Practice: Week 0: Assignment 0

Data Structures and Algorithms Design · Instructor: Prof. Nitin Saxena

Week 06 Questions

Question 1

A data structure is like:

A.A folder to organize files

B.A painting hanging on a wall

C.A song you hear on the radio

D.A smartphone without any apps

Correct Answer: A folder to organize files

Question 2

Which of the following can be considered an algorithm in daily life?

A.Rolling a dice to decide your next action

B.Guessing someone’s age without rules

C.Making a cup of tea step by step

D.Watching a random video online

Correct Answer: Making a cup of tea step by step

Question 3

Which one of the following is NOT a characteristic of an algorithm?

A.Finiteness – the algorithm must end

B.Definiteness – each step must be clear

C.Ambiguity – unclear or vague steps

D.Input – the algorithm receives data

Correct Answer: Ambiguity – unclear or vague steps

Question 4

Which data structure uses First-In-First-Out (FIFO)?

A.A line of customers waiting to be served

B.Books stacked on top of each other

C.Files randomly accessed on a hard drive

D.Assigning tasks based on urgency

Correct Answer: A line of customers waiting to be served

Question 5

What does the term ”complexity” usually refer to in algorithms?

A.The number of syntax errors in the program

B.The amount of time or space used

C.The programming language used

D.The number of people reading the code

Correct Answer: The amount of time or space used

Question 6

For which of the following should we use a tree data structure?

A.Organizing folders and files on a computer

B.Booking seats in a queue

C.Repeating a set of instructions in a loop

D.Adding items to a shopping cart

Correct Answer: Organizing folders and files on a computer