XiV. Subject: IT Unty me of Sargodha 299.70

XiV.

Subject: IT

Unty me of Sargodha

299.70

MSs. 1" Semester/Term Exam 2021

Paper: Data Structure & Algorithm (CMP-3112)

Maximum Marks: 80

cotand Part

(Compulsory)

Define Data Structure?

i - What is a cycle in a graph?

TIL

What is ADT? List its benefits?

Write the different categories of strings?

What are pointers?

How do you understand hash tables?

vii

Define acyclic graph with an example?

What is circular queue? Why we use it?

How to find total number of nodes?

What is complete binary search tree?

What are tree traversals? How many traversals of binary tree are possible?

When we should not use sequential search?

What are different methods to represent a graph?

What is recursion?

What is adjacency list?

Define full binary tree?

(2*16)

Q.5.

0.6.

Vite a program to insert or delete tem from a circular queue.

Given an array A=(12, 11, 13, 5, 6). Sort it out using a technique illustrated in insertion sort.

Write a program to insert a value at specified location in a link list.

visit website: ustadni.com

12-