Data structures PGDCA

Data structures PGDCA

University

20 Qs

quiz-placeholder

Similar activities

Arduino Loop

Arduino Loop

2nd Grade - University

20 Qs

Python List

Python List

4th Grade - University

15 Qs

Round 1 ( RHA Learner Contest )

Round 1 ( RHA Learner Contest )

University

20 Qs

1.1.1 The structure and function of the processor

1.1.1 The structure and function of the processor

11th Grade - University

15 Qs

Python MCQ

Python MCQ

University

20 Qs

Network topologies

Network topologies

8th Grade - University

20 Qs

CIS2303 Week 4_5 Ch_3

CIS2303 Week 4_5 Ch_3

University

18 Qs

Software Engineering Quiz 1

Software Engineering Quiz 1

University

20 Qs

Data structures PGDCA

Data structures PGDCA

Assessment

Quiz

Computers

University

Practice Problem

Medium

Created by

sathya priya

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...

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not a property of a set?

 

Ordered

Mutable

Does not allow duplicates

All the above

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What will be the output of the following code?

print((1,2,3)+(‘a’,’b’,’c’))

(1, 2, 3, 'a', 'b', 'c')

((1, 2, 3),('a', 'b', 'c'))

(1,’a’,2,’b’,3,’c’)

Error

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A ___ is a subgraph of a graph G that includes all the vertices of G and is also a tree.

Binary tree

Binary Search Tree

Spanning tree

AVL tree

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Hashing is the technique that uses mathematical functions to sort ___ data in a speedy and organized fashion.

Incoming

Outgoing

Stored

Both A and B

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The worst-case occur in linear search algorithm when …….

Item is somewhere in the middle of the array

Item is not in the array at all

Item is the last element in the array

Item is the last element in the array or item is not there at all

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The complexity of bubble sort algorithm is …..

O(n)

O(logn)

O(n2)

O(n logn)

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Partition and exchange sort is ……..

quick sort

tree sort

heap sort

bubble sort

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