WorksheetsAlgorithm Fundamentals
Total questions: 10
Worksheet time: 5mins
What is the correct definition of an algorithm?
A. A non-terminating set of operations
B. A finite sequence of steps to solve a problem
C. A hardware method of storing data
D. A random process producing output
Which of the following is not a performance measure of an algorithm?
A. Time Complexity
B. Correctness
C. Space Complexity
D. Aesthetic Design
Linear data structures include:
A. Graph and Binary Tree
B. Trie and Heap
C. Array and Linked List
D. Sparse Matrix and AVL Tree
A matrix with mostly zero elements is known as a (a) matrix.
In column-major order, element (i, j) is stored:
A. Based on rows first
B. Based on columns first
C. Based on diagonal numbering
D. Based on polynomial hashing
What is the drawback of arrays
A. Unpredictable indexing
B. Requires contiguous memory
C. Cannot store characters
D. No support for iteration
Non-linear data structures include:
A. Array and Queue
B. Graph and Tree
C. String and Matrix
D. Stack and Queue
Which measure determines how much memory an algorithm requires?
A. Time Complexity
B. Correctness
C. Space Complexity
D. Scalability
Why is correctness an important algorithm measure?
A. Ensures minimum time
B. Ensures minimal memory
C. Ensures correct output for all valid inputs
D. Ensures good visual appearance
An algorithm is a (a) , step-by-step procedure to solve a problem.
