Exploring Programming Concepts

What is a data structure?

• A data structure is a specialized format for organizing, processing, and storing data.

• A data structure is a method for writing code.

• A data structure is a type of computer program.

• A data structure is a programming language.

Name three common types of data structures.

• queues

• trees

• arrays, linked lists, hash tables

• stacks

What is the time complexity of accessing an element in an array?

• O(1)

• O(n^2)

• O(log n)

• O(n)

Explain the difference between a stack and a queue.

• A stack uses FIFO, while a queue uses LIFO.

• A stack uses LIFO, while a queue uses FIFO.

• A stack allows random access, while a queue does not.

• Both stack and queue use LIFO.

What is a linked list and how does it differ from an array?

• A linked list is a single block of memory, while an array consists of nodes.

• A linked list consists of nodes with links to the next node, while an array is a contiguous block of memory with indexed access.

• A linked list uses indexed access, while an array uses pointers to navigate.

• An array allows dynamic resizing, whereas a linked list has a fixed size.

Define an algorithm and give an example.

• The steps to wash a car.

• A guide to planting a tree.

• An example of an algorithm is the process for adding two numbers.

• A recipe for baking a cake.

What is the purpose of a sorting algorithm?

• To organize data in a specific order.

• To compress data to save storage space.

• To encrypt data for security purposes.

• To delete unnecessary data from a database.

Explain the difference between bubble sort and quicksort.

• Bubble sort is faster than quicksort for large datasets.

• Quicksort is a stable sorting algorithm, while bubble sort is not.

• Bubble sort is O(n^2) and simple, while quicksort is O(n log n) and more efficient.

• Bubble sort is O(n log n) and complex, while quicksort is O(n^2) and simple.

What is recursion in programming?

• Recursion is a method where a function solves a problem by calling itself.

• Recursion is when a function is executed only once without any calls to itself.

• Recursion is a technique that involves using loops to repeat a function.

• Recursion is a method where a function runs in parallel with another function.

What are the four main principles of Object-Oriented Programming?

• Encapsulation, Abstraction, Inheritance, Polymorphism

• Polymorphism, Abstraction, Composition, Overloading

• Inheritance, Composition, Encapsulation, Serialization

• Composition, Aggregation, Delegation, Interface