s8 IT Comprehensive Viva Data Structures

Convert the pre-fix expression to in-fix

–* + ABC* – DE + FG

• (A – B)*C + (D*E) – (F + G)

• (A + B)*C – (D – E)*(F – G)

• (A + B – C)*(D – E))*(F + G)

• None

G is an undirected graph with vertex set {v1, v2, v3, v4, v5, v6, v7} and edge set {v1v2, v1v3, v1v4, v2v4, v2v5, v3v4, v4v5, v4v6, v5v6, v6v7}. A breadth first search of the graph is performed with v1 as the root node. Which of the following is a tree edge ?

• v2v4

• v1v4

• v3v4

• v4v5

If the array A contains the items 10, 4, 7, 23, 67, 12 and 5 in that order, what will be the resultant array A after third pass of insertion sort ?

• 67, 12, 10, 5, 4, 7, 23

• 4, 7, 10, 23, 67, 12, 5

• 4, 5, 7, 67, 10, 12, 23

• 10, 7, 4, 67, 23, 12, 5

The minimum height of an AVL tree with n nodes is

• Ceil (log₂ (n + 1))

• 1.44 log₂ n

• Floor (log₂ (n + 1))

• 1.64 log₂ n

Of the following, which best approximates the ratio of the number of non-terminal nodes in the total number of nodes in a complete K-ary tree of depth N ?

• 1/N

• (N-1)/N

• 1/K

• (K-1)/K

Which one of the following in-place sorting algorithms needs the minimum number of swaps?

• Insertion Sort

• Quick Sort

• Heap Sort

• Selection Sort

Given a binary-max heap. The elements are stored in an arrays as 25, 14, 16, 13, 10, 8, 12. What is the content of the array after two delete operations?

• 14,13,8,12,10

• 14,12,13,10,8

• 14,13,12,10,8

• 14,13,12,8,10

The following postfix expression with single digit operands is evaluated using a stack: 8 2 3 ^ / 2 3 + 5 1 - Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are

• 6,1

• 5,7

• 3,2

• 1,5

A Hash Function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (Count table index 0 as 0^thlocation)?

• 5

• 6

• 4

• 3

The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 5, 13 in ascending order, using bubble sort is

• 8

• 9

• 12

• 10