NEW
Font size
WorksheetsData Structure
Total questions: 13
Worksheet time: 7mins
Which value is assigned/set at front and rear ends during the Initialization of a Queue?
a. 0
b. 1
c. - 1
d. infinity
What should be the value of rear (end) if the queue is full (elements are completely occupied )?
a. 1
b. - 1
c. MAX + 1
d. MAX - 1
Which among the below specified condition is applicable if the Queue is non - empty?
a. rear > front
b. rear < front
c. rear = front
d. Unpredictable
Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.
a) xyz*+pq*r+s*+
b) xyz*+pq*r+s+*
c) xyz+*pq*r+s*+
d) xyzp+**qr+s*+
Consider the following operation performed on a stack of size 5.
Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);
After the completion of all operation, the number of elements present in stack are
a)1
b)2
c)3
d)4
Maximum degree of any vertex in a simple graph of vertices n is
A - 2n - 1
B - n
C - n + 1
D - n - 1
Which of the following is useful in traversing a given graph by breadth first search?
Op 1: stack
Op 2: set
Op 3: list
Op 4: queue
Which of the following abstract data types can be used to represent a many to-many relation?
Op 1: Tree
Op 2: Stack
Op 3: Graph
Op 4: Queue
Two lists, A and B are implemented as singly linked link-lists. The address of the first and last node are stored in variables firstA and lastA for list A and firstB and lastB for list B. Given the address of a node is given in the
variable node, the element stored in the node can be accessed by the
statement node->data and the address to the next node can be accessed by node->next. Pankaj wants to append list B at end of list A. Which of the following
statements should he use?
Op 1: lastB -> next = firstA
Op 2: lastA = firstB
Op 3: lastA->next = firstB
Op 4: lastB = firstA
A complete binary tree with 5 levels has how many nodes? (Root is Level 1)
Op 1: 15
Op 2: 25
Op 3: 63
Op 4: 31
The maximum number of nodes on level I of a binary tree is which of the
following? (Root is Level 1)
Op 1: 2^l-1
Op 2: 3^l-1
Op 3: 2^l
Op 4: 2^l - 1
Surbhi wants to implement a particular data structure using a static array. She uses the concept of circular list to implement the data structure, because this allows her to efficiently use all fields of the array. Which data structure is Surbhi implementing?
Op 1: a stack
Op 2: a queue
Op 3: Binary Tree
Op 4: None of these
Number of possible ordered trees with 3 nodes A, B, C is
Op 1: 16
Op 2: 12
Op 3: 13
Op 4: 14
