CIT237
A representation of an algorithm in a computer programming language is called
Answer: program
Data types are of form
Answer: composite
Relation defining a function by means of an expression that includes one or more instances of itself is known to be relation
Answer: recurrence
The rate at which cost of algorithm grows as size of its input grows is called its
Answer: growth rate
A growth rate of n, is known as
Answer: â â linear
An Algorithm that starts at the first position to search an array and looks at each value in turn until an item is found is called
Answer: sequential
A collection of elements having specific order is called
Answer: sequence
ADT stands for
Answer: abstract data type
sorting algorithms has the lowest worst case complexity?
Answer: merge sort
Files and directories of graphical user interface of operating system programs are known as:
Answer: folders
Errors in computer programs are called
Answer: bugs
sorting algorithm needs the minimum number of swaps
Answer: selection sort
A data structure requires a certain amount of space for each
Answer: data process
ADT is of form data type
Answer: logical
The process of finding errors and fixing them within a program is called
Answer: debugging
Removal of errors is simpler in
Answer: interpreters
is the last step in solving the problem
Answer: evaluate the solution
solution requires reasoning built on knowledge and experience
Answer: heuristic
The correctness and appropriateness of solution can be checked very easily.
Answer: algorithmic
Follow me on Twitter @louisoladimeji for your Free Exam Summary and free past questions
Whatsapp: 08039407882 for your Project Writeup I Business Plan Writeup I Online Tutorial
 | Virus-free. www.avg.com |
