# 15it32c - Data Structures And Algorithms - Multiple Choice Test

26 Questions | Total Attempts: 211  Settings  .

Related Topics
• 1.
Which of the following data structure is not linear data structure?
• A.

Arrays

• B.

• C.

Both of above

• D.

None of above

• 2.
Which of the following data structure is not linear data structure?
• A.

Arrays

• B.

• C.

Both of above

• D.

None of above

• 3.
Which of the following data structure is linear data structure?
• A.

Trees

• B.

Graphs

• C.

Arrays

• D.

None of above

• 4.
The operation of processing each element in the list is known as
• A.

Sorting

• B.

Merging

• C.

Inserting

• D.

Traversal

• 5.
Finding the location of the element with a given value is:
• A.

Traversal

• B.

Search

• C.

Sort

• D.

None of above

• 6.
• 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

• 7.
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 situation

• 8.
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

• 9.
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 the above

• 10.
The memory address of the first element of an array is called
• A.

• B.

• C.

• D.

• 11.
A variable P is called pointer if
• A.

P contains the address of an element in DATA.

• B.

P points to the address of first element in DATA

• C.

P can store only memory addresses

• D.

P contain the DATA and the address of DATA

• 12.
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
• A.

Underflow

• B.

Overflow

• C.

Housefull

• D.

Saturated

• 13.
Which of the following name does not relate to stacks?
• A.

FIFO lists

• B.

LIFO list

• C.

Piles

• D.

Push-down lists

• 14.
A data structure where elements can be added or removed at either end but not in the middle
• A.

• B.

Stacks

• C.

Queues

• D.

Deque

• 15.
The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
• A.

AB+ CD*E - FG /**

• B.

AB + CD* E - F **G /

• C.

AB + CD* E - *F *G /

• D.

AB + CDE * - * F *G /

• 16.
The data structure required to check whether an expression contains balanced parenthesis is?
• A.

Stack

• B.

Queue

• C.

Array

• D.

Tree

• 17.
• A.

Stack data structure can be implemented using linked list

• B.

New node can only be added at the top of the stack

• C.

Stack is the FIFO data structure

• D.

The last node at the bottom of the stack has a NULL link

• 18.
Consider the following array implementation of stack:#define MAX 10Struct STACK{Int arr [MAX];Int top = -1;}If the array index starts with 0, the maximum value of top which does not cause stack overflow is?
• A.

8

• B.

9

• C.

10

• D.

11

• 19.
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
• A.

Queue

• B.

Stack

• C.

Tree

• D.

• 20.
Let the following circular queue can accommodate maximum six elements with the following datafront = 2 rear = 4queue = _______; L, M, N, ___, ___What will happen after ADD O operation takes place?
• A.

Front = 2 rear = 5 queue = ______; L, M, N, O, ___

• B.

Front = 3 rear = 5 queue = L, M, N, O, ___

• C.

Front = 3 rear = 4 queue = ______; L, M, N, O, ___

• D.

Front = 2 rear = 4 queue = L, M, N, O, ___

• 21.
In linked list implementation of a queue, where does a new element be inserted?
• A.

• B.

At the tail of the link list

• C.

At the center position in the link list

• D.

None

• 22.
If the MAX_SIZE is the size of the array used in the implementation of circular queue. How is rear manipulated while inserting an element in the queue?
• A.

Rear=(rear%1)+MAX_SIZE

• B.

Rear=rear%(MAX_SIZE+1)

• C.

Rear=(rear+1)%MAX_SIZE

• D.

Rear=rear+(1%MAX_SIZE)

• 23.
A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.
• A.

0

• B.

7

• C.

9

• D.

10

• 24.
• A.

1, 2, 3, 4, 5, 6, 7

• B.

2, 1, 4, 3, 6, 5, 7

• C.

1, 3, 2, 5, 4, 7, 6

• D.

2, 3, 4, 5, 6, 7, 1

• 25.
Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
• A.

Deleting a node whose location in given

• B.

Searching of an unsorted list for a given item

• C.

Inverting a node after the node with given location

• D.

Traversing a list to process each node

• 26.
• A.

Addition and deletion of an item to/ from the linked list require modification of the existing pointers

• B.

The linked list pointers do not provide an efficient way to search an item in the linked list

• C.

Linked list pointers always maintain the list in ascending order

• D.

The linked list data structure provides an efficient way to find kth element in the list