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

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

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

CS502 ALL Current Mid Term Papers Fall 2014 & Past Mid Term Papers at One Place from 10 January 2015 to 25 January 2015

CS502 ALL Current Mid Term Papers Fall 2014 & Past Mid Term Papers at One Place from 10 January 2015 to 25 January 2015

 

You Can Download Solved Mid Term Papers, Short Notes, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quizzes , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2014

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.

You Can download papers by a simple click on file. All the uploaded filed are in Zip file or PDF format So Install Adobe Reader and Winrar Software’s to open these Files

Note: If you download files with Internet Download Manager (IDM), you would face problem of damage files. All files are correct and no damage file, If you face this problem, Open IDM > Click on Options > Click on File Types > Remove PDF and ZIP from files types and save. After it download again files, files will work properly.OR Press alt+click the file ...

Thanks and Regards,

VU Students.ning Social Network.

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 6683

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

JAZAK ALLAH

Currnet Mid Term Papers of CS502 Fundamentals of Algorithms Spring 2015(All in one Discussion)



MIDTERM EXAMINATION 
 2015
CS502- Fundamentals of Algorithms 
Time: 60 min 
Marks: 38




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
► tation
► Flowchart
► Asymptotic notation

Question No: 3 ( Marks: 1 ) - Please choose one
A RAM is an idealized machine with ______________ random-access memory.
► 256MB
► 512MB
► an infinitely large
► 100GB

Question No: 4 ( Marks: 1 ) - Please choose one
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
► Algebraic and logic
► Geometric and arithmetic
► Arithmetic and logic
► Parallel and recursive

Question No: 5 ( Marks: 1 ) - Please choose one
 What will be the total number of max comparisons if we run brute-force maxima algorithm with n elements?



Question No: 6 ( Marks: 1 ) - Please choose one
What is the solution to the recurrence T(n) =T(n/2)+n .
► O(logn)
► O(n)
► O(nlogn)
► O(n2)

Question No: 7 ( Marks: 1 ) - Please choose one
Consider the following code:
For(j=1; j<n;j++)
For(k=1; k<15;k++)
For(l=5; l<n; l++)
{
Do_something_constant();
}
What is the order of execution for this code.
► O(n)
► O(n3)
► O(n2 log n)
► O(n2)

Question No: 8 ( Marks: 1 ) - Please choose one
 Consider the following Algorithm:
Factorial (n){
if (n=1)
return 1
else
return (n * Factorial(n-1))

}
Recurrence for the following algorithm is:
► T(n) = T(n-1) +1
► T(n) = nT(n-1) +1
► T(n)= T(n-1) +n
► T(n)=T(n(n-1)) +1

Question No: 9 ( Marks: 1 ) - Please choose one
 What is the total time to heapify?
► Ο(log n)
► Ο(n log n)
► Ο(n2 log n)
► Ο(log2 n)

Question No: 10 ( Marks: 1 ) - Please choose one
When we call heapify then at each level the comparison performed takes time
► It will take Θ (1)
► Time will vary according to the nature of input data
► It can not be predicted
► It will take Θ (log n)

Question No: 11 ( Marks: 1 ) - Please choose one
 In Quick sort, we don’t have the control over the sizes of recursive calls
► True
► False
► Less information to decide
► Either true or false

Question No: 12 ( Marks: 1 ) - Please choose one
Is it possible to sort without making comparisons?
► Yes
► No

Question No: 13 ( Marks: 1 ) - Please choose one
 If there are Θ (n2) entries in edit distance matrix then the total running time is
► Θ (1)
► Θ (n2)
► Θ (n)
► Θ (n log n)

Question No: 14 ( Marks: 1 ) - Please choose one
 For Chain Matrix Multiplication we can not use divide and conquer approach because,
► We do not know the optimum k
► We use divide and conquer for sorting only
► We can easily perform it in linear time
► Size of data is not given

Question No: 15 ( Marks: 1 ) - Please choose one
 The Knapsack problem belongs to the domain of _______________ problems.
► Optimization
► NP Complete
► Linear Solution
► Sorting


Question No: 16 ( Marks: 1 ) - Please choose one
 Suppose we have three items as shown in the following table, and suppose the capacity of the knapsack is 50 i.e. W = 50.
Item Value Weight
1 60 10
2 100 20
3 120 30
The optimal solution is to pick
► Items 1 and 2
► Items 1 and 3
► Items 2 and 3
► None of these

Question No: 17 ( Marks: 2 ) 
Describe an efficient algorithm to find the medianof a set of 106 integers; it is known that there are fewer than 100 distinct integers in the set





Question No: 18 ( Marks: 2 ) 
How we can avoid unnecessary repetitions for recursive calls?




Question No: 19 ( Marks: 2 ) 
Draw the cost table for chain matrix multiplication problem with initial state.






Question No: 20 ( Marks: 3 ) 
Solve it,







Question No: 21 ( Marks: 3 ) 
What are Catalan numbers? Give the formula.

Question No: 22 ( Marks: 5 ) 





Question No: 23 ( Marks: 5 ) 
Write the pseudo code for 0/1 knapsack algorithm developed using dynamic programming technique.

plzzz in kay ans bhi koi post kar day plzz jaldi

+MaLiKa thanks for sharing 

 Gud luck

My Today paper

Attachments:

MY TODAY'S PAPER

CS502

DATED 13-1-15

 

 

  • 70% mcqs were from moaaz file

 

Subjective 

 

  1. Consider the case of three matrices. A1 is 5x4, A2 is 4x6 and A3 is 6x2. If multiplication ((A1 A2)A3) is carried out, find its cost.
  2. Describe worst case and average run time.                 (2 marks)
  3. In quick sort, which step of divide and conquer is not explicit and which has main processing.
  4. Cost table for chain matrices was given. Which cells are to be filled after first iteration? Specify those cells with question mark (i.e ?).                  (3 marks)
  5. Write pseudo code Fibonacci sequence with memoization algorithm.     (5 marks)
  6. Write pseudo code for 0/1 knap sack algorithm developed using dynamic programming techniques.                                (5 marks)

MUHAMMAD SHAKEEL thanks for sharing 

Attention Students: You don’t need to go any other site for current papers pattern & questions. Because all sharing data related to current Mid term papers of our members are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links. Just keep visiting http://vustudents.ning.com/ for all latest updates.

RSS

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.