2023 2024 EduVark > Education Discussion > General Discussion > BE Computer Science Engineering 5th semester syllabus of Anna University


Thread: BE Computer Science Engineering 5th semester syllabus of Anna University Reply to Thread
Your Username: Click here to log in
Title:
  
Message:
Trackback:
Send Trackbacks to (Separate multiple URLs with spaces) :
Post Icons
You may choose an icon for your message from the following list:
 

Additional Options
Miscellaneous Options

Topic Review (Newest First)
June 30th, 2014 12:10 PM
Nitin Sharma
BE Computer Science Engineering 5th semester syllabus of Anna University

Can you please give me the BE Computer Science Engineering 5th semester syllabus of Anna University as it is very urgent for me?

As you want to get the details of BE Computer Science Engineering 5th semester syllabus of Anna University so here is the information of the same for you:

Some content of the file has been given here:

THEORY:
Discrete Mathematics
Internet Programming
Object Oriented Analysis and Design
Theory of Computation
Computer Graphics

PRACTICAL:
Case Tools Laboratory
Internet Programming Laboratory
Computer Graphics Laboratory

UNIT I LOGIC AND PROOFS 9+3
Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers –
Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS 9+3
Mathematical induction – Strong induction and well ordering – The basics of counting – The
pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear
recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.

UNIT III GRAPHS 9+3
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of
graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES 9+3
Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal
subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA 9+3
Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems –
Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

TEXT BOOKS:
1. Kenneth H.Rosen, "Discrete Mathematics and its Applications", 7th Edition, Tata Mc Graw
Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
2. Tremblay J.P. and Manohar R, "Discrete Mathematical Structures with
Applications to Computer Science", Tata Mc Graw Hill Pub. Co. Ltd, New
Delhi, 30th Reprint, 2011.

REFERENCES:
1. Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th
Edition, Pearson Education Asia, Delhi, 2007.
2. Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines,
Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.








For more detailed information I am uploading a PDF file which is free to download:


Contact Details:
Anna University
Sardar Patel Road,
Guindy,
Chennai,
Tamil Nadu, 600 025 ‎
044 2235 7080
India

Map Location:

Posting Rules
You may post new threads
You may post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off


All times are GMT +5. The time now is 03:04 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
Content Relevant URLs by vBSEO 3.6.0

1 2 3 4 5 6 7 8