Data_Structures_1

What is a data structure?

• a) A programming language
  

• b) A collection of algorithms
  

• c) A way to store and organize data
  

• d) A type of computer hardware

What are the disadvantages of arrays?

• a) Index value of an array can be negative
  

• b) Elements are sequentially accessed
  

• c) Data structure like queue or stack cannot be implemented
  

• d) There are chances of wastage of memory space if elements inserted in an array are less than the allocated size

3. Which data structure is used for implementing recursion?

• a) Stack
  

• b) Queue
  

• c) List
  

• d) Array

7. What is the value of the postfix expression 6 3 2 4 + – *?

• a) 74
  

• b) -18
  

• c) 22
  

• d) 40

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) Queue
  

• b) Stack
  

• c) Tree
  

• d) Linked list

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• a) ABCD
  

• b) DCBA
  

• c) DCAB
  

• d) ABDC

A normal queue, if implemented using an array of size MAX_SIZE, gets full when?

• a) Rear = MAX_SIZE – 1
  

• b) Front = (rear + 1) mod MAX_SIZE
  

• c) Front = rear + 1
  

• d) Rear = front

9. Which of the following is not the type of queue?

• a) Ordinary queue
  

• b) Single ended queue
  

• c) Circular queue
  

• d) Priority queue

1. Which of the following is asymptotic time complexity to find an element in an array?

• a) o(1)
  

• b) o(n)
  

• c) can't find
  

• d) o(n2)

Consider the following definition in c programming language.

struct node

{ int data; struct node next; }

typedef struct node NODE; NODE ptr;

Which of the following c code is used to create new node?

• a) ptr = (NODE*)malloc(sizeof(NODE));
  

• b) ptr = (NODE*)malloc(NODE);
  

• c) ptr = (NODE*)malloc(sizeof(NODE*));
  

• d) ptr = (NODE)malloc(sizeof(NODE));