Online Coding Lessons Data Structures and Algorithms 1

Question 1

What is an array in programming?

Accepted Answer

A collection of elements stored at contiguous memory locations

Answer

An array is a data structure that stores a fixed-size collection of elements of the same type at contiguous memory locations.

Question 2

What is the time complexity of a linear search algorithm?

Accepted Answer

O(n)

Answer

Linear search has O(n) time complexity because in the worst case, it must check every element in the list once.

Question 3

What is a stack data structure?

Accepted Answer

A structure where elements follow Last-In-First-Out (LIFO) order

Answer

A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle, where the last element added is the first to be removed.

Question 4

Which sorting algorithm works by repeatedly swapping adjacent elements if they are in the wrong order?

Accepted Answer

Bubble Sort

Answer

Bubble Sort works by repeatedly comparing and swapping adjacent elements until the list is sorted, causing larger values to 'bubble' to the end.

Question 5

What is a queue data structure?

Accepted Answer

Elements follow First-In-First-Out (FIFO) order

Answer

A queue is a data structure that follows the First-In-First-Out (FIFO) principle, like a line of people waiting — the first in is the first out.

Online Coding Lessons Practice Test