P2Pprogrammer 2 programmer

Home > Download > SMU - Question Paper > MCA > MC0082

Theory of Computer Science


This is the collection of Sikkim Manipal University (SMU) question and answers for Theory of Computer Science. It will help to prepare your examination. All question paper are classified as per semester, subject code and question type of Part A, Part B and Part C with multiple choice options as same as actual examination. SMU question papers includes year 2018, 2017, 2016 Sem I, II, III, IV, V, VI examinations of all subjects.

SMU question test set of old, last and previous year are updated regularly and it is absolutely free to use. Question paper includes Visual basic 6, VB.Net, C#, ASP.Net, Web, Oracle, Database, SQL, Software Engineering, C, C++, OOPS, MBA, MCA, BSC IT I have requested you kindly send me the question paper of Theory of Computer Science, SMU - Master of Computer Application.

Course Name        MCA (Master of Computer Application)

Subject Code       MC0082 (Theory of Computer Science)

Get Questions        PART - A    PART - B    PART - C

Theory of Computer Science Syllabus.

Part 1 Mathematical Preliminaries for Computer Science
Introduction; Sets and Cartesian product of sets; Functions and Relations; Equivalence Relations; Matrix Representations; Closure Relation:

Part 2 Recursive Functions, Strings and Growth Functions
Introduction; Recursive Functions; Integer Functions; Sequences and Strings; Growth Function:

Part 3 Methods of Proof
Introduction; Proof Techniques:

Part 4 Graphs and Binary Trees
Introduction; Definitions and Examples; Isomorphism; Trees; Rooted Tree:

Part 5 Formal Languages and Grammars
Introduction; Grammars and Languages; Classification of Grammars:

Part 6 Deterministic Finite Automata
Introduction; Basic Terms; Deterministic Finite Automaton (DFA); Transition System (Transition graph); Language accepted by a DFA:

Part 7 Non Deterministic Finite Automata
Introduction; Non-Deterministic Finite Automata; Language accepted by a NDFA; Conversion from NDFA to DFA; Moore and Mealy Machines:

Part 8 Further Problems on DFA and NDFA
Introduction; Problems on DFA; Problems on NDFA; Difference between DFA and NDFA

Part 9 Regular Expressions and Regular Languages
Regular expressions; Regular Expressions accepted by the Language; Finite Automaton from Regular Grammar; Regular Grammar from Finite Automata

Part 10 Properties of Regular Languages and Pumping Lemma
Introduction; Closure Properties of Regular Sets; Pumping Lemma; Applications of Pumping Lemma:

Part 11 Context Free Grammars
Introduction; CFG for various types of CFL; Derivations; Ambiguous Grammar:

Part 12 Mathematical Fundamentals for Computer Science
Introduction; Sets and Properties; Functions and Relations; Equivalence Relations ; Recursive Functions; Strings and Growth Functions:

Part 13 Proof Techniques
Introduction; Proof Techniques

Part 14 Trees and Binary Trees
Introduction; Graphs; Trees; Binary Trees; Walks and Paths; Directed Graphs:

Part 15 Grammar and Formal Languages
Introduction; Grammars and Languages; Types of Grammar:

Part 16 Deterministic Finite Automata (DFA)
Introduction; Basic Terms; Deterministic Finite Automata (DFA); Transition System (Transition graph); Language accepted by a DFA:

Part 17 Nondeterministic Finite Automata (NFA)
Introduction; Nondeterministic Finite Automata; Language accepted by a NFA; Construction from NFA to DFA; Moore and Mealy Machines:

Part 18 Regular Expressions and Regular Languages
Introduction; Regular expressions; Regular Expressions accepted by the Language; Finite Automata from Regular Grammar; Regular Grammar from Finite Automata:

Part 19 Regular Languages-Properties and Pumping Lemma
Introduction; Closure Properties of Regular Sets; Pumping Lemma; Applications of Pumping Lemma:

Part 20 Context Free Grammars
Introduction; CFG for various types of CFL; Derivations; Ambiguous Grammar:

Part 21 Pushdown Automata (PDA)
Introduction; Definition of PDA and Moves; Graphical Representation; Construction of Pushdown Automata; Deterministic and Non-deterministic PDA:

Part 11 Context Free Languages - Properties
Introduction; Pumping Lemma; Applications of Pumping Lemma for CFL; Closed Properties of CFL

Part 22 Turing Machines- Construction
Introduction; Turing Machine Model; Language Accepted by a Turing Machine; Design or Construction of a Turing Machine:
 


Home > Download > SMU - Question Paper > MCA > MC0082