(A) 1
(B) 2
(C) 3
(D) 4
Category: Data Structures Mcqs
Data Structures Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Data Structures Mcqs section will help users to prepare mcqs of Data Structures for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Data Structures portion from here.
What kind of list is best to answer questions such as “What is the item at position n?”
(A) Lists implemented with an array
(B) Doubly-linked lists
(C) Singly-linked lists
(D) Doubly-linked or singly-linked lists are equally best
__ is the stack characteristic but __ was implemented because of the size limitation of the array.
(A) isFull(),isEmpty()
(B) pop(), push()
(C) isEmpty() , isFull()
(D) push(),pop()
it will be efficient to place stack elements at the start of the list because insertion and removal take __ time.
(A) Variable
(B) Constant
(C) Inconsistent
(D) None of the above
when we have declared the size of the array, it is not possible to increase or decrease it during the __ of the program.
(A) Declaration
(B) Execution
(C) Defining
(D) None of the above
In case of deleting a node from AVL tree, rotation could be prolong to the root node.
(A) Yes
(B) No
A binary tree with 24 internal nodes has __ external nodes.
(A) 22
(B) 23
(C) 25
(D) 48
Suppose we had a hash table whose hash function is “n % 12”, if the number 35 is already in the hash table, which of the following numbers would cause a collision?
(A) 143
(B) 144
(C) 145
(D) 148