Syllabus of Iii Semester B.E. Computer Science (Semester Pattern) 33CS1: Applied Mathematics
Syllabus of Iii Semester B.E. Computer Science (Semester Pattern) 33CS1: Applied Mathematics
Syllabus of Iii Semester B.E. Computer Science (Semester Pattern) 33CS1: Applied Mathematics
Text Books:
• Advanced Engineering Mathematics, kreyzig
• Higher Engineering Mathematics, B.S. Grewal
Reference Books:
• Mathematics of Engineers, Chandrika Prasad
• Advance Mathematics for Engineers, Chandrika Prasad
• Applied Mathematics for Engineers, L.A. Pipes & Harville
• A Text Book of Applied Mathematics, P.N. Wartikar & J. N. Wartikar
Text Books:
• The Complete Reference C ( 4th Edition) : Herbert Schildt [ TMH]
• C How to Program, 4th Edition by H. M. Deitel & P. J. Deitel, Pearson Education.
• Writing TSRs through C : Yashwant Kanetkar ( BPB)
Reference Books :
• The C Programming Language : Dennis Ritchie & Brain Kernighan [Pearson]
• Programming with C : K.R.Venugopal & S.R.Prasad [TMH]
• Let Us C : Yashwant Kanetkar [BPB]
Text books :
• Digital Design 3rd Edition by M. Morris Mano, Pearson Education
• Digital logic and Computer Design by M. Morris Mano, Pearson Education
• Digital Cicuit & Design –R.P.Jain
• Digital circuit & design- A.P.Godse
• Fundamental Of Digital Electronics- A.Anand Kumar
• 8 bit microprocessor & controller –V.J.Vibhute
• 8 bit Microprocessor – Gaonkar.
33CS4: Combinatorial Theories
UNIT 1:
Combinatorics: Basic counting techniques, pigeon-hole principle, recurrence relations, generating functions.
Examples using ordinary power series and exponential generating functions, general properties of such functions.
Dirichlet Series as generating functions.
A general family of problems described in terms of “cards, decks and handa” with solution methods using generating
functions.
UNIT II:
Generating function proofs of the sieve formula and of various combinatorial identities. Certifying combinatorial
identities.
Some analytical methods and asymptotic results.
Polya’s counting theorem.
Basics of graph theory.
Introduction to probabilistic method in combinatorics.
UNIT III:
Number Theory
Examples of continued fractions.
The study of the continued fractions.
Alpha has infinite continued fraction if alpha is irrational.
Formal logic: Propositional logic: proof system, semantics, completeness, compactness.
Length of proofs, polynomial size proofs, efficiency of proof systems.
UNIT IV:
Alpha has periodic continued fraction if alpha is quadratic irrational.
Application to approximation of irrationals by rationals. Hurwitz’s Theorem.
First order logic: models, proof system, compactness, Examples of formal proofs in say, number theory or group theory.
Some advanced topics.
UNIT V:
Application to solutions of Pell’s equation. Proof that means cos{(p x pi)/q},for natural numbers p and q,are
irrational(apart from obvious exceptions).
Example : CS application of logic, introduction to modal and temporal logics, Or formal number theory including
incompleteness theorem.
UNIT VI:
Liouville’s Theoram on algebraic numbers.Construction of transcendental numbers.
Elements of proof theory including cut elimination, Or zero-one law for first order logic.
Text Book:
• Niven, Zuckerman and Montgomery, An Introduction to the Theory of Numbers, (5th edition),1991,Wiley.
Textbooks :
• Principles of management , P C Tripathi and P N Reddy
• Management Information System,Gordan Davis and H. Olison McGraw Hill Pub.
• Human Resources and Personal Management, William Werther and Keith Davis
• Marketing Management, V S Ramaswamy and S Namakumari
• Organization Behavior, High Arnold and Daniel Feldman McGraw Hill
• Financial Management, Khanna