DSA(UNIT 1) Test 1

Which of the following is a linear data structure?

• 1. Array

• 1. AVL Tree

• 1. Binary Tree

• 1. Graphs

Which matrix has most of the elements (not all) as Zero?

• a) Identity Matrix

• b) Unit Matrix

• c) Sparse Matrix

• d) Zero Matrix

Who coined the term Sparse Matrix?

• a) Harry Markowitz

• b) James Sylvester

• c) Chris Messina

• d) Arthur Cayley

The matrix contains m rows and n columns. The matrix is called Sparse Matrix if ________

• a) Total number of Zero elements > (m*n)/2

• b) Total number of Zero elements = m + n

• c) Total number of Zero elements = m/n

• d) Total number of Zero elements = m-n

Which of the following data structures allow insertion and deletion from both ends?

• a) Stack

• b) Deque

• c) Queue

• d) Strings

Process of inserting an element in stack is called ____________

• a) Create

• b) Push

• c) Evaluation

• d) Pop

Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________

• a) Overflow

• b) Crash

• c) Underflow

• d) User flow

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

• a) 1

• b) 40

• c) 74

• d) -18

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

• 1. 9

• 1. 36

• 1. 35

• 1. None of the above

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

• 1. 1234

• 1. 2134

• 1. 4321

• 1. None of the above