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

Time Allowed: 2:30 hrs University of Sargodha M.Sc(IT), 4th Final Term Exam, 2015 Paper: Analysis of Algorithm (CS-610)

Time Allowed: 2:30 hrs University of Sargodha M.Sc(IT), 4th Final Term Exam, 2015 Paper: Analysis of Algorithm (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· 11 days ago

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

    0 replies Reply →
  • Abubakar· 11 days ago

    Literary criticism

    1 reply Reply →
  • Guest· 12 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

Time Allowed: 2:30 hrs

University of Sargodha

M.Sc(IT), 4th Final Term Exam, 2015

Paper: Analysis of Algorithm (CS-610)

Old Course

Max. Marks: 80

Objective Part (Compulsory)

Q.No.1. Write short answers of the following questions in 2-4 lines only. (16x2=32)

Define

Algorithm?

What is a cycle in a graph?

What is divide and conquer approach?

Define the term complexity of an algorithm?

Shortly describe the binary search?

What is meant by the term optimal solution?

% What is dynamic programming!

ustad! 1Q What is a complete binary search tree?

11-What will be the complexity of two N-tingS hested loops?

14. What is recursion?

15. Why do we use algorithms?

16. What do you know about A* searching algorithm?

Subjective Part

ustadni.com

Nore: Attempt any four questions.

(4x12=48)

Q.No.2. Discuss Quick sort with the help an example.

Q.No.3. Write a program to insert or delete item from a circular queue.

Q.No.4. What is time complexity? Discuss complexity of any two sorting algorithms.

Q.No.5. Apply binary search step by step with all passes on the following tree for finding

an item "Section 1.2.2".

Section 1.1

Section 1.2]

Section 2.1]

Section 2.2]

ustadni.com

Section 1.2.1

Section 1.2.2

Section 2.2.1]

Section 2.2.2

No.6. Given an aray A- (12, 11, 13,

5. 6) 6 it out using a technique illustrated in

insertion sort.

ustadni.com

visit website: ustadni.com