Mumbai University, B.E in Computer Science, 4th Semester, Analysis of Algorithm and Design Papers

Advertisements

Paper Description:

Analysis of algorithm and design is one of the important papers of the computer Science engineering. The paper comprises of the study of various kinds of algorithm and designing a program for solving a problem. The subject includes logical and conceptual understanding of the computer based algorithms and programming structures. The subject deals with the study of the algorithms, loops, and other forms of the programming tools that are use in the computer programming languages.

Frequently Asked Questions:

The questions that are generally asked in this paper are about the computer programming language and its algorithm. Though straight programming is not asked, but everything that is used in a programming language is asked in the paper. The most prominent and often asked question of the paper is “what is algorithm, or what do you mean by algorithm?” This is one of the questions that get repeated almost every year. Apart from that questions from loops, differences in Loops, different types of algorithms, functions, are asked frequently every year.

Paper pattern:

The Mumbai University papers are generally of similar pattern. The total mark of the paper is 150; 25 for the oral examination and 25 for team effort and the theory paper is of 100 marks. The question paper has all together 7 questions. Every question is of 20 marks each. Candidates are asked to answer 5 questions from the given 7 questions. The 1st question is compulsory to answer. Remaining any 4 can be answered from the three sections of the paper. The questions are subdivided in to subparts. Every question touches is such that it relates to 2 or 3 modules of the syllabus. The first question has question from almost every part of the syllabus.

Time allotted:

The time duration allotted to the candidates for answering the question paper is 3 hours only.

Recommended Books:

Algorithm Design - Foundations, Analysis & Internet Examples by Michael T. Goodrich and Roberto Tamassia
Data Structures and Algorithms in Java by Michael T. Goodrich and Roberto Tamassia
Data Structures and Algorithms in C++ by Michael T. Goodrich, Roberto Tamassia and David M. Mount
Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein

Download Mumbai University, B.E in Computer Science, 4th Semester, Analysis of Algorithm and Design Papers

 
Advertisements







 

Do you have any question? Please ask:

Questions will be answered on our Forum section