The simplest type of data structure is ………………

A. Multidimensional array

B. Linear array✔

C. Two dimensional array

D. Three dimensional array

 Linear arrays are also called ……………….

A. Straight line array

B. One-dimensional array✔

C. Vertical array

D. Horizontal array

 Which of the following data structures are indexed structures?

A. Linear arrays✔

B. Linked lists

C. Graphs

D. Trees

When does top value of the stack changes?

A. Before deletion

B. While checking underflow

C. At the time of deletion

D. After deletion✔

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

A. Strings

B. Lists

C. Stacks

D. Tree✔

 Which of the following data structure is linear type?

A. Array✔

B. Tree

C. Graphs

D. Hierarchy

 The logical or mathematical model of a particular organization of data is called a ………

A. Data structure✔

B. Data arrangement

C. Data configuration

D. Data formation

 Which of the following are the operations applicable an primitive data structures?

A. create

B. destroy

C. update

D. all of the above✔

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

A. Strings

B. Lists

C. Stacks

D. Tree✔

 Which of the following data structure is linear type?

A. Array✔

B. Tree

C. Graphs

D. Hierarchy

 The simplest type of data structure is ………………

A. Multidimensional array

B. Linear array✔

C. Two dimensional array

D. Three dimensional array

 Linear arrays are also called ……………….

A. Straight line array

B. One-dimensional array✔

C. Vertical array

D. Horizontal array

 Which of the following data structures are indexed structures?

A. Linear arrays✔

B. Linked lists

C. Graphs

D. Trees

A …………………… does not keep track of address of every element in the list.

A. Stack

B. String

C. Linear array✔

D. Queue

A linear data structure in which insertion and deletion operations can be performed from both the ends is___

A.        Queue

B.        Deque✔

C.        Priority queue

D.        Circular queue

 In the Deque implementation using singly linked list, what would be the time complexity of deleting an element from the rear end?

A.        O(1)

B.        O(n2)

C.        O(n) ✔

D.        O(nlogn)

 Which of the following data structure allows you to insert the elements from both the ends while deletion from only one end?

A.        Input-restricted queue

B.        Output-restricted queue✔

C.        Priority queue

D.        None of the above

 What would be the time complexity if user tries to insert the element at the end of the linked list (head pointer is known)?

A.        O(1)

B.        O(n) ✔

C.        O(logn)

D.        O(nlogn)

 Which of the following is the time complexity to search an element in the linked list?

A.        O(1)

B.        O(n) ✔

C.        O(logn)

D.        O(nlogn)

What is the maximum number of children that a node can have in a binary tree?

A.        3

B.        1

C.        4

D.        2✔

 A …………………… does not keep track of address of every element in the list.

A. Stack

B. String

C. Linear array✔

D. Queue

 When does top value of the stack changes?

A. Before deletion

B. While checking underflow

C. At the time of deletion

D. After deletion✔

 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

 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✔

 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✔

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

A. O(n)

B. O(n2)

C. O(n log n) ✔

D. O(log n)

 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✔

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

A. queue

B. stack✔

C. tree

D. graph

How can we describe an array in the best possible way?

A.        The Array shows a hierarchical structure.

B.        Arrays are immutable.

C.        Container that stores the elements of similar types✔

D.        The Array is not a data structure

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

A. Abstract level

B. Application level

C. Implementation level

D. All of the above✔

 A binary search tree whose left subtree and right subtree differ in Hight by at most 1 unit is called ……

A. AVL tree✔

B. Red-black tree

C. Lemma tree

D. None of the above

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

A. Abstract level

B. Application level

C. Implementation level✔

D. All of the above

 Stack is also called as

A. Last in first out✔

B. First in last out

C. Last in last out

D. First in first out

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

A. Data

B. Operations

C. Both of the above

D. None of the above✔

 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

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

A. Stack

B. Queue✔

C. List

D. None of the above

 ………… is very useful in situation when data have to stored and then retrieved in reverse order.

A. Stack✔

B. Queue

C. List

D. Link list

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

A. Stacks

B. Queues✔

C. Dequeues

D. Binary search tree

 Which of the following data structure can’t store the non-homogeneous data elements?

A. Arrays✔

B. Records

C. Pointers

D. Stacks

 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.

A. Queue linked list✔

B. Stacks linked list

C. Both of them

D. Neither of them

 Which of the following is non-liner data structure?

A. Stacks

B. List

C. Strings

D. Trees✔

 Herder node is used as sentinel in …..

A. Graphs

B. Stacks

C. Binary tree✔

D. Queues

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

A. Stack

B. queue✔

C. Tree

D. Array

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

A. Input restricted dequeue✔

B. Output restricted qequeue

C. Priority queues

D. Stack

Which of the following data structure is non linear type?

A. Strings

B. Lists

C. Stacks

D. Graph✔

 Which of the following data structure is linear type?

A. Graph

B. Trees

C. Binary tree

D. Stack✔

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

A. Dequeue

B. Priority

C. Tree✔

D. Graph

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

A. Weakly connected

B. Strongly Connected✔

C. Tightly Connected

D. Linearly Connected

 In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

A. Depth First✔

B. Breadth First

C. With First

D. Depth Limited

 The number of comparisons done by sequential search is ………………

A. (N/2)+1

B. (N+1)/2✔

C. (N-1)/2

D. (N+2)/2

 In ……………, search start at the beginning of the list and check every element in the list.

A. Linear search✔

B. Binary search

C. Hash Search

D. Binary Tree search

 Which of the following is not the internal sort?

A. Insertion Sort

B. Bubble Sort

C. Merge Sort✔

D. Heap Sort

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

A. 0 and 1

B. 0 and -1✔

C. -1 and 0

D. 1 and 0

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

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

A. Insertion

B. Deletion

C. Retrieval

D. Traversal✔

There is an extra element at the head of the list called a ……….

A. Antinel

B. Sentinel✔

C. List header

D. List head

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

A. vertices, edges✔

B. edges, vertices

C. vertices, paths

D. graph node, edges

A ……….. is a graph that has weights of costs associated with its edges.

A. Network

B. Weighted graph

C. Both A and B✔

D. None A and B

 In general, the binary search method needs no more than ……………. comparisons.

A. [log2n]-1

B. [logn]+1

C. [log2n]

D. [log2n]+1✔

Which of the following is not the type of queue?

A. Ordinary queue

B. Single ended queue✔

C. Circular queue

D. Priority queue

The property of binary tree is

A. The first subset is called left subtree

B. The second subtree is called right subtree

C. The root cannot contain NULL

D. The right subtree can be empty✔

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

A. Successor node

B. Ancestor node✔

C. Internal node

D. None of the above

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

A. Directed tree✔

B. Undirected tree

C. Dis-joint tree

D. Direction oriented tree

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

A. Unary tree

B. Binary tree✔

C. Trinary tree

D. Both B and C

 Which of the following data structures are indexed structures?

A. Linear arrays✔

B. Linked lists

C. Queue

D. Stack

 Which of the following data structure store the homogeneous data elements?

A. Arrays

B. Records✔

C. Pointers

D. Lists

 When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….

A. Underflow

B. overflow✔

C. houseful

D. saturated

 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. queues

D. dequeue✔

 Operations on a data structure may be …..

A. creation

B. destruction

C. selection

D. all of the above✔

 The way in which the data item or items are logically related defines …..

A. storage structure

B. data structure✔

C. data relationship

D. data operation

Which of the following highly uses the concept of an array?

A.        Binary Search tree

B.        Caching

C.        Spatial locality✔

D.        Scheduling of Processes

 Which one of the following is the size of int arr[9] assuming that int is of 4 bytes?

A.        9

B.        36✔

C.        35

D.        None of the above

 Which one of the following is the process of inserting an element in the stack?

A.        Insert

B.        Add

C.        Push✔

D.        None of the above

 When the user tries to delete the element from the empty stack then the condition is said to be a ____

A.        Underflow✔

B.        Garbage collection

C.        Overflow

D.        None of the above

 If the size of the stack is 10 and we try to add the 11th element in the stack then the condition is known as___

A.        Underflow

B.        Garbage collection

C.        Overflow✔

D.        None of the above

 Which one of the following is not the application of the stack data structure

A.        String reversal

B.        Recursion

C.        Backtracking

D.        Asynchronous data transfer✔

 Which data structure is mainly used for implementing the recursive algorithm?

A.        Queue

B.        Stack✔

C.        Binary tree

D.        Linked list

 Which data structure is required to convert the infix to prefix notation?

A.        Stack✔

B.        Linked list

C.        Binary tree

D.        Queue

 Which of the following is the infix expression?

A.        A+B*C✔

B.        +A*BC

C.        ABC+*

D.        None of the above

 Which of the following is the prefix form of A+B*C?

A.        A+(BC*)

B.        +AB*C

C.        ABC+*

D.        +A*BC✔

 If the elements '1', '2', '3' and '4' are added in a stack, so what would be the order for the removal?

A.        1234

B.        2134

C.        4321✔

D.        None of the above

 

 What is the outcome of the prefix expression +, -, *, 3, 2, /, 8, 4, 1?

A.        12

B.        11

C.        5✔

D.        4

 Which one of the following node is considered the top of the stack if the stack is implemented using the linked list?

A.        First node✔

B.        Second node

C.        Last node

D.        None of the above

 What is another name for the circular queue among the following options?

A.        Square buffer

B.        Rectangle buffer

C.        Ring buffer✔

D.        None of the above

 If the elements '1', '2', '3' and '4' are inserted in a queue, what would be order for the removal?

A.        1234✔

B.        4321

C.        3241

D.        None of the above

 A list of elements in which enqueue operation takes place from one end, and dequeue operation takes place from one end is__

A.        Binary tree

B.        Stack

C.        Queue✔

D.        Linked list

 Which of the following principle does Queue use?

A.        LIFO principle

B.        FIFO principle✔

C.        Linear tree

D.        Ordered array

 Which one of the following is not the type of the Queue?

A.        Linear Queue

B.        Circular Queue

C.        Double ended Queue

D.        Single ended Queue✔

 Which one of the following is the overflow condition if linear queue is implemented using an array with a size MAX_SIZE?

A.        rear = front

B.        rear = front+1

C.        rear=MAX_SIZE -1✔

D.        rear = MAX_SIZE

 Which one of the following is the overflow condition if a circular queue is implemented using array having size MAX?

A.        rear= MAX-1

B.        rear=MAX

C.        front=(rear+1) mod max✔

D.        None of the above

 The time complexity of enqueue operation in Queue is __

A.        O(1) ✔

B.        O(n)

C.        O(logn)

D.        O(nlogn)

 Which one of the following is the correct way to increment the rear end in a circular queue?

A.        rear =rear+1

B.        (rear+1) % max✔

C.        (rear % max) + 1

D.        None of the above

 How many Queues are required to implement a Stack?

A.        3

B.        2✔

C.        1

D.        4

 Which one of the following is not the application of the Queue data structure?

A.        Resource shared between various systems

B.        Data is transferred asynchronously

C.        Load balancing

D.        Balancing of symbols✔

 The necessary condition to be checked before deletion from the Queue is__

A.        Overflow

B.        Underflow✔

C.        Rear value

D.        Front value

 Which data structure is the best for implementing a priority queue?

A.        Stack

B.        Linked list

C.        Array

D.        Heap✔

 Which of the following principle is used if two elements in the priority queue have the same priority?

A.        LIFO

B.        FIFO✔

C.        Linear tree

D.        None of the above