Which of these is a divide and conquer algorithm?

• Merge Sort

• Bubble Sort

• Insertion Sort

• Selection Sort

What is a data structure?

• A programming language

• A collection of algorithms

• A way to store and organize data

• A type of computer hardware

What data structure uses LIFO?

• Stack

• Queue

• Linked List

• Array

What is the worst case time complexity of a linear search?

• O(n)

• O(log n)

• O(1)

• O(n^2)

What are the disadvantages of arrays?

• Index value of an array can be negative

• Elements are sequentially accessed

• Data structure like queue or stack cannot be implemented

• There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

The data structure required to check whether an expression contains a balanced parenthesis is?

• Queue

• Stack

• Tree

• Array

What is the value of the postfix expression 6 3 2 4 + - *?

• 74

• -18

• 22

• 40

What makes a tree 'binary'?

• Each node can have at most two child nodes

• Each node has two parent nodes

• Each edge is bi-directional

• The tree has two root nodes

Which of the following data structures can be used for parentheses matching?

• n-ary tree

• queue

• priority queue

• stack

What is meant by the 'bubble' in Bubble sort?

• Higher values 'bubble up'

• Every time a value is compared to a neighbor value, the two are considered a 'bubble'

• It is the extra memory used when swapping values, causing a 'memory bubble'

• Higher values stay in place inside their 'bubble', while lower values are moved around