CSE 5th Sem
CSE 5th Sem
CSE 5th Sem
04(1)
AFFILIATED INSTITUTIONS
CURRICULUM – R 2008
SEMESTER V
(Applicable to the students admitted from the Academic year 2008–2009 onwards)
47
CS2301 SOFTWARE ENGINEERING LTPC
3003
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
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.
48
MA2265 DISCRETE MATHEMATICS
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.
49
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)
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).
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
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 BOOKS :
50
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
3104
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 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.
REFERENCES:
51
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
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.
52
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.
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.
53
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
TEXT BOOK
1. Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – Fundamentals”,
Eighth Edition, Sun Microsystems Press, 2008.
REFERENCES
54
CS2307 NETWORKS LAB
LTPC
0032
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
1. SOFTWARE
C++ Compiler 30
J2SDK (freeware)
Linux
NS2/Glomosim/OPNET
(Freeware)
2. Hardware 30 Nos
PCs
55
CS2308 SYSTEM SOFTWARE LAB
LTPC
0 0 3 2
(Using C)
Implement a symbol table with functions to create, insert, modify, search, and
display.
1. Implement pass one of a two pass assembler.
2. Implement pass two of a two pass assembler.
Implement a single pass assembler.
Implement a two pass macro processor
Implement a single pass macro processor.
3. Implement an absolute loader.
4. Implement a relocating loader.
5. Implement pass one of a direct-linking loader.
6. Implement pass two of a direct-linking loader.
7. Implement a simple text editor with features like insertion / deletion of a
character, word, and sentence.
8. 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)
Total= 45 Periods
Requirement for a batch of 30 students
Software – Turbo C
2. Multiuser
(Freely download)
56
CS2309 JAVA LAB
LTPC
0032
Total= 45 Periods
57
Requirement for a batch of 30 students
1. PC’s 30
58