CvLTAELG1AAv7GMjp8RSaPGsvS8 CS502-Old Papers |
Wednesday , 21 March 2018
Virtual University New old assignments, papers, GDB, Quizzez
Newest Assignments
You are here: Home - CS502 - CS502-Old Papers

Category Archives: CS502-Old Papers

CS502 Solved Mid Term Paper by Arslan Ali

Question No: 1    ( Marks: 1 )    – Please choose one  Random access machine or RAM is a/an ► Machine build by Al-Khwarizmi ► Mechanical machine ► Electronics machine        ► Mathematical model Question No: 2    ( Marks: 1 )    – Please choose one  _______________ is a graphical representation of an algorithm ►  notation ► notation        ► Flowchart ► ... Read More »

CS502 Solved Subjective for Mid Term Papers

How we build heap We build a max heap out of the given array of numbers A[1..n]. We repeatedly extract the maximum item from the heap. Once the max item is removed, we are left with a hole at the root.  Write Pseudo code for KNAPSACK algorithm? Solution: KNAPSACK (n, W) 1 for w=0,W 2 do V[0,w]ß0 3 for i=0,n ... Read More »

CS502 latest Solved MCQs Mega Collection for mid term papers

How much time merge sort takes for an array of numbers? Select correct option: T(n^2) T(n) T( log n) T(n log n)   For the heap sort we store the tree nodes in Select correct option: level-order traversal in-order traversal pre-order traversal post-order traversal   Sorting is one of the few problems where provable ________ bonds exits on how fast ... Read More »

CS502 Solved MCQs Mega Collection for Mid term Papers

25. Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________ n items    phases pointers constant 26. A (an) _________ is a left-complete binary tree that conforms to the heap order heap                                 binary ... Read More »