Skip to main content

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE


MC9221          MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE   
                                                                                                   L T P C
                                                                                                  3 1 0 4                                                                                                  
UNIT I              Matrix Algebra                                                                                 12
Matrices, Rank of Matrix, Solving System of Equations-Eigen Values and Eigen Vectors-Inverse of a Matrix - Cayley Hamilton Theorem
                                                                       
UNIT II            BASIC SET THEORY                                                                              12 Basic Definitions - Venn Diagrams and set operations - Laws of set theory - Principle of inclusion and exclusion - partitions- Permutation and Combination - Relations- Properties of relations - Matrices of relations - Closure operations on relations - Functions - injective, surjective and bijective functions.

UNIT III           MATHEMATICAL LOGIC                                                                       12
Propositions and logical operators - Truth table - Propositions generated by a set, Equivalence and implication - Basic laws- Some more connectives - Functionally complete set of connectives- Normal forms - Proofs in Propositional calculus - Predicate calculus.
                                   
UNIT IV           FORMAL LANGUAGES                                                                          12
Languages and Grammars-Phrase Structure Grammar-Classification of Grammars-Pumping Lemma For Regular Languages-Context Free Languages.

UNIT V   FINITE STATE AUTOMATA                                                                              12        Finite State Automata-Deterministic Finite State Automata(DFA), Non Deterministic Finite State Automata (NFA)-Equivalence of DFA and NFA-Equivalence of NFA and Regular Languages.                 

                                                                                                Total No. of  Periods: 60
REFERENCES

1.   Kenneth H.Rosen, “ Discrete Mathematics and Its Applications”, Tata McGraw Hill,
     Fourth Edition, 2002 (Unit 1,2 & 3).
1.   Hopcroft and Ullman, “Introduction to Automata Theory, Languages and Computation”, Narosa Publishing House, Delhi, 2002. ( Unit 4,5)
2. A.Tamilarasi & A.M.Natarajan, “Discrete Mathematics and its Application”, Khanna
                  Publishers, 2nd Edition 2005.
            4.   M.K.Venkataraman “Engineering Mathematics”, Volume II, National Publishing
      Company, 2nd Edition,1989.

 
Labels:

Comments

Unknown said…
where is the notes it's just a syllabus
30 May 2013 at 09:45
Unknown said…
where are the notes????
22 January 2021 at 01:20
Post a Comment

Popular posts from this blog

ACCOUNTING AND FINANCIAL MANAGEMENT

MC9215          ACCOUNTING AND FINANCIAL MANAGEMENT            T P C 3 1 0 4 UNIT I             FINANCIAL ACCOUNTING                                                                       9               Meaning and Scope of Accounting-Principles-Concepts-Conventions-Accounting Standards-Final Accounts-Trail Balance-Trading Account-Profit and Loss Account-Balance Sheet-Accounting Ratio Analysis-Funds Flow Analysis-Cash Flow Analysis                                                                                                                               UNIT II             ACCOUNTING                                                                                           9            Meaning-Objectives-Elements of Cost-Cost Sheet-Marginal Costing and Cost Volume Profit Analysis-Break Even Analysis-Applications-Limitations-Standard Costing and Variance Analysis-Material-Labor-Overhead-Sales-Profit Variances                                                       
1 comment
Read more

SOFTWARE PROJECT MANAGEMENT

MC9252          SOFTWARE PROJECT MANAGEMENT                  L T P C  3 0 0 3 UNIT I                  INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT          9 Project Definition – Contract Management – Activities Covered By Software Project Management – Overview Of Project Planning – Stepwise Project Planning. UNIT II            PROJECT EVALUATION                                                                         9 Strategic Assessment – Technical Assessment – Cost Benefit Analysis – Cash Flow Forecasting – Cost Benefit Evaluation Techniques – Risk Evaluation. UNIT III           ACTIVITY PLANNING                                                                               9 Objectives – Project Schedule – Sequencing And Scheduling Activities – Network Planning Models – Forward Pass – Backward Pass – Activity Float – Shortening Project Duration – Activity On Arrow Networks – Risk Management – Nature Of Risk – Types Of Risk – Managing Risk
Read more

VISUAL PROGRAMMING

MC9243          VISUAL PROGRAMMING                                                                                       L T P C 3 0 0 3 UNIT I              WINDOWS PROGRAMMING                                                                   8 The windows programming Model – Event driven programming –  GUI concepts – Overview of Windows programming – Creating and displaying the window – Message Loop – windows procedure – WM_PAINT message – WM_DESTROY message – Data types – Resources  –  An Introduction to GDI – Device context –  Text output –  Scroll Bars – Keyboard – Mouse – Menus. UNIT II            VISUAL BASIC PROGRAMMING                                                          10 Visual Basic Applications – Form and properties – Variables and Constants –  Variant type – Procedure scope – Main –  Control statements –  control arrays –  Creating and using Controls – Menus and Dialogs – Programming fundamentals – Objects and instances – Debugging – Responding
Read more