Quiz 1 - AK2 Section

Quiz 1 - AK2 Section

University

10 Qs

quiz-placeholder

Similar activities

Structure Data Review

Structure Data Review

University - Professional Development

10 Qs

DATA STRUCTURES QUIZ

DATA STRUCTURES QUIZ

University

15 Qs

Data Structures Minor-1

Data Structures Minor-1

University

8 Qs

UNIT-2 QUEUE

UNIT-2 QUEUE

University

10 Qs

data structure

data structure

University

15 Qs

Knowledge Knockout[Quiz Round](2nd-4th years)

Knowledge Knockout[Quiz Round](2nd-4th years)

University

15 Qs

BCSC0006 - Quiz 3 - Recursion

BCSC0006 - Quiz 3 - Recursion

University

10 Qs

Data Structures - Quiz1

Data Structures - Quiz1

University

10 Qs

Quiz 1 - AK2 Section

Quiz 1 - AK2 Section

Assessment

Quiz

Computers

University

Hard

Created by

Nagendra Prabhu S

Used 2+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the major advantage of a linked list over an array?

Faster access to elements.

Fixed size allocation.

Dynamic memory allocation and efficient insertion/deletion

More memory efficient for large datasets.

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the time complexity for accessing an element in the middle of a singly linked list?

O(1)

O(n)

O(log n)

O(n^2)

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which data structure can be used to reverse a string?

Queue

Stack

Linked List

Double Linked List

4.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

In a circular queue, how is the queue full condition detected?

Front == Rear

(Rear + 1) % Size == Front

(Front + 1) % Size == Rear

Rear == Size - 1

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which of the following is a disadvantage of using a linked list?

Efficient insertion and deletion

Flexibility in size

Dynamic memory allocation

Requires more memory due to pointers

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the primary advantage of using a stack for expression evaluation?

Stack is simpler to implement.

It evaluates expressions faster than other structures.

Stack naturally handles operations in reverse (LIFO), matching the needs of expression evaluation.

Stack uses less memory.

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

You are given a list of names, and you need to reverse the order of these names. Which data structure and operation would you use?

Stack to push names and then pop them.

Queue to enqueue names and then dequeue them.

Array to iterate from end to beginning.

Linked List to directly reverse the pointers.

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?