EINSTEIN COLLEGE OF ENGINEERING Vth Semester Syllabus ...

Vth Semester Syllabus 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. 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).
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 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.
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.
CS 2305 PROGRAMMING PARADIGMS CS2305 PROGRAMMING PARADIGMS
CS2305 PROGRAMMING PARADIGMS SYLLABUS