Virtual Labs

1. Which of these best describes an array in C/C++?

a: A data structure that shows a hierarchical behaviour Explanation

Explanation

b: A container of objects of similar types Explanation

Explanation

c: A container of objects of mixed types Explanation

Explanation

d: A structure in which elements must be accessed using links Explanation

Explanation

2. What is the worst-case time complexity of insertion at an arbitrary position in an array?

O(N)

Explanation

O(N^2)

Explanation

O(N\log N)

Explanation

O(1)

Explanation

3. Which of the following is an invalid one-dimensional array declaration in C?

a: int array[1000]; Explanation

Explanation

b: char array[2]; Explanation

Explanation

c: int array = {3, 4}; Explanation

Explanation

d: int array[3] = {1, 2, 3}; Explanation

Explanation

4. In a singly linked list, each node contains a minimum of two fields. If one field is the data field to store the data, then the second field is _______.

a: Pointer to the previous node Explanation

Explanation

b: Pointer to the head node Explanation

Explanation

c: Pointer to the next node Explanation

Explanation

d: Pointer to the last node only Explanation

Explanation

5. In a singly linked list without a tail pointer, what is the asymptotic time complexity to add a tail element and to find an element?

O(n)

and

O(n)

Explanation

O(1)

and

O(n)

Explanation

O(n)

and

O(1)

Explanation

O(1)

and

O(1)

Explanation

6. Why do we need pointers in a linked list but not in an array?

a: Elements are always dynamically allocated Explanation

Explanation

b: Nodes in a linked list are not required to occupy contiguous memory locations Explanation

Explanation

c: Every linked-list node must store two arrays Explanation

Explanation

d: Arrays cannot support dynamic memory allocation Explanation

Explanation

7. Which data structure follows the Last In, First Out principle and is commonly used to implement a stack?

a: Queue Explanation

Explanation

b: Graph Explanation

Explanation

c: Stack Explanation

Explanation

d: Tree Explanation

Explanation

8. Which pair of operations is associated with inserting into and removing from a queue?

a: Push and Pop Explanation

Explanation

b: Enqueue and Dequeue Explanation

Explanation

c: Insert and Search Explanation

Explanation

d: Peek and Traverse Explanation

Explanation

9. A stack contains the elements 10, 20, and 30, where 30 is at the top. If one pop operation is performed followed by push(40), which element will be at the top?

a: 10 Explanation

Explanation

b: 20 Explanation

Explanation

c: 30 Explanation

Explanation

d: 40 Explanation

Explanation

Stacks and Queues