Welcome to www.programmer2programmer.net tips
for SMU Question Paper for MC0080 
 100% Tested Ready Academic IT Projects  BE, ME, BTech, BCA, MCA, MBA, BscIT, MS, BIT, ADIT, DOEACC, IGNOU, SMU  readymadeproject.com 




Free download of Sikkim Manipal University, SMU
previous year, last year, sample question paper for : [Analysis & Design of Algorithms] MC0080. Find question and answer for PartA 2 marks, PartB 4 Marks and PartC 8 marks.
Free download of question paper of previous year test.
Analysis & Design of Algorithms , MC0080 question paper includes multiple choice options and answer also. 


SMU >> MCA >> MC0080
Analysis & Design of Algorithms
This is the collection of
Sikkim Manipal University (SMU) question paper for MCA  Analysis & Design of Algorithms. It will help you
to prepare your examination. All questions are
classified as per question type like PART  A of 2 marks,
PART  B of 4 marks and PART  C of 8 marks same as actual examination. SMU question paper set which includes
year 2017, 2016, 2015
SMU question papers of Analysis & Design of Algorithms are updated
regularly and it is absolutely free to use. SMU Question
paper includes multiple choice question and answer as same
as real and original examination. It will help you to study and prepare
for your final SMU examination.

Sikkim Manipal University
SMU
Question Paper
Latest and Updated
FREE to Download
1. BCA 2. MCA 3. BSc IT 4. MSc IT 5. MBA
Get SMU Assignment


Course Name
MCA (Master of Computer Application)
Subject Code MC0080 (Analysis & Design of Algorithms)
Get Questions
PART  A
PART  B
PART  C
Analysis & Design of Algorithms Syllabus.
Part 1 Elementary Algorithms
Introduction; Notation for expressing algorithms; Role and Notation for
comments; Example of an Algorithm; Problems and Instances; Characteristics of an
Algorithm; Building Blocks of Algorithms; Procedure and Recursion; Recursion;
Outline of Algorithmics.
Part 2 Mathematical Functions & Notations
Introduction; Functions & Notations; Modular Arithmetic / Mod function;
Mathematical Expectation in average case analysis; Mathematical Expectation;
Concept of Efficiency of an Algorithm; Well known Asymptotic Functions &
Notations; The Notation; The Notation ; The Notation ; The Notation ;
Analysis of Algorithms – Simple Examples; Analysis of First – Averages; Well
known Sorting Algorithms; Divide and Conquer Technique; Recursive Constructs;
Average – Case and Amortized Analysis; Sorting in Linear Time; Medians and Order
Statistics.
Part 3 Elementary Data Structures
Introduction; Stacks and queues; Linked lists; Hash tables; Collision
resolution by chaining; Binary Search Trees; RedBlack Trees; Rotations;
Insertion; Augmenting Data Structures; Determining the rank of an element;
Maintaining subtree sizes; How to augment a data structure; DivideandConquer;
Integer Multiplication; Binary Search; Sorting; Quick Sort; Matrix
Multiplication; Splay tree; Zig Step
Part 4 B – Trees
Introduction; Properties of B – Trees; The height of a B – Tree; Binomial
trees; Binomial Heaps; Fibonacci Heaps; Data Structures for Disjoint Set
Part 5 Graph Algorithms
Introduction; NIM/Marienbad Game; Traversing Trees; DepthFirst Search;
BreadthFirst
Search; Best First Search & Minimax Principle; Topological Sort
Part 6 Dynamic Programming
Introduction; The Problem of Making Change; The Principle of Optimality;
Chained Matrix Multiplication; Matrix Multiplication using Dynamic Programming
Part 7 Greedy Techniques
Introduction; Some Examples; Formalization of Greedy Technique; Minimum
Spanning Tree; Prim‘s Algorithm; Kruskal‘s Algorithm; Djikstra‘s Algorithm
Part 8 Models for Executing Algorithms – : FA
Introduction; Regular Expressions; Regular Languages; Finite Automata
Part 9 Models for Executing Algorithms – II: PDFA & CFG
Introduction; Formal Language & Grammar; Chomsky Classification for Grammar;
Context Free Grammar (CFG); Pushdown Automata (PDA)
Part 10 Models for Executing Algorithms – III: TM
Introduction; Prelude to Formal Definition; Turing Machine: Formal
Definition and Examples; Instantaneous Description and Transition Diagrams; Some
Formal Definitions; Observations; Turing Machine as a Computer of Function
Part 11 Algorithmically Unsolvable Problems
Introduction; Decidable and Undecidable Problems; The Halting Problem;
Reduction to Another Undecidable Problem; Undecidability of Post Correspondence
Problem; Undecidable Problems for Context Free Languages; Other Undecidable
Problems
Part 12 Complexity of Algorithms
Introduction; Notations for the Growth Rates of Functions; Classification of
Problems; Reduction, NPComplete and NPHard Problems; Establishing
NPCompleteness of Problem


Get Questions
PART  A
PART  B
PART  C
Click here to get more question paper of MCA, BCA, BSC IT, MSC IT, MBA of SMU

