MPS   INTERNAL 2 TEST

MPS INTERNAL 2 TEST

University

6 Qs

quiz-placeholder

Similar activities

TOOLS FOR AD & TECHNOLOGY DEVELOPMENT (W4-W6)

TOOLS FOR AD & TECHNOLOGY DEVELOPMENT (W4-W6)

University

10 Qs

JAVA QUIZ-1

JAVA QUIZ-1

University

10 Qs

Understanding Email, Contacts and Calendaring

Understanding Email, Contacts and Calendaring

University

10 Qs

Logika Fuzzy

Logika Fuzzy

University

10 Qs

BB

BB

University

10 Qs

Tree and Planar Graph

Tree and Planar Graph

University

10 Qs

CodeMonkey for B.Ed IT

CodeMonkey for B.Ed IT

University

10 Qs

JRB2 Quiz 4

JRB2 Quiz 4

University

10 Qs

MPS   INTERNAL 2 TEST

MPS INTERNAL 2 TEST

Assessment

Quiz

Computers

University

Practice Problem

Medium

Created by

Trilochan Sahoo

Used 3+ times

FREE Resource

AI

Enhance your content in a minute

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

6 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

5 sec • 1 pt

Which algorithm searches for an element in a list by checking each element one by one until a match is found or the end of the list is reached?

Sequential Search

Binary Search

Hashing

Tree Search

2.

MULTIPLE CHOICE QUESTION

5 sec • 1 pt

Optimal Binary Search Trees are used to minimize the:

Number of nodes in a binary tree

Height of a binary tree

Average search time in a binary search tree

Maximum search time in a binary search tree

3.

MULTIPLE CHOICE QUESTION

5 sec • 1 pt

In the context of optimal binary search trees, what does the term "internal cost" refer to?

The cost of searching in the root node

The cost of searching in the internal nodes

The cost of searching in the leaf nodes

The cost of building the binary search tree

4.

MULTIPLE CHOICE QUESTION

5 sec • 1 pt

Floyd's algorithm is used for:

Finding the shortest path in a weighted graph with negative edge weights

Finding the shortest path in a weighted graph with non-negative edge weights

Finding the longest path in a directed acyclic graph

Finding the minimum spanning tree in a graph

5.

MULTIPLE CHOICE QUESTION

5 sec • 1 pt

What is the order of growth of the function f(n) = 2n3 + 3n2 + 4n ?

O(n)

O(n^2)

O(n^3)

O(n^4)

6.

MULTIPLE SELECT QUESTION

5 sec • 1 pt

When analyzing the time complexity of a non-recursive algorithm, what is the primary focus?

The number of iterations

The number of function calls

The size of the input

The number of base cases

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?

Discover more resources for Computers