2nd Year Data Structures Quiz Qn

2nd Year Data Structures Quiz Qn

University

35 Qs

quiz-placeholder

Similar activities

Quiz# 4: Components and Devices

Quiz# 4: Components and Devices

University

35 Qs

Kelas 8 - Halaman 31 (PTS)

Kelas 8 - Halaman 31 (PTS)

8th Grade - University

30 Qs

IS PROJECT MANAGEMENT - FINAL EXAMINATION

IS PROJECT MANAGEMENT - FINAL EXAMINATION

University

30 Qs

Warmup - Python - Machine Learning

Warmup - Python - Machine Learning

University

30 Qs

Hawkin's hunt ROUND-2

Hawkin's hunt ROUND-2

University

30 Qs

Quiz Pertemuan 1:  Pengantar Pengembangan Web

Quiz Pertemuan 1: Pengantar Pengembangan Web

University

30 Qs

Infinity Code Nexus

Infinity Code Nexus

University

40 Qs

Quiz Editing Video

Quiz Editing Video

12th Grade - University

40 Qs

2nd Year Data Structures Quiz Qn

2nd Year Data Structures Quiz Qn

Assessment

Quiz

Information Technology (IT)

University

Practice Problem

Hard

Created by

Keerthana Moorthy

Used 5+ times

FREE Resource

AI

Enhance your content in a minute

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

35 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How is an array initialized in C language?

int a[3] = {1, 2, 3};

int a = {1, 2, 3};

int a[] = new int[3]

int a(3) = [1, 2, 3];

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not the type of queue?

Priority queue

Single-ended queue

Circular queue

Ordinary queue

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

From following which is not the operation of data structure?

Operations that manipulate data in some way

Operations that perform a computation

Operations that check for syntax errors

Operations that monitor an object for the occurrence of a controlling event

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following are applications of Topological Sort of a graph?

Sentence Ordering

Course Scheduling

OS Deadlock Detection

All of the above

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of the binary search algorithm?

O(n)

O(n^2)

O(log2n)

O(1)

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph?

BFS

Kruskal’s Algorithm

Prims Algorithm

Djikstra’s Algorithm

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many edges are present in the complete graph of n vertices?

n(n-1)/2

n(n+1)/2

n

n/2

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?