[go: up one dir, main page]
Scribd
Upload
72 views3 pages

Cit 237

The document contains a list of 30 questions related to programming concepts, algorithms, data structures, and software development methodologies. Each question presents multiple-choice answers, covering topics such as sorting algorithms, efficiency, and program development stages. The questions are designed for educational purposes, likely for a course in computer science or programming.

Uploaded by

Creed Kun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
72 views3 pages

Cit 237

The document contains a list of 30 questions related to programming concepts, algorithms, data structures, and software development methodologies. Each question presents multiple-choice answers, covering topics such as sorting algorithms, efficiency, and program development stages. The questions are designed for educational purposes, likely for a course in computer science or programming.

Uploaded by

Creed Kun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

CIT237 List of Questions

Latex formatted questions may not properly render

Q1 programme is a collection of logical declarations about what outcome a function should accomplish
Budget
event driven
logic
None of the above

Q2 ...is a means of organising related data items


Data
Integers
Data structure
Real Numbers

Q3 ...consist of positive and negative whole valves


Data
Integers
Real Numbers
Bytes

Q4 �?�. efficiency seeks to provide information on random input


Implementation
average-case
pointers
Sequencing

Q5 The path that starts and ends at the same vertex and passes through all the other vertices exactly once is called?
Knapsack problem
Bin packing
Hamiltonian circuit
Encapsulation

Q6 Which of the following options classifies problems according to their inherent difficulty?
Computational explicity
Computational polynomial
Computational Complexity
None is correct

Q7 What is another name for nondeterministic stage?


Verification
Detection
Guessing
Modification

Q8 Which of the following options is not a basic operation of an algorithms?


An assignment
A comparison between two variables
An arithmetic operation between two variables
A logical operators

Q9 Which of the following efficiency seeks to provide information on random input?


Average-case, ,
Best-case
Worst-case
Esimate-Case

Q10 Algorith's efficiency is investigated as a function of?


Output size parameter n
Input size parameter n
Options A and B
None is correct

Q11 �?��?��?��?�. Stages are involved in developing an efficient program.


Six
Nine
Twelve
Five

Q12 Partition-Exchange Sort is also known as?


Quicksort
Mergesort
Otions B and D
Binary

Q13 The following are the significance of sorting, except?


It is used as a part of many geometric algorithms
For finding the intersection of two or more sets
For finding duplicate values within a set
None of the options is correct

Q14 Which of the options divide its input's elements according to their position in the array?
Quicksort
Mergesort
Binary
All of the options

Q15 Which of the following sorting algorithms with a time complexity of O(n log(n)) even in the worst case?
Heapsort
Mergesort
Binary
Options A and B

Q16 Which of the options divide its input's elements according to their value?
Quicksort
Mergesort
Binary
All of the options

Q17 Divide-and-conquer paradigm consists of following major phases,except?


Breaking the problem into several sub-problems that are similar to the original problem but smaller in size
Solve the sub-problem recursively
Combine these solutions to subproblems to create a solution to the original problem.
None of the options is correct

Q18 The ideal sorting algorithm would have the following properties,except?
Stable
Operate in place
Adaptive
None of the options is correct

Q19 Which of the following algorithms works by recursively breaking down a problem into two or more sub-problems of the same
type?
Quicksort
Mergesort
divide and conquer
Binary

Q20 Which of the following sorting algorithms maintain the relative order of records with equal keys?
Quicksort
Stable
Mergesort
Unstable

Q21 Programs for use by institutions to manage their information systems are regarded as
Management Information System
Artificial Intelligence
Transaction Information Systems
Scientific Computing
Q22 programme is a collection of logical declarations about what outcome a function should accomplish
Budget
event driven
logic
None of the options

Q23 ...is a means of organising related data items


Data
Integers
Data structure
Real Numbers

Q24 ...is a data structure in which insertion and deletion can only be done at one end
Queue
Data structure
algorithms
Stack

Q25 ...is a finite sequence of unambiguous instructions


detector or a sensor
an assesor
an effector
an algorithm

Q26 ...is the result of the compilation process


Execution Stages
Source Code
Compilation
object code

Q27 This is the final stage of program development


Design
Coding
Problem Analysis
Documentation

Q28 The process for writing the program is called


Design
Coding
Problem Analysis
all of the above

Q29 This is where the clear statement of the problem is stated


Design
Coding
Problem Analysis
none of the options

Q30 These are various programming methodologies


procedural
logic
object-oriented
all of the options

You might also like