s8 IT Comprehensive Viva Data Structures

s8 IT Comprehensive Viva Data Structures

Professional Development

30 Qs

quiz-placeholder

Similar activities

AJWT MCQ Quiz

AJWT MCQ Quiz

Professional Development

25 Qs

IT support Level-1 (MS Excel)

IT support Level-1 (MS Excel)

Professional Development

25 Qs

Тест остаточных знаний

Тест остаточных знаний

Professional Development

25 Qs

Iqtisodiyotda AKT

Iqtisodiyotda AKT

University - Professional Development

25 Qs

Quizz Compition Round 16(Fundamental Mix Part 8)

Quizz Compition Round 16(Fundamental Mix Part 8)

Professional Development

25 Qs

MCA24/BC2/PST Evaluation

MCA24/BC2/PST Evaluation

Professional Development

25 Qs

IT AUDIT PROCESS

IT AUDIT PROCESS

Professional Development

25 Qs

Ethereum Devcon Quiz - 1

Ethereum Devcon Quiz - 1

Professional Development

25 Qs

s8 IT Comprehensive Viva Data Structures

s8 IT Comprehensive Viva Data Structures

Assessment

Quiz

Computers

Professional Development

Practice Problem

Hard

Created by

Arya S R

Used 2+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

30 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The minimum height of an AVL tree with n nodes is

Ceil (log2 (n + 1))

1.44 log2 n

Floor (log2 (n + 1))

1.64 log2 n

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

Insertion Sort

Quick Sort

Heap Sort

Selection Sort

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?