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

We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search Here

# CS502 Mid Term Papers Fall 2017 December 9, 2017 to December 20, 2017 & Past Papers

CS502 Mid Term Papers Fall 2017 December 9, 2017 to December 20, 2017 & Past Papers

Views: 1490

### Replies to This Discussion

Share Your Current mid 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.

&

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

#### CS502 - MidTerm 2013 By Dr Tariq Hanif

thank you sir g

CS502-Midterm by Waqar Siddhu

Attachments:

Rio Leo thanks for sharing.. keep it up

CS502 Solved Past Mid Term Papers link

CS502

CS502 Solved mid Term Papers & MCQs

CS502 today paper 11/12/207
18 MCQ's kuch moazz file sa thy or kuch waqar sidhu file sa
Q.1 given statement is sorrect or not? if correct the explain that" the computational power of RAM (Random access machine) is less than parallel machine? 3 marks
Q.2 What is necessary assumption for average-case analysis of Quick sort? 3 marks
Q.3 Describe three solution path for edit distance of these two given.
1. MATH
2. ARTS
Q.4 Complete the following algorithm: 5 marks
HEAPIFY( array A, int i, int m)
1 l LEFT(i)
2 r RIGHT(i)
3 max i
4 if (l _ m)and(A[l] > A[max])
5………………………
6………………………
7……………………….
8…………………………
9…………………………
10………………………
Best of luck

Cs502 ka papr ALHAMDULLALIHA acha howa
Basic steps of divide and conquer
how we use edit distance in molecular biology
Merge sort ..... running time of quick sort
Mcq's mostly past papr sy thy

Solved mid term by moazz

Attachments:

## Forum Categorizes

Job's & Careers (Latest Jobs)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

::::::::::: More Categorizes :::::::::::

## Latest Activity

48 minutes ago
+þµñjåßï jµTT❤ updated their profile
1 hour ago
kashif posted a discussion

### FRT (FINAL REPORT Template)

1 hour ago
Haris Sid and wajihaakram are now friends
2 hours ago
wajihaakram and ZY are now friends
2 hours ago
2 hours ago
2 hours ago
2 hours ago

Lahore, Pakistan