Anna University Syllabus
Candidates can get the Anna University Syllabus for the courses of Engineering, MBA, MCA (UG and PG). With the help of Anna University exam Syllabus, aspirants can prepare well for the examination.
The Anna University offers various UG and PG courses, so students who are studying in these courses and going to appear in the examination must check the Anna University exam syllabus in the form of PDF from here.
|This Page Includes:|
Anna University 2018 Syllabus:
Through the Anna University Exam Syllabus, students can be aware about the topics and subjects that should be prepared. Candidates who are willing to appear in Anna University Exam they may check the Anna University Syllabus 2018 for better preparation.
Here we have given Anna University Syllabus 2018-19, candidates need to read this complete page which is created by team of recruitmentresult.com.
Anna University Syllabus
Get Anna University Syllabus 2018 PDF Here
|Faculty of Science & Humanities||Download Here|
|M.Sc. (2 years)||Download Here|
|M.Phil. Medical Physics||Download Here|
|Faculty of Management Sciences||Download Here|
|(B.E , B.TECH) FULL TIME||Download Here|
|(B.E , B.TECH) PART TIME||Download Here|
|(B.E , B.TECH, B.Arch)||Download Here|
|R2013 (B.E , B.TECH) PART TIME||Download Here|
Anna University Syllabus for MBA
|1st Semester Syllabus||2nd Semester Syllabus|
Anna University Coimbatore Department of Electronic Communication Engineering:
|Sixth Semester:||Seventh Semester:|
|SEMESTER VI Elective Subjects:|
|SEMESTER VII Elective Subjects:|
|SEMESTER VIII Elective Subjects:|
Get here Best Preparation Material: MBA Preparation Books List
Syllabus of B.E. Computer Science and Engineering Semester V
Anna University Syllabus for Software Engineering
Unit I Software Product And Process
|Unit II Software Requirements|
|Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models – System Engineering – Computer Based System – Business Process Engineering Overview – Product Engineering Overview.||Functional and Non-Functional – Software Document – Requirement Engineering Process – Feasibility Studies – Software Prototyping – Prototyping in the Software Process – Data – Functional and Behavioral Models – Structured Analysis and Data Dictionary.|
Unit III Analysis, Design Concepts And Principles
Unit IV Testing
|Systems Engineering – Analysis Concepts – Design Process And Concepts – Modular Design – Design Heuristic – Architectural Design – Data Design – User Interface Design – Real Time Software Design – System Design – Real Time Executives – Data Acquisition System – Monitoring And Control System.||Taxonomy Of Software Testing – Types Of S/W Test – Black Box Testing – Testing Boundary Conditions – Structural Testing – Test Coverage Criteria Based On Data Flow Mechanisms – Regression Testing – Unit Testing – Integration Testing – Validation Testing – System Testing And Debugging – Software Implementation Techniques|
|Unit V Software Project Management|
|Measures And Measurements – ZIPF’s Law – Software Cost Estimation – Function Point Models – COCOMO Model – Delphi Method – Scheduling – Earned Value Analysis – Error Tracking – Software Configuration Management – Program Evolution Dynamics – Software Maintenance – Project Planning – Project Scheduling– Risk Management – CASE Tools|
|Unit I Logic And Proofs||Unit II Combinatorics|
Propositional Logic – Propositional equivalences-Predicates and quantifiers-Nested Quantifiers-Rules of inference-introduction to Proofs-Proof Methods and strategy
|Mathematical inductions-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 and applications|
|Unit III Graphs||Unit IV Algebraic Structures|
|Graphs and graph models-Graph terminology and special types of graphs-Representing graphs and graph isomorphism -connectivity-Euler and Hamilton graphs-planar graphs.||Algebraic systems-Semi groups and monoids-Groups-Subgroups and homomorphismsCosets and Lagrange’s theorem- Ring & Fields (Definitions and examples)|
|Unit V Lattices And Boolean Algebra|
|Partial ordering-Posets-Lattices as Posets- Properties of lattices-Lattices as Algebraic systems –Sub lattices –direct product and Homomorphism-Some Special latticesBoolean Algebra|
|UNIT I||UNIT II|
|Network architecture – layers – Physical links – Channel access on links – Hybrid multiple access techniques – Issues in the data link layer – Framing – Error correction and detection – Link-level Flow Control||Medium access – CSMA – Ethernet – Token ring – FDDI – Wireless LAN – Bridges and Switches|
|UNIT III||UNIT IV|
|Circuit switching vs. packet switching / Packet switched networks – IP – ARP – RARP – DHCP – ICMP – Queueing discipline – Routing algorithms – RIP – OSPF – Subnetting – CIDR – Interdomain routing – BGP – Ipv6 – Multicasting – Congestion avoidance in network layer||UDP – TCP – Adaptive Flow Control – Adaptive Retransmission – Congestion control –|
Congestion avoidance – QoS
|Email (SMTP, MIME, IMAP, POP3) – HTTP – DNS- SNMP – Telnet – FTP – Security – PGP – SSH|
Theory Of Computation
|Unit I Automata||Unit II Regular Expressions And Languages|
Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.
|Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata.|
|Unit III Context-Free Grammars And Languages||Unit IV Properties Of Context-Free Languages|
|Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG– Deterministic Pushdown Automata.|
Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Programming Techniques for TM.
|Unit V Undecidabality|
A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post’s Correspondence Problem – The classes P and NP
|Unit I Introduction||Unit II Assemblers|
System software and machine architecture – The Simplified Instructional Computer (SIC) – Machine architecture – Data and instruction formats – addressing modes – instruction sets – I/O and programming.
Basic assembler functions – A simple SIC assembler – Assembler algorithm and data structures – Machine dependent assembler features – Instruction formats and addressing modes – Program relocation – Machine independent assembler features – Literals – Symbol-defining statements – Expressions – One pass assemblers and Multi pass assemblers – Implementation example – MASM assembler.
|Unit III Loaders And Linkers||Unit IV Macro Processors|
Basic loader functions – Design of an Absolute Loader – A Simple Bootstrap Loader – Machine dependent loader features – Relocation – Program Linking – Algorithm and Data Structures for Linking Loader – Machine-independent loader features – Automatic Library Search – Loader Options – Loader design options – Linkage Editors – Dynamic Linking – Bootstrap Loaders – Implementation example – MSDOS linker.
Basic macro processor functions – Macro Definition and Expansion – Macro Processor Algorithm and data structures – Machine-independent macro processor features – Concatenation of Macro Parameters – Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example – MASM Macro Processor – ANSI C Macro language.
|Unit V System Software Tools|
Text editors – Overview of the Editing Process – User Interface – Editor Structure – Interactive debugging systems – Debugging functions and capabilities – Relationship with other parts of the system – User-Interface Criteria
Download From Here: Anna University Previous Question Paper
M.C.A. (Master Of Computer Applications)-1st Semester Syllabus
Anna University Syllabus for Software Engineering
|Unit I Digital Fundamentals||Unit II Combinational And Sequential Circuits Design of Combinational Circuits|
|Unit III Basic Structure Of Computers Functional units||Unit IV Processor Design|
Anna University Syllabus for Unit V Memory And I/O System
Steps to Download Anna University Exam 2018 Syllabus:
Candidates who want to download syllabus of Anna University they may follow the below important steps:-
- First of all applicants are required to log on the official website that is www.annauniv.edu to download the Anna University syllabus.
- On the home page of the official site you have to go “Academic” section and hit on the “Academic Courses” link.
- On the next page you need to move your cursor to “CURRICULUM & SYLLABI” section and hit on the “university Department” link which is available left side of the page.
- Now you are on the page containing the various links, you need to select the suitable links per the course which you want to apply.
- After that syllabus will be shown on your screen in PDF format.
- Candidates need to check the complete syllabus carefully and download it for further use.
Check Exam Scheme Here: Anna University Time Table
Candidates who want to get more details about Anna University Syllabus 2018-19 they may check Official Link. Dear Visitors you are suggested to keep in touch with this web portal for getting more information like Anna University syllabus, TSPSC Recruitment, result, admit card.
Something That You Should Put an Eye On
|Anna University Colleges List||Anna University Results|
|Anna University Fee Structure||Anna University Admission|
|Anna University Internal Marks||Anna University Syllabus|
|Anna University Hall Ticket||ANNA University DE Admission|