Wednesday, November 30, 2011

.::VULMSIT::.eNoxel Fwd: CS502_My_Paper(30-11-2011)



---------- Forwarded message ----------
From: mc100402092 Muhammad Ishfaq <mc100402092@vu.edu.pk>
Date: Wed, Nov 30, 2011 at 5:53 PM
Subject: CS502_My_Paper(30-11-2011)
To: Muhammad Ishfaq <pak.nchd@gmail.com>


Shared By Muhammad Ishfaq
Today my CS502 Paper details of question.
MCQz were 50% from past papers and 50% were new and tough.
Subjective part was from the past papers except 1 (5 number) question Detail is.
•       How to Build heap?    (2 marks.)
•       Write down the steps of dynamic programming strategy.   (2 marks)
•       Two sorting algorithm having duplicate elements is such a way that
one of order nlogn and On^2   (3marks).
•       Write steps involved in  0/1 knapsack algorithm problem         (3-Marks)
•       Solve the recursion problem. (5marks.)
•       We are given an array of n elements of x1 , x2 ,x3 , ,,,,xn,
suggest best sorting algorithm of order On.  (5 marks).
=======================================
Plz suggest some joint study discussion for this subject after
mid-term so that we could share our knowledge to capture this devil.
(for that you can mail me at pak.nchd@gmail.com)



**
Best Wishes,*

".*..SUBHANALLAHI WABI HAMDIHI...SUBHANALLAH IL AZEEM..."
**Muhammd Ishfaq
MCS 3rd Semester (PakPattan)*

**



--

     

Phr Yaad-e-Khuda Se Ghafil Iss Duniya Ki Hawass Mein

Iss Mukhtasir Si Zindgi Ka Ik Aor Din Beet Gaya...!!!

                <<<<<<<<<< sAd pAncHi >>>>>>>>>>


--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.geniusweb.tk
 
http://itncs.tk
 
 
You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en

No comments:

Post a Comment