CS502 Fall 2017 Final Term Papers Pattern & Questions 17 Feb 2018 to 28 Feb 2018 & Helping Material

[+M.Tariq Malik]

CS502 Fall 2017 Final Term Papers Pattern & Questions 17 Feb 2018 to 28 Feb 2018 & Helping Material

[+M.Tariq Malik]

Share Your Final Term Papers (Questions/Pattern) & Past Papers as well here to help each other. Thanks

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

 

Click Here For Detail.

&

 

.•°How to Download past papers from study groups°•.

 

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 

 

[1yznicaz0cevt]

can a person get at least 40 percent in finals by only consulting past papers of computer science courses ??

[+M.Tariq Malik]

Final term Solved Mooaz Past Papers

Final Term Solved Papers Mega Files link

Pas papers Solved final term By Waqar

Final Term Past papers Solved By Moaaz

Final term Solved Mooaz Past Papers

Final Term Solved Papers Mega Files link

Pas papers Solved final term By Waqar

Solved Pas papers Mid Term by Waqar Siddhu

Final Term Past papers Solved By Moaaz

Past papers Solved mid term by Students Random Folder

moaaz mid term Solved

[+M.Tariq Malik]

Cs502 final term paper.
Pattern is not changed. 40 mcqs 5 questions contains 3 marks 5 questions contains 5 marks.
Mcqs 20% comes from past papers. Mostly are from types of MTS algorithms.
Subjective questions are:
1: which approach is used in Huffman coding to generate prefix code? 
2: define forward edge and cross edge. 
3: aik question tha fbnoci series k about.
4: what is running time of kruskl's algorithm.
5: floyd algorithm ka running time btana tha given graph dkh k.
6: scenario given tha btana tha konsi algorithm technique use kren gy.
7: apply partitioning algorithm on given array
8: create minimum Spaning tree as u want with ur oun choice algorithm technique.
9: create adgency matrix of given shape.
10: define E-cycle and H-cycle.

[+M.Tariq Malik]

Today Cs502 paper. 2018
Only 2 mcqs by moaz Nd others files. Nd questions are as under. 
1. Create.(u), find (u), union (u,v)
2 topology Nd example.
3. Reduction Nd example.
4. Essential of algorithm.
I remembered only above said questions. 
Beat of luck please focus on short question also as mcqs.....

[+M.Tariq Malik]

Here is my today's CS502 paper 

MCQs were very conceptual and only 3 MCQs were from past

Subjective part is as under:

3 marks questions 

1. By what techniques we can manipulate graph in computer only write their names

2. Matrix was given show the running time of Floyd Warshal algorithm

3. what is a graph??

4. Where the divide and conquer came from and why is is called divide and conquer

5. Define create.set (u)
Find.set(u)
Union.set(v,u)

5-Marks questions 

1. Write 3solutions path for word MATHs and ARTS

2. How topology sort works?

3. Suppose u could reduce Np complete to a polynomial in a polynomial time what would be the consequence??

4. Five characteristics of Free trees

5. Which technique uses prefix code?? why??

[Sierra]

Asalam Alikum. I gave CS 502 paper today and 80% of subjective as well as objective was from the data present at the link that I am attaching. (These are past papers solved by Waqar Sindhu)

https://www.dropbox.com/sh/umq35651laqsf68/AAD2i-yWmeIHBd9BUaELBYmj...

Remember in prayers

[Muhammad Yousaf]

Asalam Alikum

I have given up CS-502 paper today (08:00 AM)

@Sierra your feedback is 100% correct and thanks for sharing link (Past papers)

[Sierra]

Walikum Asalam and welcome brother.

[Ali Raza]

90% mcqs and 70% Subjective from the link you shared.

[Dildar Hussain]

Almost all the mcqs are from above link and my subjective is here

1) NP-reduction(5m)

2) Adjacency  list is give and make the graph (5m) old pprs

3) define Hamiltonian and Eulerian cycle (5m) old papers

4) what is merge sort make the tree for n=31 (5m)

5) make MST graph is given (5m) old papers

6) Define graph traversal (3m) old pprs

7) What is chain matrix multiplication (3m)

8) how we find short path by using bell ford (3m)

9) What is the complexity of Prim's Alogoritham (3m)

10) what is the correctness for activity selecttion (3m)

see the above link for preparation