AB+ CD*E − FG /**
AB + CD* E − F **G /
AB + CD* E − *F *G /
AB + CDE * − * F *G / AB + CDE * − * F *G / AB + CDE * − * F *G / AB + CDE * − * F *G /
Front = Maximum -1
Rear = Maximum -1
Front = Rear
Front = -1
Row Major
Column Major
Diagonal
None
The string entered is printed as it is.
The string entered is printed in reverse order.
It will go in an infinite loop.
It will print an empty line.
Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm
None of these
Access the “data” field of 2nd node
Access the “data” field of 3rd node
Access the “data” field of 1st node
Front=0, Rear=Max-1
Front=Rear
Rear=0. Front=0
Front=-1, Rear=-1
Linked-List
Array
Queue
Stack
Sorts a linked list
Exchange Values of consecutive nodes
Reverses a linked list
Assigns node value to each other in random order
Counting from 1 to n
Reverse Counting from n to 1
Binary Equivalent of number n
N is recursively divided by 2
Wait!
Here's an interesting quiz for you.