Time Left - 09:00 mins
UPPCL AE 2019: Technical Quiz 7
Attempt now to get your rank among 199 students!
Question 1
In a full binary tree number of nodes is 63 then the height of the tree is :
Question 2
What are the appropriate data structures for graph traversal using Breadth First Search (BFS) and Depth First Search (DFS) algorithms?
Question 3
Which of the following process scheduling algorithm may lead to starvation?
Question 4
The combinational circuit given below is implemented with two NAND gates. To
which of the following individual gates is its equivalent?
which of the following individual gates is its equivalent?
Question 5
External interrupt may not arise because of :
Question 6
Consider the below statements :
S1 : A regular language L1 has 3 states in its DFA , then the complement of L1 will also have 3 states in its DFA.
S2 : A context free language L2 has 4 states in its PDA. The complement of L2 will also have 4 states in its PDA.
Question 7
A top down parser generates :
Question 8
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as :
Question 9
Which Netware protocol provides link-state routing?
Question 10
A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is : 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is
- 199 attempts
- 1 upvote
- 1 comment
Tags :
GATE & PSU CSGeneralJun 16GATE & PSU CS
