Shyam Sunder Kanth

Tech Unleashed

Wohoo!! We're on YouTube

Showing posts with label 3rd-Sem-Questions. Show all posts
Showing posts with label 3rd-Sem-Questions. Show all posts

Sunday, 27 November 2022

Discrete Structure : End Semester Examination ( 3rd Sem )

November 27, 2022 0

Discrete Structure

End Semester Examination, 2021-22
B. Tech - Semester : 03
Time : 03 hrs. - Max. Marks : 100

Instructions:
  1. All questions are Compulsory
  2. Assume missing data suitably, if any.
Section : A ( 10 x 4 = 40 Marks )
All questions are compulsory
  1. Given set A = { 1,2,3,4 } and B = { x,y,z }. Let R be the following relation from A to B, R = { (1,y), (1,z), (3,y), (4,x), (4,z) }
    a. Determine the matrix of the relation.
    b. Find inverse R-1 of R.
    c. Determine the domain and Range of R.
  2. Let f: R->R ang g: R->R, where R is the set of real numbers. Find fog and gof, where f(x) = x2-4 and g(x) = x+4. State where these functions are injective, surjective and bijective.
  3. Construct the truth table for each of the following compound statement.
    i. (p <--> q) V (~p <--> r) 
    ii. (~p<-->q) <--> (p <-->r)
  4. Use mathematical induction to show that
    1+2+22+...+2n = 2n+1 - 1, for all non-negative integers n.
  5. Verify absorption law with the help of truth table.
  6. Explain Ring and Field with suitable example.
  7. Using the law of Boolean algebra prove that
    ( A+B )( A+C ) = A+BC
  8. Apply DeMorgan's theorems to each of the following expressions.
    a. ( A+B+C)D 
    b. ABC+DEF
  9. Define and explain the following :
    i) Binary search tree, ii) Bipartite graphs.
  10. Find the all Least Upper Bounds (LUB) and all Greatest Upper Bounds (GUB) of 
    i) {c,d,e}, ii) {a,b} for the given figure.


Section : B ( 3 x 6 = 18 Marks )
All questions are compulsory
  1. State which of the following propositional statement is Tautology/ Contingency/ Contrdiction.
    i. ( P^Q ) -> ( QvR )
    ii. ( p->(QvR)) -> ((P^Q)->R))
    iii. ((P->Q) ^ (Q->R) ^ R)) -> (~P)
    OR
    Write the converse, Inverse and contrapositive of the following:
    i. "If P is Cube then P is 3D."
    ii. If the flood destroy my house then my insurance company will pay me.
  2. Define the following terms with an example.
    i. Graph, ii. Self loop, iii. Regular graph
    OR
    Find the In order, Pre Order and Post Order of Binary tree.


  3. Consider the Poset A = ({1,2,3,4,6,9,12,18,36}, | ). Draw the Hasse diagram and find the GLB & LUB of the sets {6,18} & {4,6,9}. ( | denotes divide relation i.e. a|b is a divides b).
    OR
    Discuss Poset. Show that "less than or equal to" relation on a set of real number is partial ordering.
Section : C ( 3 x 10 = 30 Marks )
All questions are compulsory
  1. Given the In Order and Post Order traversal of a tree T:
    In Order : BEHFACDGI
    Post order : HFEABIGDC. Determine the tree T and its pre order.
    OR
    Define complemented lattice. Determine whether the poset shown in figure-1 and figure-2 is complemented lattice or not.


  2. Convert each of the following Boolean expressions to sop form:
    i. AB+B(CD+EF) , ii. (A+B)(B+C+D)
    OR
    Minimize the following Boolean function
    F(A, B, C, D) = Σm(0,1,2,5,7,8,9,10,13,15)
  3. Discuss the pigeon hole principle. Show that among all 80 students in our class, 7 or more are born in the same month.
    OR
    Solve the recurrence relation Fn=10Fn-1-25Fn-2, where F0 = 3 and F1 = 17.
Section : D ( 1 x 12 = 12 Marks )
All questions are compulsory
  1. Define isomorphism. Determine whether the following pair of graphs are isomorphic.


    OR
    Find the Hamiltonian path and Hamiltonian cycle, if it exists. Also identify the Euler's circuit.



*******************
Tags # 3rd-Sem-Questions Continue Reading
By at No comments:
Labels:

Thursday, 24 November 2022

Principles of Operating Systems : End Semester Examination ( 3rd Sem )

November 24, 2022 0
border-collapse: collapse;

 Principles of Operating Systems

End Semester Examination, 2021-22
B. Tech - Semester : 03
Time : 03 hrs. - Max. Marks : 100

Instructions:
  1. All questions are Compulsory
  2. Assume missing data suitably, if any.
Section : A ( 10 x 4 = 40 Marks )
All questions are compulsory
  1. Define the essential properties of the time-sharing operating system.
  2. Distinguish between client-server and peer-to-peer models of distributed operating systems.
  3. Enumerate any five system calls used i process management or file management.
  4. Give the principles, which should be followed by any solution designed to achieve mutual exclusion in critical section problem.
  5. Differentiate between preemptive and non-preemptive scheduling.
  6. Define deadlock. Explain necessary condition for deadlock to occur.
  7. Differentiate between logical address space and physical address space.
  8. List out the major attribute and operation of file.
  9. Write about Dynamic loading and linking.
  10. Explain Demand paging and Memory Management Unit.
Section : B ( 3 x 6 = 18 Marks )
All questions are compulsory
  1. Consider the following page reference string : 8 1 2 2 0 2 0 3 2 3 1 3 2 1 2 0 1 7 0 1. How many page fault would occur for the Optimal replacement algorithm, assuming three and four frames.
    OR
    Explain the Resource-Allocation-Graph. Demonstrate Resource-Allocation-Graph with a cycle but no deadlock.
  2. Discuss about the evolution of virtual machine. Explain how virtualization can be implemented in operating system.
    OR
    With a neat sketch, explain how the logical address is translated into physical address using paging mechanism.
  3. Memory Hierarchy Design and its characteristics with Suitable Diagram.
    OR
    Given free memory partition of 250K, 350K, 600K, 200K and 700K ( in order ), how would each of the First-fit, Best-fit and Worst-fit algorithms place processes of 110K, 260K, 261K and 498K (in order) ?
Section : C ( 3 x 10 = 30 Marks )
All questions are compulsory
  1. Explain the concept of segmentation with neat diagram. What is the main problem with segmentation ?
    OR
    Explain how paging supports virtual memory. With neat diagram explain how logical address is translated into physical address.
  2. Consider the following snapshot of the system :

    ProcessMaxAllocation  Available
    A, B, C, D  A, B, C, D  A, B, C, D
    P06 0 0 15 0 0 12 3 1 1
    P12 7 5 01 0 0 1
    P22 3 5 61 2 5 4
    P31 6 5 30 6 3 3
    P41 6 5 60 2 1 2

    Using Banker's algorithm, answer the following questions:
    i) How many resources of type A, B, C, D are there?
    ii) What are the contents of need matrix ?
    iii) Find if the system is in safe state ? If it is, find the safe sequence.
    OR
    What are directories? List different types of directory structure with examples. Mention their advantages and disadvantages.
  3. What's difference between CPU cache and TLB and also RAM and ROM ?
    OR
    What is swapping and benefits of swapping and explain also input output interface, modes of data transfer ?
Section : D ( 1 x 12 = 12 Marks )
All questions are compulsory
  1. Discuss the concept of Disk scheduling in Operating system? The requested tracks, in the order received are : 65, 48, 49, 58, 80, 120, 160, 258, 174. Apply the following disk scheduling algorithms. Starting tracks at 100.
    i) FCFS ii) C- SCAN iii) LOOK
    OR
    Direct memory access is used for high-speed I/O devices in order to avoid increasing the CPU's execution load. How does the CPU interface with the device to coordinate the transfer.
*******************
Tags # 3rd-Sem-Questions Continue Reading
By at No comments:
Labels:

Object Oriented Programming Using Java : End Semester Examination ( 3rd Sem )

November 24, 2022 0

  Object Oriented Programming Using Java

End Semester Examination, 2021-22
B. Tech - Semester : 03
Time : 03 hrs. - Max. Marks : 100

Instructions:

  1. All questions are Compulsory
  2. Assume missing data suitably, if any.
Section : A ( 10 x 4 = 40 Marks )
All questions are compulsory
  1. Classify different data types used in java with the help of of examples.
  2. Explain how to set Temporary and Permanent Paths in java.
  3. Discuss the uses if this and super keywords with example.
  4. Distinguish between constructor overloading and method overloading with example.
  5. What is decision control statement in java ? Explain 3 types of control structures.
  6. What is object oriented programming ? Explain the need of object oriented programming.
  7. Create a program to display numbers divisible by 6 from 1 to n where n is 100 using class and object concept.
  8. Create a program in java to display account information ( Account number, customer name, balance ) of a person in a bank.
  9. Develop a program in java to input 5 numbers from keyboard and find their sun and average.
  10. Explain any four string functions used in Java.
Section : B ( 3 x 6 = 18 Marks )
All questions are compulsory
  1. Demonstrate a table showing all the access specifiers and their accessibility in the class, package, subclass and other package.
    OR
    What is multithreading ? Explain different ways to implement multithreading in java.
  2. Elaborate and explain different types of casting with proper example.
    OR
    What is constructor ? What are the rules of constructor ? Give an example.
  3. Why multiple inheritance is not supported by java ? What is the solution ? Explain with example.
    OR
    Create a java program that reads a positive integer and count the number of digits in the integer.
Section : C ( 3  x 10 = 30 Marks )
All questions are compulsory
  1. Create a java program to implement multi-level inheritance and explain all the keywords used in it.
    OR
    Distinguish between :
    i) final and finally.
    ii) String and StringBuffer.
  2. Distinguish between :
    i) Inputstream and Reader classes.
    ii) Outputstream and Writer classes.
    OR
    What is exception and exception handling ? How can we declare our own exception ?
  3. What is garbage collection ? Discuss various ways for garbage collection in java.
    OR
    Explain the life cycle of thread, and also write a program to find the factorial of range 1 - 10 using two threads.
Section : D ( 1  x 12 = 12 Marks )
All questions are compulsory
  1. Explain and write a program in java to read data from file. The file name is "one.txt".
    OR
    How packages are created and accessed in java. Briefly explain the naming convention in packages.
*******************


Tags # 3rd-Sem-Questions Continue Reading
By at No comments:
Labels:

Saturday, 19 November 2022

Data Structure : End Semester Examination ( 3rd Sem )

November 19, 2022 0

 Data Structure

End Semester Examination, 2021-22
B. Tech - Semester : 03
Time : 3 hrs. - Max. Marks : 100

Instructions:
  1. All questions are Compulsory
  2. Assume missing data suitably, if any.
Section : A ( 10 x 4 = 40 Marks )
All questions are compulsory
  1. List advantage of linked list over arrays.
  2. Evaluate time complexity of insertion sort.
  3. List different ways of implement polynomial ADT.
  4. Define in-degree and out-degree of a graph.
  5. Discuss deque with examples.
  6. What are the properties of Minimum Cost Spanning (MST) Tree ?
  7. Discuss rotation of AVL tree.
  8. What are the disadvantages of circular linked list.
  9. Evaluate the best case, average case and worst case time complexity of Bubble sort.
  10. Explain the properties of Sparse matrix.
Section : B ( 3 x 6 = 18 Marks )
All questions are compulsory
  1. Write an algorithm to delete an element anywhere from doubly linked list.
    OR
    Write applications of single linked list to represent polynomial expressions.
  2. Write an algorithm of insertion in queue using linked list.
    OR
    Explain polynomial addition using linked list.
  3. Write an algorithm to push and pop an element using array.
    OR
    Write an algorithm to push and pop an element from linked list.
Section : C ( 3 x 10 = 30 Marks )
All questions are compulsory
  1. Write a pseudo code for converting infix expression into postfix.
    OR
    Explain time complexity and space complexity of an algorithm with example.
  2. Convert following expression X+(Y*Z)-((N*M+O)/P) into post form.
    OR
    Rearrange following numbers using selection sort : 10, 6, 3, 7, 17, 26, 56, 32, 72 and discuss its time complexity.
  3. What is a Binary tree ? Construct a binary tree given the pre-order traversal and in-order traversal as follows:
    Pre-Order Traversal : G B Q A C K F P D E R H
    In-Order Traversal : Q B K C F A G P E D H R
    OR
    Construct AVL tree for the following : 1, 2, 3, 4, 5, 6, 7
Section : D ( 1 x 12 = 12 Marks )
All questions are compulsory
  1. Explain Prim's algorithm and apply the same on the following graph.



    OR
  2. Write an algorithm for minimum cost spanning tree using Kruskal's algorithm and apply same on the following graph.

*******************
Tags # 3rd-Sem-Questions Continue Reading
By at No comments:
Labels:

Friday, 18 November 2022

Object Oriented Programming Using Java : Mid Semester Examination ( 3rd Sem )

November 18, 2022 0

Object Oriented Programming Using Java

Mid Semester Examination, 2021-22
B. Tech - Semester : 03
Time : 1.30 hrs. - Max. Marks : 40

Instructions:
  1. All questions are Compulsory
  2. Assume missing data suitably, if any.
Section : A ( 2 x 2 = 4 Marks )
All questions are compulsory
  1. What are the main characteristics of OOPs ?
  2. Demonstrate a program in java to check whether the number is palindrome is not.
Section : B ( 4 x 2 = 8 Marks )
All questions are compulsory
  1. Demonstrate a program in java which displays the squares of the first ten integers.
  2. Define various features of java with proper example.
Section : C ( 6 x 2 = 12 Marks )
All questions are compulsory
  1. Construct a class Bank where data will be Account no, customers name and balance. Use display() method to print all the information of particular customer whose balance is less than 5000.
    OR
    Identify the usage of garbage collector ? When does an object become eligible garbage collector ? Explain with example.
  2. Build a program in java to do the following:
    i. To swap the two numbers without using the third variable.
    ii. Factorial of a number.
    OR
    Explain and elaborate the architecture of JVM using neat diagram.
Section : D ( 8 x 2 = 16 Marks )
All questions are compulsory
  1. Build a program to display odd and even numbers from 1 to n where n = 100 using class and object concept.
    OR
    Identify basic arithmetic and relational operators in java with the help of a program.
  2. Create a program that consider the three numbers and prints "increasing" if the number are in increasing order, "decreasing" if the number are in decreasing order, and "Neither increasing or decreasing order" otherwise.
    Test Data
    Input first number: 1524
    Input second number: 2345
    Input third number: 3321
    Expected Output : Increasing Order 
    OR
    Create a program in java with class student with the data fields name, roll_no, and fees. The type of name, roll_no and fees are String, String and Double respectively. The methods are get_detail() and display_detail(). Also define default and parameterized constructor and display the detail of both students.
*******************
Tags # 3rd-Sem-Questions Continue Reading
By at No comments:
Labels: