Home /UOS — University of Sargodha /Main Campus /Advance Analysis of Algorithms

Paper: University of Sargodha M. Sc. I. T, 4" Term Exam 2015. Analysis of Algorithms (CS: 610)

Paper: University of Sargodha M. Sc. I. T, 4" Term Exam 2015. Analysis of Algorithms (CS: 610) — page 1

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

Your email is only used to send you replies and occasional Ustadni updates. It is never shown publicly.

Log in to post under your name

No questions yet — be the first to ask.

Need Paper? See all →

Need a paper or stuck on a question? Ask here — students reply and you get an email.

Ask about a paper
  • Ayesha Mustafa· 10 days ago

    BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025

    0 replies Reply →
  • Abubakar· 10 days ago

    Literary criticism

    1 reply Reply →
  • Guest· 11 days ago

    this paper consists of 60 marks but now we have 35 marks paper.

    1 reply Reply →
  • saira khalid· 1 month ago

    air past paper nhi h

    1 reply Reply →
Ad

Paper text

Paper:

University of Sargodha

M. Sc. I. T, 4" Term Exam 2015.

Analysis of Algorithms (CS: 610)

Time Allowed: 2:30 Hour

Maximum Marks: 80

OBJECTIVE PART (COMPULSORY)

1.

16 Short questions each requiring answer in 2-3 lines only having 2 marks each. (32 Marks)

A. What is constant time?

B.- What is average case efficiency?

C. / What is recursion?

D. - What is time complexity?

E. What is cluster graph?

F.- How non deterministic computer solves problem?

G. - What is worst case efficiency?

H.~ Explain binary search.

Mbat is Big O notation?

What is collision in hashing? chen it wad

L. < What is asymptotic complexity?

M. - What is optimal solution?

).- Why we use alporithms? 1

P. ~ What is chaining?

ustadni.com

SUBJECTIVE PART

Attempt three out of five questions. (3 ×

16)

2/ Explain quick sort with help an example.

3. What is difference between sparse and dense matrix. Also explain suitable data structure for each

one.

4. Store the following data in a Hash Table of size

16. Use linear probing for collision resolution.

2, 5, 7, 25, 15, 10, 20, 30, 17, 13

5/Explain dynamic programming with help of an exampreM

6. Explain any string matching algorithm with help of an example.

ustadni.com

ustadni.com

ustadni.com

visit website: ustadni.com