Chapter:

310+ more mcqs Solved MCQs

in Data Structures (DS)

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Information Technology FY (BSc IT) , Bachelor of Computer Applications (BCA) .

Chapters

Take a Test

51.	A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A.	singly linked list
B.	circular linked list
C.	doubly linked list
D.	linear linked list
Answer» C. doubly linked list

52.	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
Answer» D. dequeue

53.	In a priority queue, insertion and deletion takes place at ………………
A.	front, rear end
B.	only at rear end
C.	only at front end
D.	any position
Answer» D. any position

54.	The time complexity of quick sort is …………..
A.	o(n)
B.	o(n2)
C.	o(n log n)
D.	o(log n)
Answer» C. o(n log n)

55.	Which of the following is an application of stack?
A.	finding factorial
B.	tower of hanoi
C.	infix to postfix conversion
D.	all of the above
Answer» B. tower of hanoi

56.	The data structure which is one ended is ………………
A.	queue
B.	stack
C.	tree
D.	graph
Answer» B. stack

57.	A list which displays the relationship of adjacency between elements is said to be
A.	linear
B.	non linear
C.	linked list
D.	trees
Answer» A. linear

58.	……………….. level is where the model becomes compatible executable code
A.	abstract level
B.	application level
C.	implementation level
D.	all of the above
Answer» C. implementation level

59.	Which of the following data structure is not linear data structure?
A.	arrays
B.	linked lists
C.	both of the above
D.	none of the above
Answer» D. none of the above

60.	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
Answer» A. push, pop

61.	Each array declaration need not give, implicitly or explicitly, the information about
A.	the name of array
B.	the data type of array
C.	the first data from the set to be stored
D.	the index set of the array
Answer» C. the first data from the set to be stored

62.	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
Answer» A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

64.	Finding the location of the element with a given value is:
A.	traversal
B.	search
C.	sort
D.	none of above
Answer» B. search

65.	The operation of processing each element in the list is known as
A.	sorting
B.	merging
C.	inserting
D.	traversal
Answer» D. traversal

66.	Arrays are best data structures
A.	for relatively permanent collections of data
B.	for the size of the structure and the data in the structure are constantly changing
C.	for both of above situation
D.	for none of above situatio
Answer» A. for relatively permanent collections of data

63.	Linked lists are best suited
A.	for relatively permanent collections of data
B.	for the size of the structure and the data in the structure are constantly changing
C.	for both of above situation
D.	for none of above situation
Answer» B. for the size of the structure and the data in the structure are constantly changing

67.	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
D.	none of the above
Answer» C. both i and ii

68.	What will be the value of top, if there is a size of stack STACK_SIZE is 5
A.	5
B.	6
C.	4
D.	none of the above
Answer» C. 4

69.	………… is not the operation that can be performed on queue.
A.	insertion
B.	deletion
C.	retrieval
D.	traversal
Answer» D. traversal

70.	A data structure where elements can be added or removed at either end but not in the middle is called …
A.	linked lists
B.	stacks
C.	queue
D.	dequeue
Answer» D. dequeue

71.	Which of the following name does not relate to stacks?
A.	fifo lists
B.	lifo list
C.	piles
D.	push-down lists
Answer» A. fifo lists

72.	The term "push" and "pop" is related to the
A.	array
B.	lists
C.	stacks
D.	all of the above
Answer» C. stacks

73.	Which data structure allows deleting data elements from front and inserting at rear?
A.	stacks
B.	queue
C.	dequeue
D.	binary search tree
Answer» B. queue

74.	node.next -> node.next.next; will make
A.	node.next inaccessible
B.	node.next.next inaccessible
C.	this node inaccessible
D.	none of the above
Answer» A. node.next inaccessible

75.	A circular linked list can be used for
A.	stack
B.	queue
C.	both stack & queue
D.	neither stack or queue
Answer» C. both stack & queue

310+ more mcqs Solved MCQs

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

In a priority queue, insertion and deletion takes place at ………………

The time complexity of quick sort is …………..

Which of the following is an application of stack?

The data structure which is one ended is ………………

A list which displays the relationship of adjacency between elements is said to be

……………….. level is where the model becomes compatible executable code

Which of the following data structure is not linear data structure?

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.

Each array declaration need not give, implicitly or explicitly, the information about

The elements of an array are stored successively in memory cells because

Linked lists are best suited

Finding the location of the element with a given value is:

The operation of processing each element in the list is known as

Arrays are best data structures

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.

What will be the value of top, if there is a size of stack STACK_SIZE is 5

………… is not the operation that can be performed on queue.

A data structure where elements can be added or removed at either end but not in the middle is called …

Which of the following name does not relate to stacks?

The term "push" and "pop" is related to the

Which data structure allows deleting data elements from front and inserting at rear?

node.next -> node.next.next; will make

A circular linked list can be used for

In doubly linked lists

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

The situation when in a linked list START=NULL is

In doubly linked lists, traversal can be performed?

How do you count the number of elements in the circular linked list?

How do you insert a node at the beginning of the list?

What is a dequeue?

Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

Which of the following option is not correct?

Overflow condition in linked list may occur when attempting to .............

Which of the following is not a type of Linked List ?

Linked list is generally considered as an example of _________ type of memory allocation.

Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.

If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?

In Circular Linked List insertion of a node involves the modification of ____ links.

If a list contains no elements it is said to be

Linked list uses

Standard approach for implementation of a list is/are of

First link node of list is accessed from a pointer named

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.

76.	In doubly linked lists
A.	a pointer is maintained to store both next and previous nodes.
B.	two pointers are maintained to store next and previous nodes.
C.	a pointer to self is maintained for each node.
D.	none of the above
Answer» B. two pointers are maintained to store next and previous nodes.

78.	The situation when in a linked list START=NULL is
A.	underflow
B.	overflow
C.	housefull
D.	saturated
Answer» A. underflow

79.	In doubly linked lists, traversal can be performed?
A.	only in forward direction
B.	only in reverse direction
C.	in both directions
D.	none of the above
Answer» C. in both directions

80.	How do you count the number of elements in the circular linked list?
A.	public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head) { temp = temp.getnext(); length++; } return length; }
B.	public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != null) { temp = temp.getnext(); length++; } return length; }
C.	public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head && temp != null) { temp = head.getnext(); length++; } return length; }
D.	public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head && temp == null) { temp = head.getnext(); length++; } return length; }
Answer» A. public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head) { temp = temp.getnext(); length++; } return length; }

81.	public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; while(temp.getNext() != head) temp = temp.getNext(); if(temp == head) { var = head.getItem(); head = null; return var; } temp.setNext(head.getNext()); var = head.getItem(); head = head.getNext(); return var; } What is the functionality of the following code? Choose the most appropriate answer.
A.	return data from the end of the list
B.	returns the data and deletes the node at the end of the list
C.	returns the data from the beginning of the list
D.	returns the data and deletes the node from the beginning of the list
Answer» D. returns the data and deletes the node from the beginning of the list

82.	What is the functionality of the following code? Choose the most appropriate answer. public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; Node cur; while(temp.getNext() != head) { cur = temp; temp = temp.getNext(); } if(temp == head) { var = head.getItem(); head = null; return var; } var = temp.getItem(); cur.setNext(head); return var; }
A.	return data from the end of the list
B.	returns the data and deletes the node at the end of the list
C.	returns the data from the beginning of the list
D.	returns the data and deletes the node from the beginning of the list
Answer» B. returns the data and deletes the node at the end of the list

83.	How do you insert a node at the beginning of the list?
A.	public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(node); head.setnext(node); size++; }
B.	public class insertfront(int data) { node node = new node(data, head, head); node.getnext().setprev(node); head.setnext(node); size++; }
C.	public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(head); head.setnext(node); size++; }
D.	public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(node); head.setnext(node.getnext()); size++; }
Answer» A. public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(node); head.setnext(node); size++; }

84.	What is a dequeue?
A.	a queue with insert/delete defined for both front and rear ends of the queue
B.	a queue implemented with a doubly linked list
C.	a queue implemented with both singly and doubly linked lists
D.	a queue with insert/delete defined for front side of the queue
Answer» A. a queue with insert/delete defined for both front and rear ends of the queue

85.	Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
A.	full: (rear+1) mod n == front, empty: rear == front
B.	full: (rear+1) mod n == front, empty: (front+1) mod n == rear
C.	full: rear == front, empty: (rear+1) mod n == front
D.	full: (front+1) mod n == rear, empty: rear == front
Answer» A. full: (rear+1) mod n == front, empty: rear == front

86.	Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
A.	a queue cannot be implemented using this stack.
B.	a queue can be implemented where enqueue takes a single instruction and dequeue takes a sequence of two instructions.
C.	a queue can be implemented where enqueue takes a sequence of three instructions and dequeue takes a single instruction.
D.	a queue can be implemented where both enqueue and dequeue take a single instruction each.
Answer» C. a queue can be implemented where enqueue takes a sequence of three instructions and dequeue takes a single instruction.