Set 1 Computer Science Algorithm and Data structure quiz

20 QuestionsMultiple ChoiceFree Practice

About this quiz

This Set 1 Computer Science Algorithm and Data structure quiz quiz contains 20 multiple choice questions designed to help you revise and test your computer science, Algorithm and data structure Quizzes knowledge. Select an answer for each question and click “Submit Answer” to see instant feedback. Take your time and try to score as high as possible!

Description

In this algorithm quiz, we would see that we follow a set of particular rules often, maybe when solving a quadratic equation, or when cooking, or when executing a particular task. These instructions that are aimed at disciplining oneself before the execution of a task are what we call Algorithms. Programmers use algorithms all the time to finish particular tasks. We are going to see terms like arrays, records, pointers, linked lists, stacks, queues, recursion, trees, sorting and searching, and learn all before the end of this quiz.

An algorithm is simply a set of finite instructions that aid you in the completion of a certain task. A typical example could be long division.

The data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values as well as the relationships among them, and the functions or operations that can be applied to the data. The type of data structures are,

  • Linear: arrays, lists.
  • Tree: binary, heaps, space partitioning etc.
  • Hash: distributed hash table, hash tree etc.
  • Graphs: decision, directed, acyclic etc.

More quizzes can be found here after you have seen as you answer questions on this quiz. More quizzes on Computer science can be found at Computer quizzes.

Nice time!!!

Progress0 / 20 answered
1

Question 1 of 20

Two main measures for the efficiency of an algorithm are 

2

Question 2 of 20

  The time factor when determining the efficiency of algorithm is measured by 

3

Question 3 of 20

  The space factors when determining the efficiency of algorithm is measured by 

4

Question 4 of 20

  Which of the following case does no exist in complexity theory 

5

Question 5 of 20

  The worst case occurs in linear search algorithm when 

6

Question 6 of 20

  The average case occurs in linear search algorithm 

7

Question 7 of 20

  The complexity of the average case of an algorithm is 

8

Question 8 of 20

  The complexity of linear search algorithm is 

9

Question 9 of 20

  The complexity of binary search algorithm is 

10

Question 10 of 20

  The complexity of Bubbles sort algorithm is 

11

Question 11 of 20

  The complexity of merge sort algorithm is 

12

Question 12 of 20

The indirect change of the values of a variable in one module by another module is called 

13

Question 13 of 20

  Which of the following data structure is not linear data structure? 

14

Question 14 of 20

  Which of the following data structure is linear data structure? 

15

Question 15 of 20

  The operation of processing each element in the list is known as 

16

Question 16 of 20

  Finding the location of the elements with a given value is 

17

Question 17 of 20

  Arrays are best data structures 

18

Question 18 of 20

  Linked list are best suited
 

19

Question 19 of 20

  Each array declaration need not give, implicitly or explicitly, the information about 

20

Question 20 of 20

  The element of an array are stored successively in memory cells because