University of Sargodha BS 3* Term Examination 2016 Subject: Computer Science Paper: Data Structure & Algorithms (CMP-3113) Time Allowed: 2:30 Flours Maximum Marks: 80 Objective part is compulsory. Attentistree questions from subjective part.
Discussion
Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.
No questions yet — be the first to ask.
More Discrete Structures papers
See all
Discrete Structures (URCO-5101/URCO-5102/URCO-5103)- Subject: CS/IT/SE UOS - ADP/BS 1st Semester Examination 2025
Uploaded 8 months ago
Download ↓
Discrete Structure BS-IT 3rd term (UOS) 2023.
Uploaded 1 year ago
Download ↓
Discrete Structure BS-IT part-2 2022 University Of Sargodha .
Uploaded 1 year ago
Download ↓
Discrete Structure 3rd term BS-IT PART-1 2022 (UOS) University Of Sargodha .
Uploaded 1 year ago
Download ↓
Discrete Structure 3rd term BS-IT University Of Sargodha 2021.
Uploaded 1 year ago
Download ↓
Discrete Structures MSC IT 2022 UOS
Uploaded 3 years ago
Download ↓
Paper text
University of Sargodha
BS 3* Term Examination 2016
Subject: Computer Science Paper: Data Structure & Algorithms (CMP-3113)
Time Allowed: 2:30 Flours
Maximum Marks: 80
Objective part is compulsory. Attentistree questions from subjective part.
ObjectivePart
(Compulsory)
Q
1. Attempt all questions each required in 2-3 lines having equal markeyS
tadni.com
(2*16)
What is data-structure?
iii:
What is an algorithm?
iv:
What are asymptotic notations?
What is divide and conquer approach.
V:
What is the post fix notation of (a +
b) * (c +
d)?
vi:
vii:
Define an Abstract Data Type (ADT)
What is the difference between a PUSH and a POP?
viii:
Why do we use queues?
ix:
List out the advantages of using a linked list.
x:
What are doubly linked lists?
xi:
What is recursion?
xii:
xiii:
What is a binary tree?
What is a graph?
Xiv:
What is hashing?
XV:
Which sorting algorithm is best if the list is already sorted? Why?
xvi:
What is max heap?
Subjective Part
(3*16)
Q
2. Write a programmer / algorithm to do the following.
(Find sum of element of array by using recursion.
Program / algorithm to POP a value in a stack.
0.3. What are circular queue? Write down salines algorilms for inserting and deleting elements
from a circular queue implemented using arrays.
@
4. What is a Binary Search Tree (BST)? Make a BST for the following sequetice of numbers.
45,32,90,34,68,72,15,24,30,66,11,50,10 JS
Traverse the tree in preorder, inorder and postorder.
Q
5. Write a programmer / algorithm to do the following operations
i. Delete a node at the end of single link list
ii. insert the first node in the circular link list
Q
6. Write an algorithm ofMerge sort method. Also apply merge sort on the following data.
10, 4, 5, 3, 100.30, 8265+20
. ustadni.com