SMU B.SC IT Fundamentals of Algorithms MCQ Question Paper

SMU B.SC IT 2nd year Paper 2013 Fundamentals of Algorithms Sikkim Manipal University Exam 2013 1st SEM Fundamentals of Algorithms Test Question Paper Free Download Sikkim Manipal University Fundamentals of Algorithms Multiple Choice Question Papers 2013 SMU B.SC IT 4th SEM Question Paper 2013 for all students Previous Year old Past Papers of SMU MCQ B.SC IT SEM VI Paper 2013 Fundamentals of Algorithms Sikkim Manipal University Exam B.SC IT 3rd SEM year Sample Model Question Papers Free Download PDF

SMU B.SC IT Semester I Model | Sample | Mock Test Question Paper for 2013 Exam, This SMU B.SC IT Fundamentals of Algorithms Semester II Question are based on the Sikkim Manipal University B.SC IT exam syllabus. Free download pdf SMU B.SC IT Fundamentals of Algorithms Semester III Question Bank with solution SMU B.SC IT Fundamentals of Algorithms SEM IV exam 2013 Books and Study Materials are here all these SMU B.SC IT SEM V question bank and Books is free downloadable,

Fundamentals of Algorithms

Full Marks: 140                                                                                                                                                           Time:

1. A process is a ______________ actually being carried out to solve a problem.
a. Sequence of activities
b. Step-by step procedure
c. Flow of information
d. Both b and c

2. The concept of logarithm is defined indirectly by the definition of _______________.                                                                                                                        a. Exponential                                                                                                                                                                                                                                                    b. Floor Function                                                                                                                                                                                                                                               c. Ceiling function                                                                                                                                                                                                                                            d. Monotonically increasing function

3. Merge sort is an example of
a. Divide and conquer
b. decrease and conquer
c. space and time tradeoff                                                                                                                                                                                                                             d. greedy method

Download Full SMU B.SC. IT Fundamentals of Algorithms MCQ Question Paper With Answer Key.

 

Similar Pages …………….


Click Here to Comment


Submit your review

Updated: June 17, 2013 — 2:13 pm
CbseSamplePapers.org © 2013