Custom Search

Anna University CAMPUS Placement cognizant 2013 passing Out students

Anna University Dec 2012 Maths 3 m3 Reexam issue full Details

Anna University Nov/Dec 2012 3rd,5th,7th semester result Tentative dates

GATE 2013 HALL TICKET DOWNLOAD AND EXAM TIME TABLE

TN +2 october 2012 results

TIPS FOR ANNA UNIVERSITY STUDENTS TO GET PASS MARK EASILY

TN HSC 12TH MARCH 2013 TIME TABLE Announced Download soon

TN SAMACHEERKALVI 10TH March/April 2013 TIME TABLE Announced Download soon

ANNA UNIVERSITY MAY/JUNE REVALUATION REVIEW PROCEDURE, LAST DATE, APPLICATION FEE, REFUND PROCEDURE

ANNA UNIVERSITY MAY/JUNE 2012 REVALUATION RESULTS for 2nd,4th,6th,8th SEMESTER AVAILABLE HERE

ANNA UNIVERSITY FIRST SEMESTER BE/BTECH QUESTION BANK

GATE 2013 APPLY ONLINE AND KNOW MORE ABOUT NEW 2013 GATE

ANNA UNIVERSITY NOV/DEC 2012 TIME TABLE FOR 3RD,5TH,7TH SEMESTER

ANNA UNIVERSITY MAY/JUNE 2012 REVALUATION LAST DATE AUGUST 29, REVALUATION PROCEDURE,RESULT

ANNA UNIVERSITY MAY/JUNE 2012 RESULTS announced

ANNA UNIVERSITY TANCA ME/MTECH RANK LIST AND COUNSELLING SCHEDULE ANNOUNCED CLICK HERE

ANNA UNIVERSITY MAY/JUNE 2012 2ND,4TH,6TH,8TH SEMESTER RESULT DATE ANNOUNCED CLICK HERE

ANNA UNIVERSITY IMPORTANT INFORMATION FOR FIRST YEAR 2012-2013 STUDENTS

UNIVERSITY DEPARTMENTS AU:ANNA UNIVERSITY PART TIME BE/BTECH MAY/JUNE 2012 RESULTS ANNOUNCED CLICK HERE

TNEA 2012 TODAY'S VACANCY POSITION CHECK SOON

ANNA UNIVERSITY 8TH SEMESTER MAY/JUNE 2012 RESULTS ANNOUNCED CHECK SOON

ANNA UNIVERSITY 2ND SEMESTER JUNE 2012 RESULTS DATE FOR ALL COLLEGES TENTATIVE

ANNA UNIVERSITY CHENNAI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY OF TECHNOLOGY CHENNAI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY OF TECHNOLOGY TRICHY 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY COIMBATORE 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY TIRUNELVELI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

ANNA UNIVERSITY MADURAI 4TH SEMESTER,6TH SEMESTER MAY/JUNE 2012 RESULTS INCLUDING ARREARS ANNOUNCED CHECK SOON

TAMILNADU ENGINEERING ADMISSIONS 2012 TNEA 2012 VACANCY POSITION

TAMILNADU ENGINEERING ADMISSIONS 2012 TNEA 2012 RANK LIST ANNOUNCED CHECK SOON

TAMILNADU ENGINEERING ADMISSIONS 2012 COUNSELLING SCHEDULE, IMPORTANT DATES CHECK SOON

TAMILNADU ENGINEERING ADMISSIONS 2012 COUNSELLING CALCULATE CUT OFF MARK CLICK HERE

ANDHRA PRADESH AP SSC RESULTS OUT TODAY CHECK SOON

CBSE SSLC CLASS 10TH RESULTS TODAY CHECK SOON

KARNATAKA PUC (2ND) RESULTS ANNOUNCED CHECK SOON

RAJASTHAN 12TH COMMERCE RESULTS TO BE ANNOUNCED TODAY 12TH MAY 2012 CLICK HERE (BSER 12TH RESULTS)

MEGHALAYA HSSLC 2012 RESULTS CLICK HERE

KERALA SSLC/10TH 2012 RESULTS CLICK HERE

AP INTER 2ND YEAR RESULTS 2012 ANNOUNCED CLICK HERE

AP EAMCET 2012 EXAM HALL TICKET DOWNLOAD CLICK HERE

SBTET ANDHRA DIPLOMA APRIL/MAY 2012 TIME TABLE CLICK HERE

TAMIL NADU +2 RESULTS ANNOUNCED CLICK HERE

TAMIL NADU 10th SSLC SAMACHEERKALVI RESULTS ON JUNE 4TH 2012 CLICK HERE

ANNA UNIVERSITY MAY/JUNE 2012 TIME TABLE ALL UPDATES IN ONE PAGE

ANNA UNIVERSITY OF TECHNOLOGY TRICHY (2007,2008 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY COIMBATORE (2007,2008 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY TIRUNELVELI (2007,2008,2009,2010 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY MADURAI (2010 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY OF TECHNOLOGY CHENNAI (2007,2008 REGULATION) MAY/JUNE 2012 REVISED TIME TABLE CLICK HERE (AFFILIATED COLLEGES AND UNIVERSITY DEPARTMENTS) FOR BE AND BTECH

ANNA UNIVERSITY 2ND SEMESTER MAY/JUNE 2012 REVISED TIME TABLE (APPLICABLE FOR CHENNAI, TRICHY, COIMBATORE, MADURAI, TIRUNELVELI FOR 2011 BATCHES ALSO)

ANNA UNIVERSITY RESCHEDULED EXAM DATES CLICK HERE

ANNA UNIVERSITY MAY/JUNE 2012 RESULTS ON JUNE

ANNA UNIVERSITY FIRST SEMESTER JAN 2012 REVALUATION RESULTS CLICK HERE

ANNA UNIVERSITY FIRST SEMESTER JAN 2012 BE/BTECH BSC MSC MCA MBA RESULTS ANNOUNCED

ANNA UNIVERSITY OF TECHNOLOGY THIRD SEMESTER NOV/DEC 2011 REVALUATION RESULTS ANNOUNCED CLICK HERE

ANNA UNIVERSITY COIMBATORE NOV/DEC 2011 REVALUATION RESULTS ANNOUNCED

ANNA UNIVERSITY TIRUNELVELI NOVEMBER/DECEMBER 2011 REVALUATION RESULTS

ANNA UNIVERSITY 3RD SEMESTER NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY CHENNAI BE/BTECH, ME/MTECH, MCA, NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY TRICHY NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY TRICHY NOVEMBER/DECEMBER 2011 REVALUATION RESULTS

ANNA UNIVERSITY COIMBATORE NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY TIRUNELVELI NOVEMBER/DECEMBER 2011 RESULTS

ANNA UNIVERSITY MADURAI NOVEMBER/DECEMBER 2011 RESULTS

TAMILNADU DIPLOMA APRIL/MAY 2012 RESULTS INFO CLICK HERE

TAMILNADU DIPLOMA APRIL/MAY 2012 TIME TABLE ANNOUNCED CHECK SOON

TAMILNADU DIPLOMA OCTOBER 2011 REVALUATION RESULTS ANNOUNCED CHECK SOON

GATE 2012 RESULTS ANNOUNCED CHECK SOON

TANCET 2012 RESULTS ANNOUNCED CHECK SOON CLICK HERE

TANCET 2012 RANK LIST AND CUT OFF MARKS DETAILS CLICK HERE

TANCET 2012 COUNSELLING SCHEDULE DETAILS CLICK HERE

ANNA UNIVERSITY 1ST,3RD,5TH,7TH SEMESTER SYLLABUS 2008 REGULATION

TOP 10 ENGINEERIN COLLEGES IN CHENNAI UNDER ANNA UNIVERSITY



TOP 10 ENGINEERIN COLLEGES IN CHENNAI UNDER ANNA UNIVERSITY

1.ANNA UNIVERSITY,GUINDY
2.MADRAS INSTITUTE OF TECHNOLOGY
3.SRI VENKATESHWARA COLLEGE
4.SSN
5.VELAMMAL ENGINEERING COLLEGE
6.ST.JOSEPH'S(if not deemed)
7.RMK ENGINNERING COLLEGE
8.SAI RAM
9.PANIMALAR ENGINEERING COLLEGE
10.JEPPIAR


NOTE: IT IS MY OWN OPINION ONLY

IT IS NOT A 100 PERCENT CORRECT REPORT STUDENTS SHOULD ASK THE PASSED OUTS STUDENTS OF THE RESPECTIVE COLLEGE BEFORE JOINING REFER THE CAREER TIPS IN THIS BLOG HOW TO SELECT COLLEGE

Anna university be ece 5th semester syllabus download REGULATION 2008 2009 UPDATED

Anna university be ece 5th semester syllabus download


TO BOOKMARK PRESS CTRL+D






 or VIEW
The following download include the full syllabus for anna university ELECTRONICS AND COMMUNICATION DEPARTMENT Regulation 2008 2009 updated

AIM FOR HIGH
HOW TO IMPROVE SELF CONFIDENCE? 
COMMUNICATION SKILLS

Anna University Chennai has been declared

Anna university BE credit system results have been announced


Anna University B.E / B.Tech (Mark System) Results 2010 | Anna University B.E / B.Tech / B.Arch. / M.B.A / M.C.A / I – Sem Credit System Results | Anna University B.E / B.Tech 2010 | Anna University B.Arch. / M.B.A / M.C.A / I – Sem Results | www.annauniv.edu
Anna University Results ANNOUNCED

Anna University, Chennai turns out over 65,000 engineering graduates every year. The university has over 3,800 Ph.D. scholars registered in its various departments of the university and in affiliated engineering colleges in the state and approved R&D organizations.

Anna University Chennai has been declared B.E / B.Tech Examination Results Jan – 2010 (Mark System) and B.E / B.Tech. / B.Arch. / M.B.A / M.C.A / I – Sem Results – Credit System – Jan 2010

Anna University Examination Results.


Results 1
Results 2
FOR B.E / B.Tech (Mark System) RESULTS CLICK HERE
FOR B.E / B.Tech. / B.Arch. / M.B.A / M.C.A / I-SEM RESULTS CLICK HERE
FOR OFFICIAL WEBSITE  CLICK HERE

Anna university BE credit system results have been announced

Anna university BE credit system results have been announced



Anna University B.E / B.Tech (Mark System) Results 2010 | Anna University B.E / B.Tech / B.Arch. / M.B.A / M.C.A / I – Sem Credit System Results | Anna University B.E / B.Tech 2010 | Anna University B.Arch. / M.B.A / M.C.A / I – Sem Results | www.annauniv.edu
Anna University Results

Anna University, Chennai turns out over 65,000 engineering graduates every year. The university has over 3,800 Ph.D. scholars registered in its various departments of the university and in affiliated engineering colleges in the state and approved R&D organizations.

Anna University Chennai has been declared B.E / B.Tech Examination Results Jan – 2010 (Mark System) and B.E / B.Tech. / B.Arch. / M.B.A / M.C.A / I – Sem Results – Credit System – Jan 2010

Anna University Examination Results.



Results 1
Results 2
FOR B.E / B.Tech (Mark System) RESULTS CLICK HERE
FOR B.E / B.Tech. / B.Arch. / M.B.A / M.C.A / I-SEM RESULTS CLICK HERE
FOR OFFICIAL WEBSITE  CLICK HERE

Engineering counselling to begin today



The single-window counselling for engineering admissions will begin on Monday as per schedule, with 182 sports quota candidates called for the process, said P. Mannar Jawahar, Vice-Chancellor, Anna University, Chennai, on Sunday.
ARRANGEMENTS


“Of the 182 candidates, seven are appearing for medical counselling also. All of them have been called at 9 a.m., and we have made all arrangements to start the process on time,” he said.


With some confusion remaining over the number of colleges and seats available to students, a petition filed by private colleges challenging the All India Council for Technical Education's (AICTE) new norms for renewal of approval is coming up for hearing on Monday.
SEAT MATRIX


Kumar Jayant, Commissioner, Directorate of Technical Education, said the seat matrix, showing the seats in the colleges available for students, will use the data from the previous year.


“We will include any new colleges that are approved as and when they come up, and will remove from the list any colleges if they are disapproved,” he said.

CS2307 Network Lab CS2308 System Software Lab CS2309 Java Lab CS 2307 Network Lab CS 2308 System Software Lab CS 2309 Java Lab





CS2307 NETWORK LAB  SYLLABUS L T P C
0 0 3 2 1. Programs using TCP Sockets (like date and time server & client, echo server &
client, etc..)
2. Programs using UDP Sockets (like simple DNS)
3. Programs using Raw sockets (like packet capturing and filtering)
4. Programs using RPC
5. Simulation of sliding window protocols
Experiments using simulators (like OPNET)
6. Performance comparison of MAC protocols
7. Implementing Routing Protocols
8. Performance comparison of Routing protocols
9. Study of UDP performance
10. Study of TCP performance.





CS2308 SYSTEM SOFTWARE LAB L T P C
0 0 3 2
(Using C)
1. Implement a symbol table with functions to create, insert, modify, search, and
display.
2. Implement pass one of a two pass assembler.
3. Implement pass two of a two pass assembler.
4. Implement a single pass assembler.
5. Implement a two pass macro processor
6. Implement a single pass macro processor.
7. Implement an absolute loader.
8. Implement a relocating loader.
9. Implement pass one of a direct-linking loader.
10. Implement pass two of a direct-linking loader.
11. Implement a simple text editor with features like insertion / deletion of a character,
word, and sentence.
12. Implement a symbol table with suitable hashing
(For loader exercises, output the snap shot of the main memory as it would be, after the
loading has taken place)





CS2309 JAVA LAB L T P C
0 0 3 2
1. Develop Rational number class in Java. Use JavaDoc comments for documentation.
Your implementation should use efficient representation for a rational number, i.e.
(500 / 1000) should be represented as (½).
2. Develop Date class in Java similar to the one available in java.util package. Use
JavaDoc comments.
3. Implement Lisp-like list in Java. Write basic operations such as 'car', 'cdr', and
'cons'. If L is a list [3, 0, 2, 5], L.car() returns 3, while L.cdr() returns [0,2,5].
4. Design a Java interface for ADT Stack. Develop two different classes that implement
this interface, one using array and the other using linked-list. Provide necessary
exception handling in both the implementations.
5. Design a Vehicle class hierarchy in Java. Write a test program to demonstrate
polymorphism.
6. Design classes for Currency, Rupee, and Dollar. Write a program that randomly
generates Rupee and Dollar objects and write them into a file using object
serialization. Write another program to read that file, convert to Rupee if it reads a
Dollar, while leave the value as it is if it reads a Rupee.
7. Design a scientific calculator using event-driven programming paradigm of Java.
8. Write a multi-threaded Java program to print all numbers below 100,000 that are
both prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design a
thread that generates prime numbers below 100,000 and writes them into a pipe.
Design another thread that generates fibonacci numbers and writes them to another
pipe. The main thread should read both the pipes to identify numbers common to
both.
9. Develop a simple OPAC system for library using even-driven and concurrent
programming paradigms of Java. Use JDBC to connect to a back-end database.
10. Develop multi-threaded echo server and a corresponding GUI client in Java.
11. [Mini-Project] Develop a programmer's editor in Java that supports syntaxhighlighting,
compilation support, debugging support, etc.

CS 2305 PROGRAMMING PARADIGMS CS2305 PROGRAMMING PARADIGMS

CS2305 PROGRAMMING PARADIGMS  SYLLABUS  L T P C 3 0 0 3
AIM:
To understand the concepts of object-oriented, event driven, and concurrent
programming paradigms and develop skills in using these paradigms using Java.
UNIT I OBJECT-ORIENTED PROGRAMMING – FUNDAMENTALS 9
Review of OOP - Objects and classes in Java – defining classes – methods - access
specifiers – static members – constructors – finalize method – Arrays – Strings -
Packages – JavaDoc comments
UNIT II OBJECT-ORIENTED PROGRAMMING – INHERITANCE 10
Inheritance – class hierarchy – polymorphism – dynamic binding – final keyword –
abstract classes – the Object class – Reflection – interfaces – object cloning – inner
classes – proxies
UNIT III EVENT-DRIVEN PROGRAMMING 10
Graphics programming – Frame – Components – working with 2D shapes – Using color,
fonts, and images - Basics of event handling – event handlers – adapter classes –
actions – mouse events – AWT event hierarchy – introduction to Swing – Model-View-
Controller design pattern – buttons – layout management – Swing Components
UNIT IV GENERIC PROGRAMMING 8
Motivation for generic programming – generic classes – generic methods – generic code
and virtual machine – inheritance and generics – reflection and generics – exceptions –
exception hierarchy – throwing and catching exceptions – Stack Trace Elements -
assertions - logging
UNIT V CONCURRENT PROGRAMMING 8
Multi-threaded programming – interrupting threads – thread states – thread properties –
thread synchronization – thread-safe Collections – Executors – synchronizers – threads
and event-driven programming
TOTAL=45 PERIODS
TEXT BOOK:
1. Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – Fundamentals”, Eighth
Edition, Sun Microsystems Press, 2008.
8
REFERENCES:
1. K. Arnold and J. Gosling, “The JAVA programming language”, Third edition, Pearson
Education, 2000.
2. Timothy Budd, “Understanding Object-oriented programming with Java”, Updated
Edition, Pearson Education, 2000.
3. C. Thomas Wu, “An introduction to Object-oriented programming with Java”, Fourth
Edition, Tata McGraw-Hill Publishing company Ltd., 2006.

CS2304 SYSTEM SOFTWARE CS 2304 SYSTEM SOFTWARE

CS2304 SYSTEM SOFTWARE SYLLABUS L T P C 3 1 0 4
AIM
To have an understanding of foundations of design of assemblers, loaders, linkers, and
macro processors.
OBJECTIVES
 To understand the relationship between system software and machine architecture.
 To know the design and implementation of assemblers
 To know the design and implementation of linkers and loaders.
 To have an understanding of macroprocessors.
 To have an understanding of system software tools.
UNIT I INTRODUCTION 8
System software and machine architecture – The Simplified Instructional Computer
(SIC) - Machine architecture - Data and instruction formats - addressing modes -
instruction sets - I/O and programming.
UNIT II ASSEMBLERS 10
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 9
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.
UNIT IV MACRO PROCESSORS 9
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 9
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.
L: 45, T: 15, TOTAL= 60 PERIODS
TEXT BOOK:
1. Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd
Edition, Pearson Education Asia, 2006.
7
REFERENCES:
1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second
Revised Edition, Tata McGraw-Hill, 2000.
2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.
3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann
Publishers, 2000.

CS2303 THEORY OF COMPUTATION CS 2303 THEORY OF COMPUTATION

CS2303 THEORY OF COMPUTATION  SYLLABUS L T P C
3 1 0 4
UNIT I AUTOMATA 9
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.
UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9
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 9
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.
UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9
Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing
Machines – Programming Techniques for TM.
UNIT V UNDECIDABALITY 9
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.
L: 45, T: 15, TOTAL= 60 PERIODS
TEXT BOOK:
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,
Languages and Computations”, second Edition, Pearson Education, 2007.
REFERENCES:
1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”,
Second Edition, Pearson Education, 2003.
2. Thomas A. Sudkamp,” An Introduction to the Theory of Computer Science,
Languages and Machines”, Third Edition, Pearson Education, 2007.
3. Raymond Greenlaw an H.James Hoover, “ Fundamentals of Theory of Computation,
Principles and Practice”, Morgan Kaufmann Publishers, 1998.
4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole,
1997.
5. J. Martin, “Introduction to Languages and the Theory of computation”
Third Edition, Tata Mc Graw Hill, 2007

CS2302 COMPUTER NETWORKS CS 2302 COMPUTER NETWORKS

 SYLLABUS 

CS2302 COMPUTER NETWORKS L T P C
3 0 0 3
UNIT I 9
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
UNIT II 9
Medium access – CSMA – Ethernet – Token ring – FDDI - Wireless LAN – Bridges and
Switches
UNIT III 9
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
45
UNIT IV 9
UDP – TCP – Adaptive Flow Control – Adaptive Retransmission - Congestion control –
Congestion avoidance – QoS
UNIT V 9
Email (SMTP, MIME, IMAP, POP3) – HTTP – DNS- SNMP – Telnet – FTP – Security –
PGP - SSH
TOTAL: 45 PERIODS
TEXT BOOK :
1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”,
Third Edition, Morgan Kauffmann Publishers Inc., 2003.
REFERENCES:
1. James F. Kuross, Keith W. Ross, “Computer Networking, A Top-Down Approach
Featuring the Internet”, Third Edition, Addison Wesley, 2004.
2. Nader F. Mir, “Computer and Communication Networks”, Pearson Education, 2007
3. Comer, “Computer Networks and Internets with Internet Applications”, Fourth Edition,
Pearson Education, 2003.
4. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, 2003.
5. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson
Education, 2000

MA2265 DISCRETE MATHEMATICS MA 2265 DISCRETE MATHEMATICS



MA2265 DISCRETE MATHEMATICS  SYLLABUS L T P C
3 1 0 4
AIM


To extend student’s Logical and Mathematical maturity and ability to deal with
abstraction and to introduce most of the basic terminologies used in computer science
courses and application of ideas to solve practical problems.


OBJECTIVES


At the end of the course, students would
 Have knowledge of the concepts needed to test the logic of a program..
 Have an understanding in identifying structures on many levels.
 Be aware of a class of functions which transform a finite set into another finite set
which relates to input output functions in computer science.
 Be aware of the counting principles
 Be exposed to concepts and properties of algebraic structures such as semi groups,
monoids and groups.


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 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 9 + 3


Graphs and graph models-Graph terminology and special types of graphs-Representing
graphs and graph isomorphism -connectivity-Euler and Hamilton paths


UNIT IV ALGEBRAIC STRUCTURES 9 + 3


Algebraic systems-Semi groups and monoids-Groups-Subgroups and homomorphisms-
Cosets and Lagrange’s theorem- Ring & Fields (Definitions and examples)


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


L: 45, T: 15, TOTAL= 60 PERIODS


TEXT BOOKS:
1. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Special Indian
edition, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, (2007). (For the units 1 to 3,
Sections 1.1 to 1.7 , 4.1 & 4.2, 5.1 to 5.3, 6.1, 6.2, 6.4 to 6.6, 8.1 to 8.5)
2. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 30th Re-print
(2007).(For units 4 & 5 , Sections 2-3.8 & 2-3.9,3-1,3-2 & 3-5, 4-1 & 4-2)
4


REFERENCES:
1. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied
Introduction”, Fourth Edition, Pearson Education Asia, Delhi, (2002).
2. Thomas Koshy, ”Discrete Mathematics with Applications”, Elsevier Publications,
(2006).
3. Seymour Lipschutz and Mark Lipson, ”Discrete Mathematics”, Schaum’s Outlines,
Tata McGraw-Hill Pub. Co. Ltd., New Delhi, Second edition, (2007).

CS2301 SOFTWARE ENGINEERING CS 2301 SOFTWARE ENGINEERING



CS2301 SOFTWARE ENGINEERING  SYLLABUS L T P C
3 0 0 3


UNIT I SOFTWARE PRODUCT AND PROCESS 9


Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models
– System Engineering – Computer Based System – Business Process Engineering
Overview – Product Engineering Overview.


UNIT II SOFTWARE REQUIREMENTS 9


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 9


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.


UNIT IV TESTING 9


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   9


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


TOTAL= 45 PERIODS


TEXT BOOKS:
1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia,
2007.
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth
Edition, McGraw-Hill International Edition, 2005.
REFERENCES:
1. Watts S.Humphrey,”A Discipline for Software Engineering”, Pearson Education,
2007.
2. James F.Peters and Witold Pedrycz,”Software Engineering, An Engineering
Approach”, Wiley-India, 2007.
3. Stephen R.Schach, “ Software Engineering”, Tata McGraw-Hill Publishing Company
Limited, 2007.
4. S.A.Kelkar,”Software Engineering”, Prentice Hall of India Pvt, 2007.

ANNA UNIVERSITY BE CSE 5TH SEMESTER SYLLABUS REGULATION 2008 2009 UPDATED





ANNA UNIVERSITY CHENNAI : : CHENNAI – 600 025
AFFILIATED INSTITUTIONS
B.E. (8 SEMESTER) COMPUTER SCIENCE AND ENGINEERING
CURRICULUM – R 2008
(Common to all branches of B.E. / B.Tech Programmes
SEMESTER V  SYLLABUS 
(Applicable to the students admitted from the Academic year 2008–2009 onwards)
 TO DOWNLOAD FULL 5TH SEMESTER CSE SYLLABUS PDF DOWNLOAD


CODE NO. COURSE TITLE                     

THEORY


CS2301 Software Engineering            
MA2265 Discrete Mathematics           
CS2302 Computer Networks             
CS2303 Theory of Computation        
CS2304 System Software                  
CS2305 Programming Paradigms       


PRACTICAL


CS2307 Network Lab
CS2308 System Software Lab          
CS2309 Java Lab                                                                  

CS2207 DIGITAL LABORATORY CS2208 DATA STRUCTURES LAB CS2209 OBJECT ORIENTED PROGRAMMING LAB CS 2207 DIGITAL LABORATORY CS 2208 DATA STRUCTURES LAB CS 2209 OBJECT ORIENTED PROGRAMMING LAB



CS 2207 DIGITAL LABORATORY 
 SYLLABUS 0 0 3 2

(Common to CSE & IT)



LIST OF EXPERIMENTS
Verification of Boolean theorems using digital logic gates
Design and implementation of combinational circuits using basic gates for arbitrary functions, code converters, etc.
Design and implementation of 4-bit binary adder / subtractor using basic gates and MSI devices
Design and implementation of parity generator / checker using basic gates and MSI devices
Design and implementation of magnitude comparator
Design and implementation of application using multiplexers/ Demultiplexers
Design and implementation of Shift registers
Design and implementation of Synchronous and Asynchronous counters
Simulation of combinational circuits using Hardware Description Language (VHDL/ Verilog HDL software required)
Simulation of sequential circuits using HDL (VHDL/ Verilog HDL software required)




CS 2208 DATA STRUCTURES LAB 0 0 3 2



Aim:



To develop programming skills in design and implementation of data structures and their applications.



1. Implement singly and doubly linked lists.

2. Represent a polynomial as a linked list and write functions for polynomial addition.

1. Implement stack and use it to convert infix to postfix expression

2. Implement a double-ended queue (dequeue) where insertion and deletion

operations are possible at both the ends.

3. Implement an expression tree. Produce its pre-order, in-order, and post-

order traversals.

4. Implement binary search tree.

5. Implement insertion in AVL trees.

6. Implement priority queue using binary heaps

7. Implement hashing with open addressing.

8. Implement Prim's algorithm using priority queues to find MST of an

undirected graph.



Total: 45







List of Equipments and components for A Batch of 30 students (1 per batch)




SOFTWARE REQUIRED – TURBOC version 3 or GCC version 3.3.4.
OPERATING SYSTEM – WINDOWS 2000 / XP / NT OR LINUX
COMPUTERS REQUIRED – 30 Nos. (Minimum Requirement : Pentium III or Pentium IV with 256 RAM and 40 GB harddisk)



CS 2209 OBJECT ORIENTED PROGRAMMING LAB 0 0 3 2

(Common to CSE & IT)



1. Design C++ classes with static members, methods with default arguments, friend functions. (For example, design matrix and vector classes with static allocation, and a friend function to do matrix-vector multiplication)

2. Implement complex number class with necessary operator overloadings and type conversions such as integer to complex, double to complex, complex to double etc.

3. Implement Matrix class with dynamic memory allocation and necessary methods. Give proper constructor, destructor, copy constructor, and overloading of assignment operator.

4. Overload the new and delete operators to provide custom dynamic allocation of memory.

5. Develop a template of linked-list class and its methods.

6. Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort, and quick sort.

7. Design stack and queue classes with necessary exception handling.

8. Define Point class and an Arc class. Define a Graph class which represents graph as a collection of Point objects and Arc objects. Write a method to find a minimum cost spanning tree in a graph.

9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic polymorphism and RTTI. Write a C++ program that randomly generates complex numbers (use previously designed Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and write the result to another file (one per line).

GE2021 ENVIRONMENTAL SCIENCE AND ENGINEERING GE 2021 ENVIRONMENTAL SCIENCE AND ENGINEERING



GE 2021 ENVIRONMENTAL SCIENCE AND ENGINEERING 
 SYLLABUS 3 0 0 3

(Common to Civil, CSE, IT & Biomedical Degree Programmes)





AIM

The aim of this course is to create awareness in every engineering graduate about the importance of environment, the effect of technology on the environment and ecological balance and make them sensitive to the environment problems in every professional endeavour that they participates.



OBJECTIVE

At the end of this course the student is expected to understand what constitutes the environment, what are precious resources in the environment, how to conserve these resources, what is the role of a human being in maintaining a clean environment and useful environment for the future generations and how to maintain ecological balance and preserve bio-diversity. The role of government and non-government organization in environment managements.



Unit I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 14

Definition, scope and importance of environment – need for public awareness - concept of an ecosystem – structure and function of an ecosystem – producers, consumers and decomposers – energy flow in the ecosystem – ecological succession – food chains, food webs and ecological pyramids – Introduction, types, characteristic features, structure and function of the (a) forest ecosystem (b) grassland ecosystem (c) desert ecosystem (d) aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) – Introduction to biodiversity definition: genetic, species and ecosystem diversity – biogeographical classification of India – value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values – Biodiversity at global, national and local levels – India as a mega-diversity nation – hot-spots of biodiversity – threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts – endangered and endemic species of India – conservation of biodiversity: In-situ and ex-situ conservation of biodiversity.

Field study of common plants, insects, birds

Field study of simple ecosystems – pond, river, hill slopes, etc.



Unit II ENVIRONMENTAL POLLUTION 8

Definition – causes, effects and control measures of: (a) Air pollution (b) Water pollution (c) Soil pollution (d) Marine pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear hazards – soil waste management: causes, effects and control measures of municipal solid wastes – role of an individual in prevention of pollution – pollution case studies – disaster management: floods, earthquake, cyclone and landslides.



Field study of local polluted site – Urban / Rural / Industrial / Agricultural.








Unit III NATURAL RESOURCES 10

Forest resources: Use and over-exploitation, deforestation, case studies- timber extraction, mining, dams and their effects on forests and tribal people – Water resources: Use and over-utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits and problems – Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources, case studies – Food resources: World food problems, changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies – Energy resources: Growing energy needs, renewable and non renewable energy sources, use of alternate energy sources. case studies – Land resources: Land as a resource, land degradation, man induced landslides, soil erosion and desertification – role of an individual in conservation of natural resources – Equitable use of resources for sustainable lifestyles.



Field study of local area to document environmental assets – river / forest / grassland / hill / mountain.



Unit IV SOCIAL ISSUES AND THE ENVIRONMENT 7

From unsustainable to sustainable development – urban problems related to energy – water conservation, rain water harvesting, watershed management – resettlement and rehabilitation of people; its problems and concerns, case studies – role of non-governmental organization- environmental ethics: Issues and possible solutions – climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust, case studies. – wasteland reclamation – consumerism and waste products – environment production act – Air (Prevention and Control of Pollution) act – Water (Prevention and control of Pollution) act – Wildlife protection act – Forest conservation act – enforcement machinery involved in environmental legislation- central and state pollution control boards- Public awareness.



Unit V HUMAN POPULATION AND THE ENVIRONMENT 6

Population growth, variation among nations – population explosion – family welfare programme – environment and human health – human rights – value education – HIV / AIDS – women and child welfare – role of information technology in environment and human health – Case studies.



Total = 45

TEXT BOOKS

1. Gilbert M.Masters, ‘Introduction to Environmental Engineering and Science’, 2nd edition, Pearson Education (2004).

2. Benny Joseph, ‘Environmental Science and Engineering’, Tata McGraw-Hill, New Delhi, (2006).



REFERENCE BOOKS

1. R.K. Trivedi, ‘Handbook of Environmental Laws, Rules, Guidelines, Compliances and Standards’, Vol. I and II, Enviro Media.

2. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’, Jaico Publ., House, Mumbai, 2001.

3. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT LTD, New Delhi, 2007. 4. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press (2005)

CS2204 ANALOG AND DIGITAL COMMUNICATION CS 2204 ANALOG AND DIGITAL COMMUNICATION


CS2204 ANALOG AND DIGITAL COMMUNICATION
 SYLLABUS  3 1 0 4



UNIT I FUNDAMENTALS OF ANALOG COMMUNICATION 9

Principles of amplitude modulation, AM envelope, frequency spectrum and bandwidth, modulation index and percent modulation, AM Voltage distribution, AM power distribution, Angle modulation - FM and PM waveforms, phase deviation and modulation index, frequency deviation and percent modulation, Frequency analysis of angle modulated waves. Bandwidth requirements for Angle modulated waves.

UNIT II DIGITAL COMMUNICATION 9

Introduction, Shannon limit for information capacity, digital amplitude modulation, frequency shift keying, FSK bit rate and baud, FSK transmitter, BW consideration of FSK, FSK receiver, phase shift keying – binary phase shift keying – QPSK, Quadrature Amplitude modulation, bandwidth efficiency, carrier recovery – squaring loop, Costas loop, DPSK.

UNIT III DIGITAL TRANSMISSION 9

Introduction, Pulse modulation, PCM – PCM sampling, sampling rate, signal to quantization noise rate, companding – analog and digital – percentage error, delta modulation, adaptive delta modulation, differential pulse code modulation, pulse transmission – Intersymbol interference, eye patterns.

UNIT IV DATA COMMUNICATIONS 9

Introduction, History of Data communications, Standards Organizations for data communication, data communication circuits, data communication codes, Error control, Error Detection, Error correction, Data communication Hardware, serial and parallel interfaces, data modems, Asynchronous modem, Synchronous modem, low-speed modem, medium and high speed modem, modem control.

UNIT V SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES 9

Introduction, Pseudo-noise sequence, DS spread spectrum with coherent binary PSK, processing gain, FH spread spectrum, multiple access techniques – wireless communication, TDMA and CDMA in wireless communication systems, source coding of speech for wireless communications.



TUTORIAL: 15

TOTAL: 45 +15=60
TEXT BOOKS:

1. Wayne Tomasi, “Advanced Electronic Communication Systems”, 6/e, Pearson Education, 2007.

2. Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons., 2001.
REFERENCES:

1. H.Taub,D L Schilling ,G Saha ,”Principles of Communication”3/e,2007.

2. B.P.Lathi,”Modern Analog And Digital Communication systems”, 3/e, Oxford University Press, 2007

3. Blake, “Electronic Communication Systems”, Thomson Delmar Publications, 2002.

4. Martin S.Roden, “Analog and Digital Communication System”, 3rd Edition, PHI, 2002. B.Sklar,”Digital Communication Fundamentals and Applications”2/e Pearson Education 2007.

CS2203 OBJECT-ORIENTED PROGRAMMING CS 2203 OBJECT-ORIENTED PROGRAMMING



CS 2203 OBJECT-ORIENTED PROGRAMMING 
 SYLLABUS 3 0 0 3

(Common to CSE & IT)



Aim: To understand the concepts of object-oriented programming and master OOP using C++.



UNIT I 9

Object oriented programming concepts – objects – classes – methods and messages – abstraction and encapsulation – inheritance – abstract classes – polymorphism.

Introduction to C++ – classes – access specifiers – function and data members – default arguments – function overloading – friend functions – const and volatile functions - static members – Objects – pointers and objects – constant objects – nested classes – local classes



UNIT II 9

Constructors – default constructor – Parameterized constructors – Constructor with dynamic allocation – copy constructor – destructors – operator overloading – overloading through friend functions – overloading the assignment operator – type conversion – explicit constructor



UNIT III 9

Function and class templates - Exception handling – try-catch-throw paradigm – exception specification – terminate and Unexpected functions – Uncaught exception.



UNIT IV 9

Inheritance – public, private, and protected derivations – multiple inheritance - virtual base class – abstract class – composite objects Runtime polymorphism – virtual functions – pure virtual functions – RTTI – typeid – dynamic casting – RTTI and templates – cross casting – down casting .



UNIT V 9

Streams and formatted I/O – I/O manipulators - file handling – random access – object serialization – namespaces - std namespace – ANSI String Objects – standard template library.





Total: 45

Text Books:



1. B. Trivedi, “Programming with ANSI C++”, Oxford University Press, 2007.



References:



1. Ira Pohl, “Object Oriented Programming using C++”, Pearson Education, Second Edition Reprint 2004..

2. S. B. Lippman, Josee Lajoie, Barbara E. Moo, “C++ Primer”, Fourth Edition, Pearson Education, 2005. B. Stroustrup, “The C++ Programming language”, Third edition, Pearson Education, 2004.

CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN



CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN
 SYLLABUS  3 1 0 4

(Common to CSE & IT)



AIM

To provide an in-depth knowledge of the design of digital circuits and the use of Hardware Description Language in digital system design.

OBJECTIVES
To understand different methods used for the simplification of Boolean functions
To design and implement combinational circuits
To design and implement synchronous sequential circuits
To design and implement asynchronous sequential circuits
To study the fundamentals of VHDL / Verilog HDL



UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 8

Review of binary number systems - Binary arithmetic – Binary codes – Boolean algebra and theorems - Boolean functions – Simplifications of Boolean functions using Karnaugh map and tabulation methods – Implementation of Boolean functions using logic gates.



UNIT II COMBINATIONAL LOGIC 9

Combinational circuits – Analysis and design procedures - Circuits for arithmetic operations - Code conversion – Introduction to Hardware Description Language (HDL)



UNIT III DESIGN WITH MSI DEVICES 8

Decoders and encoders - Multiplexers and demultiplexers - Memory and programmable logic - HDL for combinational circuits



UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC 10

Sequential circuits – Flip flops – Analysis and design procedures - State reduction and state assignment - Shift registers – Counters – HDL for Sequential Circuits.



UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC 10

Analysis and design of asynchronous sequential circuits - Reduction of state and flow tables – Race-free state assignment – Hazards. ASM Chart.



TUTORIAL = 15 TOTAL : 60


TEXT BOOKS

1. M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, 2007.



REFERENCES

1. Charles H.Roth, Jr. “Fundamentals of Logic Design”, 4th Edition, Jaico Publishing

House, Cengage Earning, 5th ed, 2005.

2. Donald D.Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2007.

CS 2201 DATA STRUCTURES CS2201 DATA STRUCTURES




CS 2201 DATA STRUCTURES  SYLLABUS 3 1 0 4



Aim: To master the design and applications of linear, tree, balanced tree, hashing, set, and graph structures.

Unit I Linear Structures 9


Abstract Data Types (ADT) – List ADT – array-based implementation – linked list implementation – cursor-based linked lists – doubly-linked lists – applications of lists – Stack ADT – Queue ADT – circular queue implementation – Applications of stacks and queues


Unit II Tree Structures 9


Tree ADT – tree traversals – left child right sibling data structures for general trees – Binary Tree ADT – expression trees – applications of trees – binary search tree ADT – Threaded Binary Trees.



Unit III Balanced Trees 9

AVL Trees – Splay Trees – B-Tree - heaps – binary heaps – applications of binary heaps


Unit IV Hashing and Set 9

Hashing – Separate chaining – open addressing – rehashing – extendible hashing - Disjoint Set ADT – dynamic equivalence problem – smart union algorithms – path compression – applications of Set



Unit V Graphs 9

Definitions – Topological sort – breadth-first traversal - shortest-path algorithms – minimum spanning tree – Prim's and Kruskal's algorithms – Depth-first traversal – biconnectivity – Euler circuits – applications of graphs



Total: 45





TEXT BOOK

1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition , Pearson Education, 2005.



REFERENCES



1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”,

Pearson Education, First Edition Reprint 2003.

2. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India

Edition, 2005.
Related Posts Plugin for WordPress, Blogger...

Subscribe via email

FREE SMS ALERTS

CLICK HERE

Custom Search