A â€¦â€¦â€¦â€¦â€¦ is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

1. directed tree

2.undirected tree

3.dis-joint tree

4.direction oriented tree

A â€¦â€¦â€¦â€¦â€¦â€¦â€¦â€¦ does not keep track of address of every element in the list.

1.stack

2.string

3.linear array

4.queue

A graph is a collection of nodes, called â€¦â€¦â€¦. And line segments called arcs or â€¦â€¦â€¦.. that connect pair of nodes.

1.antinel

2.sentinel

3.ist header

4. list head

A graph is said to be â€¦â€¦â€¦â€¦â€¦â€¦ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

1.partite

2.bipartite

3.rooted

4.bisects

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

1. singly linked list

2.circular linked list

3.doubly linked list

4.linear linked list

Any node is the path from the root to the node is called

1. successor node

2.ancestor node

3.internal node

4.None of the above

Arrays are best data structures â€¦â€¦â€¦â€¦

1.for relatively permanent collections of data

2. for the size of the structure and the data in the structure are constantly changing

3.for both of above situation

4. for none of the above

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

1. the name of array

2.the data type of array

3.. the first data from the set to be stored

4. the index set of the array

fThe disadvantage in using a circular linked list is â€¦â€¦â€¦â€¦â€¦â€¦â€¦â€¦.

1.it is possible to get into infinite loop.

2.last node points to first node

3.time consuming

4.requires more memory space

Herder node is used as sentinel in â€¦..

1.graphs

2.stacks

3.binary tree

4.queues

In a priority queue, insertion and deletion takes place at â€¦â€¦â€¦â€¦â€¦â€¦

1.front, rear end

2.only at rear end

3.only at front end

4.any position

In a queue, the initial values of front pointer f rare pointer r should be â€¦â€¦.. and â€¦â€¦â€¦.. respectively.

1.0 and 1

2.0 and -1

3.-1 and 0

4.1 and 0

In â€¦â€¦â€¦â€¦â€¦, search start at the beginning of the list and check every element in the list.

1. linear search

2.binary search

3.hash search

4. binary tree search

In doubly linked lists

1. a pointer is maintained to store both next and previous nodes.

2.two pointers are maintained to store next and previous nodes.

3. a pointer to self is maintained for each node.

4.none of the above

In doubly linked lists, traversal can be performed?

1.only in forward direction

2.only in reverse direction

3. in both directions

4. none of the above

In general, the binary search method needs no more than â€¦â€¦â€¦â€¦â€¦. comparisons.

1.[log2n]-1

2.logn]+1

3. [log2n]

4.[log2n]+1

In the â€¦â€¦â€¦â€¦â€¦.. traversal we process all of a vertexâ€™s descendants before we move to an adjacent vertex.

1.depth first

2.breadth first

3.with first

4.depth limited

Linear arrays are also called â€¦â€¦â€¦â€¦â€¦â€¦.

1. straight line array

2.one-dimensional array

3.vertical array

4.horizontal array

The simplest type of data structure is â€¦â€¦â€¦â€¦â€¦â€¦

1. multidimensional array

2. linear array

3. two dimensional array

4.three dimensional array

The time complexity of quick sort is â€¦â€¦â€¦â€¦..

1.o(n)

2.o(n2)

3. o(n log n)

4.o(log n)

What is a dequeue?

1. a queue with insert/delete defined for both front and rear ends of the queue

2.a queue implemented with a doubly linked list

3.a queue implemented with both singly and doubly linked lists

4.a queue with insert/delete defined for front side of the queue

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

1.stacks

2.queue

3.dequeue

4.binary search tree

Which of the following data structure is linear type?

1.array

2.tree

3.graphs

4.hierarchy

A â€¦â€¦. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

1.queue linked list

2.stacks linked list

3.both of them

4.neither of them

A â€¦â€¦â€¦.. is a graph that has weights of costs associated with its edges.

1. network

2.weighted graph

3. both a and b

4.none a and b

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

1.circular queue

2.random of queue

3.priority

4.dequeue

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called â€¦â€¦ D. none of the above

1.. avl tree

2.red-black tree

3. lemma tree

4.None of the above

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called â€¦â€¦

1. avl tree

2.red-black tree

3.lemma tree

4.None of the above

A circular linked list can be used for

1.stack

2.queue

3.both stack & queue

4.neither stack or queue

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

1. linked lists

2.stacks

3.queue

4.dequeue

A directed graph is â€¦â€¦â€¦â€¦â€¦â€¦. if there is a path from each vertex to every other vertex in the digraph.

1. weakly connected

2.strongly connected

3.tightly connected

4.linearly connected

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

1. linear

2.non linear

3.linked list

4.trees

Arrays are best data structures â€¦â€¦â€¦â€¦

1. for relatively permanent collections of data.

2. for the size of the structure and the data in the structure are constantly changing

3.for both of above situation

4. for none of the above

â€¦â€¦ is not the operation that can be performed on queue.

1.insertion

2.deletion

3.retrieval

4.traversal

â€¦â€¦ is not the operation that can be performed on queue.

1.insertion

2.deletion

3.retrieval

4.traversal

â€¦â€¦. Is a directed tree in which outdegree of each node is less than or equal to two.

1. unary tree

2.binary tree

3.trinary tree

4.both b and c

â€¦â€¦. Is a pile in which items are added at one end and removed from the other.

1.stack

2.queue

3.list

4.None of the above

â€¦â€¦â€¦ is not the operation that can be performed on queue.

1.insertion

2.deletion

3.retrieval

4.traversal

â€¦â€¦â€¦.. level is where the model becomes compatible executable code

1.abstract level

2.application level

3.implementation level

4.All of the above

â€¦â€¦â€¦â€¦â€¦ is not the component of data structure.

1.operations

2.storage structures

3.algorithms

4.None of the above

Each node in a linked list has two pairs of â€¦â€¦â€¦â€¦.. and â€¦â€¦â€¦â€¦â€¦â€¦.

1.link field and information field

2. link field and avail field

3.avail field and information field

4.address field and link field

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

1.traversal

2.search

3.sort

4.None of the above

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

1.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;}

2. 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;}

3. 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;}

4.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;}

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

1.input restricted dequeue

2.output restricted qequeue

3.output restricted qequeue

4.stack

In a circular queue the value of r will be ..

1.r=r+1

2.r=(r+1)% [queue_size â€“ 1]

3.r=(r+1)% queue_size

4.r=(r-1)% queue_size

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.

1.push, pop

2. pop, push

3.insert, delete

4.delete, insert

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

1.node.next inaccessible

2.node.next.next inaccessible

3.this node inaccessible

4.None of the above

Stack is also called as

1.last in first out

2.first in last out

3.last in last out

4.first in first out

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

1.full: (rear+1) mod n == front, empty: rear == front

2. full: (rear+1) mod n == front, empty: (front+1) mod n == rear

3. full: rear == front, empty: (rear+1) mod n == front

4.full: (front+1) mod n == rear, empty: rear == front

The advantage of â€¦â€¦â€¦â€¦â€¦.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

1.lists

2.linked lists

3.trees

4.queues

The data structure which is one ended is â€¦â€¦â€¦â€¦â€¦â€¦

1. queue

2.stack

3.tree

4.graph

The disadvantage in using a circular linked list is â€¦â€¦â€¦â€¦â€¦â€¦â€¦â€¦.

1. A. it is possible to get into infinite loop

2.last node points to first node

3. time consuming

4.requires more memory space

The logical or mathematical model of a particular organization of data is called a â€¦â€¦â€¦

1.data structure

2.data arrangement

3.data configuration

4.data formation

The number of comparisons done by sequential search is â€¦â€¦â€¦â€¦â€¦â€¦

1.(n/2)+1

2.(n+1)/2

3.(n-1)/2

4.(n+2)/2

The property of binary tree is

1.the first subset is called left subtree

2. the second subtree is called right subtree

3. the root cannot contain null

4.the right subtree can be empty

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

1. array

2.lists

3.stacks

4.all of the above

There is an extra element at the head of the list called a â€¦â€¦â€¦.

1.antinel

2.sentinel

3.list header

4.list head

To represent hierarchical relationship between elements, Which data structure is suitable?

1.dequeue

2.priority

3.tree

4.graph

What differentiates a circular linked list from a normal linked list?

1.you cannot have the â€˜nextâ€™ pointer point to null in a circular linked list

2. it is faster to traverse the circular linked list

3. you may or may not have the â€˜nextâ€™ pointer point to null in a circular linked list

4.head node is known in circular linked list

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

1.5

2.6

3.4

4.None of the above

When does top value of the stack changes?

1.before deletion

2.while checking underflow

3. at the time of deletion

4. after deletion

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

1. stacks

2.queues

3.dequeues

4.binary search tree

Which data structure is used in breadth first search of a graph to hold nodes?

1.stack

2.queue

3.tree

4.array

Which data structure is used in breadth first search of a graph to hold nodes?

1.stack

2.queue

3.tree

4.array

Which if the following is/are the levels of implementation of data structure

1.abstract level

2.application level

3.implementation level

4. all of the above

Which is/are the application(s) of stack

1.function calls

2.large number arithmetic

3. evaluation of arithmetic expressions

4.All of the above

Which of the following data structure is linear type?

1.graph

2.trees

3.binary tree

4.stack

Which of the following data structure is non linear type?

1. strings

2.lists

3.stacks

4.graph

Which of the following data structure is non-linear type?

1.strings

2.lists

3.stacks

4.tree

Which of the following data structures are indexed structures?

1. linear arrays

2.linked lists

3.graphs

4.trees

Which of the following is an application of stack?

1. finding factorial

2.tower of hanoi

3.infix to postfix conversion

4. all of the above

Which of the following is non-liner data structure?

1.stacks

2.list

3.strings

4.trees

Which of the following is not the internal sort?

1.insertion sort

2.bubble sort

3.merge sort

4.heap sort

Which of the following is not the part of ADT description?

1. data

2.operations

3.both of the above

4.None of the above

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.

1. i-only

2. ii-only

3.both i and ii

4.None of the above

- Data Structures and algorithms MCQ Questions
- Data Structure -Abstract Data Types
- Data Structure Questions and Answers Singly Linked
- Data Structures &algorithms MCQ Questions
- Data Structure Multiple Choice Questions and Answers
- Data Structure (DS) MCQ Set 1
- Data Structure (DS) MCQ Set 2
- Data Structure and Algorithms (DSA) set 1
- Data Structure and Algorithms (DSA) set 2
- Data Structure and Algorithms (DSA) set 3
- Data Structure and Algorithms (DSA) set 4
- Data Structure and Algorithms (DSA) set 5
- Linear Data Structures - List
- Data Structure MCQ questions and answer
- Data Structure MCQ questions and answer

Online Exam TestTop Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on Online Exam Testwebsite is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!