Database and Machine Learning Quiz

What is the purpose of regularization in machine learning?

• To reduce bias in the model.

• To reduce variance in the model.

• To prevent overfitting by penalizing large model coefficients.

• To speed up the training process.

What is the primary objective of supervised learning in machine learning?

• To uncover hidden patterns in unlabeled data.

• To classify data into predefined categories based on labeled examples.

• To learn from interactions with an environment and optimize rewards.

• To discover meaningful clusters within a dataset.

What does the term "overfitting" refer to in machine learning?

• When a model fails to capture underlying patterns in the data.

• When a model performs well on training data but poorly on unseen data.

• When a model is too simple to represent the complexity of the data.

• When a model performs equally well on both training and test data.

Which data structure is typically used to implement a priority queue?

• Stack

• Queue

• Linked List

• Heap

Which algorithm is commonly used to find the shortest path in a weighted graph?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Dijkstra's Algorithm

• Prim's Algorithm

What is the primary goal of unsupervised learning in machine learning?

• To classify data into predefined categories based on labeled examples.

• To learn from interactions with an environment and optimize rewards.

• To discover hidden patterns or structures within a dataset without labeled examples.

• To predict a continuous value based on input features.

Which of the following is NOT a type of database integrity constraint?

• Entity Integrity

• Referential Integrity

• Domain Integrity

• Structural Integrity

Which normal form eliminates transitive dependencies?

• First Normal Form (1NF)

• Second Normal Form (2NF)

• Third Normal Form (3NF)

• Boyce-Codd Normal Form (BCNF)

What is the purpose of using dynamic programming in algorithm design?

• To solve problems by combining solutions to subproblems

• To find the shortest path in a graph

• To sort data efficiently

• To solve problems using recursion

Which sorting algorithm has the best worst-case time complexity?

• Bubble Sort

• Quick Sort

• Merge Sort

• Insertion Sort