As you will write Tezpur University PG entrance exam and for its exam preparation looking for sample paper, so on your demand I am providing same for you:

Q1. Start and Stop bits do not contain any ‘information’ but are used in serial communication for the following
A. Error detection
B. Error Correction
C.Synchronization
D. Slowing down the communication
Q2. A page replacement policy is not necessary for
A. Fully associative caches B. Set associative caches C. Directly mapped caches D. Write- through caches
Q3. The number of select input lines in a 8- to -1 multiplexer is-
A.1
B.8
C.256
D. None of these
Q4. In a heap with n elements with the highest element at the root, the 7th highest element can be found in time
A. O (nlog n)
B. O (n)
C. O(log n)
D. O(1)
Q5. Which one of the following permutations can obtained in the output ( in the same order) using a stack assuming
that the input is the sequence 1,2,3,4,5, in that order?
A. 3,4,5,1,2,
B. 3,4,5,2,1
C. 1,5,2,3,4
D.5,4,3,1,2
Q6. Part of a compiler that keeps record of names of variable and their associated attributes /values is known as
A. Parser
B. Symbol Table C. Lexical Analyzer
D. Intermediate Code
Q7. In SQL, which of the following is not a DDL command
A.RENAME
B. REVOKE
C. GRANT
D. UPDATE
Q8. Which of the following features cannot be captured by CFGs
A. Syntax of if -then-else statement
B. Syntax of recursive procedures
C. Whether a variable has been declared before its use D. Variable names of arbitrary length
SECTION B
(15 short questions of 2 marks each)
Q1. Assume that a CPU has only two registers R1 and R2 and that only the following instruction is available.
XOR Ri , Rj ;{ Rj ! Ri Å Rj , for i, j=1,2}
Using this XOR instruction , find an instruction sequence in order to exchange the contents of the Registers
R1and R2.
Q2. A binary search tree is generated by inserting in order the following integers-50, 15, 62, 5, 20, 58, 91, 3. The no. of
nodes in the left and right subtree of the root respectively is ?
Q3 Suppose you are given an array s[1..n] and a procedure reverse (s,i,j,). Which reverses that order of elements in s
between position i and j (both inclusive)? What does the following
sequence do, where 1<=k<n
reverse(s,l,k)
reverse(s,k+l,n)
reverse (s,l,n)
Q4. Give a production grammar for the language L={aibi|i,j >= 1,i!=j}
Q5. Given the following Relational Schema
EMP (emp_no, dept_no,emp_name,salary)
DEPT(dept_no,dept_name,location)
Write SQL query to find all the department names where the number of employees in the department is greater than
500.
Q6. Consider n processes sharing the CPU in RR fashion . Assuming that each process switch takes s seconds. What
must be the quantum size q such that the overhead resulting from process switching is minimized, but at the same
time each process is guaranteed to get its turn at the CPU at least every t seconds

Attached Files

Tezpur University PG entrance exam paper.pdf (399.1 KB, 103 views)