Cryptec Tech Quiz Round 1 SEM 3

A queue follows _________:

• LIFO principle

• FIFO principle

• Linear tree

• Ordered array

The tango tree is a type of :

• Binary Search Tree

• K-ary Tree

• Ternary Tree

• AVL Tree

Which of the following sorting algorithms can be used to sort a random

linked list with minimum time complexity?

• Insertion Sort

• Quick Sort

• Heap Sort

• Merge Sort

Which among the following options is NOT correct about stacks?

• Stack is based on LIFO principle

• Used in solving sequential processing problems

• Insertion operation in stack is known as push

• Used in solving recursion problems

How can we describe an array in the best possible way?

• The Array shows a hierarchical structure

• Arrays are immutable

• Container that stores the elements of similar types

• The Array is not a data structure

Which one of the following is the size of int arr[9] assuming that int is of 4

bytes?

• 9

• 36

• 35

• None of these

When the user tries to delete the element from the empty stack then the

condition is said to be a ____:

• Underflow

• Garbage collection

• Overflow

• None of these

Which one of the following is not the application of the stack data structure?

• String reversal

• Recursion

• Backtracking

• Asynchronous data transfer

If the elements '1', '2', '3' and '4' are added in a stack, so what would be the

order for the removal?

• 1234

• 2134

• 4321

• None of the above

What is the maximum number of children that a node can have in a binary

tree?

• 3

• 2

• 4

• 2