ACTS COMPUTER COLLEGE

P. Guevara Ave., Cor. A. Bonifacio St., Sta. Cruz, Laguna

www.actscc.edu.ph
Department of Computer Studies

PRELIM EXAMINATION
2IT-A-IT201-2CS-A-CS203-Data Structures and Algorithms
1st Semester A.Y. 2020-2021
TOTAL
Name : _Melvin Abenes________________________________
Date : _BSIT 2 A____________________________ 100
GENERAL INSTRUCTIONS:
1. Read all instructions carefully.
2. Your answers can be typed using word processing application or handwritten.Save your file as
DataStructuresandAlgorithmsPrelimExam_yourfullname.
3. Submit your exam on the Google drive provided to you.
4. One hour and 30 minutes are allocated to complete the exam, including the time spent in downloading of exam and uploading of
your answers.
5. Answer the exam intelligently.

Answer the questions intelligently.

1. Is a dictionary a simple or associative container? Is the ordering a linear ordering or a weak ordering? ANSWER: A
dictionary is associate container that is a linear ordering for its contains information that is releated other different
words and relations.
2. A spell checker in a program such as a word processor keeps a list of recognized spellings of known words. Is such a
collection kept as a simple or associative contain? ANSWER : - It is a simple container, it only checks the spellings of
words that goes against its list of spellings without any other process or any other relations.
3. A hash table that stores an associative array is sometimes described as a look-up table. For example, in C++, the
statemenT
ANSWER: To saved memory and time once it is needed it will fetch the data

Why would the preprocessor need a look-up table to store such definitions? ANSWER: Preprocessor replacement are done
on a textual basic.
4. Is every linear ordering of a finite number of objects a hierarchical ordering? Is every hierarchical ordering a partial
ordering? Answer: No. Because linear ordering is any relationship where any two objects x and y while hierarchical
orderings all relationships may appear very different and all exhibit the same properties, partial orderings has multiple
starting points and one class may have multiple prerequisites.
5. Describe the difference between an explicitly defined and an implicitly defined relation.ANSWER: implicity defined
relation arw done by other code running behind thenscenes while explicity defined relation arw manual approach to
change what you what by writing out the code yourself.
Prepared by: Reviewed/Approved by: Noted by:

DR. ADOREE A. RAMOS DR. ADOREE A. RAMOS PROF. RUBEN F. MACALINAO, MBA, MM
Faculty Head, Department of Business Management President/Director
6. Discuss the three classifications of memory allocation. ANSWER: Touching, in actual contact, next in space; meeting
at a common boundary, bordering, adjoining or connected throughout in an unbroken sequence.
7. Linked – Linked storage such as linked list associates two pieces of data with each item being stored.
8. Indexed - An array of pointers link to a sequence of allocated memory locations.Answer: i- not equal ii- equal iii- not
equal

9. Distinguish some variations of memory allocations such as Trees, Graphs,, Deques (linked arrays) and inodes
10. Which of the following are equal?

11.

Prepared by: Reviewed/Approved by: Noted by:

DR. ADOREE A. RAMOS DR. ADOREE A. RAMOS PROF. RUBEN F. MACALINAO, MBA, MM
Faculty Head, Department of Business Management President/Director