GAGE COLLEGE UNDERGRADUATE PROGRAM
ASSIGNMEN ON DATASTRUCTURE AND ALGORITHM ANALYSIS
(CSC 315)
Date: ________________ E.C.
Total Weight:- 20%
GENERAL DIRECTIONS
1. This is a group assignment that has 3 up to 5 members of each group (but not allowed
for less than three members).
2. Since it is a group assignment, all members should participate actively.
3. Read the instructions carefully and do accordingly.
4. Submission deadline will decide by the instructor.
5. The assignment should submit with a hard copy.
6. All students should collect the assignment at [Link]
by follow the login steps.
7. Use of pencils and red pens are not allowed.
8. For further activities or questions each student can communicate the instructor
through email or telegram and other communication media.
9. Write your answers on the space provided at the end of all questions /or on a
separate sheet of paper/.
Good Luck !!!
RYTHM: Raise yourself To Help Mankind !!!
1|Page
GAGE COLLEGE DEP’T OF COMPUTER SCIENCE ASSIGNMENT ON DATA
STRUCTURE AND ALGORITHM ANALYSIS
Direction I:- If the statement is correct Write TRUE, else write FALSE (2 pt each)
_________1.An algorithm is a sequence of computational steps that transform the input into the output.
_________2. Data Structure is clearly specified set of simple instructions to be followed to solve a problem.
_________3. Performance of a program is the amount of computer memory and time needed to run a
program.
_________4. If T(n)=3n4+3n-3, it is said to be order or category of the algorithm is n3.
Direction II:- Choose the correct answer from the given alternatives(2 pt each)
_______1. An Algorithmmust have a unique defined proceeding and succeeding stepsmean____.
A) Finiteness
B) Definiteness
C) Sequence
D) Correctness
_______2Algorithm must be possible to perform each instruction..
A) Feasibility:
B) Definiteness:
C) Effectiveness:
D) Completeness:
_______3. In Searching algorithms if the target matches with the element that is in the first position of the
List then we can say thatit is
A) Best case
B) Worst case
C) Average case
D) None
2|Page
Direction III:- Match(1 pt each)
Column A Column B
1. Dynamic memory allocation A. First In First Out
2. Pointer B. A special variable that holds a memory
3. Stack address
4. Queue C. Memory blocks are allocated and remains
5. Static memory allocation reserved till the program is halted
6. Nonlinear data structure D. Tree and graph
E. Class and structure
F. Memory can be allocated and de-allocated
at run time
G. Last In First Out
3|Page