CC104 – Data Structures and Algorithm

Examination

Name: _________________________________________ Date: __________________

Year Level: ________________________________ Course: ___________________

Fill in the blank:

Give the correct answer in the space provided.

1. It is used to model the real world through objects. ____________________________

2. It is a term that specifies the type of data that a variable may hold in the programming
language. ____________________________
3. It is nothing but a piece of information. _________________________
4. A combination of elements each of which is either a data type.
_____________________
5. It is a finite ordered collection of homogeneous data elements which provides direct
access (or random access) to any of its elements. _____________________
6. It is a data type where the operations are defined but the types of the items being
manipulated. ________________________
7. It is a collection of domain, operations, and axioms (or rules).
_____________________
8. The elements of Matrix are stored row-wise. _____________________
9.

_______________________________
10.

_____________________________
11.

_____________________________________
12. It is the most common and frequently used data object.
________________________
13. It is usually formed from the character set of the programming language.
________________________________
14. It is also used to return the value of the last recursive call as the value of the
function. ________________________
15. Changes the binary search algorithm slightly. ___________________________
16. Used to effectively overcome the problem associated with sequential files and to
speed up the key search. _________________________
17. is the operation of arranging the records of a table according to the key value of
each record. __________________________
18. Any sort algorithm that uses main memory exclusively during the sorting is called
_____________________________.
19. It is used in external sorting. __________________________
20. is said to be stable if at the end of the method, identical elements occur in the same
relative order as in the original unsorted set. ___________________________
21. Allows both rapid retrieval by key and inorder traversal.____________________
22. Any two nodes which are connected with an edge
are called _____________________.
23. A graph in which every edge is undirected is called ____________________.
24. Any graph which that contains parallel edges is called___________________.
25. A graph which has no parallel edges is called _________________________.
26. It is the one that is not allowed to update its structure once it is constructed.
______________________________
27. It is the one that changes during the access sequence.
________________________
28. When symbols are known in advance and no insertion and deletion is allowed, it is
called _____________________.
29. It is used when symbols are not known in advance but are inserted as they come
and deleted if not required. __________________________
30. Where the heights of the left and right subtrees of the root differ by utmost 1 and the
left and right subtrees called. _________________________
31. It is a discrete structure consisting of nodes (vertices) and the lines joining the
nodes (edges). ___________________
32. The graphs represented using a sequential representation using matrices is called
____________________.
33. Are lists where nodes may be shared among several other lists called
___________________.
34. It is a set of lists that contain one list for vertex. _________________________
35. It is a connected graph with no cycles. ______________________
36. It is the spanning tree of G whose edges sum to minimum weight.
___________________________
37. Represent elements and edges represent relationships. ______________________
38. It is the process of finding the presence of a particular string (pattern) in the given
string (text). ______________________
39. It is a finite sequence of symbols that are chosen from a set or alphabet.
_____________________
40. It is a subset of the symbols in a string where the order of elements is preserved.
_____________________________
41. Finds the occurrence of the pattern P in text T and returns the number of shifts
of P, after which the occurrence is found taking T, P, and prefix function p as inputs
called ___________________________.
42. Represents a set of strings (such as all the words in a text) known as tries.
_________________________
43. It is a tree-based data structure for storing strings to make pattern matching faster.
______________________
44. It is obtained from standard trie by compressing chains of redundant nodes.
______________________
45. It is a compressed Trie for all the suffixes of a text. _____________________

Essay:

As an IT student, Why is it important to learn the data structures and algorithm?