#1
 
 
Msc Computer Science In Mahatma Gandhi University
Hi buddy I want to do Msc Computer Science from Mahatma Gandhi University and for the same here looking for its syllabus so would you plz provide me here ?

#2
 
 
Re: Msc Computer Science In Mahatma Gandhi University
As you want here I am providing Mahatma Gandhi University Msc Computer Science program syllabus : SEMESTER I MCS 1C1 Mathematical Foundations of Computer Science Module 1 (Hours 25) Propositional Calculus: Statements and notation, Connectives, Negation, Conjunction, Disjunction , Statement formulas and truth tables, Conditional and Biconditional, Well formed formulas, Tautologies, equivalence of formulas, tautological implications, Normal form, disjunctive and conjunctive normal forms, Theory of inference for statement calculus, Validity using truth tables, Rules of inference, sample problems Predicate Calculus: Predicates, statement functions, variables and quantifiers, predicate formulae, free and bound variables, the universe of discourse, valid formulas and equivalences Module 2 (Hours 18) Graphs: Definition and examples , incidence and degree, isomorphism, sub graphs, walks, paths, and circuits, weighed graphs, shortest path algorithms, incidence and adjacency matrices and their properties, definition and properties of trees and binary trees. Definition of spanning tree, minimum spanning tree algorithms, Cut sets and cut vertices, maxflow mincut theorem , Digraphs, directed paths and connectedness, directed trees, arborescence , tournaments. Module 3 (Hours 25) Theory of Automata: Definition, Description of finite automata, Transition system and its properties, Acceptability of a string by a finite automata, NFA, Equivalence of DFA and NFA, Minimization of finite automata, Construction of minimum automaton. Regular sets and Regular grammars: Regular expressions, identities for regular expressions, finite automata and regular expressions, transition system containing ^ moves, conversion of nondeterministic systems to deterministic systems, Algebraic method using Ardenās theorem, Construction of finite automata equivalent to a regular expression. Module 4 (Hours 14) Languages and grammars: Basic definition and example, Definition of a grammar , derivation and the language generated by a grammar, Chomsky classification of languages, Context free languages and derivation trees Module 5 (Hours 8) Fuzzy logic: Introduction, Crisp Sets: an overview, Fuzzy sets: Basic types, Basic concepts, Characteristics and significance of the paradigm shift Mahatma Gandhi University Msc Computer Science program syllabus
__________________ Answered By StudyChaCha Member 