Welcome to www.programmer2programmer.net tips for SMU Question Paper for MC0082

programmer2programmer.net

 Tips
 Microsoft Certification
 Final Year Project Idea
 Connection Strings
 Password Recovery
 SQL Injection
 Encryption & Decryption
  
 LIVE Academic Project
 Project #1 - VB6, Access
  Project #2 - VB.Net, SQL
 Project #3 - ASP, Access
 Project #4 - ASP.NET, C#
 Project #5 - VB6, SQL
 Project #6 - Stegano
 Project #7 - C
 Project #8 - C++
 Project #9 - JAVA, MySQL
 Project #10- PHP, MySQL
 Project #11- JSP, Oracle
 Project #12- C# Face Exp
 Project #13- Mobile Bank
 Download MBA Project
 MBA Project Topic
 Project Viva Question
  2017 New Projects
 Project Synopsis Download
  
 University Question Paper, Assignment and Projects
 SMU - Question Paper
 SMU - Assignment
 SMU - Synopsis Projects
 SCDL - Assignment
 IGNOU - Synopsis Projects
 Welingkar - Projects
 Project Report Formats
  
 Interview Question Answer
 General & HR Round
 Visual Basic 6
 VB.Net & C#
 ASP.Net
 SQL Server
  Oracle and DBA
 My SQL
  

100% Tested
Ready Academic IT Projects

BE, ME, BTech, BCA, MCA, MBA, Bsc-IT, MS, BIT, ADIT, DOEACC, IGNOU, SMU
readymadeproject.com

Free download of Sikkim Manipal University, SMU previous year, last year, sample question paper for  : [Theory of Computer Science] MC0082. Find question and answer for Part-A 2 marks, Part-B 4 Marks and Part-C 8 marks. Free download of question paper of previous year test.   Theory of Computer Science , MC0082 question paper includes multiple choice options and answer also.

Home Personal Member Forum Source Project Tips Contact
 

   SMU >> MCA >> MC0082

   Theory of Computer Science

This is the collection of Sikkim Manipal University (SMU) question paper for MCA - Theory of Computer Science. 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 Theory of Computer Science 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      
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:
 

  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

(C) Atanu Maity, 2006-2017