SMARTICUS

If the post order traversal gives a b - c d * + then the label of the nodes 1, 2, 3 ... will be

•    +, -, *, a, b, c, d

•    a, -, b, +, c, *, d

•    a, b, c, d, -, *, +

•   -, a, b, +, *, c, d

What is the time complexity for adding an element to a heap?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which data structure is used to implement depth-first search in a graph?

• Array

• Linked List

• Stack

• Queue

Which of the following operations on a heap data structure has the worst-case time complexity of O(log n)?

• Insertion

• Deletion

• Search

• Heapify

Which of the following is the correct formula to calculate the index of a node's parent in a binary heap?

• i/2

• 2i

• 2i+1

• i-1

The postfix form of the expression (A B)*(C*D− E)*F / G is

• AB CD* E − F **G /

• AB CD*E − FG /**

• AB CDE − F *G /

• AB CD* E − F G / 

What is a cycle in a graph?

• A set of vertices that are all connected to each other.

• A path in the graph that starts and ends at the same vertex.

• A group of edges that connect two different vertices.

• A subgraph that is disconnected from the main graph.

A binary tree is generated by inserting in order the following integers:

50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24

The number of nodes in the left and right of the root respectively is

• (4,7)

• (7,4)

• (6,3)

• (3,6)

What is the time complexity of sorting an array using bubble sort?

• O(1)

• O(n)

• O(n log n)

• O(n^2)

Which of the following data structures is commonly used in conjunction with a suffix array to perform efficient pattern matching?

• Trie

• Hash table

• Bloom filter

• Skip list