Go Back   2023-2024 StudyChaCha > StudyChaCha Discussion Forum > General Topics

Old November 18th, 2017, 09:31 AM
Super Moderator
Join Date: May 2011
Default Re: Msc Computer Science In Mahatma Gandhi University

As you want here I am providing Mahatma Gandhi University Msc Computer Science program syllabus :

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
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
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

Attached Files Available for Download
File Type: pdf Mahatma Gandhi University Msc Computer Science program syllabus.pdf (509.5 KB, 2 views)
Answered By StudyChaCha Member
Reply With Quote

Reply to this Question / Ask Another Question
Your Username: Click here to log in


All times are GMT +6. The time now is 05:21 PM.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, vBulletin Solutions Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8