JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

Final Lab Quiz Data Structures MCA

Email *

Record my email address with my response

NAME

*

*

ROLL NO:

*

*

SECTION:

*

*

EMAIL :

*

*

**1. Condition to enqueue an element in a linear Queue**

1 point

A. Rear=Rear*1

B. Rear=Rear+1

C. Front=Front-1

D. Front=Front+1

**2.Which of the following data structures follows the Last In, First Out (LIFO) principle?**

1 point

A. Queue

B. Stack

C. Linked List

D. Tree

1 point

A. N

B. 0

C. 2

D. 1

**4.In a doubly linked list, each node contains how many pointers/references to other nodes?**

1 point

A. 0

B. 1

C. 2

D. 3

**5.Which of the following is not a type of tree traversal**

1 point

A. Preorder

B. Inorder

C. Postorder

D. Sideorder

**6.Which data structure is used to implement recursion efficiently?**

1 point

A. Stack

B. Queue

C. Linked List

D. Array

**7.****Which of the following is a linear data structure?**

1 point

A. Tree

B. Graph

C. Queue

D. Hash table

** 8. Condition to move to next postion while dequeue an element in a circular Queue**

1 point

A. Front=Front+1

B. Front=Front-1

C. Front=(Front+1)%Max

D. Front=(Front+1)/Max

**9. A node in a Linkedlist consist of how many parts ?**

1 point

A. 1

B. 3

C. 4

D. 2

**10.****What does FIFO stand for in the context of data structures?**

1 point

A. First In, First Out

B. First Input, First Output

C. Fast In, Fast Out

D. Find In, Find Out

Submit

Clear form

Never submit passwords through Google Forms.

This form was created inside of NIST University. Report Abuse