MCQ Mojo
access_time
menu
Quiz
Web Stories
CBSE
arrow_drop_down
MCQ Questions for CBSE Class 12 with Answers
MCQ Questions for CBSE Class 11 with Answers
MCQ Questions for CBSE Class 10 with Answers
MCQ Questions for CBSE Class 9 with Answers
MCQ Questions for CBSE Class 8 with Answers
MCQ Questions for CBSE Class 7 with Answers
MCQ Questions for CBSE Class 6 with Answers
MCQ Questions for CBSE Class 5 with Answers
MCQ Questions for CBSE Class 4 with Answers
MCQ Questions for CBSE Class 3 with Answers
MCQ Questions for CBSE Class 2 with Answers
MCQ Questions for CBSE Class 1 with Answers
CBSE
arrow_drop_down
MCQ Questions for CBSE Class 12 with Answers
MCQ Questions for CBSE Class 11 with Answers
MCQ Questions for CBSE Class 10 with Answers
MCQ Questions for CBSE Class 9 with Answers
MCQ Questions for CBSE Class 8 with Answers
MCQ Questions for CBSE Class 7 with Answers
MCQ Questions for CBSE Class 6 with Answers
MCQ Questions for CBSE Class 5 with Answers
MCQ Questions for CBSE Class 4 with Answers
MCQ Questions for CBSE Class 3 with Answers
MCQ Questions for CBSE Class 2 with Answers
MCQ Questions for CBSE Class 1 with Answers
Quiz
Quiz
/
Data Structure Gate & PSU MCQ Questions With Answers
1.
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, get the total number of element present in stack is
1
2
3
4
2.
Act of adding values into a stack is called
Popping
Polling
Pushing
None
3.
________is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
4.
In algorithm several statements appear in the same step
True
False
5.
Which of the following points is/are true about Linked List data structure when it is compared with array
Arrays have better cache locality that can make them better in terms of performance.
It is easy to insert and delete elements in Linked List
Random access is not allowed in a typical implementation of Linked Lists
The size of array has to be pre-decided, linked lists can change their size any time.
All of the above
6.
Identify the types of sorting that used the concept of divide and conquer.
Insertion sort
Merge sort
Selection sort
Bubble sort
7.
In a graph if E=(u,v) means _____________
u is adjacent to v but v is not adjacent to u
e begins at u and ends at v
u is processor and v is successor
both b and c
8.
What does LIFO stand for?
Last In First Out
Least In Flow Out
Last In Flow Out
Last In First Object
9.
Tree
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
10.
Which of these data structures is LIFO?
Stack
Queue
Binary Tree
Double linked list
11.
Traversing each and every record exactly once is called_______
Insertion
Deletion
Traversing
Searching
12.
._____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.
Queue
Stack
Singly Linked List
Circular queue
13.
If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?
ABCD
DCBA
DCAB
ABDC
14.
In which algorithm takes less time or space is called
Best case
Worst case
Average case
None of the above
15.
Root
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
16.
Choose the correct statement
A data structure is a specialised format for organising and storing data
A data structure is a specialised format for organising and storing information
A data structure is a format for organising and storing only one data type
A data structure is too complicated to truly understand or use
17.
A queue is what?
Last in, first out
First in, first out
Last in, last out
First in, last out
18.
State true of false.i) A node is a parent if it has successor nodes.ii) A node is child node if out degree is one.
True, True
False, True
True, False
False, False
19.
Arranging the books in order and removing from the topmost book is an example for________
Linked List
Queue
Stack
Structure
20.
Consider the usual algorithm for determining whether a sequence of parentheses is balanced.The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(())) are:
1
2
3
4
21.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called
AVL tree
Red-black tree
Lemma tree
None of the above
22.
What is the value of the ROOT node in this Tree?
35
24
42
20
23.
Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
Deleting a node whose location in given
Searching of an unsorted list for a given item
Inverting a node after the node with given location
Traversing a list to process each node
24.
In ___________ data structures all elements may or may not be of same type.
linear
non linear
homogeneous
non- homogeneous
25.
A tree sort is also known as__________ sort.
quick
heap
shell
selection
26.
A function calls itself is called ___________.
queue
recursion
function
none of above
Report Question
Previous
Next
warning
Submit
access_time
Time
Report Question
A bunch of text
Support mcqmojo.com by disabling your adblocker.
×
Please disable the adBlock and continue.
Thank you.
Reload page