Data Structure and Algorithm BS 3 Semester/Term University Of Sargodha (UOS) 2021

University of Sargodha

BS 3r Semester/Term Exam 2021

Paper: Data Structures and Algorithm (CMPC-203)

Subject: I.T

Time Allowed: 02:30 Hours

Note: Objective part is compulsory. Attempt any three questions from subjective part.

Objective Part

(Compulsory)

Q.1.

Write short answers of the following in 2-3 lines cach on your answer sheet.

S

i.

ii.

ili.

iv.

V.

vi.

vii.

viii.

ix.

x.

xi.

xii.

Write the name of two non-linear data structure.

Which principles are used in stack and queue data structure?

Write the name of two sorting algorithms that use recursion.

What is meant by asymptotic notations?

Write the name of two graph traversing algorithms.

What do you mean by ADT?

Why parenthesis is not used in postfix notation?

Write name of non-linear data structure that uses priority queue.

Write the name of data structure that has no null pointer.

Declare the structure of node in doubly linked list.

Define Hashing.

What is necessary for binary search?

29394

Maximum Marks: 60

(2*12)

ustadni.com

Subjective Part

(3"12)

Q.2.

a) What is benefit of using linked implementation of nodes over an array?

b) Write a function in java that searches an element from an array using binary search iteratively.

Q.3.

Write a function in JAVA that is passed the reference of first node of doubly linked list and adds a

node as last node in doubly linked list.

Q.4.

Q.5.

What is hashing? Describe any two collision Resolution techniques.

Make a BST using following sequence of numbers and traverse it by using all types of traversal

algorithms.

45, 32, 90, 21, 78, 77, 81, 132, 90, 96, 25, 110, 36

Q.6. Write a program to add and delete an element from circular queue.

ustadni.com

ustadni.com

ustadni.com

Samed with Carelatter

ustadni.com