Tech Fundamentals Challenge

What is a primary key in a database?

• A primary key can be duplicated across records.

• A primary key is a type of foreign key.

• A primary key is used to store large amounts of data.

• A primary key is a unique identifier for a record in a database.

Explain the difference between a clustered and a non-clustered index.

• Clustered index: logical order of data; Non-clustered index: no specific order.

• Clustered index: separate structure, multiple allowed; Non-clustered index: only one per table.

• Clustered index: physical order of data, only one per table; Non-clustered index: separate structure, multiple allowed.

• Clustered index: allows multiple per table; Non-clustered index: physical order of data.

What is normalization in database design?

• Normalization in database design is the process of organizing data to minimize redundancy and dependency.

• A method to increase data redundancy

• A way to create backup copies of data

• A technique for data encryption

Describe the role of the operating system in a computer.

• The operating system is solely responsible for hardware manufacturing.

• The operating system only manages user accounts and passwords.

• The operating system is a type of application software that runs on top of other applications.

• The operating system acts as an intermediary between users and the computer hardware, managing resources and providing essential services for application execution.

What is a process and how does it differ from a thread?

• A process is an independent execution unit with its own memory space, while a thread is a smaller unit of a process that shares memory with other threads.

• A process cannot contain threads, as they are separate entities.

• Threads are independent execution units with their own memory space.

• A process is a type of thread that runs in the same memory space.

Define deadlock in the context of operating systems.

• A deadlock occurs when a process is terminated unexpectedly.

• A deadlock is a situation where all processes are running efficiently without waiting.

• A deadlock is a situation in an operating system where two or more processes are unable to proceed because each is waiting for the other to release a resource.

• A deadlock is when a process runs out of memory and crashes.

What is the purpose of a file system?

• To provide internet connectivity

• The purpose of a file system is to manage how data is stored and retrieved on a storage device.

• To enhance the graphics of a device

• To increase the speed of a computer

Explain the concept of Big O notation in algorithm analysis.

• Big O notation describes the upper bound of an algorithm's complexity, focusing on worst-case scenarios.

• Big O notation focuses solely on the best-case scenario of an algorithm.

• Big O notation is used to describe the exact runtime of an algorithm.

• Big O notation measures the average case performance of an algorithm.

What is the difference between a linear search and a binary search?

• Linear search is O(n) and works on unsorted lists; binary search is O(log n) and requires sorted lists.

• Linear search requires sorted lists to function.

• Binary search can be used on unsorted lists.

• Linear search is faster than binary search.

Describe the divide and conquer algorithm strategy.

• Divide and conquer is an algorithm strategy that breaks a problem into smaller subproblems, solves them independently, and combines their solutions.

• It requires a single, linear approach to problem-solving.

• It only solves the largest subproblem and ignores the rest.

• It combines all parts of a problem into one solution at once.