Computer Science Fundamentals

What is the purpose of representing algorithms?

• Representing algorithms is done to complicate problem-solving

• The purpose of representing algorithms is to provide a clear and structured way to describe the steps needed to solve a problem.

• The purpose of representing algorithms is to create chaos

• Algorithms are represented to confuse users

Which data type is used to store whole numbers in programming?

• boolean

• integer

• string

• float

What is the time complexity of Bubble Sort algorithm?

• O(n)

• O(1)

• O(n^2)

• O(nlogn)

Give an example of a data structure used to store data in a hierarchical manner.

• Queue

• Linked list

• Tree data structure

• Graph data structure

Explain how Binary Search algorithm works.

• Binary Search algorithm works by randomly selecting elements from the array until the target element is found.

• Binary Search algorithm works by repeatedly dividing the sorted array in half and narrowing down the search range until the target element is found or the subarray becomes empty.

• Binary Search algorithm works by sorting the array in descending order.

• Binary Search algorithm works by comparing the target element with the first element of the array.

Fill in the blank: A variable declared as 'int x;' in C++ is of ________ data type.

• float

• string

• boolean

• integer

What is the main difference between Insertion Sort and Selection Sort algorithms?

• Insertion Sort selects the smallest element from the unsorted portion and swaps it with the first unsorted element, while Selection Sort builds the final sorted array one item at a time by comparing each element with the rest of the array.

• Insertion Sort and Selection Sort algorithms have no differences in their approach to sorting elements.

• Insertion Sort and Selection Sort both select the smallest element from the unsorted portion and swap it with the first unsorted element.

• Insertion Sort builds the final sorted array one item at a time by comparing each element with the rest of the array, while Selection Sort selects the smallest element from the unsorted portion and swaps it with the first unsorted element.

Describe the process of linear search algorithm.

• The process of linear search involves iterating through each element in the list and comparing it with the target value until a match is found or the end of the list is reached.

• In linear search, the target value must be at the beginning of the list

• Linear search algorithm always starts searching from the middle of the list

• The process of linear search involves sorting the list before searching

Multiple Choice: Which of the following is a non-linear data structure? A) Array B) Linked List C) Tree D) Stack

• D) Stack

• B) Linked List

• A) Array

• C) Tree