Data Structure And Algorithm II

Data Structure And Algorithm II

University

15 Qs

quiz-placeholder

Similar activities

MESYUARAT KE-3 MYTECC ASSEMBLY: TOGETHER WE BIND

MESYUARAT KE-3 MYTECC ASSEMBLY: TOGETHER WE BIND

University

20 Qs

Software Testing

Software Testing

University

10 Qs

Chapter 2: Input Device

Chapter 2: Input Device

12th Grade - University

12 Qs

ĐC CNTT_Chương 1

ĐC CNTT_Chương 1

University

20 Qs

C Programming Unit-1 Test-2

C Programming Unit-1 Test-2

University

20 Qs

Hệ Điều Hành Của Máy Tính

Hệ Điều Hành Của Máy Tính

10th Grade - University

10 Qs

TEST1.PY

TEST1.PY

10th Grade - University

20 Qs

FSA,DFA dan NFA

FSA,DFA dan NFA

University

15 Qs

Data Structure And Algorithm II

Data Structure And Algorithm II

Assessment

Quiz

Computers

University

Hard

Created by

RAHUL SONAWANE

Used 20+ times

FREE Resource

AI

Enhance your content in a minute

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

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a hash table?

a) A structure that maps values to keys

b) A structure that maps keys to values

c) A structure used for storage

d) A structure used to implement stack and queue

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If several elements are competing for the same bucket in the hash table, what is it called?

a) Diffusion

b) Replication

c) Collision

d) Duplication

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not a technique to avoid a collision?

a) Make the hash function appear random

b) Use the chaining method

c) Use uniform hashing

d) Increasing hash table size

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A technique for direct search is

a) Binary Search

b) Linear Search

c) Tree Search

d) Hashing

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The goal of hashing is to produce a search that takes

a) O(1) time

b) O(n2 )time

c) O(log n ) time

d) O(n log n ) time

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statement(s) is TRUE?

I. A hash function takes a message of arbitrary length and generates a fixed length code.

II. A hash function takes a message of fixed length and generates a code of variable length.

III. A hash function may give the same hash value for distinct messages.

I only

II and III only

I and III only

II only

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is direct addressing?

A. Distinct array position for every possible key

B. Fewer array positions than keys

C. Fewer keys than array positions

D. None of the mentioned

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