VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

Information Technology

II B.Tech. II Semester (IT) 2016-17

ACADEMIC PLAN

1. Formal Languages and Automata Theory

2. Data Base Management Systems

3. Computer Organization

4. Design and Analysis of Algorithms

5. Software Engineering

6. JAVA Programming
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
(Autonomous)
DEPARTMENT OF INFORMATION TECHNOLOGY

II B. Tech, Ist Semester (Information Technology)

Subject : Formal Languages and Automata Theory
Subject Code : 5CS04
Academic Year : 2016 – 17
Number of working days : 90
Number of Hours / week :3+1
Total number of periods planned : 72
Name of the Faculty Member : R.Vijaya Saraswathi, K.Bheemalingappa, B.Swetha

Course Objectives:
 Explain the theoretical foundations of computer science concerning– the relationships between
languages and machines, the inherent limits of what can be computed, and the inherent efficiency of
solving problems.
 Identify a language’s location in the Chomsky hierarchy (regular sets, context-free, context-
sensitive, and recursively enumerable languages).
 Convert among equivalently powerful notations for a language, including among DFAs, NFAs,
and regular expressions, and between PDAs and CFGs.
 Build the foundation for students to pursue research in the areas of automata theory, formal
languages, and computational power of machines.

Course Outcomes (COs): Upon completion of this course, students should be able to:
 List computational devices according to their computational power, and tools which will allow us
to tell if a device is powerful enough to solve a given computational problem.
 Relate the concept of the grammar with the concept of programming language.
 Design Solutions for problems related to Finite Automata, RE, CFG, PDA and Turing Machine.
 Analyze various problems and categorize them into P, NP, NP-Complete and NP-Hard problems.

UNIT : I

Syllabus:
Fundamentals: strings, Alphabet, Language, Operations, Chomsky hierarchy of languages,
Finite state machine Definitions, finite automation model, acceptance of strings and languages,
DFA and NFA, transition diagrams and language recognizers. NFA with ε transitions –
Equivalence between NFA with and without ε transitions, NFA to DFA conversion, minimization
FSM, equivalence between two FSM’s, Output machines- Moore and Mealy machine.

Learning Objectives: After completion of the unit, the student must able to:
 Understand the defining and differentiating the strings
  Use the different types of operators in the languages
 Understand the finite automation model
 Analyze the language recognition tools
 List out the differences between DFA and NFA
 Solve the problems related to DFA and NFA
 Understand the process how to convert the NFA to DFA so that you can write the
equivalent DFA for the NFA.
 Learn the procedure to minimize the DFA
 Learn the output machines: Moore and Mealy machines

Lecture Plan

S.No. Description of Topic No. of Hrs. Method of Teaching

st
1. Fundamentals: Strings, Operations 1 hour Black board+PPT
2. Finite state automation 2nd hour Black board
3. Finite automation model, acceptance of strings 3rd hour Black board

4. DFA and NFA problems 4th hour Black board

5. Transition Diagrams 5th hour Black board
6. NFA with ε transition 6th & 7th hour Black board
7. NFA to DFA Conversion and related problems 8th & 9th hour Black board
8. NFA and DFA equivalence 10th & 11th hour Black board
th th
9. DFA minimization 12 & 13 hour Black board
10. Finite Automata with output machines 14th & 15th hour Black board

Assignment – 1

1. Explain the Finite automation how the language constructs can be recognized?
2. List out the Finite automates?
3. Define: string, sub string, transitive closure, and reflexive transitive closure
4. Describe the finite state machine with a block diagram.
5. Explain the procedure to convert NFA to DFA.
6. What are the Finite automates with output and explain them with the suitable
Examples.
7. Explain the procedure to minimize the DFA for the given regular expression.

UNIT : II

Syllabus:
Regular Languages : Regular Sets , Regular Expressions , identity Rules, Constructing Finite
automata for a given regular expressions, Conversion of Finite automata to regular expressions,
Pumping lemma of regular sets , closure properties of regular sets (proofs not required). Regular
Grammars – right linear and left linear grammars, equivalence between regular grammar and FA.

Learning Objectives: After completion of the unit, the student must able to:
  Understand the regular expressions

 Learn the usage of identity rules

 Learn the conversion procedure for RE to Finite automata.

 Understand the concept of pumping Lemma

 Define the grammar and types of grammars

 Understand the relation between the RE and FA

Lecture Plan

S.No. Description of Topic No. of Hrs. Method of Teaching

th
1. Regular sets 16 hour PPT+Blackboard
2. Identity rules and problems 17th hours PPT+Blackboard
3. Finite automata for a given regular expression 18th hours PPT+Blackboard
4. Conversion of regular expression to finite automata 19th & 20th hours Black board
5. pumping lemma 21th & 22th hours PPT+Blackboard
6. Closure properties 23th hours Black board
7. Grammar 24nd & 25rd hours PPT+Blackboard
8. Equivalence between Regular Grammar and FA 26th & 27th hours PPT+Blackboard
9. Context Free grammar 28th & 29th hours PPT+Blackboard
10. Derivation and derivation trees 30th & 31th hours PPT+Blackboard

Assignment – 2
1. Define the Regular Expression.
2. Write the Identity Rules for RE
3. Construct the FA for the Regular Expression (a/b)*abb.
4. Obtain the minimized DFA for the RE (a/b)*abb.
5. Explain the Pumping Lemma for the regular sets.
6. What are the properties of regular sets.
7. Define the grammar and what are the types of grammars
8. Consider the grammar E->E + E | E * E | id.
write the right-most derivation and left most derivation for the sentence id*id+id.

UNIT : III

Syllabus:
Context Free Grammar, derivation trees, sentential forms, right most and left most derivations of
strings. Ambiguity in Context free Grammars. Minimization of Context free grammars, CNF,
 GNF, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL (proofs
omitted).
Push Down Automata- definition, model, acceptance of CFL, Acceptance by final state and
acceptance by empty state and its equivalence, Equivalence of CFL and PDA (proofs not
required), Introduction to DCFL and DPDA.

Learning Objectives: After completion of the unit, the student must able to:
 Know what is meant by ambiguity.

 Learn the Chomsky Normal forms

 Learn the Greiback Normal Forms

 Understand the pumping Lemma for CFG

 Learn the purpose of push down automata

 Understand the acceptance of CFL

 Understand the acceptance of finite state and empty state

 Gain the knowledge on CFL and PDA

Lecture Plan

S.No. Description of Topic No. of Hrs. Method of Teaching

1. Ambiguity in CFG 32nd hour Black board
2. Minimization of CFG 33rd&34th hours Black board
3. CNF and GNF 35th &36th hour Black board +PPT
4. Pumping Lemma for CFG 37th -38th hour Black board +PPT
5. Properties of CFL 39th hours Black board +PPT
6. Push down automata 40st hours Black board +PPT
7. Acceptance of CFL 41th&42th hours PPT + Video
8. Acceptance by finite state and acceptance by empty 43rd &44th hours Black board + Notes
state and its equivalence
9. Equivalence of CFL and PDA 45th -47th hours Black board + Notes

Assignment – 3

1. What is an ambiguity?
2. What does an ambiguity trouble in the CFG?
3. What are the techniques used to minimize the CFG
4. Explain the CNF and GNF with an example.
5. Explain the concept of push down automata
6. Write the push down automata to accept the language {ww* | w ε {0, 1}}
7. Explain the equivalence of CFL and PDA.

UNIT : IV

Syllabus:
Turing Machine: Definition, model, Design of TM, computable functions, recursively
enumerable languages. Church’s hypothesis, counter machine, types of Turing Machines (proofs
not required)

Learning Objectives: After completion of the unit, the student must able to:
 Learn the Turing machine design
 Usages of computation functions
 Learn recursively enumerable languages
 Understand the church’s hypothesis.
 Understand the counter machines.

Lecture Plan
S. No. Description of Topic No. of Hrs. Method of Teaching
1. Turing machine 48th & 49th hours Black board +PPT
2. Design of Turing Machine 50th – 52nd hours Black board +PPT
3. Recursively enumerable languages 53rd hours Black board +PPT
4. Church’s hypothesis 54th hours Black board +PPT
5. Counter machine 55th hours Black board+PPT
6. Types of Turing machines 56th &57th hours Black board +PPT

Assignment – 4
1. Solve the problem using the TM, [anbcn /where n is an odd ]
2. Explain the steps required to design the TM.
3. Expalin the Counter machines with suitable example.

UNIT : V

Syllabus:
Computability Theory: Linear Bounded Automata and context sensitive languages, LR (0) grammar,
decidability of problems, Universal TM, Undecidable problems about Turing Machine – Post’s
Correspondence Problem - The classes P and NP.
Learning Objectives: After completion of the unit, the student must able to:
 Learn the concept on Chomsky hierarchy of languages
 Learn Context sensitive languages
 Work on the LR (0) grammars
  Understand the P and NP problems

Lecture Plan

S. No. Description of Topic No. of Hrs. Method of Teaching

1. Chomsky hierarchy of languages 58th hour Black board + PPT
2. Linear bounded automata and context sensitive 59th hours PPT + Blackboard
languages
3. LR (0) grammar 60th &61th hours Black board + notes
th rd
4. Decidability of problems 62 &63 hours Black board + PPT
th
5. Universal TM, undesirability of posts 64 hours Black board + PPT
th th
6. P and NP problems, NP complete and NP hard 65 - 67 hours Black board + PPT
problems

Assignment - 5
1. Explain the Chomsky hierarchy of languages
2. What is meant by linear bounded automata?
3. Define LR (0) grammar? Write canonical collection of LR (0) items for the arithmetic grammar.
4. Explain the difference between LR (0) and LR (1) items
5. Explain the Universal TM
6. Explain the P and NP problems

TEXT BOOKS
1.“Introduction to Automata Theory, Languages and Computations”, H.E.Hopcroft , R. Motwani and J.D.Ullman,
Second ,Pearson Education,2003.
2.“Introduction to theory of computation “,Micheal Sipser, Thomson Brokecole,1997

REFERENCES
1.“Elements of the theory of computation “, H.R.Lewis and C.H.papadimitriou,Second Edition, Pearson
Education/PHI,2003.
2.“ Formal Languages and automata Theory “, K.V.N.Sunitha and N.Kalyani TMH,2010.
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF INFORMATION TECHNOLOGY

II B. Tech, Semester II (IT)

Subject : Computer Organization
Subject Code : 5IT04
Academic Year : 2016 – 17
Number of working days : 87
Number of Hours / week :4

Total number of periods planned: 62

Name of the Faculty Member: Ms.K.RENUKA

(5IT04)COMPUTER ORGANIZATION
Course Objectives:

 To understand the basic structure and operation of a digital computer.

 To analyse the operations of the arithmetic unit including the algorithms & implementation of
fixed-point and floating-point addition, subtraction, multiplication & division.
 To learn the different ways of communicating with I/O devices and standard I/O interfaces
 To analyse the hierarchical memory system including cache memories, secondary memory and
virtual memory.

Course Outcomes:

On successful completion of this course, you should be able to

 Describe the structure and functioning of a digital computer, including its overall system
architecture, operating system, and digital components.
 Understand the impact of instruction set architecture on cost-performance of computer design
 Demonstrate the applicability of single-cycle (MIPS), multi-cycle (MIPS), parallel, pipelined,
superscalar, and RISC/CISC architectures
 Analyse cost performance and design trade-offs in designing and constructing a computer
processor including memory

..
UNIT-I
I Syllabus

BASIC STRUCTURE OF COMPUTERS: Introduction, Computer Evolution and

performance, System Buses, bus Structures, Improvements in Chip Organization and
Architecture, The evolution of the INTEL x86 architecture, embedded system and the arm.
Register Transfer Language and Micro operations: Register Transfer language, Register
Transfer, Arithmetic Micro operations, Logic Micro operations, Shift Micro operations, and
Arithmetic logic shift unit.

II Learning Objectives

At the end of unit student must be able to

 Know the basic structure of computers

 Learn the Computer Evolution and performance
 Learn System Buses and bus Structures
 Learn the Improvements in Chip Organization and Architecture
 Learn the evolution of the INTEL x86 architecture
 Know the Embedded system and the arm
 Learn the Register Transfer Language and Micro operations
 Learn the Arithmetic logic shift unit

III Lecture Plan

S.No. Description of Topic No. of Method of

Hrs. Teaching
1 BASIC STRUCTURE OF COMPUTERS: Introduction 1 Chalk and Board
2 Computer Evolution and performance 1 Chalk and Board
3 System Buses, bus Structures 1 Chalk and
Board+PPT
4 Improvements in Chip Organization and Architecture 1 PPT. chalk & board
5 The evolution of the INTEL x86 architecture 1 PPT, chalk & board
6 Embedded system and the arm 1 chalk & board
7 Register Transfer Language and Micro operations: Register 1 chalk & board
Transfer language, Register Transfer
8 Arithmetic Micro operations 1 chalk & board
9 Logic Micro operations 1 chalk & board
10 Shift Micro operations 1 chalk & board

11 Arithmetic logic shift unit 1 chalk & board

________
Total: 11Hrs
_________
IV Assignment

1. Explain the various Improvements in Chip Organization and Architecture

2. Draw the block diagram of Arithmetic logic shift unit and explain

UNIT-II

I Syllabus

Basic Computer Organization and Design: Instruction Codes, Computer Registers, computer
instructions – instruction Cycle, memory reference instructions, input-output and interrupt.
Central Processing Unit: Stack organization, instruction formats, addressing modes, data transfer
and manipulation, program control, CISC and RISC.

II Learning Objectives

At the end of unit student must be able to

• Learn Instruction Codes
• Know Computer Registers
• Know Computer instructions
• Learn and analyze Instruction Cycle
• Learn Memory reference instructions
• Learn Input-output and interrupt
• Learn Central Processing Unit: Stack organization
• Learn Instruction formats
• Learn Addressing modes
• Learn Data transfer and manipulation Instructions
• Learn Program control Instructions
• Learn CISC and RISC. Instructions

III Lecture Plan

No.Of Hours
S.No. Description of Topic No. of Method of
Hrs. Teaching
1. Instruction Codes 1 chalk & board
2. Computer Registers 1 PPT,chalk& Board
3. Computer instructions 1 PPT, chalk & board
4. Instruction Cycle 1 PPT, chalk & board
5. Memory reference instructions 1 PPT, chalk & board
6 Input-output and interrupt 1 chalk & board
7 Central Processing Unit: Stack organization 2 chalk & board
8 Instruction formats 1 chalk & board
9 Addressing modes 1 chalk & board
 10 Data transfer and manipulation 2 chalk & board
11 Program control 1 chalk & board
12 CISC and RISC 1 chalk & board
_________
Total:14Hrs
_________

IV Assignment

1. Explain the Instruction Cycle

2. Explain various Addressing modes with example

UNIT-III
I Syllabus

THE MEMORY ORGANIZATION: The Computer System: Characteristics of Computer

Memory Systems, The Memory Hierarchy Semiconductor Main Memory, SRAM and DRAM,
External Memory, performance considerations, RAID, virtual memory, secondary storage.

MICROPROGRAMMED CONTROL: Control memory, address sequencing, micro program

example, and design of control unit, hardwired control, and micro programmed control.

II Learning Objectives
At the end of unit student must be able to
 Know the Characteristics of Computer Memory Systems
 Know the Memory Hierarchy
 Learn Semiconductor, Main Memory, SRAM and DRAM, External Memory,
performance considerations, RAID, virtual memory, secondary storage.

MICROPROGRAMMED CONTROL: Control memory, address sequencing, micro program

example, and design of control unit, hardwired control, and micro programmed control.

III Lecture Plan

S.No. Description of Topic No. Method of Teaching

of
Hrs.
1 The Computer System: Characteristics of Computer Memory 1 PPT,chalk & board
Systems
2 The Memory Hierarchy ,Semiconductor Main Memory 1 PPT,chalk & Board
3 SRAM and DRAM 1 PPT, chalk & board
4 External Memory, Performance considerations 1 PPT, chalk & board
5 RAID 1 PPT, chalk & board

6 Virtual memory, secondary storage. 1 PPT,chalk & board

7 MICROPROGRAMMED CONTROL: Control memory, 1 PPT,chalk & board
address sequencing
8 Micro program example 2 chalk & board
9 Design of control unit 1 PPT,chalk & board
10 Hardwired control and micro programmed control. 1 PPT,chalk & board

_________
Total:11 Hrs
___________
IV Assignment

1. Explain the Characteristics of Computer Memory Systems

2. Differentiate Hardwired control with micro programmed control

UNIT-IV
I Syllabus

COMPUTER ARITHMETIC: Addition and subtraction, multiplication algorithms, Division

algorithms, floating-point arithmetic operations, Decimal arithmetic unit, Decimal arithmetic
operations.
INPUT-OUTPUT ORGANIZATION: Peripheral devices, input-output interface, asynchronous
data transfer, modes of transfer, priority interrupt, direct memory access.

II Learning Objectives
At the end of unit student must be able to
• Know the Addition and subtraction
• Learn the Multiplication algorithms
• Learn the Division algorithms
• Learn the Floating-point arithmetic operations
• Design the Decimal arithmetic unit
• Learn the Decimal arithmetic operations
• Know the Peripheral devices
• Know the Input-output interface
• Know the Asynchronous data transfer
• Learn the Modes of transfer
• Know Priority interrupt
• Learn the Direct memory access.

III Lecture Plan

S.No. Description of Topic No. of Hrs. Method of Teaching

1. Addition and subtraction 1 PPT, chalk & board
2. Multiplication algorithms 2 PPT+Video,chalk & board
3. Division algorithms 2 PPT, chalk & board
4. Floating-point arithmetic operations 1 PPT, chalk & board
5. Decimal arithmetic unit 1 PPT, chalk & board
 6. Decimal arithmetic operations 2 chalk & board
7. Peripheral devices 1 chalk & board
8. Input-output interface 2 PPT,chalk & board
9. Asynchronous data transfer 1 PPT,chalk & board
10. Modes of transfer 1 chalk & board,PPT
11. Priority interrupt 1 chalk & board,PPT
12. Direct memory access 2 chalk & board,PPT

__________
Total:17hrs
__________
IV Assignment

1. Explain Booth’s Multiplication algorithm

2. Explain Asynchronous data transfer with example
3.
UNIT-V

I Syllabus

PIPELINE AND VECTOR PROCESSING: Parallel Processing, Pipelining, Arithmetic

Pipeline, Instruction pipeline, RISC pipeline Vector Processing, Array Processors.

II Learning Objectives
At the end of unit student must be able to
• Learn the Parallel Processing
• Learn the Pipelining, Arithmetic Pipeline
• Know the Instruction pipeline
• Learn the RISC pipeline
• Know Vector Processing
• Know Array Processors

III Lecture Plan

S.No. Description of Topic No. of Hrs. Method of Teaching

1. Parallel Processing 1 PPT
2. Pipelining 1 PPT
3. Arithmetic Pipeline 1 PPT
4. Instruction pipeline 1 PPT
5. RISC pipeline 1 PPT, chalk & board
6. Vector Processing, 2 PPT
7. Array Processors 2 PPT
___________
Total:9 hrs
____________
IV Assignment

1. Draw the arithmetic pipeline

TEXT BOOKS

1. Computer Organization and Architecture – William Stallings Sixth edition, Pearson/PHI

2. Computer System Architecture – M. Morris Mano, III edition, Pearson/PHI

REFERENCES

1. Fundamentals of Computer Organization and Design, Sivarama Dandamudi

2. Computer organization – Carl Hamacher, Zvonks Vranesic, Safeazaky, V edition, Mc Graw
Hill
3. Computer Architecture a Quantitative approach, John L. Hennessy and David A Patterson,
Fourth edition Elsevier.
4. Computer Architecture Fundamentals and Principles of Computer Design, Joseph D/ Dumas
II, BS Publication
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF INFORMATION TECHNOLOGY

IIIth B. Tech, IInd Semester (INFORMATION TECHNOLOGY)

Subject : DATA BASE MANAGEMENT SYSTEMS

Subject Code : 5CS05
Academic Year : 2016 – 17
Number of working days : 72
Number of Hours / week :4
Total number of periods planned: 70
Name of the Faculty Member: V.LAVANYA

III Year B. Tech IT – II SEM L T/P/D C

3 0 3

(5CS05) DATA BASE MANAGEMNET SYSTEMS

UNIT – I

Introduction to Databases and Database Management System - Database system

Applications - Advantages of DBMS over File System - Data Models – Instances and schema -
View of Data - Database Languages -DDL-DML - Database Users and Administrator - Database
System Structure.

Learning objectives :

After completion of the unit, students will be able to:

 Learn the overview and purpose of Data base Management Systems.

 Know the advantages of DBMS over File System
 Become familiar with data models, data Base Language, Data Base System Structure.
 Become familiar with data base users and role of database administrator.

Lecture plan :
S.No. Description of Topic No. Method of Teaching
of
Hrs
Introduction to Databases and Database Management System
1 Introduction to Database Management System & Database system 1 Chalk & Board
Applications
2 Advantages of DBMS over File System 1 PPT+ Chalk & Board
3 Data Models 1 PPT+ Chalk & Board
4 Instances and schema 1 Chalk & Board
5 View of Data 1 Chalk & Board
6 Database Languages -DDL-DML 1 Chalk & Board
7 Database Users and Administrator 1 PPT+ Chalk & Board
8 Database System Structure 1 PPT+ Chalk & Board
9 Tutorial 1 Chalk & Board

Total = 9

UNIT – II

Database Design and ER diagrams – Attributes and Entity Sets – Relationships and
Relationship Sets – Constraints - Keys - Design Issues - Entity-Relationship Diagram Weak
Entity Sets - Extended E-R Features- Database Design with ER model - Database Design for
Banking Enterprise

Learning objectives:
After completion of the unit, the students will be able to:
 Become familiar with ER- Diagram concepts.
 To understand keys, Relationships.
 Analyze and Draw the ER diagram.
 Analyze and Design database for any enterprise.

Lecture Plan :

S.No. Description of Topic No. of Method of Teaching

Hrs.
Database Design and ER diagrams
1 Database Design and ER diagrams 1 PPT+ Video
2 Attributes and Entity Sets, Relationships and 1 PPT+ Chalk & Board
Relationship Sets
3 Constraints - Keys 2 PPT+ Chalk & Board
4 Design Issues, Entity-Relationship Diagram 1 PPT+ Chalk & Board
Weak Entity Sets
5 Extended E-R Features 1 PPT+ Chalk & Board
6 Database Design with ER model 1 PPT+ Chalk & Board
 7 Database Design for Banking Enterprise 1 PPT+ Video
8 Tutorial 1 Chalk & Board

Total = 9

UNIT – III
Introduction to the Relational Model – Structure of RDBMS - Integrity Constraints over
Relations – Enforcing Integrity Constraints – Querying Relational Data - Relational Algebra and
Calculus.
Introduction to SQL- Data Definition commands, Data Manipulation Commands, Basic
Structure, Set operations Aggregate Operations - Join operations - Sub queries and correlated
queries, SQL functions , views ,Triggers, Embedded SQL.

Learning objectives:

After completion of the unit, the students will be able to:

 Learn an overview of Relational model
 Learn Relational Algebra and Calculus
 Write the queries in Relational Algebra and Calculus
 Become familiar with DDL, DML & DCL commands of SQL
 Become familiar with set operations, aggregate operations, join operations, sub queries
and correlated queries.
 Write the queries in SQL.
 To understand the views, triggers and SQL functions.
 Learn Embedded SQL.

Lecture plan:

S.No. Description of Topic No. of Method of Teaching

Hrs.
Introduction to the Relational Model

1 Introduction to the Relational Model, Structure of 1 PPT+ video

RDBMS

2 Integrity Constraints over Relations 1 PPT+ Chalk & Board

 3 Enforcing Integrity Constraints 1 PPT+ Chalk & Board

4 Querying Relational Data 1 Chalk & Board

5 Relational Algebra and Calculus 2 PPT+ Chalk & Board

Introduction to SQL
6 Introduction to SQL 1 Chalk & Board
7 Data Definition commands 1 Chalk & Board
8 Data Manipulation Commands 1 Chalk & Board
9 Basic Structure 1 Chalk & Board
10 Set operations Aggregate Operations 1 Chalk & Board
11 Join operations 1 Chalk & Board
12 Sub queries and correlated queries 1 Chalk & Board
13 SQL functions 1 PPT+ Chalk & Board
14 views ,Triggers 1 PPT+ Chalk & Board
15 Embedded SQL 1 PPT+ Chalk & Board
16 Tutorial 1 Chalk & Board

Total = 17

UNIT – IV
Functional Dependencies– Introduction , Basic Definitions, Trivial and Non trivial
dependencies, closure of a set of dependencies, closure of attributes, irreducible set of
dependencies- Schema Refinement in Database Design- Problems Caused by Redundancy –
Decompositions – Problem Related to Decomposition –- Lossless Join Decomposition –
Dependency Preserving Decomposition - FIRST, SECOND, THIRD Normal Forms – BCNF ––
Multi valued Dependencies – Fourth Normal Form.

Learning objectives :

After completion of the unit, the students will be able to

 Become familiar with Functional Dependencies & Normal forms.
 To understand Schema Redundancy, Decompositions.
 To understand Schema Refinements, joins.
 Analyze and refine the Schema

Lecture plan :
S.No. Description of Topic No. of Method of Teaching
Hrs.
Functional Dependencies
1 Introduction, Basic Definitions 1 PPT+Video
2 Trivial and Non trivial dependencies 1 PPT+ Chalk & Board
3 closure of a set of dependencies 1 PPT+ Chalk & Board
4 closure of attributes 2 PPT+ Chalk & Board
5 irreducible set of dependencies 1 PPT+ Chalk & Board
6 Schema Refinement in Database Design 1 PPT+ Chalk & Board
7 Problems Caused by Redundancy 1 PPT+ Chalk & Board
8 Decompositions – Problem Related to 1 PPT+ Chalk & Board
Decomposition
9 Lossless Join Decomposition Dependency 1 PPT+ Chalk & Board
Preserving Decomposition
10 Dependency Preserving Decomposition 1 PPT+ Chalk & Board
11 FIRST, SECOND, THIRD Normal Forms – 2 PPT+ Chalk & Board
BCNF
12 Multi valued Dependencies – Fourth Normal 1 PPT+ Chalk & Board
Form
13 Tutorial 1 Chalk & Board

Total = 15

UNIT – V
Transaction concept- Transaction state- Implementation of atomicity and Durability Concurrent
executions – Serializability, Recoverability. Lock Based Protocols, Timestamp Based Protocols,
Validation Based Protocols, Multiple Granularity, Dead Lock Handling – Failure Classification –
Storage Structure - Recovery and Atomicity- Log Based recovery – Recovery with concurrent
transactions – Checkpoints.
File Organization – Organization of records in file - Data Dictionary Storage – Indexing and
Hashing – Basic Concepts, Ordered Indices+ Tree Index files, B- tree index files – Static
Hashing – Dynamic Hashing – Comparison of Indexing with Hashing.

Learning objectives :

After completion of the unit, the students will be able to:

 Know an overview of Transaction.

 Become familiar with the ACID properties.
 Understand Lock Based Protocols, Timestamp Based Protocols, Validation Based Protocols.
 Learn deadlock handling mechanism.
 Learn File Organization concepts.
 Understand the indexing concepts.
 Understand the Hashing concepts.

Lecture plan :

S.No. Description of Topic No. of Method of Teaching

Hrs.
Transaction concept
1 Transaction state, Implementation of atomicity and 1 PPT+ Chalk & Board
Durability
2 Concurrent executions – Serializability,Recoverability 1 PPT+ Chalk & Board
3 Lock Based Protocols 2 PPT+ Chalk & Board
4 Timestamp Based Protocols 1 PPT+ Chalk & Board
5 Validation Based Protocols 1 PPT+ Chalk & Board
6 Multiple Granularity 1 PPT+ Chalk & Board
7 Dead Lock Handling, Failure Classification 1 PPT+ video
8 Structure Recovery & Atomicity- Log Based recovery 2 PPT+ Chalk & Board
9 Recovery with concurrent transactions 1 PPT+ Chalk & Board
10 Checkpoints 1 PPT+ Chalk & Board
File Organization
11 Organization of records in file, Data Dictionary 1 PPT+ Chalk & Board
Storage
12 Data Dictionary Storage 1 PPT+ Chalk & Board
13 Indexing and Hashing, Basic Concepts 1 PPT+ Chalk & Board
14 Ordered Indices+ Tree Index files 1 PPT+ video
15 B- tree index files 2 PPT+ video
16 Static Hashing, Dynamic Hashing Comparison of 1 PPT+ Chalk & Board
Indexing with Hashing
17 Tutorial 1 Chalk & Board

Total = 20

TEXT BOOKS:
1. Database System Concepts, Silberschatz, Korth, Fifth Edition, McGraw hill (1, 2, 3 & 5
Units).
2. Introduction to Database Systems, C.J.Date, Pearson Education (4th Unit)
REFERENCES:
1. Database Management Systems, Raghu Ramakrishna, Johannes Gehrke, TATA Mc Graw
Hill.
2. Fundamentals of Database Systems, Elmasri Navrate Pearson Education 3. Data base Systems
design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition.
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF INFORMATION TECHNOLOGY

II B. Tech, II-Semester (Information Technology)

Subject : Design and Analysis of Algorithms

Subject Code : 5CS06
Academic Year : 2016 – 17
Number of working days : 80
Number of Hours / week :4
Total number of periods planned: 64
Name of the Faculty Member: B.MATHURA BAI

II Year B. Tech IT – II SEM L T/P/D C

3 0 3

(5CS06) DESIGN AND ANALYSIS OF ALGORITHMS

(Common to CSE & IT)

Course Objectives:
 Design and analysis of algorithms is a basis of computer science. The objective of this
course is to cover key techniques for designing and analyzing algorithms. The topics
include (but not limited to) (1) divide and conquer , (2) dynamic programming, (3)
greedy algorithms, (4) backtracking, (5) branch and bound, (6) time and space
complexity analysis, and (7) theory of NP.
 Learning classic algorithms.
 Devise correct and efficient algorithms for solving a given problem
 Validate/Verify correctness of an algorithm.
Course Outcomes:
After completion of the course the student is able to
 Describe and use major algorithmic techniques (divide-and-conquer, dynamic
programming, linear programming, greedy paradigm, graph algorithms) and cite
problems for which each technique is suitable.
 Understand asymptotic notation, its properties anduse in measuring algorithm behavior
 Determine asymptotic expressions for the worst-case execution time and space
requirements of algorithms and data structures.
 Evaluate and compare different algorithms using worst-, average-, and best-case analysis.
Identify the complexity of problems.

UNIT – I
Introduction
Algorithm, Pseudo code for expressing algorithms, Performance Analysis –Space complexity,
Time Complexity, Asymptotic Notation- Big oh Notation, Omega Notation, Theta Notation.
Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees, connected
components and bi-connected components.
Learning Objectives:
After completion of the unit, students will be able to:
 Learn about Pseudo code for expressing algorithms.
 Analyze the Performance Analysis.
 Become familiar with Space complexity, Time complexity based Asymptotic
Notations.
 Learn about Disjoint sets and their operations such as Union and Find algorithms
 Understand spanning trees, connected and bi-connected components.

Lecture Plan:

S.No. Description of Topic No. of Method of

Hrs. Teaching
1. Chalk & board
Introduction: Basic of Algorithm and History 1
+Video
2. Pseudo code for expressing algorithms 2 PPT + LBD
3. Performance Analysis 1 PPT
4. Space complexity and Time Complexity 1 PPT + LBD
5. Asymptotic Notations (Big oh Notation, Omega PPT, chalk &
2
Notation, Theta Notation) board
6. Disjoint Sets- disjoint set operations PPT, Chalk &
1
board
7 PPT, Chalk &
union and find algorithms 2
board
8 PPT, Chalk &
spanning trees, 1
board
9 PPT, Chalk &
connected components 1
board
10 PPT, Chalk &
bi-connected components 1
board
11 Slip Test 1 Chalk & Board

Total = 14
UNIT – II
Divide and Conquer
General method, applications-Binary search, Quick sort, Merge sort, Strassen’s matrix
multiplication.
Greedy method: General method, applications-Job sequencing with deadlines, 0/1 knapsack
problem, Minimum cost spanning trees, Single source shortest path problem, Huffman codes.

Learning Objectives:
After completion of the unit, the students will be able to:
 Analyze the divide and conquer method.
 Understand the Binary Search and perform searching using Binary search
  Understand the Quick sort, merge sort and perform sorting using these techniques.
 Understand the Strassen’s matrix multiplication.
 Analyze the Greedy method.
 Understand the job sequencing with deadlines.
 Understand the 0/1 Knapsack problem.
 Understand the minimum cost spanning trees,
 Understand the Single source shortest path problem & Huffman codes
Lecture Plan:

S.No. Description of Topic No. Method of

of Teaching
Hrs.
1. Divide and conquer: General method 1 Chalk & talk +
Video
2. Applications-Binary search, Its Algorithm 1 PPT+ chalk
&board
3. Quick sort, Its Algorithm 1 PPT+ chalk
&board
4. Merge sort, Its Algorithm 1 PPT+ chalk
&board
5 Strassen’s matrix multiplication 2 PPT+ chalk &
board
6 Greedy method: General method 1 PPT+Chalk &
board
7 applications-Job sequencing with deadlines 2 PPT+Chalk &
board
8 0/1 knapsack problem 2 PPT+Chalk &
board
9 Minimum cost spanning trees 1 PPT+Chalk &
board
10 Single source shortest path problem and Huffman code 2 Chalk & board
11 Tutorial 1

Total = 15
UNIT – III
Dynamic Programming
General method, Principle of Optimality, Applications-Multistage graphs, Matrix chain
multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path
problem, Travelling sales person problem, Reliability design.

Learning Objectives:
 Analyze the Dynamic Programming method.
 Understand the Matrix chain multiplication.
 Understand the Optimal binary search trees.
  Understand the 0/1 knapsack problem,
 Understand the all pair shortest path problem
 Understand the Traveling sales person problem
 Understand the reliability design
Lecture Plan:
S.No. Description of Topic No. of Method of
Hrs. Teaching
1 Dynamic Programming: General method, 1 PPT+Video
2 1 PPT+ chalk
Principle of Optimality
&board
3 1 PPT+ chalk
multistage graph
&board
4 1 PPT+chalk
Matrix chain multiplication
&board
5 2 PPT+chalk &
Optimal binary search trees
board
6 2 PPT+ chalk
0/1 knapsack problem
&board
7 1 PPT+ chalk
All pairs shortest path problem
&board
8 2 PPT+ chalk
Travelling sales person problem
&board
9 1 PPT+ chalk
Reliability design
&board
10 Tutorial 1 Chalk & board

Total = 13
UNIT – IV
Backtracking
General method, applications-Recursive Permutation Generator, N-queen problem, sum of
subsets problem, Graph coloring, Hamiltonian cycles.

Learning Objectives:
After completion of the unit, the students will be able to
 Understand the concepts of Backtracking: General method
 Become familiar with the application-n-queen problem.
 Analyze sum of subsets problem.
 Understand the AND graph coloring, Hamiltonian cycles.

Lecture Plan:
S.No. Description of Topic No. of Hrs. Method of
Teaching
 1 Backtracking: General method 1 PPT+Video

2 applications-Recursive Permutation Generator 1 PPT+ chalk

&board
3 N-queen problem 2 PPT+ chalk
&board
4 sum of subsets problem 1 PPT+ chalk
&board
5 graph coloring 2 PPT + chalk
&board
6 Hamiltonian cycles 2 PPT, Chalk &
board
7 Tutorial 1 Chalk &
board

Total = 10
UNIT – V
Branch and Bound
General method, applications-Traveling sales man problem, 0/1 knapsack problem, L C Branch and
bound solution, FIFO Branch and bound solution. NP-hard and NP-complete problem: Basic
concepts, non-deterministic algorithms, NP-Hard and NP-Complete classes, Cook’s theorem.

Learning Objectives:

After completion of the unit, the students will be able to:

 Understand the concepts of Branch and Bound: General method

 Become familiar with the Traveling sales man problem.
 Analyze 0/1 knapsack problem.
 Understand the L C Branch and bound solution,FIFO Branch and bound solution.
 Understand the concepts of NP-hard and NP-complete problem
 Become familiar with the non-deterministic algorithms.
 Analyze NP-hard and NP-Complete classes.

Lecture Plan :
S.No. Description of Topic No. of Method of
Hrs. Teaching
1. Branch and Bound: General method, applications 1 PPT+Video
2. Applications-Traveling sales man problem 2 PPT++ chalk
&board
3. 0/1 knapsack problem 1 PPT++ chalk
&board
4. L C Branch and bound solution 1 PPT+ chalk
&board
5. FIFO Branch and bound solution 2 PPT+ chalk
&board
 6 NP-hard and NP-complete problem: Basic concepts, 1 PPT+ chalk
&board
7 Non-deterministic algorithms, 1 PPT+ chalk
&board
8 NP-hard and NP-Complete classes 1 PPT+ chalk
&board
9 Cook’s theorem 1 PPT+ chalk
&board
10 Tutorial 1 Chalk & board

Total = 12
TEXT BOOKS:

1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and

Rajasekharam, Galgotia publications pvt. Ltd.
2. Introduction to Algorithms, second edition, T.H.Cormen,C.E.Leiserson, R.L.Rivest,and
C.Stein,PHI Pvt. Ltd./ Pearson Education

REFERENCES:

1 Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and

R.Tomassia,John wiley and sons.
2. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee,
S.S.Tseng, R.C.Chang and T.Tsai, Mc Graw Hill.
3. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson
education.
4. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.
5. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education.

Journals:

1. Journal of Discrete Algorithms

(http://www.journals.elsevier.com/journal-of-discrete-algorithms/)
2. Algorithms :Design Techniques and Analysis
(http://www.worldscientific.com/worldscibooks/10.1142/4002)

Videos:
1. http://www.nptelvideos.in/2012/11/design-analysis-of-algorithms.html
2. http://ocw.mit.edu/6-046JF05
3. https://www.youtube.com/watch?v=EcT-Jt5WStw
4. https://class.coursera.org/algo2-003/lecture/preview
5. https://www.coursera.org/course/algo2
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
(Autonomous)
DEPARTMENT OF NFORMATION TECHNOLOGY

II B. Tech, IInd Semester (Information Technology)

Subject : JAVA PROGRAMMING
Subject Code : 5CS15
Academic Year : 2016 – 17
Number of working days : 90
Number of Hours / week :4
Total number of periods planned: 75
Faculty Members: Dr.N.Sandhya,V.Baby,A.Madhavi,M.Manasa

Course Objectives
 Understand fundamental concepts and constructs of Java.
 Implement different object oriented concepts in Java
 Develop the concepts of multithreading and IO streams
 Construct GUI models
Course Outcomes
 Write java programs using various programming constructs
 Solve different mathematical problems using OOP paradigm
 Design and analyze the solutions for thread and IO management concepts
 Implement the applications involving GUI models and events

UNIT-I

Fundamentals of Object Oriented programming: Object oriented paradigm - Basic concepts of Object Oriented
Programming - Benefits of OOP - Applications of OOP
Java Evolution: Java Features - How Java differs from C and C++ - Java and Internet - Java and World Wide Web
- Web Browsers - Hardware and Software Requirements - Java Environment. Overview of Java Language: Simple
Java Program - Java Program Structure - Java Tokens- Java Statements - Implementing a Java Program - Java
Virtual Machine - Constants - Variables - Data types - Scope of Variables-Symbolic Constants-Type Casting and
type promotions – Operators, Operator Precedence and Associativity - Control Statements – break - continue-
Arrays-Multi dimensional arrays, Wrapper Classes - Simple examples.
.
Objectives:-
At the end of this unit student will be able to know

 Understand the object oriented programming principles

 Understand the differences between JAVAa and C/C++
 Understand the implementation of JAVA programming
 Learn about Control Stuctures,Operators,Arrays etc.
 Learn how to write a JAVA program with an example.

Lecture Plan:-Total Classes Required: 10

S.no Description of Topic No. of Hrs. Method of teaching

1 Introduction to JAVA 2 BB
Evolution
2 Object Oriented 1 BB
Programming Principles
3 benefits of 2 BB
 OOP,Comparision between
JAVA and C/C++
4 Java 1 BB
Tokens,Variables,DataTypes
5 Control Stuctures 2 BB,PPT
6 Operators 2 BB,PPT

Assignment:-

1. What is JIT compiler?

2. Can we execute a program without main() method?
3. What is difference between object oriented programming language and object based programming
language?
4. Why main method is static?
5. Demonstrate the principle concepts of OOPS.
6. Elaborate system.out.println().
7. Explain JVM architecture
8. Enumerate and explain java buzz words
9. Demonstrate the usage of wrapper classes
10. Explain how arrays are handled in java

UNIT-II

Classes: Classes and Objects - Constructors – methods - this keyword – garbage collection- finalize - Overloading
methods and constructors - Access Control- Static members – nested and inner classes – command line arguments -
variable length arguments.
Inheritance: Forms of inheritance – specialization, specification, construction, extension, limitation, combination,
benefits and costs of inheritance. Super uses- final - polymorphism, method overriding - dynamic method dispatch –
abstract classes – exploring string class.

Objectives:-
At the end of this unit student will be able to know

 Understand the classes and objects

 Implement different kinds of constuctors
 Understand the inheritance
 Illustrate various inhenritance concepts

Lecture Plan: - Total Classes Required: 11

S.no Description of Topic No. of Hrs. Method of teaching
1 Classes and Objects 2 BB,VIDEO
2 Constructors 2 BB,PPT
3 Methods and Classes 2 BB
4 Inheritance 1 BB
5 Types of Inheritance 3 BB,PPT
6 Abstarct classes 2 BB

Assignment:-

1. Why we need to use Inheritance?

 2. What is multiple inheritances? Why Java Doesn't Support multiple Inheritance.
3. Can a class extend itself?
4. Explain types of constructors.
5. Illustrate with an example different types of inheritance.
6. Demonstrate dynamic method dispatch
7. Differentiate string class and string buffer class
8. Explain garbage collection in java.
9. Explain the significance of final key word w.r.t variable, class, method.
10. Demonstrate variable length arguments

UNIT-III

Packages and Interfaces: Defining and accessing a package – understanding CLASSPATH – access protection
importing packages – Interfaces - Defining and implementing an interface, Applying interfaces, Variables in
interfaces and extended interfaces. Exploring java.lang and java.util packages.
Exception Handling-Fundamentals, usage of try, catch, multiple catch clauses, throw, throws and finally. Java Built
in Exceptions and creating own exception subclasses.
Objectives:-
At the end of this unit student will be able to know

 Understand the packages classpath.

 Implement interfaces
 Compare and contrast interfaces and abstract classes
 Explore java.lang and java.util packages
 Exception handling

Lecture Plan: - Total Classes Required: 10

S.no Description of Topic No. of Hrs. Method of teaching
1 Packages 2 BB
2 Classpath 1 BB,PPT
3 Interfaces 4 BB,PPT
4 Exception Handling 3 BB,PPT

Assignment:-

1. Explain how to handle different types of exceptions.

2. What is the difference between classpath and path?
3. Why do we need packages?
4. How interfaces are beneficial than the abstract class.
5. How to create user defined exceptions
6. Demonstrate the implementation of interface

UNIT - IV

Multithreaded Programming: Java Thread life cycle model – Thread creation - Thread Exceptions - Thread
Priority – Synchronization - Messaging - Runnable Interface - Interthread Communication - Deadlock - Suspending,
Resuming and stopping threads.
I/O Streams: File – Streams – Advantages - The stream classes – Byte streams – Character streams.

Objectives:-
At the end of this unit student will be able to know
  Understand the Multithreaded programming.
 Illustrate synchronization, deadlock, and Thread priority.
 Implement I/O stream

Lecture Plan: - Total Classes Required: 8

S.no Description of Topic No. of Hrs. Method of teaching
1 Multithreaded 3 BB,PPT
programming
2 I/O streams 2 BB,PPT

Assignment:-

1. What is the purpose of the wait(), notify(), and notifyAll() methods?

2. What is the difference between start and run method in Java Thread?
3. Illustrate the code to avoid deadlock in Java where N threads are accessing N shared resources
4. Which one is better to implement thread in Java ? extending Thread class or implementing Runnable?
5. Signify the need of two types of streams – byte streams and character streams?
6. What are the super most classes of all streams?
7. Explain FileInputStream and FileOutputStream?

UNIT – V

Applet Programming: How Applets differ from Applications - Applet Life Cycle - Creating an Applet - Running
the Applet- Designing a Webpage - Applet Tag - Adding Applet to HTML file - More about Applet Tag - Passing
parameters to Applets - Aligning the display.
Event handling: basics of event handling, Event classes, Event Listeners, delegation event model, handling mouse
and keyboard events, adapter classes, AWT Class hierarchy - AWT Controls - Layout Managers and Menus,
limitations of AWT
Objectives:-
At the end of this unit student will be able to

 Demoinstrate Applet programming

 Design a web page
 Understand the basics of event handling
 Illustrate AWT Class hierarchy and their related programs
 Understand MVC Architecture

Lecture Plan: - Total Classes Required: 11

S.no Description of Topic No. of Hrs. Method of teaching
1 Applet programming 1 BB,VIDEO
2 Applet to HTML 3 PPT
3 Event Handling 3 PPT,BB
4 AWT Class 2 BB,VIDEO,PPT

Assignment:-

1. Which classes can an applet extend?

2. For what do you use the start() method?
3. True or false: An applet can make network connections to any host on the internet.
 4. How do you get the value of a parameter specified in the JNLP file from within the applet's code?
5. Explain AWT components with examples.

TEXT BOOKS:
1. The Complete Reference Java J2SE 5th Edition, Herbert Schildt, TMH Publishing Company Ltd,
NewDelhi.
2. Big Java 2nd Edition, Cay Horstmann, John Wiley and Sons
REFERENCE BOOKS:
1. Java How to Program, Sixth Edition, H.M.Dietel and P.J.Dietel, Pearson Education/PHI
2. Core Java 2, Vol 1, Fundamentals, Cay.S.Horstmann and Gary Cornell, Seventh Edition, Pearson
Education.
3. Core Java 2, Vol 2, Advanced Features, Cay.S.Horstmann and Gary Cornell, Seventh Edition, Pearson
Education.
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF CIVIL ENGINEERING

II B. Tech, Semester II (Information Technology)

Subject :Software Engineering

Subject Code : 5CS07
Academic Year : 2016 – 17
Number of working days : 90
Number of Hours / week :4
Total number of periods planned : 60
Name of the Faculty Member : Y.UshaRani

III Year B. Tech CE – II Sem L T/P/D C

4 0 4

(5CS07) SOFTWARE ENGINEERING

UNIT I

Introduction to Software Engineering: Changing nature of Software, Software Myths. A

Generic View Of Process:-Software engineering-A layered technology, The Capability Maturity
Model Integration (CMMI)
Process Models: The water fall model, Incremental process models, evolutionary process
models, the unified process.

Learning objectives :

After completion of the unit, students will be able to:

 understand different aspects of Software Engineering
 understand various Software Process Models
 Analyze which process model is suitable to which application domain.

Lecture plan :

Method of
S.No. Description of Topic No. of Hrs.
Teaching
Defining Software, Software Application Domains,
1. 2 Chalk & board
Legacy Softwares
2. Software Engineering and defining Software 2 Chalk & board
 Process
Software Myths, A Generic view of Software
3. 1 Chalk & board
Process Model
A layered technology, The Capability Maturity
4. 2 Chalk & board
Model Integration (CMMI)
5. The water fall model, Incremental process models 2 PPT, chalk & board
6. Evolutionary process models, The unified process 2 PPT, Chalk & board
7 Tutorial 1 Chalk & Board

Total = 12
Assignment Questions :
1. Explain about Software Myths.
2. Discuss with neat case study Waterfall, Incremental Process Model.
3. Identify the need of Evolutionary Process Model. Discuss with Neat examples.

UNIT II

Software Requirements: Functional and Non functional requirements, User requirements,

System requirements, Interface specification, The software requirements document.

Requirements Engineering Process: Feasibility studies, Requirements elicitation and analysis,

requirements validation, requirements management

Learning objectives:

After completion of the unit, the students will be able to:

 know the importance of Software Requirements
 Identify different types of Software Requirements
 learn requirements collection can be engineered
 Analyze the software requirements
 Know how software requirements can be validated

Lecture plan :

Method of
S.No. Description of Topic No. of Hrs.
Teaching
1. Functional and Non-functional requirements 1 PPT+Video
2. User requirements, System requirements 2 PPT
3. Interface specification 1 PPT
4. The software requirements document 2 PPT+ chalk &board
5 Feasibility studies 1 PPT, chalk & board
 6 Requirements elicitation and analysis 2 PPT, Chalk & board
Requirements validation, Requirements
7 2 Chalk & board
management
8 Tutorial 1 Chalk & Board

Total = 12
Assignment Questions :
1. Distinguish Software Functional Requirements and Non – Functional Requirements
2. Explain the contents of SRS Document with examples.
3. Explain Feasibility Study, Requirement Validation.

UNIT III

System models: context models, behavior models, data models, object models, structured
methods

Design engineering: design process and design quality, design concepts the design model
Creating an architectural design: software architecture, data design, architectural styles and
patterns, architectural design

Learning objectives:
After completion of the unit, the students will be able to:
 know about various Software System Models
 Learn how Process and Quality is being designed
 Analyze Software architecture
 Evaluate the Data Design
 Carryout various architectural Styles

Lecture plan:

Method of
S.No. Description of Topic No. of Hrs.
Teaching
1 Context Models, Behavior Models 1 PPT+Video
2 Data Models, Object Models 1 PPT
3 Structured Methods 1 PPT
4 Design Process, Design Quality 1 PPT+ chalk &board
5 Design Concepts, The Design Model 1 PPT, chalk & board
What is architecture ? Creating an architectural
6 2 PPT
Design
7 Architectural Styles, Patterns, Refinement 2 Chalk & board
 8 Architectural Design 2 Chalk & board
7 Tutorial 1 Chalk & Board

Total = 12
Assignment Questions :
1. Explain Software Object Models and Behaviour Models.
2. Explain Architectural Design and styles, Patterns, Refinement.

UNIT IV

Test Strategies: A strategic approach to software testing, Black box and White box Testing,
Validation Testing, System Testing.

Product Metrics ,Software Quality, Metrics for analysis model, Metrics for design model,
Metrics for source code, Metrics for testing, Metrics for maintenance Metrics for process and
products, Software measurement, Metrics for software quality

Learning objectives :

After completion of the unit, the students will be able to

 learn about the types of test strategies
 know about the metrics for software quality
 know about the metrics for analysis model
 carry out a simple metrics for software measurement
 understand metrics for software quality

Lecture plan :

S.No. Description of Topic No. of Hrs. Method of

Teaching
1 A strategic approach to software testing – 1 PPT+Video
verification and validation, Organizing for Testing
2 Software Testing strategy – A Big Picture 1 PPT
3 Creteria for completion of Software Testing 1 PPT
4 Test Strategies for Conventional and Object 1 PPT+ chalk &board
Oriented Software
5 Black box and White box Testing, Validation 2 PPT,
Testing, System Testing.
6 Software Quality, Metrics for analysis model 1 PPT, Chalk & board
7 Metrics for design model, Metrics for source code, 2 Chalk & board
 Metrics for testing, Metrics for maintenance
8 Metrics for process and products 1
9 Software measurement, Metrics for software 2
quality
10 Tutorial 1 Chalk & board

Total = 13
Assignment Questions :
1. Explain with neat example Software Testing Strategy – a big picture.
2. Explain Software Metrics.
3. Explain with neat examples about different Software Tests.

UNIT V

Risk Management: Reactive vs proactive risk strategies, Software risks, Risk identification,
Risk projection Risk refinement, RMMM, RMMM plan

Quality Management: Quality concepts, Software quality assurance, Software reviews, Formal
technical reviews, Statistical Software Quality Assurance, Software reliability, ISO 9000 Quality
standards

Learning objectives :

After completion of the unit, the students will be able to:

 Understanding Risk Management
 Know Reactive and Proactive Risk Strategies
 Know how Risk identification is carried out
 How Software quality assurance is given
 What are Software Review Process, Formal Technical reviews.
 Carry out Statistical Software Quality Assurance
 Know Software Reliability, ISO 9000 Quality Standards

Lecture plan :

S.No. Description of Topic No. of Hrs. Method of

Teaching
1. Reactive vs proactive risk strategies, Software 1 PPT
risks, Risk identification
2. Risk projection Risk refinement 1 PPT
 3. RMMM, RMMM plan 1 PPT
4. Quality concepts, Software quality assurance 2 PPT+ chalk &board
5. Software reviews, Formal technical reviews 1 PPT, Video
6 Statistical Software Quality Assurance, Software 3
reliability
7 ISO 9000 Quality standards 1
8 Tutorial 1 Chalk & board
Total = 11
Assignment Questions :
1. Distinguish Reactive and Proactive Risks.
2. Explain RMMM Plan.
3. Explain Software Statistical Quality Assurance.

TEXT BOOKS

1. Software engineering- Roger S.Pressman, A practitioner’s Approach, McGraw-Hill

International Edition, 5th edition, 2001.
2. Software engineering, Ian Sommerville, Pearson education Asia, 6th edition, 2000.

REFERENCE BOOKS

Books:

1. “An Integrated Approach to Software Engineering” - Pankaj Jalote- Springer Verlag,

1997.
2. “Software Engineering – An Engineering Approach”, James F Peters and Witold
Pedryez, John Wiley and Sons, New Delhi, 2000.
3. “Software Engineering Fundamentals”, Ali Behforooz and Frederick J Hudson, Oxford
University Press, New Delhi, 1996.

Journals:

1. IEEE Transactions on Software EngineeringBimonthly ISSN: 0098-5589

2. Journal of Statistical SoftwareISSN 1548-7660Published by the Foundation for Open

Access Statistics
 3. ACM Transactions On Software Engineering And Methodology
Quarterly ISSN: 1049-331X
4. ACM Transactions On Mathematical Software Quarterly ISSN: 0098-3500

Conferences :
1. ICSE - International Conference on Software Engineering.
2. FSE - ACM SIGSOFT Symposium on the Foundations of Software Engineering.
3. ICSM - International Conference on Software Maintenance.
4. ASE - IEEE/ACM International Conference on Automated Software Engineering.