CS 203 Sample Exam

Data(s) are?

When describing for (PSEUDOCODE) Process and Initialize, What keywords will you be needing?

[blank_start]Data structures[blank_end] are organized representations that aim to show relationships among data items

Which of the following statement is false?

A variable P is called pointer if?

Two dimensional arrays are also called

_________ is a technique that solves a problem by solving a smaller problem of the same type

Recursive Data Structure: a?

Declaring Pointer : int _ Pointer; what should go before the word Pointer?

[blank_start]Recursive call[blank_end] - must change at least one of the parameters and make progress towards the base case

What kind of Sorting is this?

What kind of Sorting is this?

What kind of Sorting is this?

What kind of Sorting is this?

What kind of Sorting is this?

What kind of Sorting is this?

A [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.

First Circle : [blank_start]274[blank_end] Second Circle : [blank_start]NULL[blank_end]

First 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]

 [blank_start]Running time[blank_end] of an algorithm is usually a function of the input size

Computing 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

The running time will be described using the [blank_start]Big-Oh notation[blank_end].

There are various operations on pointers, like, [blank_start]deferencing[blank_end], [blank_start]assignment[blank_end], and [blank_start]comparison[blank_end].

Properties 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

o 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

First 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]

[blank_start]Insertion sort[blank_end] arranges data in order by “inserting” elements in its proper position.

[blank_start]Merge sort[blank_end] can work with nos. with of unlimited duplication and unspecified size.

[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.