Home / Engineering / Data Structure (DS) / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) What is one of the common examples of a stack?

(A) a pile of books
(B) bus stop
(C) a basket of fruits
(D) a carat of eggs
Correct answer : Option (A) - a pile of books

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Data Structure (DS)

Q. Delimiting and synchronization of data exchange is provided by __________

Q. A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

Q. Retransmission of packets must not be done when _______

Q. The partition algorithm uses _______ scans of the databases to discover all frequent sets.

Q. Smart means systems are active, digital, networked, autonomous, reconfigurable, local control of its own resources, is this statement is true or false?

Q. Suppose that a process is in BLOCKED state waiting for some i/o service. When a service is completed, it goes to the

Q. If you need a more powerful scaling feature, with a superior control on outliers and the possibility to select a quantile range, there's also the class________.

Q. #include "stdio.h" int a = 20; int main() { int a = 10; printf("%d", ::a); return 0; }

Q. If U = {1, 2, 3, . . . 10 } and S = { 4, 5, 6, 7, 8 }, then S ' =

Q. In a NAND based S’-R’ latch, if S’=1 & R’=1 then the state of the latch is