### Data Structure QUESTIONS : PART 5

Maximum degree of any vertex in a simple graph of vertices n is

- 2n - 1

- n

- n + 1

n - 1

SHOW ANSWER
Apriory algorithm analysis does not include

Time Complexity

Space Complexity

Program Complexity

None of the above!

SHOW ANSWER
How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4}

4

5

6

7

SHOW ANSWER
Which of the following uses memoization?

Greedy approach

Divide and conquer approach

Dynamic programming approach

None of the above!

Dynamic programming approach

SHOW ANSWER
Program with highest run-time complexity is

Tower of Hanoi

Fibonacci Series

Prime Number Series

None of the above

SHOW ANSWER
The complexity of multiplying two matrices of order m*n and n*p is

mnp

mp

mn

np

SHOW ANSWER
If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been stored in _________ order

row major

column major

matix major

None of these

SHOW ANSWER