B.Tech. (Computer Science & Engineering)
Programme Structure & Syllabi
Third Semester
Course Code / Course Name / L / T / P / C / Exam.Duration / Relativeweightage (%)
Th / P / CWS / PRS / MTE / ETE / PRE
MA1302 / Engineering Mathematics-III / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1301 / Computer Organization & Architecture / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1302 / Switching Theory & Logic Design / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1303 / Data Structures / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1304 / Object Oriented Programming(java) / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1330 / Switching Theory & Logic Design Lab. / 0 / 1 / 2 / 2 / 1.5 / - / 60 / - / - / 40
CS1331 / Data Structures Lab. / 0 / 1 / 2 / 2 / 1.5 / - / 60 / - / - / 40
CS1332 / Object Oriented Programming(java) Lab / 0 / 1 / 2 / 2 / 1.5 / - / 60 / - / - / 40
Total / 15 / 8 / 6 / 26
Fourth Semester
Course Code / Course Name / L / T / P / C / Exam.Duration / Relativeweightage (%)
Th / P / CWS / PRS / MTE / ETE / PRE
MA1402 / Engineering Mathematics IV / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1401 / Operating Systems / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1402 / Relational Database Management Systems / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
CS1403 / Microprocessors / 3 / 1 / 0 / 4 / 3 / 10 / - / 40 / 50 / -
------/ Open Elective-I / 3 / 0 / 0 / 3 / 3 / 10 / - / 40 / 50 / -
CS1430 / Operating System Lab / 0 / 1 / 2 / 2 / 1.5 / - / 60 / - / - / 40
CS1431 / Relational DBMS Lab / 0 / 1 / 2 / 2 / 1.5 / - / 60 / - / - / 40
CS1432 / Microprocessors Lab / 0 / 1 / 2 / 2 / 1.5 / - / 60 / - / - / 40
Total / 15 / 7 / 6 / 25
Fifth Semester
Course Code / Course Name / L / T / P / C / Exam.Duration / Relative weightage (%)
Th / P / CWS / PRS / MTE / ETE / PRE
CS1501 / Design & Analysis Of Algorithms / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1502 / Software Engineering / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1503 / Computer Graphics / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1504 / Formal Languages And Automata Theory / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
IT1504 / Data Communications / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1530 / Design & Analysis Of Algorithms Lab. / 0 / 1 / 2 / 2 / - / 1.5 / 60 / 40
CS1531 / Computer Graphics Lab / 0 / 1 / 2 / 2 / - / 1.5 / 60 / 40
CS1532 / Software Engineering Lab / 0 / 1 / 2 / 2 / - / 1.5 / 60 / 40
Total / 15 / 8 / 6 / 26
Sixth Semester
Course Code / Course Name / L / T / P / C / Exam.Duration / Relative weightage (%)
Th / P / CWS / PRS / MTE / ETE / PRE
CS1601 / Language Processors / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1602 / Computer Networks & Protocols / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1603 / Parallel Processing / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
------/ Open Elective-II / 3 / 0 / 0 / 3 / 3 / - / 10 / - / 40 / 50 / -
CS16xx / Program Elective –I / 3 / 0 / 0 / 3 / 3 / - / 10 / - / 40 / 50 / -
CS16xx / Program Elective -II / 3 / 0 / 0 / 3 / 3 / - / 10 / - / 40 / 50 / -
CS1630 / Language Processors Lab. / 0 / 1 / 2 / 2 / - / 1.5 / 60 / 40
CS1631 / Computer Networks &Protocols Lab. / 0 / 1 / 2 / 2 / - / 1.5 / 60 / 40
CS1632 / Parallel Processing Lab. / 0 / 1 / 2 / 2 / - / 1.5 / 60 / 40
Total / 18 / 6 / 6 / 27
Seventh Semester
Course Code / Course Name / L / T / P / C / Exam.Duration / Relative weightage (%)
Th / P / CWS / PRS / MTE / ETE / PRE
MB1721 / Essentials of Management & Engineering Economics / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1701 / Big Data Analytics / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS1702 / Object Oriented Analysis & Design / 3 / 1 / 0 / 4 / 3 / - / 10 / - / 40 / 50 / -
CS17xx / Program Elective III / 3 / 0 / 0 / 3 / 3 / - / 10 / - / 40 / 50 / -
CS17xx / Program Elective-IV / 3 / 0 / 0 / 3 / 3 / - / 10 / - / 40 / 50 / -
CS1730 / Big Data Analytics Lab / 0 / 1 / 2 / 3 / - / 1.5 / 60 / 40
CS1731 / Object Oriented Analysis & Design Lab / 0 / 1 / 2 / 3 / - / 1.5 / 60 / 40
CS1779 / Mini project / 0 / 0 / - / 3 / 100#
Total / 18 / 5 / 4 / 26
Eighth Semester
Course Code / Course Name / L / T / P / C / Exam.Duration / Relative weightage (%)
Th / P / CWS / PRS / MTE / ETE / PRE
CS1881 / Major Project / 0 / 0 / - / 20 / 25# / 75##
TOTAL / 0 / 0 / - / 20
*will be done in the summer and evaluated in eighth semester
Note:- # Midterm presentation.
## Final presentation
Project work evaluation (mid semester evaluation) = 100 marks (Committee=Guide+HOD+Co ordinator)
Project work evaluation (end semester evaluation) = 300 marks (100 marks for Report evaluation+100 mark for Guide + Viva-voce = 100 marks (Jointly)
L = Number of Lectures hrs/weekP = Number of practical hours/week
CWS: Class Work Sessionals
MTE: Mid-Term Exam
PRE: End Term Practical Exam / T= Number of Tutorials hrs/week
C= Number of Credits.
PRS: Practical Sessionals
ETE: End Term Exam
* Presentations Only
Open Electives
CS1690 Principles of Programming Languages
CS1691 Programming in C++
CS1692 Programming in Java
CS1693 Linux Basics and Programming
CS1694 Web 2.0 and Rich Internet Applications
CS1695 Information Retrieval
CS1696 Database Management Systems
CS1697Principles of Software Engineering
Program Electives
ELECTIVE I:
CS1650 Digital Image Processing
CS1651 Information Retrieval
ELECTIVE II:
CS1652Distributed Systems
CS1653Cloud Computing Infrastructure Services
ELECTIVES III
CS1750Artificial Intelligence
CS1751Advanced Internet Technology
ELECTIVE IV
CS1752Cryptography & Network Security
CS1753Mobile computing
Note: A few Electives from the above list will be offered depending on the availability of Faculty.
1st year Credits:52
2nd-4th year credits:150
Total credits:202
SYLLABI
MA1302 ENGINEERING MATHEMATICS-III [31 0 4]
Boolean Algebra, subalgebra, Direct product & Homomorphism, Lattices and Algebraic Systems, properties of Lattices and related theorem, Statements and Notations, Tautologies and contradictions, equivalence of formulas, Tautological implications, Theory of inference, rules of inference, statement function, variables and quantifiers, Predicate Calculus, Permutations and Combinations, Generating function, Principle of inclusion and exclusion, Partitions, compositions, Lexicographical and Fikes ordering of permutations, Algorithms for generating functions, Graph theory, path, cycle, Basic theorems, Dijkstra’s Algorithms, Group theory, semigroups and monoids, Permutation groups, cyclic groups.
Text Books:
- J. P. Tremblay and R. Manohar, Discrete Mathematics Structures with Application to computer Science, Tata Mc Graw Hill, 2001.
References:
- C. L. Liu, Elements of Discrete Mathematics, Mc Graw Hill, 2008.
- E. P. Page and L. B. Wilson, An introduction to computational combinatorics, Cambridge Univ. Press, 1979.
CS1301 COMPUTER ORGANIZATION AND ARCHITECTURE [3 1 0 4]
Basic Structure of computers: Computer types, functional units, basic operational concepts, bus structures, software, performance; Machine Instructions and programs: Numbers, arithmetic operations and characters, Memory locations and addresses; Memory operations, Addressing modes; Arithmetic: Addition and subtraction of signed numbers, Adders, ALU design, Bit slice processor, Multiplication of positive numbers Signed operand multiplication, Fast multiplication, Integer division, Floating point numbers and operations; Memory Systems: Introduction, Basic concepts, Design methods; RAM memories, Read only memories, Speed size and cost, Cache memories, Performance considerations, Virtual memories, Memory, Management Requirements, Secondary storage; Input/Output organization: Accessing I/O devices, Interrupts, Direct memory access, Buses, Interface circuits
References:
1. C. Hamacher, Z. Vranesic, “Computer Organization”, TMH, 2002.
2. W. Stallings, “Computer Organization and Architecture –Designing for Performance”, PHI, 2009.
CS1302 SWITCHING THEORY & LOGIC DESIGN [3 1 0 4]
Introduction to logic circuits: Variables and functions, Inversion, Truth tables, Logic gates and networks, Boolean algebra, Introduction to VHDL; Optimized implementation of logic functions: Synthesis using AND OR and NOT gates, Karnaugh map, Strategy for minimization, Minimization of POS forms, Incompletely Specified Functions, Multiple output circuits NAND and NOR logic networks, multilevel NAND and NOR circuits, Analysis of multilevel circuits; Number representation and arithmetic circuits: Positional number representation, Addition of unsigned numbers, Signed numbers, Fast adders, Design of arithmetic circuits using VHDL, BCD representation; Combinational-Circuit building blocks: Multiplexer, decoder, Encoder, Code converter, Arithmetic comparison circuits, VHDL for Combinational Circuits; Flip Flops, Registers, Counters; Overview of semiconductor diode: BJT, MOSFET, TTL–standard, High speed, low-power, low-power schottky, CMOS logic-NAND, NOR
References:
- S. Brown and Z. Vranesic, “Fundamentals of Digital Logic with VHDL Design”, TMH, 2000.
- M. Mano, “Digital Design”, PHI Pvt. Ltd., 3rd Edition, 2000.
- P. Leach, A. Malvino, G. Saha, “Digital Principles and Applications”, TMH, 6th Edition, 2006.
- J. Bhasker, “A VHDL Primer”, PHI Pvt. Ltd., 3rd Edn, 2005.
CS1303 DATA STRUCTURES [3 1 0 4]
Introduction: Algorithm specification; Performance Analysis: Time and Space Complexity, Asymptotic notation; pointer declaration and definition, memory allocation functions, array of pointers; The type definition, enumerated types, accessing structures, complex structures, arrays of structures, structures and functions; Recursive definition & processes, Recursion in C, writing recursive programs efficiency of recursion, Examples: Tower of Hanoi, GCD, Fibonacci Definition and examples, Representing stacks in C, Evaluation of expressions, multiple stacks and queues; Applications: infix, postfix and prefix and their conversions Linked lists representations, Singly, doubly, header node, circular, Applications: linked stacks and queues, polynomial and long integer arithmetic, union, intersection, Basic terminologies, binary tree representation, recursive/ non recursive, Binary search tree, AVL trees; Applications: Expression trees, inserting, deleting, searching, height of BST Terminology and representations, Graph operations, spanning trees, minimum cost spanning tree, shortest path and transitive closure, Binary and linear search, insertion, quick, merge, heap, radix sort Static Hashing
References:
1. A. Forouzan, R. F. Gilberg, “A Structured Programming Approach Using C”, Thomson, 2003.
2. A. Tenenbaum, J. Augenstein, “Data Structures using C”, Pearson Education, 2006.
3. E. Horowitz, S. Sahni, “Fundamentals of Data Structures in C”, Silicon Press, 2nd Edn, 2007.
CS1304 OBJECT ORIENTED PROGRAMMING USING JAVA [3 1 0 4]
The History and Evolution of java: The Creation of Java, how java changed the internet, Java’s Magic, Servlets, The java Buzzwords; An Overview of Java, arrays; Introduction to classes: Class fundamentals, declaring objects, Assigning Object reference variables, Introduction to methods, Constructors, this keyword, Garbage collection, finalize() method, Overloading, objects as parameters, argument passing, returning objects, recursion, access control, final, nested and inner classes, string class; I/O Basics: Reading Console Input, Writing Console Output, Files, Applet fundamentals; Inheritance: basics, super, multilevel hierarchy, overriding, abstract classes, final with inheritance; Packages and Interfaces, Exception Handling, Multithreaded programming; String Handling, Applet Class, Event Handling; Introduction to AWT: Classes, component, Container, Panel, Window, frame, Canvas, working with frame, working with Graphics, using AWT Controls.
References:
- Herbert Schildt , “The Complete Reference JavaEight Edition”, Tata McGraw-Hill, reprint 2011
- Steven Holzner, “Java 2 programming black book” , DreamTech, NewDelhi, reprint: 2005.
CS1330 SWITCHING THEORY& LOGIC DESIGN LAB [0 1 2 2]
Simulation of the following logic circuits using VHDL code MAX+ and Verification of logic gates and Boolean algebra; Boolean algebra, Simplification of expressions using Kmap. Experiments on multilevel NAND, NOR circuits; Arithmetic circuits; multiplexers and Multiplexer Applications.
References:
1. S. Brown and Z. Vranesic, “Fundamentals of digital logic with VHDL design”, TMH, 2000.
2. J. Bhasker, “A VHDL Primer”, PHI Pvt. Ltd., 3rd Edition, 2005.
CS1331 DATA STRUCTURES LAB [0 1 2 2]
Review of C and programs on Recursion, Stacks, Stacks, Queues, lists, Trees, Graphs, using C language.
References:
1. A. Forouzan, R. F. Gilberg, “A Structured Programming Approach Using C, Thomson”, 2nd Edition, 2003.
2. A. Tanenbaum, J. Augeustein, “Data Structures using C”, Pearson Education, 2006.
3. E. Horowitz, S. Sahni, “Fundamentals of Data Structures in C”, Silicon Press, 2nd Edition, 2007.
CS1332 OBJECT ORIENTED PROGRAMMING USING JAVA LAB [0 1 2 2]
Control statements and arrays,Stacks and Lists,Strings, Classes and methods,Inheritance, Packages,Interfaces, Exception Handling, Threads, Input/Output, Event Handling,Applets, involving AWT, Programs involving AWT
References:
Herbert Schildt , “The Complete Reference Java Eight Edition”, Tata McGraw-Hill, reprint 2011
MA1402 ENGINEERING MATHEMATICS-IV [31 0 4]
Probability, distributions, Moment generating functions, functions of random variables, F and T distributions, Sampling distribution, Central limit theorem, Point estimation, MLE, interval estimation, Test of Hypothesis, significance level, certain best tests, Stichastic process, classification of statistics of stochastic process, stationary and Ergodic process.
Text Books:
- P. L. Meyer, Introduction to Probability and Statistical Applications, Addison-Wesley Pub. Co., 1970.
References:
1. K. S. Trivedi, Probability, Statistics with Reliability, Queuing and computer science applications, PHI, 2002.
2. Miller, Fruend and Johnson, Probability and Statistics for Engineers, PHI 2009.
CS1401 OPERATING SYSTEMS [3 1 0 4]
Introduction: Functions, Operating System Structure and Operations, Process Management, Memory Management, Storage Management, Protection and Security, Special Purpose Systems, Operating System Services, User Operating System Interfaces, System Calls, Types of System Calls, System Programs, Operating System Structure, Virtual Machines, System Boot; Processes: Concept, Process Scheduling, Operations on Processes, Inter-process Communication Overview, Multithreaded Models, Thread Libraries, Threading Issues, Linux Threads, Basic Concepts; CPUScheduling: Scheduling Algorithms, Thread Scheduling, Linux Scheduling, Algorithm Evaluation Background, Critical Section Problem; Memory management: Contiguous Memory Allocation, Paging, Page Table Structure, Segmentation, Examples: The Intel Pentium; Background, Demand Paging, Copy-On-Write, Page Replacement, Allocation of Frames, Thrashing, Allocating Kernel Memory, Other Consideration; Files: Access Methods, Directory Structure, File System, Access Matrix, Implementation of Access Matrix; Security Problem: Program Threats, System and Network threats, User Authentication Design Principles, Kernel Modules, Process Management, Scheduling, Memory Management, File Systems, Inter-process Communication, Security
References:
1. A. Silberschatz, P. B. Galvin, “Operating System Concepts”, International student version, Wiley India Student Edition, Eighth Edition, 2009.
2. W. Stallings, “Operating Systems: Internals and Design Principles”, Pearson Ed., 2009.
3. J. Harris, “Operating Systems”, Tata McGraw-Hill publications, 2002.
CS1402 RELATIONAL DATABASE MANAGEMENT SYSTEMS [3 1 0 4]
Introduction: Database-System Applications, Relational Databases, Database Design, Data Storage and Querying, Transaction Management, Database Architecture; Relational Algebra: Fundamental Relational-Algebra Operations, Extended Relational-Algebra Operations, Null Values, Modification of the Database; SQL: Data Definition Language, Data manipulation language , SQL Data Types and Schemas, Integrity Constraints, Basic Structure of SQL Queries, Set Operations, Aggregate Functions, Null Values, Nested Sub-queries, Complex Queries, Views, Modification of the Database, Joined Relations, Authorization, Overview of the Design Process; The Entity-Relationship Model: Constraints, Entity-Relationship Diagrams, Entity-Relationship Design Issues, Weak Entity Sets, Extended E-R Features; Hashing Techniques: Dynamic Hashing; Transactions: Transaction State, Implementation of Atomicity and Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation, Testing for Serializability, Lock-Based Protocols, Log-Based Recovery, Recovery algorithms
References:
1. S. Korth, “Database System Concepts”, Mc-GrawHill, 6th Edition, 2011.
2. R. Elmasri, S. Navathe, “Fundamentals of Database Systems”, Pearson Education, 2006.
3. T. Connolly, C. Begg, “Database Systems–A Practical Approach to Design, Implementation and Management”, Pearson Education, 3rd Edition, 2002.
.
CS1403 MICROPROCESSORS [3 1 0 4]
8086: internal architecture, programming the 8086, Addressing modes,Flags; Instruction Set: assembler and Assembler directives, Simple sequence programs, Jumps and conditional jumps, Loop instructions, Instruction timing and delay loops; String instructions, Writing and Using Procedures and Macros, Interrupts and Interrupt Responses: 8259 Priority Interrupt Controller, 8254 Software-Programmable Timer/counter; Software interrupts, DOS 21h functions; Timing and Functional diagram: reset and wait state, Min and Max mode operation, Min and max mode input, output timing diagrams; 8255: Programmable Parallel ports and Handshake Input/ Output, 8087 Math Coprocessor, ISA Bus, PCI Bus, USB Bus, Accelerates graphics port (AGP) Architecture, Real address and PVAM mode, Task protection and Task Switching, Paging, Architecture, addressing modes, Instruction set, Simple assembly language programs
References:
1. D. V. Hall, “Microprocessors and Interfacing”, TMH, Revised Second Edition, 2006.
2. B. B. Brey, “The Intel Microprocessors”, Seventh Edition, Prentice Hall India, 2005.
3. A. Clements, “Microprocessor system design 68000 Hardware”, Software, and Interfacing, PWS Publishing Company, Third Edition, 1997.
CS1430 OPERATING SYSTEMS LAB [0 1 2 2]
Testing the use of UNIX commands, UNIX shell commands, Basics of Shell Programming, UNIX System Calls, CPU Scheduling Algorithms, Deadlock Detection Algorithms, Deadlock Avoidance Algorithms, Page Replacement Algorithms, Memory Allocation Algorithms, Disk Scheduling Algorithms, UNIX Inter Process Communication.
References:
1. A. Silberschatz, P. B. Galvin, “Operating System Concepts”, International student version, Wiley India Student Edition, Eighth Edition, 2009.
2. W. Stallings, “Operating Systems: Internals and Design Principles”, Pearson Ed., 2009.
3. J. Harris, “Operating Systems”, Tata McGraw-Hill publications, 2002.
CS1431 RELATIONAL DBMS LAB [0 1 2 2]
DB application development with MS Access, Experiments on DDL and Basic SQL, Advanced SQL, ER diagrams using DIA tool, Data Integrity Constraints and Built-in Functions, Design and Implementing the data requirements of a simple DB application, Experiments on Basic PL/SQL, PL/SQL Exceptions and Transactions, PL/SQL Cursors, PL/SQL Procedures, Functions and Packages, DB application development with Java as front end
References:
1. S. Korth, “Database System Concepts”, McGrawHill, 6th Edition, 2011.
2. R. Elmasri, S. Navathe, “Fundamentals of Database Systems”, Pearson Education, 2006.
3. T. Connolly, C. Begg, “Database Systems–A Practical Approach to Design”, Implementation and Management, Pearson Education, 3rd Edition, 2002.
CS1432 MICROPROCESSORS LAB [0 1 2 2]
Basics of Assembly Programming, Programs using Addition, Subtraction and Branching Instructions, Operations on BCD and ASCII data (Packing, Unpacking, Conversion between BCD and ASCII), Multiplication and Division List Operations (Arrays) String Operations, DOS and BIOS interrupts – String Operations DOS interrupts – Integer Operations and file operations, Logic Controller Interfacing, DAC Interfacing Elevator Interfacing
References:
1. Respective User Manual for the kit.
CS 1501Design & Analysis of Algorithms [3 1 0 4]
Algorithm Analysis: A priori and a posteriori Analysis, Time Space Tradeoff, Asymptotic Notations, Properties of asymptotic notations, Recurrence equations, Solving recurrence equations using Substitution method and Master’s method, Divide and Conquer: Binary Search, Finding Maximum and Minimum, Merge Sort, Quick Sort, Matrix Multiplication, Greedy Algorithms: Knapsack Problem, Job Sequencing with deadline, Optimal Merge Pattern, Single Source Shortest Path, Minimum Cost Spanning tree, Dynamic Programming: Multistage Graphs, Matrix Chain Multiplication, All-Pair shortest paths, Optimal binary search trees, 0/1 Knapsack, Travelling salesperson problem, Graph Traversals, Connected Components, SpanningTrees, Bi-connected components, Introduction to NP-Hard and NP-Completeness.
TEXT BOOKS:
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms C++, Second Edition, Universities Press, 2007.
2. K.S. Easwarakumar, Object Oriented Data Structures using C++, Vikas PublishingHouse pvt. Ltd., 2000
REFERENCES:
1. T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, "Introduction to Algorithms",Second Edition, Prentice Hall of India Pvt. Ltd, 2003.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "The Design and Analysis ofComputer Algorithms", Pearson Education, 1999.
CS1502 SOFTWARE ENGINEERING [3 1 0 4]
Introduction: The Evolving Role of Software, The changing nature of software, Legacy software, Software Myths, Software Engineering: A Layered Technology, A Process Framework, The Capability Maturity Model Integration (CMMI), Specialized Process Models, The Unified Process; Agile development: Agile Process Models Software Engineering Practice, Communication Practice, Planning Practices, Modeling Practices, Construction Practice, Deployment Computer–Based Systems, The System Engineering Hierarchy, Business Process Engineering: An Overview; Product Engineering: An Overview, Data Modeling Concepts, Object Oriented Analysis, Flow-Oriented Modeling, Taxonomy of Quality Attributes, Perspectives of Quality, Quality System, Software Quality Assurance, Capability Maturity Model Observation on Estimation, The Project Planning Process, Software Scope and Feasibility, Human Resources, Empirical Estimation Model
References:
1. R. Pressman, “Software Engineering: A Practitioners Approach”, McGrawHill Pubs, 2000.