WorksheetsData Structures and Algorithms Quiz
Total questions: 14
Worksheet time: 7mins
What is the definition of data structure?
A representation of the logical relationship between individual elements of data
A way of organizing all data items without considering their relationships
A set of instructions to organize data
A method to execute a specific function
Which of the following is a primitive data structure?
Integer
Static
Tree
Graph
What is the purpose of an algorithm?
To solve a particular function through a step-by-step procedure
To analyze the correctness of data structures
To define the basic concepts of Big O notations
To organize data
What is the time complexity of an algorithm?
The amount of space required by the algorithm
The process of defining a formula for memory prediction
The process of determining the total time required for execution
The process of defining a formula for sorting data
Which of the following is an example of a non-primitive data structure?
Integer
Array
Character constants
Graph
What is the space complexity of an algorithm?
The process of defining a formula for sorting data
The process of determining the amount of space required
The process of defining a formula for memory prediction
The process of defining a formula for total time required
What is the main difference between primitive and non-primitive data structures?
Non-primitive data structures are built out of primitive data structures
Primitive data structures are built out of non-primitive data structures
Non-primitive data structures are directly operated upon by machine instructions
Primitive data structures are more sophisticated
What is the purpose of a recursive algorithm?
To define the basic concepts of Big O notations
To execute a specific function
To solve a particular function through a step-by-step procedure
To find the factorial of a given number
What is the complexity that computes the amount of time required by an algorithm?
Space complexity
Time complexity
Searching complexity
Sorting complexity
Which of the following is an example of a primitive data structure?
Tree
Graph
Stack
Integer
What is the purpose of proving the correctness of algorithms during the design phase?
To verify each part of a program as soon as it is developed
To ensure the program will always successfully complete
To prove that the correct output is produced if the program successfully completes
To reuse the proved models as much as possible
What is the main goal of developing an algorithm?
To analyze the correctness of data structures
To solve a particular function through a step-by-step procedure
To define the basic concepts of Big O notations
To organize data
What is the purpose of the initialization step in loop invariance?
To prove that the correct output is produced if the program successfully completes
To ensure the program will always successfully complete
To verify each part of a program as soon as it is developed
To ensure the loop invariant is true prior to the first iteration of the loop
What is the main purpose of the maintenance step in loop invariance?
To prove that the correct output is produced if the program successfully completes
To ensure the program will always successfully complete
To verify each part of a program as soon as it is developed
To maintain the loop invariant after each iteration of the loop
