Monday, December 12, 2011
Monday, December 5, 2011
Fw: [KUDCS-MP-2011-BSCS-DAA] ATTENDANCE IN THE COURSE
--- On Thu, 12/1/11, Dr. S J Hussain <drsjhussain@yahoo.com> wrote:
|
Sunday, November 20, 2011
Friday, November 18, 2011
Wednesday, November 16, 2011
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> (- \> \> !
DAA PROPOSAL SUGGESTION
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.Sunday, November 13, 2011
NLP CoURSE OUTLINE
Topics:
1. CFG
2. Tokenization
2.1. Generic
2.2. Special Tokens
2.2.1. Named Entity Recognition
2.2.2. Word Normalization
3. String Searching
3.1. Abocrasik Algorithm
4. Parts of speech tagging.
4.1. Hidden Markov Model
5. Handling Morphological Variations
5.1. Algorithms
5.1.1. Stemming(Suffix striping)
5.1.2. Stochastic Algorithms
5.1.3. Bruteforce Algorithm
5.1.4. Lemitization
5.1.5. Hybrid Approaches
5.1.5.1. Suffix Tree Algo
5.1.5.2. Affix Statement
5.2. Measurement of stemming algorithm
5.2.1. Under
5.2.2. Over
6. Vector Spaces in NLP
6.1. Weighing Formula
6.2. Similarity
6.2.1. For Binary data
6.2.2. For Ordinal data
6.2.3. For Categorical data
6.2.4. For Quantitative data
6.3. SVD
6.3.1. Term Document Matrix
6.3.2. Truncated SVD
7. Speech to Text
8. Text To Speech
Dated 28-September-2011
Regards
Arsalan Shahid
Saturday, November 12, 2011
NEWS UPDATE
DATA STRUCTURE IMPROVEMENT STUFF
Data Structures Slides (4th semester)
https://skydrive.live.com/?cid=9b04b0976f30785b#!/?cid=9b04b0976f30785b&sc=documents&uc=1&id=9B04B0976F30785B%21109
Slidse also avialbe in BELOW box folder
Friday, November 4, 2011
Fw: [csku2008b] Fw: MIS Result [1 Attachment]
--- On Fri, 11/4/11, yawar abbas <syawara1@yahoo.com> wrote:
|
Tuesday, October 25, 2011
Fw: [csku2008b] Workshop on Android Development
--- On Sat, 10/22/11, Faraz Ahmad Khan <faraz_prodigy@yahoo.com> wrote:
|
Tuesday, October 11, 2011
Fw: [KUDCS-MP-2011-BSCS-DAA] New file uploaded to KUDCS-MP-2011-BSCS-DAA
--- On Sun, 10/9/11, KUDCS-MP-2011-BSCS-DAA@yahoogroups.com <KUDCS-MP-2011-BSCS-DAA@yahoogroups.com> wrote:
|
Fw: [csku2008b] Stanford Free Online Classes
--- On Tue, 10/11/11, Jawaid Gadiwala <jgadiwala@folio3.com> wrote:
|
Tuesday, October 4, 2011
MATLAB software
http://www.mathworks.com/products/matlab/tryit.html
MATLAB Complete software
http://www.mediafire.com/?kyniwifwki3
Wednesday, September 21, 2011
Graphics in Python
Struct types in Python
http://docs.python.org/library/types.html
support for user defined data types in python
Arrys in python
iterative loops in python
http://homepage.mac.com/s_lott/books/python/html/p01/p01c08_iterative.html
Friday, August 26, 2011
MULTIMEDIA E-BOOK
http://www.4shared.com/document/X0H1Q6UF/Fundamentals_of_Multimedia.html
MULTIMEDIA E-BOOK ALSO AVAILABLE IN UNIVERSITY2.tk
just go to ->Box->E-BOOK(folder)->8th Semster(folder) dOWnload n enjoy :)
Tuesday, August 9, 2011
Tuesday, June 14, 2011
NETWORKING EVENING PAPER
Paper consists of 3 sections:
section 1: (20 marks)
Q1: given 32 bit hex value, pass it through E/P table. E/P table was not given.
Q2: RSA algorithm. e = 7, p = 5, q = 11. Message in binary = (1000), find plain-text, cipher-text, d, z
Q3: Given 64 bit hex value, pass it through IP table, IP table was given.
section 2: (26 marks)
- configuration of pvlan with example.
- difference between MAC and one way. Hash value
- explain briefly working of ipsec AH and ESP in tunnel and transport mode. support AH in transport and tunnel mode.
- briefly explain the making of digital signature.
- differentiate the following.
- confusion and diffusion
- private key authority and private key certificate
- circuit level gateway and application level gateway firewall
(few more questions,,, i don't remember..)
section 3: (16 marks)
14 mcq's, 2 fill in the blanks
NOTE: Major part of the paper was from IPSEC.
Q no 1.
given input of binary number : 00001111101010100
32 bit in DEs passing from E/p table
Q no 1 a
input :11223344556677
in hexadecimail PASsing from PC-1 given TABLe !
Q no 2.
Digital signature ?? Explain
Q no. 3
RSA LAB Question , n=55 , p=5, q =11, E= 7
message M =(1000) in binary convert into Ciper txt
Q no 4,
difference b/w
Tunnel mode and transparent mode
Q
no 5.
difference b/w MAC and IPsec
Q no 6
breifly explain about
a.message authentication
tunnel mode
ipsec .
Qno 8
configure PVLAN of its step with example .
Q no 9
MCQ of 20 marks
protected ports . pvlan, MD5 ,RSA , IPSEC ,
