QUAID-E-AZAM COLLEGE RAJANPUR
MID-TERM EXAMINATION
ADP Computer Science 3rd SEMESTER SESSION (2023-25)
Student Name [Link]
Paper Data Structure and algorithm Total Marks 5
SECTION-A
(Marks: 5)
Note: All parts of this are to be answered on the question paper itself and attached with the answer book. Each
question carries 0.5 marks. Deleting/overwriting is not allowed. Do not use lead pencil.
Q.1 Choose the following correct options.
1- A collection of facts and figures is called?
(A) Information (B) Data (C) Data structure (D) none
2- A single unit of value in the data ?
(A) Datum (B) Record (C) Data item (D) Data unit
3- A single unit of information is called?
(A) Datum (B) Data item (C) Record (D) field
4- How many types are there types of sub algorithms?
(A) 2 (B) 3 (C) 5 (D) 5
5- Which of following is the type of algorithm?
Divide and
(A) Greedy (B) (C) Iterative (D) All
conquer
6- This loop is also called the counter loop?
(A) Do loop (B) For loop (C) Do while loop (D) Repeat for loop
7- Comment are given starting with?
(A) // (B) / (C) /* (D) %
8- Logical operation is ?
(A) AND (B) OR (C) NOT (D) NOR
9- Divide and conquer is type of?
(A) Algorithm (B) Stack (C) Flowchart (D) None
10- Dividing composite data items is?
(A) Merging (B) Splitting (C) Sorting (D) Updating
QUAID-E-AZAM COLLEGE RAJANPUR
MID-TERM EXAMINATION
ADP Computer Science 3rd SEMESTER SESSION (2023-25)
Student Name [Link]
Paper Data Structure and Algorithm Total Marks 20
SECTION-B
(Marks: 20)
Q.2 Answer the following short questions. (2 x 5 = 10)
Define data and information?
I-
Define data type?
II-
Differ B/W primitive and non primitive data type?
III-
Differ B/W linear and greedy algorithm?
IV-
Write something about divide and conquer algorithm?
V-
Q.3 Long Question. (2 x 5=10)
Define algorithm and also describe its characteristics?
I-
Define data structure and also describe operations on data structures?
II-
END
