Fundamentals of Data Structures

What is an array in programming?

• An array is a collection of elements that can only be numbers.

• An array is a type of function that returns a value.

• An array is a single value of any data type.

• An array is a collection of elements identified by index or key, typically of the same data type.

How do you declare an array in Java?

• int myArray[] = new int();

• int[] myArray = new int[10];

• int myArray = new int[10];

• int[] myArray = int[10];

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

• O(n^2)

• O(n)

• O(1)

• O(log n)

Define an algorithm in the context of computer science.

• An algorithm is a step-by-step procedure for solving a problem or performing a task in computer science.

• An algorithm is a programming language used for coding.

• An algorithm is a random guess to solve a problem.

• An algorithm is a type of computer hardware.

What are the characteristics of a good algorithm?

• Speed, accuracy, and unpredictability

• clarity, efficiency, correctness, robustness, scalability, and maintainability.

• Simplicity, complexity, and redundancy

• Flexibility, inconsistency, and obsolescence

Explain the difference between a linear and a binary search algorithm.

• Linear search is faster than binary search for large datasets, while binary search is slower.

• Linear search checks elements one by one, while binary search divides the list and checks midpoints.

• Linear search uses a divide-and-conquer approach, while binary search checks each element sequentially.

• Binary search requires a sorted list, while linear search can be used on unsorted lists.

What is the purpose of data structures in programming?

• To organize and manage data efficiently.

• To create user interfaces

• To write algorithms for sorting data

• To store data in a database

Name three common types of data structures.

• arrays, linked lists, Java

• stacks, graphs, trees

• queues, hash tables, sheets

• trees, forest, lines

What is the difference between a stack and a queue?

• A stack uses LIFO while a queue uses FIFO.

• A stack can only hold integers while a queue can hold any data type.

• Both stack and queue use the same data structure.

• A stack uses FIFO while a queue uses LIFO.

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

• O (1)

• O(log n)

• O (n log n)

• O(n)