Home /UOS — University of Sargodha /Main Campus /Design and Analysis Algorithm

Design and Analysis Algorithm BSCS/MS Information Technology/MSc Information Technology UOS — University of Sargodha 2015

Design and Analysis Algorithm BSCS/MS Information Technology/MSc Information Technology UOS — University of Sargodha 2015 — 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· 5 days ago

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

    0 replies Reply →
  • Abubakar· 5 days ago

    Literary criticism

    1 reply Reply →
  • Guest· 5 days ago

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

    1 reply Reply →
  • Annie· 6 days ago

    Can you please tell me more past papers please because my exams are starting from next week

    1 reply Reply →
  • Ahmed· 10 days ago

    Did you provide the past papers of the science of society uos?

    1 reply Reply →

More Design and Analysis Algorithm papers

See all

Paper text

University of Sargodha

Department of Computer Science & Information Technology

Subjeet: Design & Analysis of Algorithms

Time: 120 Minutes

Đưnc thrustan nis

Paper: Final Term

Class: BSCS 5 R & S

Marks: 60

ustani.pk

ustani.pk-

Thiversity chowk has a lot of traffic flow. Det se minimum number of lighting grouns required

to smoothly and efficiently execute the traffle. All the roads are two way. Solve the problem

using Greedy approach.

[10]

Daewoo Chowk

Khayyam Chowk

What is don

University

at is its sigmieance in ung clesters? Also explain the role played by CP

[1O]

FTOI

- A forest is a grap, walose comporent are trous. Draw ll dife forgiving o nudes (toy

~ 5- Find longest common subsequence between MIJAWXU & XMIYAUZ.

1101 5

6- Find Fib7) using Divide and Conquer strategy. Also find Fib(7) using Dynamic programming

Note that Fib(1) 1 & Fib(2)

2.

visit website: ustani.pk