Professional Documents
Culture Documents
3 of 6 sets
C. time consuming
Discussion
A.it is possible to get into infinite loop.
52. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
Discussion
C.doubly linked list
53. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
A. circular queue
B. random of queue
C. priority
D. dequeue
Discussion
x
D.dequeue
https://mcqmate.com/topic/17/data-structure-set-3 1/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
D. any position
A. o(n)
B. o(n2)
C. o(n log n)
D. o(log n)
Discussion
C.o(n log n)
A. finding factorial
B. tower of hanoi
Discussion
B.tower of hanoi
A. queue
B. stack
C. tree
D. graph
Discussion
B.stack
58. A list which displays the relationship of adjacency between elements is said to be
A. linear
B. non linear
C. linked list
D. trees
Discussion x
A.linear
https://mcqmate.com/topic/17/data-structure-set-3 2/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
59. ……………….. level is where the model becomes compatible executable code
A. abstract level
B. application level
C. implementation level
Discussion
C.implementation level
60. Which of the following data structure is not linear data structure?
A. arrays
B. linked lists
Discussion
D.none of the above
61. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the
stack, when stack is not empty is called ………..operation.
A. push, pop
B. pop, push
C. insert, delete
D. delete, insert
Discussion
A.push, pop
62. Each array declaration need not give, implicitly or explicitly, the information about
Discussion
C.the first data from the set to be stored
https://mcqmate.com/topic/17/data-structure-set-3 3/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
63. The elements of an array are stored successively in memory cells because
A. by this way computer can keep track only the address of the first element and the addresses of other elements can be
calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. both of above
D. none of above
Discussion
A.by this way computer can keep track only the address of the first element and the addresses of other elements can
be calculated
B. for the size of the structure and the data in the structure are constantly changing
Discussion
B.for the size of the structure and the data in the structure are constantly changing
65. Finding the location of the element with a given value is:
A. traversal
B. search
C. sort
D. none of above
Discussion
B.search
A. sorting
B. merging
C. inserting
D. traversal
Discussion
D.traversal
https://mcqmate.com/topic/17/data-structure-set-3 4/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
B. for the size of the structure and the data in the structure are constantly changing
Discussion
A.for relatively permanent collections of data
68. Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse
the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly
linked list.
A. i-only
B. ii-only
C. both i and ii
Discussion
C.both i and ii
69. What will be the value of top, if there is a size of stack STACK_SIZE is 5
A. 5
B. 6
C. 4
Discussion
C.4
A. insertion
B. deletion
C. retrieval
D. traversal
Discussion
D.traversal
x
71. A data structure where elements can be added or removed at either end but not in the middle is called …
https://mcqmate.com/topic/17/data-structure-set-3 5/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
x
A. linked lists
B. stacks
C. queue
D. dequeue
Discussion
D.dequeue
A. fifo lists
B. lifo list
C. piles
D. push-down lists
Discussion
A.fifo lists
A. array
B. lists
C. stacks
Discussion
C.stacks
74. Which data structure allows deleting data elements from front and inserting at rear?
A. stacks
B. queue
C. dequeue
Discussion
B.queue
A. node.next inaccessible
B. node.next.next inaccessible
Discussion
A.node.next inaccessible
« Set 2 Set 4 »
Tags
Question and answers in Data Structure (DS),Data Structure (DS) Multiple choice questions and answers,Important MCQ of Data Structure (DS), x
Solved MCQs for Data Structure (DS),Download PDF for Data Structure (DS) solved MCQs,Data Structure (DS) MCQ with answers PDF download
https://mcqmate.com/topic/17/data-structure-set-3 6/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
report this ad
Usability Engineering
8085 Microprocessor
Communication Skill
Computer Fundamentals
Digital Electronics
Fedora
report this ad
https://mcqmate.com/topic/17/data-structure-set-3 7/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
1 2 3 4 5 6
Share
M C Q M AT E I S A L S O AVA I L A B L E O N
ABOUT US DISCLAIMER C O N TA C T U S
McqMate.com is an educational platform, Which is developed BY Email: admin@mcqmate.com
https://mcqmate.com/topic/17/data-structure-set-3 8/9
3/29/22, 11:25 PM Data Structure (DS) solved MCQ's with PDF Download [set-3]
https://mcqmate.com/topic/17/data-structure-set-3 9/9