Quiz
CS 203 Sample Exam
Dieses Quiz enthält Fragetypen, die sich im gewohnten Player öffnen.
Fragen in diesem Quiz (29)
1Data(s) are?
- APieces of information stored in a computer and manipulated by programs.
- BOrganized representations that aim to show relationships among data items.
- COrganized list of data items where you can anytime take out and take in.
- DData that contains a pointer to an instance of itself
2When describing for (PSEUDOCODE) Process and Initialize, What keywords will you be needing?
- ADESCRIBE and INIT
- BPROMPT and SET
- CGET and CALCULATE
- DREAD and SET
3[blank_start]Data structures[blank_end] are organized representations that aim to show relationships among data items
- AData structures
4Which of the following statement is false?
- AArrays are dense lists and static data structure
- BPointers store the next data element of a list
- Cdata elements in linked list need not be stored in adjecent space in memory
- Dlinked lists are collection of the nodes that contain information part and next pointer
5A variable P is called pointer if?
- AP contains the address of an element in DATA.
- BP points to the address of first element in DATA
- CP can store only memory addresses
- DP contain the DATA and the address of DATA
6Two dimensional arrays are also called
- Atables arrays
- Bmatrix arrays
- CBoth Tables Arrays and Matrix Arrays
- Dnone of above
7_________ is a technique that solves a problem by solving a smaller problem of the same type
- AFor Loop
- BArray
- CRecursion
- DSorting
8Recursive Data Structure: a?
- AData structure that contains a pointer to an instance of itself
- BProcedure that calls itself
- CTechnique that solves a problem by solving a smaller problem of the same type
- DPieces of information stored in a computer and manipulated by programs.
9Declaring Pointer :
int _ Pointer;
what should go before the word Pointer?- A&
- B#
- C*
- DNone of the above
10[blank_start]Recursive call[blank_end] - must change at least one of the parameters and make progress towards the base case
- ARecursive call
11What kind of Sorting is this?
- AQuick Sort
- BMerge Sort
- CInsertion Sort
- DSelection Sort
- EBucket Sort
- FBubble Sort
12What kind of Sorting is this?
- ASelection Sort
- BQuick Sort
- CMerge Sort
- DInsertion Sort
- EBucket Sort
- FBubble Sort
13What kind of Sorting is this?
- AMerge Sort
- BSelection Sort
- CBucket Sort
- DBubble Sort
- EQuick Sort
- FInsertion Sort
14What kind of Sorting is this?
- ABubble Sort
- BInsertion
- CSelection Sort
- DBucket Sort
- EQuick Sort
- FMerge Sort
15What kind of Sorting is this?
- ASelection Sort
- BMerge Sort
- CInsertion
- DBucket Sort
- EBubble Sort
- FQuick Sort
16What kind of Sorting is this?
- ASelection Sort
- BBucket Sort
- CMerge Sort
- DInsertion
- EQuick SOrt
- FBubble Sort
17A [blank_start]pointer variable[blank_end] is a variable whose value is a memory address. Since this address
actually “points” to some memory location, it is referred to as a pointer.- Apointer variable
18First Circle : [blank_start]274[blank_end]
Second Circle : [blank_start]NULL[blank_end]
- A274
- BNULL
19First Circle : [blank_start]274[blank_end]
Second Circle : [blank_start]275[blank_end]
Third Circle : [blank_start]323[blank_end]
Fourth Circle : [blank_start]324[blank_end]
- A274
- B275
- C323
- D324
20 [blank_start]Running time[blank_end] of an algorithm is usually a function of the input size
- ARunning time
21Computing the Running Time of an Algorithm
o it is necessary to determine how many times a programming statement will be executed during
the entire duration of the program’s execution.
o This is what we will refer to as the frequency count. Then, we determine what type of primitive
operation will be performed.
o It can either be:
An [blank_start]assignment[blank_end] statement
A [blank_start]method[blank_end] call
A [blank_start]conditional[blank_end] statement
A [blank_start]iterative[blank_end] statement
A [blank_start]return[blank_end] from a method/procedure- Aassignment
- Bmethod
- Citerative
- Dreturn
- Econditional
22The running time will be described using the [blank_start]Big-Oh notation[blank_end].
- ABig-Oh notation
23There are various operations on pointers, like, [blank_start]deferencing[blank_end], [blank_start]assignment[blank_end], and [blank_start]comparison[blank_end].
- Adeferencing
- Bassignment
- Ccomparison
24Properties shared in general by algorithms :
o [blank_start]Input[blank_end] – instance values of problem to be solved
o [blank_start]Output[blank_end] – values produced that solves problem
o [blank_start]Definiteness[blank_end] – unambiguous - steps defined precisely
o [blank_start]Effectiveness[blank_end] – Each step performed exactly in finite amount of time
o [blank_start]Finiteness[blank_end] – output after finite number of steps – must terminate
o [blank_start]Correctness[blank_end] – correct output from input
o [blank_start]Generality[blank_end] – applicable to all instances of the problem- AInput
- BOutput
- CDefiniteness
- DEffectiveness
- EFiniteness
- FCorrectness
- GGenerality
25o When describing input, output, computations, etc, the following terms are often used:
[blank_start]Input[blank_end]: INPUT, READ, GET
[blank_start]Output[blank_end]: PRINT, DISPLAY, SHOW, PROMPT
[blank_start]Compute[blank_end]: COMPUTE, CALCULATE, DETERMINE
[blank_start]Initialize[blank_end]: SET, INIT
[blank_start]Add one[blank_end]: INCREMENT, BUMP
[blank_start]Decisions[blank_end]: TEST, IF/THEN/ELSE, WHILE/DO- AInput
- BOutput
- CCompute
- DInitialize
- EAdd one
- FDecisions
26First Circle :[blank_start]1471[blank_end]
Second Circle :[blank_start]1471[blank_end]
Third Circle : [blank_start]1641[blank_end]
Fourth Circle : [blank_start]1642[blank_end]
- A1471
- B1471
- C1641
- D1642
27 [blank_start]Insertion sort[blank_end] arranges data in order by “inserting” elements in its proper position.
- AInsertion sort
28[blank_start]Merge sort[blank_end] can work with nos. with of unlimited duplication and unspecified size.
- AMerge sort
29[blank_start]Quick sort[blank_end] is the most efficient sorting algorithm. It starts with choosing a partitioning element called the
pivot. The elements will be divided according to the pivot, one part contains elements that are less than
or equal to the pivot, the other part contains elements that are greater than the pivot.- AQuick sort
Informationen
- Beschreibung
- Sample
- Autor
- SITEAcads
- Sprache
- English
- Aufrufe
- 87
- Schlagwörter
- Bewertung
- Noch keine Bewertungen Bewerte dieses Quiz