## MCQs Analysis of Algorithms for Jobs Test – Solved

“MCQs Analysis of Algorithms for Jobs Test – Solved” is the set of frequently asked Multiple Choice questions and these MCQs are asked in different test in the past in different test. Here, we are presenting those MCQs in a different style. Let’s begin with Set 1.

## Set 1: MCQs onĀ Analysis of Algorithms – FAQ by GAT

1. Define the implementation level 0f data structure?

A. abstract level

B.implementation level

C. application level

D. none of these

E. all of the above

2.left and right subtree differ in height by unit 1 are BST known as?

A. AVL tree

B. red-black tree

C. lemma tree

D. none of these

E. all of the above

3. define the level in a data structure in which data is ready for execution?

A. abstract level

B.implementation level

C. application level

D. none of these

E. all of the above

4. the stack is also known as?

A.Last in first out

B.First in last out

C.First in first out

D.none of these

E.all of above

5 Which one is not the component of the data structure?

A. operations

B. storage structure

C. algorithms

D. none of above

E. all of the above

## Set 2: MCQs onĀ Analysis of Algorithms- FAQ by GRE

6. define the name of the process in which items are added at one end and removed from another side?

A. stack

B. Queue

C. List

D. none of above

E. all of the above

7. which data structure allows you to delete data and inserting in a rear order?

A. stack

B. queues

C. de queues

D.none of these

E.Binary search trees

8 which one is not belongs to internal sort ?

A. insertion sort

B. bubble sort

C. heap sort

D. merge sort

E. none of these

9. Define the value of r in a circular queue?

A. r=r+1

B. r=(r+1)%[QUEUE_SIZE=1]

C. r=(r+1)% QUEUE_SIZE

D. r=(r-1)% QUEUE_SIZE

E. none of these

10 . A combination of an decryption algorithm and a encryption algorithm is called a.

A. plain text

B. original text

C. cipher

D. shift cipher

E. none of these

F. both a&b

## Set 3: MCQs onĀ Analysis of Algorithms – FAQ by NTS

11. Size of the congestion window increases exponentially until it reaches——. In the slow-start algorithm,

A. 0

B. n-1

C. Threshold

D. n+1

E. none of these

F. both a&b

12. Dijkstra algorithm creates the shortest path tree In Unicast Routing from a

A.Chart

B.Graph

C.Station

D.Link

E.none of these

F.both a&b

13. In Message Integrity, SHA-l hash algorithms create an N-bit block message-digest out of how many messages of.

A.1001 Bit Blocks

B.1000 Bit Blocks

C.512 Bit Blocks

D.2020 Bit Blocks

E.none of these

F.both c&d

14. Suppose we want to determine the efficiency of the algorithm, then how we can measure the space factor

A. To count the maximum memory required by the algorithm

B. To count the minimum memory required by the algorithm

C. To count the average memory required by the algorithm

D. To count the maximum disk space needed by the algorithm

E. none of these

F. both a&b

15. Find the complexity of Bubble sort algorithm?

A. O(n)

B. O(log n)

C. O(n2)

D. O(n log n)

E. none of these

F. both a&b

## Set 4: MCQs onĀ Analysis of Algorithms – FAQ by PPSC

16. A best suited linked list is

A. for relatively permanent collections of data

B. The structure size and data in changing constantly

C. for both of the above situation

D. for none of the above situation

E. none of these

F. both a&b

17. divide and conquer approaches steps.

A. divide, conquer and combine

B. conquer, divide and combine

C. combine, divide and conquer

D. none of these

E. all of the above

F. both a&b

18. In the binary search algorithm the complexity of searching for an element from a set of n elements.

A. O(nlogn)

B. O(log n)

C. O(n2)

D. O(n)

E. none of these

F. both a&c

19. what is the time complexity of optimal binary search tree .

A. O(logn)

B. O(n)

D. O(n!)

E. none of these

F. all of above

20. merge sort in data structure is used for .

A. two pointers

B. two-pointers and N extra array

C. 2N/2pointers and N/2 Extra array

D. two-pointers and an extra arrays

E. none of these

F. both a&b

21 The output to stage n becomes the input of which in dynamic programming.

A. stage n-1

B. stage n+1

C. stage n

D. stage n-2[latex size=0 color=000000 background=ffffff]\displaystyle f_{rec} = \frac{c+v_{mobile}}{c} f_{em}[/latex]

E. none of these

F. both a&b