DAA PROPOSAL NOTICE

UNIVERSITY OF KARACHI

DEPARTMENT OF COMPUTER SCIENCE

(MORNING PROGRAMME)

BACHELORS OF SCIENCE IN COMPUTER SCIENCE

SECOND SEMESTER 2011

BSCS-610 DESIGN AND ANALYSIS OF ALGORITHM

INVITATION OF PROPOSALS FOR THE FINAL PROJECT REPORT

As per policy of the course, as clearly mentioned in the course outline, it is mandatory for the students

to work on a relevant project and to prepare the academic report of the work done during the project

on individual basis in order to qualify the examination of the course. In this regard, the formal

proposals are invited from all the students registered in the course, on individual bases. The proposals

for the project must be prepared and submitted as per directions mentioned in the course outline .

The proposals should consist of: Preliminary objective (task); Problem definition and description;

Idea and theory behind the problem and its solution; Suggested solution/ method etc; Potential in the

desired work; Suggested plan for study.

Selection of the topic for the project is also a part of the project. Students are recommended to go

through various resources for this task.

The final project reports, individually worked out and submitted, should consist of: Main objective;

Exact problem definition; De tailed relevant analysis of the problem; Detailed background theory;

Higher-level detail design; Suggested solution/ methods/algorithms/methodologies etc; Software

system along with the input data and the output result/Pseudocode algorithm along with the dry

execution and the trace table, as the case may be (as and where applicable); Implementation/testing

strategy (as and where applicable); Results/findings/outcomes (as and where applicable) along with

the conclusions; Future work recommendations; Bibliographic references. The project reports

completed in all aspects must be submitted during the last week of the course, prior to the

commencement of the final examination. Individual defence of the report and oral examinations will

be conducted at the time of submitting the reports.

Following are some of the suggested topics that may be selected as the final project for the course.

However the students may decide to work on the project of their own choice as already mentioned

above (subject to the approval of the course incharge).

# Suggested Topics

1

Theory and solutions of Pyramidal Number Problem.

2

Various aspects of Travelling Salesman Problems.

3

Design, analysis, and improvements in Quicksort Algorithm.

4

Intelligent solution for the Knapsack Problem.

5

Intelligent solution for the Knight's Problem.

6

Intelligent solution for the Eight Queen's Problem.

7

Heuristic Solution to solve Travelling Salesman Problem.

8

Analysis and comparison of the various Routing Algorithms.

9

Optimised BSTrees and the implementation of the Huffman Coding Algorithm.

10

Implementation of Binary Heap and managing Heapsort Algorithm.

The proposals completed in all aspects as mentioned above must be submitted to the course supervisor

NOW!

Dr. Syed Jamal Hussain

--
 <\b>    (- \> \> !