DATA STRUCTURE AND ALGORITHM
EXAM QUESTIONS & ANSWERS
Algorithm - Correct Answers -A computable set of steps to achieve a desired result.
Array - Correct Answers -In programming, a list of data values, all of the same type, any
element of which can be referenced by an expression consisting of the array name
followed by an indexing expression. Arrays are part of the fundamentals of data
structures, which, in turn, are a major fundamental of computer programming
Data Structure - Correct Answers -The term data structure refers to the way data is
organized for use within a program. Correct organization of data can lead to simpler and
more efficient algorithms. Common data structures are linked-lists, stacks, queues and
trees.
FIFO - Correct Answers -First in first out is a policy that items are processed in order of
arrival. A QUEUE implements this.
Linear Search - Correct Answers -A simple, though inefficient, search algorithm that
operates by sequentially examining each element in a list until the target element is
found or the last has been completely processed. Linear searches are primarily used
only with very short lists. Also called sequential search.
merge sort - Correct Answers -A sort algorithm that splits the items to be sorted into two
groups, recursively sorts each group, and merges them into a final, sorted sequence.
Node - Correct Answers -A unit of reference in a data structure. Also called a vertex in
graphs and trees. (2) A collection of information which must be kept at a single memory
location.
Insertion Sort - Correct Answers -Sort by repeatedly taking the next item and inserting it
into the final data structure in its proper order with respect to items already inserted.
LIFO - Correct Answers -Last in first out is a policy that the most recently arrived item is
processed first. A STACK implements this.
Linked List - Correct Answers -A data structure in which a list of nodes or elements of a
data structure connected by pointers. A singly linked list has one pointer in each node
pointing to the next node in the list; a doubly linked list has two pointers in each node
pointing to the next and previous nodes. In a circular list, the first and last nodes of the
list are linked together.
EXAM QUESTIONS & ANSWERS
Algorithm - Correct Answers -A computable set of steps to achieve a desired result.
Array - Correct Answers -In programming, a list of data values, all of the same type, any
element of which can be referenced by an expression consisting of the array name
followed by an indexing expression. Arrays are part of the fundamentals of data
structures, which, in turn, are a major fundamental of computer programming
Data Structure - Correct Answers -The term data structure refers to the way data is
organized for use within a program. Correct organization of data can lead to simpler and
more efficient algorithms. Common data structures are linked-lists, stacks, queues and
trees.
FIFO - Correct Answers -First in first out is a policy that items are processed in order of
arrival. A QUEUE implements this.
Linear Search - Correct Answers -A simple, though inefficient, search algorithm that
operates by sequentially examining each element in a list until the target element is
found or the last has been completely processed. Linear searches are primarily used
only with very short lists. Also called sequential search.
merge sort - Correct Answers -A sort algorithm that splits the items to be sorted into two
groups, recursively sorts each group, and merges them into a final, sorted sequence.
Node - Correct Answers -A unit of reference in a data structure. Also called a vertex in
graphs and trees. (2) A collection of information which must be kept at a single memory
location.
Insertion Sort - Correct Answers -Sort by repeatedly taking the next item and inserting it
into the final data structure in its proper order with respect to items already inserted.
LIFO - Correct Answers -Last in first out is a policy that the most recently arrived item is
processed first. A STACK implements this.
Linked List - Correct Answers -A data structure in which a list of nodes or elements of a
data structure connected by pointers. A singly linked list has one pointer in each node
pointing to the next node in the list; a doubly linked list has two pointers in each node
pointing to the next and previous nodes. In a circular list, the first and last nodes of the
list are linked together.
