Search Header Logo

Quiz ROund 3

Authored by Adithya Aby

Computers

University

Used 4+ times

Quiz ROund 3
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Which of the following scheduling algorthms is non-preemptive?

Round Robin

Shortest job first

First Come FIrst Served

Multilevel Feedback Queue

2.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Which data structure is used to implement a heap?

Array

Linked List

Binary Search Tree

Graph

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Which algorithm is used to find the minimum spanning tree of a graph?

Dijkstra's Algorithm

Bellman Ford Algorithm

Krushkal's Algorithm

Prim's Algorthm

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of Dijkstra's algorithm when implemented with a priority queue?

O(E log V)

O(V log V)

O(E + V log V)

O(V^2)

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a characteristic of a binary search tree?

Both a and c

In-order traversal gives sorted order

All nodes are balanced

All nodes have at most two children

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm is commonly used for graph traversal?

Binary Search

Merge Sort

Depth First Search

Quick Sort

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following programming languages is statistically typed?

Java

Pyton

C++

All of the above

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?