Data Structure I Mock Test 1

10%

Question 1 of 10

1. Process of removing an element from stack is called __________

Push

Evaluation

Create

Pop

Question 1 of 10

Question 2 of 10

2. How do you instantiate an array in Java?

int arr() = new int(3);

int arr[] = new int(3);

int arr[];

int arr[] = new int[3];

Question 2 of 10

Question 3 of 10

3. What does 'stack overflow' refer to?

accessing item from an undefined stack

adding items to a full stack

removing items from an empty stack

index out of bounds exception

Question 3 of 10

Question 4 of 10

4. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

θ(1)

O(1)

O(n)

θ(n)

Question 4 of 10

Question 5 of 10

5. Which of the following is not the application of stack?

Data Transfer between two asynchronous process

A parentheses balancing program

Tracking of local variables at run time

Compiler Syntax Analyzer

Question 5 of 10

Question 6 of 10

6. Which of the following is not an inherent application of stack?

Reversing a string

Job scheduling

Implementation of recursion

Evaluation of postfix expression

Question 6 of 10

Question 7 of 10

7. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?

log 2 n

ⁿ⁄₂

log 2 n – 1

Question 7 of 10

Question 8 of 10

8. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

ABDC

DCBA

DCAB

ABCD

Question 8 of 10

Question 9 of 10

9. What kind of linked list is best to answer questions like “What is the item at position n?”

Array implementation of linked list

Singly linked list

Doubly linked list

Circular linked list

Question 9 of 10

Question 10 of 10

10. Circular Queue is also known as ________

Ring Buffer

Rectangle Buffer

Curve Buffer

Square Buffer

Question 10 of 10