(Attock VU Group) .........current papers of cs502.........

see attachment too..

1st
50% subjective from 1st half of book
50% objective from Huffman encoding
1. Heap sort Algorithm
2. Difference between Back edge and cross edge
3. Prim's Algorithm
4. Do go through k & Dont go through k at all
5. BFS pseudo code in graph
6. heapify
7. Prove that the generic TRAVERSE (S) marks every vertex in any connected graph exactly once and the set of edges (v, parent (v)) with parent (v) ¹F form a spanning tree of the graph.
8. Apply Kruskal's algorithms on the following graph.[You can show final result in exam software and need not to show all intermediate steps]. 
Thanx & Remember me in ur Prayers

====================================

2nd

Define the multitasking (2)
Define the protected mode (3)
What is disk driver and why disk driver are necessary in BIOS (5)
Writ the code of break point interrupt routine (5)
Define the trap flag (3)
From what purpose INT 1 is reserved (2)
Mcq are mostly in past papers

========================================

--

***Ya Allah! grant us good in this world and good in the hereafter,
and save us from the chastisement of the fire***

--
Group Basic Rules:
 
Immoral & Rudish talk, Earning program links, Cell number for friendship purpose, Websites/Groups Links, Adult contents, Spamming are strictly prohibited and banned in group.
 
 
Follow these detailed Group Rules, otherwise you will be banned at any time.
https://docs.google.com/document/d/1YJxA8x3_U7C1lRc0EXfLrJpco4A1XkB1vDxOTqOd3Jg/edit?hl=en&authkey=CNDy9tkJ
 
Group Email Address:
Attock-VU-Group@Googlegroups.Com
 
Join group by sending a blank email from University ID at:
Attock-VU-Group+Subscribe@Googlegroups.Com
 
 
Click here to Join this group at Facebook:
https://www.facebook.com/home.php?sk=group_111877855568034
 
 
Do not send Non-study-related Emails till the ending of Final Exam.