Data Structure
Authored by Assistant Chennai
Professional Development
Professional Development
Used 37+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
13 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
10 sec • 1 pt
Which value is assigned/set at front and rear ends during the Initialization of a Queue?
a. 0
b. 1
c. - 1
d. infinity
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
3.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
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
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
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*+
5.
MULTIPLE CHOICE QUESTION
10 sec • 1 pt
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
6.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Maximum degree of any vertex in a simple graph of vertices n is
A - 2n - 1
B - n
C - n + 1
D - n - 1
7.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
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
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
