G.

PULLA REDDY ENGINEERING COLLEGE (Autonomous): KURNOOL

Accredited by NBA of AICTE and NAA C of UGC
An ISO 9001:2008 Certified Institution
Affiliated to JNTUA, Anantapuramu

Scheme – 2017
Scheme and Syllabus for III, IV Semester of Four year
B.Tech. Degree Course in CSE

Department of Computer Science and Engineering

G. Pulla Reddy Engineering College (Autonomous): Kurnool
Accredited by NBA of AICTE and NAAC of UGC Affiliated
to JNTUA, Anantapuramu.
 Vision and Mission of the Department:

Vision :
The department aims to become a leader in the field of education, training and research
in Computer Science and Engineering.

Mission :
Mission 1: The department strengthens the core competence in computer
Science and Engineering by imparting quality education and training.

Mission 2: To promote innovation and research through collaborative and

participatory approaches.

Mission 3: To inculcate the leadership capabilities, ethical values and

professional behavior to face the challenges in global market.

Program Educational Objectives(PEOs)

Program Educational Objectives(PEOs) of the under graduate programme in Computer

Science and Engineering at G.Pulla Reddy Engineering College (Autonomous), Kurnool
are to prepare the graduates to possess the ability to

PEO1: Analyze, Design and Develop computer based systems and applications using
core areas of Computer Science & Engineering.

PEO2: Be engineering professionals, innovators, entrepreneurs engaged in their

profession with social awareness and ethical values.

PEO3: Work in teams in multi-disciplinary areas to address the needs of society.

Program Specific Outcomes(PSOs) :

PSO1 : Understand the principles, structure and development methodologies of system

software

PSO2 : Design, develop, implement and test application software for systems including
distributed software systems.

PSO3 : Understand the architecture and organization of computer systems, embedded

systems and networked systems.
 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
FOUR YEAR B.TECH. DEGREE COURSE
Scheme of Instruction and Examination
(Effective from 2017-2018)
CSE– III Semester Scheme: 2017
Scheme of
Scheme of Examination
Instruction
Maximum Marks
Course periods/week
S. No Course Title Credits
No. End Internal
Total
L T/D P Exam Assessment
Marks
Marks Marks
I Theory
Managerial Economics and
1. HU201 3 3 0 0 60 40 100
Financial Accountancy
2. CS201 Discrete Mathematics 3 3 0 0 60 40 100
Switching Theory and
3. CS202 3 3 0 0 60 40 100
Logic Design
4. CS203 Advanced Data Structures 3 3 0 0 60 40 100
Database Management 3 3 0 0 60 40 100
5. CS205
Systems
Computer Organization & 3 3 0 0 60 40 100
6. CS207
Architecture
7. ML01 Constitution of India - 2 - - - - -
II Practical
8. CS204 Advanced Data Structures 1 - - 2 50 50 100
Lab
9. CS206 Data Base Management Lab 1 - - 2 50 50 100

10. HU203 Advanced Communication 1 - - 2 - 100 100

Skills Lab
Total 21 20 0 06 460 440 900

FOUR YEAR B.TECH. DEGREE COURSE

Scheme of Instruction and Examination
(Effective from 2017-2018)
CSE – IV Semester Scheme: 2017

Scheme of
Scheme of Examination
Instruction
Maximum Marks
Course periods/week
S. No Course Title Credits
No. End Internal Total
L T/D P Exam Assessment Mark
Marks Marks s
I Theory
1. BS204 Probability & Statistics 3 3 0 0 60 40 100
Object Oriented 3 3 0 0 60 40 100
2. CS208
Programming
3. CS210 Operating System 3 3 0 0 60 40 100
4. CS211 Computer Networks 3 3 0 0 60 40 100
Design & Analysis of
5. CS212 3 3 0 0 60 40 100
Algorithms
6. CS213 Software Engineering 3 3 0 0 60 40 100
7. ML02 Environmental Studies - 2 - - - - -
II Practical
8. EC212 Basic Electronics Lab 1 - - 2 50 50 100
9. CS209 Object Oriented 1 - - 2 50 50 100
Programming Lab
Soft Skills Lab 1 - - 2 - 100 100
10. HU204

Total 21 20 0 06 460 440 900

 MANAGERIAL ECONOMICS AND FINANCIAL ACCOUNTACY (MEFA)

III Semester: Common for CSE and ECE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
HU201 Foundation
Assessment
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understand the nature and scope of managerial economics and various concepts of demand analysis
CO2: Understand the significance of demand elasticity and different concepts of demand forecasting
CO3: Understand the concepts of production and cost analysis and different market structures and their
competitive situations
CO4: Understand the concept and significance of capital budgeting
CO5: Understand the principles and significance of accountancy and preparation of final accounts

UNIT– I
Introduction to Managerial Economics & Demand :
Managerial Economics- Definition, Nature and Scope; Demand -Meaning, Types of Demand, Demand
Determinants, Law of Demand and its exceptions, Law of Diminishing Marginal Utility, Indifference curve.
UNIT– II
Elasticity of Demand and Demand Forecasting:
Elasticity of Demand-Types, Measurement and Significance;
Demand forecasting –Importance, Factors, Purposes, Methods of Demand Forecasting
UNIT– III
Theory of production & cost analysis and Market Structures:
Production Analysis: Meaning, Isoquants &Isocosts, The law of diminishing Marginal Returns, Law of
Returns to Scale, Internal and External Economies of scale.
Cost Analysis – Cost concepts, Cost output relationship for Short Run and Long Run, Break Even
Analysis – Its Importance, Limitations and Managerial uses
Market Structures: Types and Features of different market structures–Perfect Competition – Monopoly
– Monopolistic and Oligopolistic; Price output determination in case of perfect competition and
Monopoly.
UNIT– IV
Capital and Capital Budgeting:
Introduction: significance of capital budgeting, steps in capital budgeting, optimum level of capital,
decision to invest under certainty-payback period method, net discounted present value method, internal
rate of return method, sources of capital, decision to invest under risk and uncertainty

UNIT– V
Introduction to Financial Accountancy:
Principles of Accountancy: Introduction, Double Entry System of Book Keeping-, Journal, Ledger,
Preparation of Trial balance
Preparation of Final Accounts: Trading Account, Profit & Loss Account, and Balance Sheet with
adjustments, Final Accounts problems.
Text Books :
1. A.R. Aryasri, Managerial Economics and Financial Analysis,McGrawHill Education

Reference Books :
1) Varshiney and Maheswari, Managerial Economics, Sultan Chand & Co, New Delhi
2) Vanita Agarwal, Managerial Economics, Pearson Education
3) Domnick Salvatore: Managerial Economics in a Global Economy, 4th Edition, Thomson
4) S.P.Jain and K.L.Narang, Financial Accounting

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 DISCRETE MATHEMATICS (DM)

III Semester : CSE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS201 Professional
Assessment
Core
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understand the mathematical representation of statements using connectives, normal forms,
equivalence and implications.
CO2: Calculate numbers of possible outcomes of elementary combinatorial processes such as
permutations and combinations.
CO3: Solve homogenous and Inhomogeneous recurrence relations using substitution method and
generating functions.
CO4: Understand the concept of planar graphs, Hamiltonian graphs, Euler graphs, spanning trees
and binary trees.
CO5: Understand the association between the elements of sets using digraphs and Warshall’s
Algorithm.

UNIT– I
Mathematical Logic
Statements & Notation, Connectives, Well Formed Formulas, Equivalence & implications, Duality law,
Other connectives.
Normal forms
Normal forms- Principle Disjunctive Normal form, Principle conjunctive Normal form, Theory of
inference for statement calculus.
UNIT– II
Elementary Combinatorics
Permutations & Combinations, Enumeration of Combinations and Permutations without repetition,
Combinations with repetition, Principle of Inclusion-Exclusion.
UNIT– III
Recurrence Relations
Generating Functions of Sequences, Calculating Coefficients of Generating Functions, Recurrence
Relations, Solving Recurrence Relations by Substitution and Generating Functions, The method of
Characteristic Roots, Solutions of Inhomogeneous Recurrence Relations.

UNIT– IV
Graphs
Basic Concepts, Isomorphism and Sub graphs, Trees and Their Properties, Spanning Tress-Depth First
search and Breadth First search, Minimal Spanning Trees, Binary Trees, Planar and Non planar
Graphs, Euler’s Formula, Hamiltonian Graphs, Chromatic Numbers.

UNIT– V
Relations and Digraphs
Introduction, Properties of Binary Relations, Equivalence Relations, Digraphs, Partially ordered sets,
Special elements of POSET, Hasse Diagram, Lattices and their properties, Transitive Closure,
Warshall’s algorithm.
Text Books :
1. Trembly.J.P and manohar.R [2011], Discrete mathematical structures with applications to
computer science, Mc-Graw-Hill International Editions.
2. Joe L.Mott, Abraham Kandel and Theodore P.Baker [2008], [2nd Edition], Discrete Mathematics
for Computer Scientists and Mathematicians, PHI.

Reference Books :
1. Dr. S.Chandrasekharaiah, Mathematical foundations of computer science, -Prism books Pvt.Ltd.
2. Ralph P.Grimaldi [2006], [5th Edition], Discrete and Combinational Mathematics-An Applied
Introduction, Pearson Education.
3. Liu [2004], Elements of discrete mathematics, McGraw-Hill.

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 SWITCHING THEORY AND LOGIC DESIGN (STLD)

III Semester: CSE Scheme: 2017

Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS202 Professional
Assessment
Core
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understanding number conversions, Error detection and correction mechanisms: parity,
checksum, hamming codes.
CO2: Apply the Axioms and theorems of Boolean Algebra for minimization of Boolean functions,
canonical forms.
CO3: Apply the minimization procedures using Karnaugh map, Tabulation method, prime implication
chart to obtain minimal SOP and POS.
CO4: Design combinational circuits: Encoders, Decoders, Multiplexers, ROM, PLA.
CO5: Design Sequential circuits using Flip-flops and sequential logic.
CO6: Design Registers: Shift Register, Bi directional Shift Register and counters: Ring Counter,
Johnson Counter.

UNIT– I
Number System & Binary Codes: The Decimal, Binary, Octal, Hexadecimal Number System,
Number Base Conversions, Complements, Binary Arithmetic in Computers, Weighted Binary codes,
Non Weighted Binary codes, Error Detecting Codes, Error Correcting Codes, Parity Checking.
Boolean Algebra & Minimization of Boolean Functions: Basic Definitions, Axiomatic Definition of
Boolean Algebra, Basic Theorems and Properties of Boolean Algebra, Boolean Functions, Canonical
and Standard Forms, Other Logic Operations, Digital Logic gates.
UNIT– II
Simplification of Boolean Functions: The Map Method, Two, Three, Four, Five and Six variable maps,
Product of Sums Simplification, NAND and NOR Implementations, Other two Level Implementations,
Don’t Care Conditions, The Tabulation Method, Determination of Prime Implicants, Selection
of Prime Implicants.
UNIT– III
Combinational Logic: Introduction, Design Procedure, Adders, Subtractors, Code Conversion,
Analysis Procedure, Multilevel NAND Circuits, Multilevel NOR Circuits, Exclusive-or and
Equivalence Functions.
Combinational Logic with MSI & LSI: Binary Parallel Adder, Decimal Adder, Magnitude
Comparator, Decoders, Multiplexers, Read Only Memory (ROM), Programmable Logic Array
(PLA).
UNIT– IV
Sequential Logic: Introduction, Flip Flops, Triggering of Flip Flops, Analysis of Clocked Sequential
Circuits, State Reduction and Assignment, Flip Flop Excitation Tables, Design Procedure, Design of
Counters, Design with State Equations.
UNIT– V
Registers: Introduction, Registers - Registers with parallel load, Sequential Logic Implementation,
Shift Registers - Serial Transfer, Bi-directional Shift Register with parallel load, Serial Addition.
Counters : Ripple Counters - Binary Ripple Counter, BCD Ripple Counter, Synchronous Counters -
Binary Counter, Binary Up-Down Counter, Johnson Counter.
Text Books :
1. M.Morris Mano , Digital Logic and Computer Design, Pearson Education, IV Edition, 2011

Reference Books :
1. ZviKohavi [2008], Switching and Finite Automata Theory, TMH.
2. F.J.Hill and G.R.Peterson [1981], [3rd Edition], Introduction to switching theory and logic
Design.
3. Donald D. Givone [2006], [4rd Edition], Digital Principles and Applications, Tata McGraw Hill.

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer any
one question
 ADVANCED DATA STRUCTURES (ADS)

III Semester: CSE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS203 Professional
Assessment
Core
3 0 0 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understand the concept of Class, Object and Dynamic Memory allocation in C++.
CO2: Illustrate the applications of Linked Lists, Stacks and Queues.
CO3: Comprehend the operations performed on Binary Search Trees and AVL Trees.
CO4: Understand the Operations and Applications of Heaps.
CO5: Organize the data using various Hashing Techniques for efficient Searching.

UNIT– I
Introduction to C++
Structure of a C++ program, Class, Object, Scope Resolution operator, Defining Member functions,
Constructors, Dynamic Memory allocation.
UNIT– II
Review of Elementary Data Structures: Arrays, Linked Lists, Stacks, Queues
Applications of Linked lists: Polynomial manipulation.
Applications of Stacks: Recursion, Quick sort, Polish notations, Conversion of infix notation to postfix
notation, Postfix expression evaluation.
Applications of Queues: Breadth First Search.

UNIT– III
Non Linear Data Structures:
Operations on Binary Search Trees, AVL Trees and their operations, Threaded Binary Trees.
Special Trees: Splay Trees, B-Trees and their operations.

UNIT– IV
Priority Queues (Heaps):
Simple Priority Queues- Implementation using arrays and linked lists, Binary Heaps.
Applications of Binary heap- Heap Sort; d-heaps, Leftist Heaps, Skew Heaps, Binomial Queues
UNIT– V
Hashing Techniques:
Hashing Definition, Hash functions, Open Hashing (Separate Chaining), Closed Hashing (Open
Addressing)- Linear Probing, Quadratic Probing, Double Hashing; Rehashing, Extendible Hashing.
String Searching Techniques:
History, Brute-Force algorithm, Knuth-Morris-Pratt algorithm, Boyer-Moore algorithm, Robin-Karp
algorithm.
Text Books :
1. Herbert Scheldt, [4th Edition], The Complete reference C++, Tata McGraw-Hill
2. Jean Paul Tremblay and Paul G.Sorensen [2007], An introduction to Data Structures with
Applications, TMH.
3. Robert Sedgewick, Algorithms in C, Addison-Wesley Publishing Company.

Reference Books :
1. E.Balaguruswamy [2008], Object Oriented Programming with C++
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C [Second Edition].
3. GAV Pai, Data Structures and Algorithms, Tata McGraw Hill Publications.

Web References:
1. https://www.cprogramming.com/algorithms-and-data-structures.html
2. https://www.tutorialspoint.com/data_structures_algorithms
3. http://index-of.co.uk/Algorithms/Algorithms%20in%20C.pdf

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 DATABASE MANAGEMENT SYSTEMS (DBMS)
III Semester: CSE Scheme: 2017
Course Code Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS205 Professional
Assessment
Core
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Design ER model for a practical Real life system.
CO2: Use SQL commands to create, update, modify and retrieve data from the data bases.
CO3: Understand the importance of Good database design and indexing.
CO4: Understand the properties of transactions in a database system.
CO5: Understand Concurrency control techniques and Recovery system.

UNIT– I
Introduction: Introduction to DBMS, Purpose of Database Systems, Database System Applications,
View of Data, Data Models, Database Users, Database Architecture.
Entity-Relationship Model: Basic Concepts, Cardinality of Relationship, ER Diagram Notations,
Entity-Relationship Diagrams, Extended E-R Features, Modeling using ER Diagrams, Reduction of an
E-R Schema to Tables.
UNIT– II
Structured Query Language (SQL): Introduction to SQL, Data types, Data Definition language
commands, Data Manipulation language Commands and Data control Language Commands ,
Candidate Key, Primary key, Foreign key, Select Clause, Where Clause, Logical Connectivity’s –
AND, OR, Range Search, Pattern Matching, Order By, Group By, Set Operations – Union, Intersect
and Minus, Aggregate Functions, Join Operations.
PL/SQL: Control Structures, Procedures, functions, Triggers and Cursors.

UNIT– III
Relational Database Design: Features of Good Relational database Designs, Decomposition,
Normalization, Functional Dependency, Types of Normal Forms - First Normal Form, Second Normal
Form, Third Normal Form, Boyce Codd Normal Form(BCNF), Fourth Normal Form and Fifth
Normal Form.
Indexing and Hashing: Basic Concepts, Ordered Indices, Multilevel Indices, Secondary Indices,
Static Hashing and Dynamic Hashing.

UNIT– IV
Transactions: ACID properties of a Transaction, Transaction States, Implementation of Atomicity and
Durability, Concurrent Executions.
Serializability : Conflict Serializability, View Serializability, Recoverability –Recoverable and Non
Recoverable Schedules, Cascade less Schedules, Testing for Serializability.
UNIT– V
Concurrency control: Lock-Based Protocols, Timestamp-Based Protocols, Validation Based
Protocols, Multiple Granularity, Deadlock handling.
Recovery System: Failure Classification, Storage Structure, Recovery and Atomicity- Shadow Paging
Technique, Log-Based Recovery.
 Text Books :
1. Henry F. Korth& Abraham Silberschatz [2005], [5 Edition], Data Base System Concepts,
MC Graw Hill.

Reference Books :
1. C J Date [2008], An Introduction to Data Base Systems, Pearson Education.
2. Raghu Ramakrishna and Johnannes Gehrke [2003], [3rd Edition], Data Base Management
Systems, TATA Mc GrawHill.
3. ElmarsiRamez and Navrate Shamkant B [2009], Fundamentals of Data Base Systems,
Pearson Education.

Web References:
1. https://www.w3schools.com/sql
2. https://www.tutorialspoint.com/plsql/index.htm

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 COMPUTER ORGANIZATION & ARCHITECTURE (COA)

III Semester: CSE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
Professional L T P C Internal End Exam TOTAL
CS207 Core Assessment
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Analyze the Computer Organization and Design of a Basic Computer.
CO2: Impart the knowledge of Programming the Basic Computer and the design of Micro
programmed control unit
CO3: Understand the Internal working of an CPU, Pipeling and Vector Processing
CO4: Implement the Computer Arithmetic and understand Input Output Organization
CO5: To understand the concepts RAM, ROM, Virtual Memory and Secondary Storages

UNIT– I
Basic Computer Organization and Design
Instruction Codes, Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle,
Memory Reference Instructions, Input/output and Interrupt, Complete Computer Description, Design
of Basic Computer.
UNIT– II
Programming The Basic Computer
Introduction, Machine Language, Assembly Language, The Assembler, Programming Arithmetic and
Logic Operations.
Micro Programmed Control:
Control Memory, Address Sequencing, Micro program Example, Design of Control Unit.
UNIT– III
Central Processing Unit
Introduction, General Register Organization, Stack Organization, Instruction Formats, Addressing
Modes, Data Transfer and Manipulation, Program Control, RISC and CISC.
Pipeline and Vector Processing
Parallel Processing, Pipelining, Arithmetic and Instruction Pipeline, RISC Pipeline, Vector
Processing, Array Processors.
UNIT– IV
Computer Arithmetic:
Introduction, Addition and Subtraction, Multiplication, Division algorithms.
Input/output Organization
Peripheral Devices, Input/output Interface, Asynchronous Data Transfer, Modes of Transfer, Priority
Interrupt, DMA.
UNIT– V
The Memory System:
Basic Concepts, Semiconductor RAM memories, Read-Only memories, Speed, Size and Cost, Cache
Memories -Mapping Functions, Virtual Memories, Secondary Storage.
Text Books :
1. M. Morris Mano [2011], [3rd Edition], Computer system architecture, Pearson Education, 2011
2. Carl Hamacher, ZvonkoVranesie, SafwatZaky, [5th Edition], Computer Organization,
McGraw-

Reference Books :
1. Hayes John .P, Computer architecture & organization, MGH, 1998
2. Willam Stallings, [6 th Edition], Computer Organization and Architecture Designing for
performance, Pearson [PHI], 2003

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 CONSTITUTION OF INDIA (CI)
III Semester : CSE Scheme : 2017
Course Code Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
ML201 Mandatory
Assessment
2 - - - - - -
Sessional Exam Duration : 2 Hrs

Course Outcomes :At the end of the course the student will be able to
CO1: Understand the formation and principles of Indian Constitution.
CO2: Understand structure and functions of Union government and State executive. Duties of
President, Vice president, Prime Minister, Governor, Chief Minister cabinet and State
Legislature.
CO3: Understand constitutional amendments of 42, 44,74,76,86 and 91. Central-State relations,
President rule.
CO4: Understand Indian social structure and languages in India. Rights of women, SC, ST and then
weaker section.
CO5: Understand the structure of Judiciary, Role and functions of Supreme Court, High court and
Subordinate courts, Judicial review.
UNIT - I
Historical back ground, Significance of Constitution, Making of the constitution, Role of the
constituent Assembly, Salient features, the Preamble, Citizenship, procedure for amendment of
Constitution Fundamental rights-Derivative principles of state policy-Elections in India.
UNIT - II
Union Executive: Structures of Union Government & Functions, President, Vice President, Prime
Minister, Cabinet, Parliament- State Executive:Structures and Functions, Governor, Chief Minister,
Cabinet, State Legislature
UNIT - III
Central, State Relations, President’s Rule, Constitutional Amendments [42, 44, 74, 76, 86 & 91]-
Constitutional functionaries, Working of Parliamentary system in India
UNIT - IV
Indian Social Structure, Languages in India-Political Parties & Pressure groups, Rights of Women-
S.C‟s, S.T‟ s & other weaker sections.
UNIT - V
Judiciary: Structure, Organisation of Judiciary, independence of the Judiciary, role and functions of
Supreme Court, High Courts & Sub ordinate courts, Judicial Review.

Text Books :
1. Durga Das Basu, “Introduction to the Constitution of India”, Wedwe& Company
2. Macivel, Page, “An Introduction Analysis”, Society
3. M.V. Pylee, “Indian Constitution”, S. Chand Publications
4. Subhash C Kashyao :“Our Constitution”,NationalBank,Trust, India.
5. Constitutional Law of india by Dr.S.M.Rajan
Reference Books :
1. The Constitution of India.By the Ministry of Law and Justice, The Govt. of India.
2. Constitutional Law of India by kashyapsubhasah ,c
3. Indian constitution Law by M.P.Jain
4. Constitutional Law of India by H.M Seervai

Web References:
1. https://www.india.gov.in/my-government/constitution-india
 ADVANCED DATA STRUCTURES LAB (ADS (P))

III Semester: CSE Scheme: 2017

Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS204
Assessment
0 0 2 1 50 50 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Write programs using Class and Object concepts.
CO2: Implement Programs for the applications of Linked lists, Stacks and Queues.
CO3: Perform operations on Binary Search Trees and AVL Trees.
CO4: Develop programs for various Hashing Techniques.

List of Experiments
1. Implementation of Class, Object concepts
2. Application of Linked List: Polynomial operations
3. Applications of Stacks: Conversion of arithmetic expressions from one form to other, Evaluation
of Expressions, Recursion
4. Application of Queue: Graph traversals
5. Implementation of Binary Search Tree
6. Implementation of AVL Trees
7. Applications of Binary Heaps
8. Implementation of Hashing Techniques

Reference Books:
1. Herbert Scheldt, [4th Edition], The Complete reference C++, Tata McGraw-Hill.
2. Jean Paul Tremblay and Paul G.Sorensen [2007], An introduction to Data Structures with
Applications, TMH.
 DATABASE MANAGEMENT SYSTEMS LAB (DBMS (P))
III Semester: CSE Scheme: 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS206
Assessment
0 0 2 1 50 50 100
End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Work with the concepts of DDL, DML, DCL Commands.
CO2: Design of databases for real life systems using Oracle.
CO3: Learning of SQL queries on the real life systems.
CO4: Execution of PL/SQL programs for different problems
CO5: Implementation of procedure, function, trigger and cursor concepts in PL/SQL

List of Experiments
1. Perform DDL, DML and DCL commands.
2. Design and create a University Library Data base using ER diagram and Schema Diagram.
3. Design and create a university database consisting of the following tables Department,
Course, Instructor and Student using ER Modelling and Schema Diagram.
4. Create various tables like Branch, Account, Depositor, Customer, Loan and Borrower for a
banking system with constraints using a Schema diagram.
5. Perform various SQL queries on select clause, where clause, pattern matching, Order by,
and Group by.
6. SQL Queries on Set operations, Aggregate functions and Join Operations.
7. PL/SQL program using control Structures
8. Program to implement Procedures and Functions.
9. Program to implement Cursors.
10. Program to implement Triggers.

Web References :
1. https://www.w3schools.com/sql
2. https://www.tutorialspoint.com/plsql/index.htm
 ADVANCED COMMUNICATION SKILLS LAB (ACS(P))

III/IV Semester: Common for all Scheme : 2017

Branches
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal TOTAL
HU203 Assessment
0 0 2 1 100 100

Course Outcomes : At the end of the course students will be able to

CO1: Speak in English confidently, fluently and effectively.
CO2: Exhibit team playing and leadership skills.
CO3: Give Presentations effectively.
CO4: Comprehend the Verbal and Non-verbal texts.
CO5: Prepare Resume, Company profiles and Project presentations.
CO6: Enhance possibilities of Job prospects.

List of Activities
Focus in the lab is more on fluency than on accuracy
1. Ice breaking Activities
2. JAM
3. Listening Comprehension – Practice tests
4. Oral Presentation
5. Presentation Strategies
6. Group Discussion – Team Playing, Leadership Skills
7. Debate
8. Information Transfer – Verbal to Non-verbal and Vice-Versa
9. Resume Preparation
10. Company Profiling
11. Interview Skills – a) Telephonic Interview
b) Personal Interview
12. Project Presentation

Reference Books :
1. Communication Skills, Sanjay Kumar and PushpLata, Oxford University Press.
2. English Language Laboratories A Comprehensive Manual, NiraKonar, PHI.
3. Technical Communication 3 E, Raman and Sharma, Oxford University Press.
4. Personality Development and Soft Skills, Barun k. Mitra, Oxford University Press.
 PROBABILITY AND STATISTICS (PS)

IV Semester : CSE Scheme : 2017

Course
Category Hours/Week Credits Maximum Marks
Code
Continuous
End
L T P C Internal TOTAL
BS204 Foundation Exam
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes : At the end of the course the student will be able to
CO1: Gain the knowledge on Mathematical Statistics and probability theory
CO2: Classify discrete and continuous distributions
CO3: Understand the test of hypothesis for large samples
CO4: Analyze the Test of significance for small samples
CO5: Find correlation coefficient and classification of ANOVA

UNIT – I
Statistical Methods: Introduction to statistics, Frequency distribution, Measures of Central
Tendency, Measures of dispersion, Moments.
Probability: Basic concepts of probability, Addition and Multiplication law of probability,
Mathematical Expectation -Variance and Co-variance.
UNIT - II
Probability Distributions: Random variable – Discrete and continuous probability distributions and
Functions; Binomial, Poisson and Normal distributions.
UNIT – III
Test of Hypothesis: Population and sample, Confidence interval of mean, Statistical hypothesis –
Null and Alternative hypothesis, Level of Significance and Critical region, Z-test for means and
Proportions.
UNIT - IV
Test of Significance: Student t-test - sample mean, difference between sample means and paired
Student t-test, F – test, Chi-square test –Goodness of fit and independence of attributes.
UNIT - V
Correlation: Co-efficient of Correlation, Lines of regression and Rank Correlation.
Analysis of Variance : ANOVA for One-way classification , ANOVA for Two-way classification

Text Books
1. Gupta and Kapur Fundamentals of Mathematical Statistics; S.Chand & Company, New Delhi.
2. T.K.V.Iyengar and others -Probability And Statistics, S.Chand & Company, 5th Edition, 2015.
3. B.S.Grewal [2012], HigherEngineering Mathematics, Khanna Publishers,NewDelhi.
Reference Books
1. K.Murugesan & P.Gurusamy , Probability And Statistics , Anuradha Publications
2. Probability And Statistics , Murray R Spiegal and others , Schaum’s series, Tata Mcgraw Hill
Education.
3. Leomard Kazmier , Business Statistics , Schaum’s series, Tata Mcgraw Hill Education

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall
be EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and
may contain sub-questions. i.e there will be two questions from each unit and the student should
answer any one question
 OBJECT ORIENTED PROGRAMMING (OOP)

IV Semester: CSE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS208 Professional
Assessment
Core
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understand fundamentals of oop concepts, class, input and output
CO2: Explain Inheritance, packages and interface
CO3: Illustrate string handling methods, exception handling
CO4: Apply multi threading concepts, files
CO5: Understand applet programming, AWT and event handling

UNIT– I
Object oriented concepts:
Fundamentals, Overview of Java, Java buzzwords, Data types, variables and arrays. Operators, control
statements. Introducing Classes: Class fundamentals, declaring objects, introducing methods,
Constructors, Reading console input, writing console output, this keyword, garbage collection,
finalize.
UNIT– II
Inheritance:
Inheritance basics, using super, method overriding, dynamic method dispatch, abstract class, using
final with inheritance.
Packages and Interfaces:
Defining package, access protection, importing packages. Interfaces: Defining interface, implementing
interface

UNIT– III
String Handling:
String constructors, Special string operations, character extraction, string comparison, searching
strings, modifying strings. StringBuffer class and its methods.
Exception Handling:
Fundamentals, exception types, try, catch, throw, throws, finally. Java built-in exceptions, creating
your own exception subclasses.

UNIT– IV
Multithreading:
Java thread model, Main thread, creating a thread, creating multiple threads, Thread class and its
methods, isAlive( ), join( ), thread priorities, synchronization, interthread communication.
Files:
Reading and writing files
UNIT– V
Applet:
Applet basics and Applet class.
AWT Controls: Label, Button, Checkbox, Checkbox Group, Choice, List, Scrollbar, TextField,
TextArea.
Event Handling: Delegation event model, Event Classes, sources of events, event listener interfaces.
Adapter classes.
Text Books :
1. Herbert Schildt [2008], [5th Edition], The Complete Reference Java2, TATA McGraw-Hill.
2. E Balaguruswamy [2007], [3rd Edition], Programming with Java, A Primer, TATA McGraw-Hill

Reference Books :
1. Bruce Eckel [2008], [2nd Edition], Thinking in Java, Pearson Education.
2. H.M Dietel and P.J Dietel [2008], [6th Edition], Java How to Program, Pearson Ed.

Web References:
1. https://www.tutorialspoint.com/java/index.htm

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 OPERATING SYSTEM (OS)

IV Semester: CSE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
CS210 Professional L T P C Internal End Exam TOTAL
Core Assessment
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course, the students will be able to
CO1: Understand the OS design structures and its services.
CO2: Understand the concepts of process scheduling, synchronization and its implementation.
CO3: Exemplify the memory management techniques and virtual memory.
CO4: Understand the structure and organization of file system and secondary storage structure.
CO5: Understand Deadlock handling mechanisms, Protection and Security services and Linux Case Study.

UNIT– I
Introduction:
What Operating Systems Do, Operating System Structure, Operating System Operations, Overview of
Process Management, Memory Management, Storage Management, Protection and Security, Computing
Environments
Operating System Structures:
Operating System Services, User Operating System Interface, System Calls, Types of System Calls,
Operating System Structure.
UNIT– II
Process Management:
Processes-Process Concept, Process Scheduling, Operations on Processes, Inter process Communication,
Examples of IPC Systems, Threads- Overview, Multicore Programming, Multithreading Models.
Synchronization: Background, The Critical-Section Problem, Peterson’s Solution, Semaphores, Classic
problems of Synchronization, Monitors.
Process Scheduling:
Basic concepts, Scheduling Criteria, Scheduling Algorithms, Real Time CPU Scheduling-RMS & EDF
UNIT– III
Memory Management:
Main Memory Background, Swapping, Contiguous Memory Allocation, Segmentation, Paging, Structure of
the Page table.
Virtual Memory Background, Demand paging, Page Replacement, Allocation of Frames, Thrashing.
UNIT– IV
Storage Management:
Mass Storage Structure: Overview of Mass-Storage Structure, Disk Structure, Disk Scheduling.
File System Interface: File Concepts, Access Methods, Director y and Disk Structure,
F i l e S y s t e m I m p l e m e n t a t i o n - File system Structure, File system Implementation, Directory
Implementation, Allocation Methods, Free-Space Management.
UNIT– V
Deadlocks:
S ystem Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,
Deadlock Avoidance, Deadlock Detection, Recover y from Deadlock.
Protection and Security:
 Protection: Goals of Protection, Domain of Protection, Access Matrix, Implementation of Access Matrix,
Access Control, Revocation of access rights,
Security: The Security problem, System and Network Threats.
CASESTUDY: The Linu x Operating System:
History, Design Principles, Kernel Modules, Process Management.

Text Books :
1. Silberschatz, Galvin and Greg Gagne, Operating S ystem Concepts, 9thedition, WILEY INDIA
Edition.

Reference Books :
1. Operating System : Internals and Design principles, 5th Edition, Willam Stallings Prentice Hall of India.
2. Gagne[2003],[6thEdition],Operating System Concepts, John Wiley & Sons, Inc publishers.
3. Tanenbaum [2000],Modern Operating System, Pearson Education..

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30marks, covering half of the syllabus for first sessional
and remaining half for second sessional exam. Question No 1 which carries 6 marks contains three short
answer questions of two marks each. The remaining three questions shall be EITHER/OR type questions
carrying 8marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2 marks. (Total
10 marks) covering one question from each unit. The remaining five questions shall be EITHER/OR type
questions carrying 10 marks each. Each of these questions is from one unit and may contain sub- questions.
i.e there will be two questions from each unit and the student should answer any one question
 COMPUTER NETWORKS (CN)
IV Semester: CSE Scheme: 2017
Course Code Category Hours/Week Credits Maximum Marks
Continuous
Professional L T P C Internal End Exam TOTAL
CS211
Core Assessment
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understand Network models and Physical layer Understand Data Communication Systems,
Network models and its Protocols
CO2: Study the techniques used in data link layer.
CO3: Understand the routing strategies for an IP based networking infrastructure.
CO4: Study of congestion control and internetworking concepts.
CO5: Understand connection establishment and services provided by TCP and UDP

UNIT– I
Introduction: Data communications, Networks, Protocols and standards, The OSI Model – Layered
architecture, Layers in OSI Model, TCP/IP Protocol Suite, Addressing – Physical addresses, Logical
addresses, Port Addresses.
Physical layer and Transmission Media: Analog and digital – Analog and digital data, Analog and
digital signals, Digital signals – Bit rate, Bit length, Transmission of digital signals, Transmission
Impairments – Attenuation, Distortion and Noise, Performance – Bandwidth, Throughput, Latency,
Jitter.
UNIT– II
Data Link Layer: Error detection – Introduction, Block coding – error detection, error correction,
hamming distance and minimum hamming distance, CRC codes, Checksum. Framing, Flow and error
control.
UNIT– III
Network layer: Design Issues: store-and-forward, services to transport layer, connection less and
Connection oriented services, comparison of virtual circuits and datagram subnets.
Routing Algorithms: The optimality principle, shortest path routing, Flooding, Distance vector and
Link state, Hierarchical, Broadcast and Multicast Routings.
UNIT– IV
Congestion Control: Principles, congestion prevention policies, congestion control in virtual circuits
and datagram subnets, load shedding, jitter control.
Internetworking: Concatenated virtual circuits, connection less internetworking, tunnelling, Internet
work routing, Fragmentation. The IP protocol, IP address, Internet Control protocols, Gateway routing
protocols: OSPF, BGP.
UNIT– V
Transport Layer: UDP, TCP- service model, protocol, segment header, connection management,
Transmission Policy, congestion control and timer management.
Application Layer: The DNS Name Space, Resource Records, Name Servers.
Text Books :
1. Behrouz A. Forouzan [2006][4th Edition], Data communications and Networking, MGH.
2. Andrew S. Tenenbaum [2007], [4th Edition], Computer Networks, Pearson Education.

Reference Books :
1. William Stallings ,Data and Computer Communications, Seventh Edition or Eighth Edition
2. An Engineering Approach to Computer Networks, S.Keshar, [II Edition], Pearson Education.
3. Computer Networking: A Top-Down Approach Featuring the Internet, James F, Keith W.Ross,
[V Edition], Pearson Education.
4. Computer networks and internets, Douglas E Comer [6th Edition], Pearson Education.

Web References:
1. https://www.tutorialspoint.com/data_communication_computer_network/index.htm

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 DESIGN & ANALYSIS OF ALGORITHMS (DAA)

IV Semester: CSE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
Professional L T P C Internal End Exam TOTAL
CS212
Core Assessment
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understand time, space complexities, notations, Divide and conquer technique to solve problems.
CO2: Understand greedy method to solve problems.
CO3: Understand Dynamic programming technique to solve problems.
CO4: Understand Backtracking and branch & bound techniques and solve problems.
CO5: Understand basic tree traversal and searching techniques and finding the lower bound for
various applications

UNIT– I
Introduction: What is an Algorithm? Performance Analysis: Space &Time Complexities, Asymptotic notation,
Probabilistic analysis, Amortized analysis.
Divide and Conquer: General method, Binary search, Finding Maximum and Minimum, Merge sort, Quick sort,
Strassens Matrix Multiplication.
UNIT– II
Greedy Method : The General Method, Knapsack Problem, Tree Vertex splitting, Job Sequencing with
Deadlines, Minimum-Cost Spanning Trees, Optimal Storage on Tapes, Optimal Merge Patterns, Single Source
Shortest Paths.
UNIT– III
Dynamic Programming : The General Method, Multistage Graphs, All Pairs Shortest Paths, Optimal Binary
Search Trees, String Editing problem, 0/1-Knapsack, Reliability Design, The Travelling Salesperson Problem.
UNIT– IV
Backtracking: The General Method, The 8-Queens Problem, Sum of Subsets, Graph Coloring, and Hamiltonian
Cycles.
Branch and Bound: The Method, 15 Puzzle problem, Travelling Salesperson.
UNIT– V
Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for Graphs, Bi-connected
Components and DFS.
Lower Bound Theory: Comparison Trees, Oracles and Adversary Arguments, Techniques for Algebraic
problems.
Text Books :
1. Ellis Horowitz, SartazSahni& Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms, Galgotia
Publications Second Edition.

Reference Books :
1. Jon Kleinberg, Eva Tardos, Algorithm Design, Pearson Education Seventh Impression.

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first sessional
and remaining half for second sessional exam. Question No 1 which carries 6 marks contains three short
answer questions of two marks each. The remaining three questions shall be EITHER/OR type questions carrying
8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2 marks.
(Total 10 marks) covering one question from each unit. The remaining five questions shall be EITHER/OR
type questions carrying 10marks each. Each of these questions is from one unit and may contain sub-questions.
i.e there will be two questions from each unit and the student should answer any one question
 SOFTWARE ENGINEERING (SE)

IV Semester: CSE Scheme: 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS213 Professional
Assessment
Core
3 0 - 3 40 60 100
Sessional Exam Duration: 2 Hrs End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Understand the phases of software development life cycle and Process models
CO2: Demonstrate Requirement Engineering process and change management
CO3: Understand the design concepts, design models, architectural styles and patterns
CO4: Explain White box testing and Black box testing techniques
CO5: Understand Risk Mitigation Monitoring Management plan, Software Quality Assurance activities
and Quality standards

UNIT– I
Introduction To Software Engineering And Process Models: The Evolving role of software, Changing nature
of software, Software myths.
Software Engineering: A Layered Technology, A Process Framework.
Process Models: The Waterfall model, Incremental process models, Evolutionary process models, The
Unified process, Agile process models.
UNIT– II
Software Requirement and Requirement Engineering Process: Functional and Non-functional requirements,
User requirements, System requirements, The Software requirements document.
Requirement Engineering Process: Feasibility studies, Requirements elicitation and Analysis, Requirement
validation, Requirement Management.
UNIT– III
Design: Design process and Design quality, Design concepts-Abstraction, Information Hiding, Functional
Independence, Refactoring, Modularity, Refinement, Design Classes, Design Model.
Creating an Architectural Design: Software Architecture, Data Design- Data Design at architecture level,
Data Design at component level, Architectural Styles & Patterns. Architectural design.
UNIT– IV
Testing & Metrics: Testing Strategies-A Strategic approach to Software testing, Test strategies for
Conventional software, White Box Testing- Basis Path Testing, Control Structure Testing, Black Box Testing,
Validation Testing, System Testing, The art of Debugging.
Metrics for Process & Products: Software Measurement, Metrics for software quality.
UNIT– V
Risk Management: Risk Management- Reactive vs. Proactive risk strategies, Software risks, Risk
identification, Risk projection, Risk refinement, RMMM, RMMM plan.
Quality Management: Quality Management- Quality Concepts, Software quality assurance, Software reviews,
Formal technical reviews, Statistical software quality assurance, Software reliability, The ISO 900 quality
standards.
Text Books :
1. Roger S.Pressman [2005], [7th Edition], Software Engineering, A Practitioner’s Approach, Mc
Graw Hill, International Edition.
2. Sommerville [2008], [7th Edition], Software Engineering, Pearson education.

Reference Books :
1. K.K.Agarwal&Yogesh Singh [2008], Software Engineering, New Age International Publishers.
2. James F.Peters,Witoldpedecz,JohnWiely [2008], Software Engineering-an Engineering approach.
3. Software Engineering, Pankaj Jalote’s , A Precise Approach, Wiley

Web References:
1. 1. https://www.tutorialspoint.com/software_engineering/software_engineering_tutorial.pdf
2. 2.http://www.niecdelhi.ac.in/uploads/Notes/btech/4sem/cse/21378403-Software-Engineering-
-K-Aggarwal-YogeshSingh-Full-Notes.pdf

Question Paper Pattern:

Sessional Exam
The question paper for sessional examination is for 30 marks, covering half of the syllabus for first
sessional and remaining half for second sessional exam. Question No 1 which carries 6 marks contains
three short answer questions of two marks each. The remaining three questions shall be EITHER/OR
type questions carrying 8 marks each.

End Exam
Question Paper Contains Six Questions. Question 1 contains 5 short Answer questions each of 2
marks. (Total 10 marks) covering one question from each unit. The remaining five questions shall be
EITHER/OR type questions carrying 10marks each. Each of these questions is from one unit and may
contain sub-questions. i.e there will be two questions from each unit and the student should answer
any one question
 ENVIRONMENTAL STUDIES (ES)

IV Semester: Common for CSE & ECE Scheme : 2017

Course Code Category Hours/Week Credits Maximum Marks
Continuous
Internal End
ML02 Mandatory L T P C TOTAL
Assessment Exam
2 - - - - - -
Sessional Exam Duration : - End Exam Duration:-
Course Outcomes : At the end of the course students will be able to
CO1: Apply the knowledge of environmental issues in his area of work. Appreciate the need for the
conservation of Natural resources for sustainable development.
CO2: Understands the importance of Ecosystem and conservation of biodiversity
CO3: Understands the problems due to environmental pollution with remedial measures and issues related to
environment.
CO4: Appreciate the disaster management in prevention of loss of life and property
CO5: Appreciate the use of IT & related technology to conserve environment & human health.

UNIT - I
Introduction to Environmental studies and Natural resources:
Definition, scope, importance and multidisciplinary nature of Environmental studies. Need for public
awareness.
Energy resources-Growing energy needs non-renewable and renewable energy resources: Hydroelectric, solar,
wind and nuclear energy resources. Water resources-Use and over exploitation of surface and ground water.
Dams and its effects on forest and tribal people. Forest resources- uses of forest, deforestation causes and
effects. Food resources- changes caused by agriculture and over grazing. Modern agriculture and its effects.
Role of individual in conservation of natural resources.
UNIT - II
Concepts of ecosystem:
Structure and function of an ecosystem. Energy flow in an ecosystem (single channel energy flow model).
Ecological succession. Food chains, food webs and ecological pyramids. Introduction, types, characteristic
features and functions of grasslands, desert, pond and ocean ecosystems.
UNIT - III
Biodiversity and its conservation:
Definition, levels of biodiversity. Values of biodiversity- consumptive, productive, social, ethical and
ecological services. Hot spots of biodiversity. Biogeographical classification of India. Endangered and
endemic species of India. Threats to biodiversity-Habitat loss, poaching of wild life and man-wild life conflict.
Conservation strategies- In situ and ex situ conservation.
UNIT - IV
Environmental pollution:
Definition, causes, effects and control measures of air, soil,water and noise pollution. Disaster management -
Floods. Earth quake, cyclone and landslides. Global warming, acid rains, ozone layer depletion. Waste
management-Municipal solid waste. Role of an -individual in prevention of pollution.
UNIT - V
Social issues and the environment
Consumerism and waste products. From unsustainable development to sustainable development. Salient
features of Air Act, water Act and Forest conservation Act. Process involved in the enforcement of
Environmental legislation. Role of Information Technology in environment and human health.

Text books
1. C.P. Kaushik and Anubha Kaushik, “ Environmental Studies” New Age International(p) Ltd., New
Delhi
2. R.Rajagopalan “ Environmental Studies”, Oxford University press, Chennai
3. Y.Anjaneyulu “ Introduction to Environmental sciences”, BS Publications, Hyderabad

Reference books
1. Benny Joseph. “Environmental Studies” , Tata McGraw Hill, New Delhi.
2. Barucha Erach, “Environmental studies”, Universities press.
 BASIC ELECTRONICS LAB (BE (P))

IV Semester: CSE Scheme:2017

Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
EC212
Assessment
0 0 2 1 50 50 100
End Exam Duration: 3 Hrs

Course outcomes: Up on successful completion of this course, the student shall be able to
CO1: Study and analyze the operation of cathode-ray oscilloscope (CRO) for Sinusoidal,Triangular, Square
wave forms and phase calculation using lissajous figures.
CO2: Plot the V-I characteristics of PN-Diode, Zener diode to understand their behavior and calculate cut-in
voltage, breakdown voltage
CO3: Design half wave and full wave rectifiers with filters, calculate ripple factor and percentage of regulation,
and plot the characteristics
CO4: Design Common Base(CB) and Common Emitter (CE) configuration and Characterize the current flow
of a bipolar transistor in CB and CE configurations
CO5: Realize Boolean expression using logic gates and design Half adder and Full adder Circuit
CO6: Design and realize the truth tables for Multiplexer and Shift register
CO7: Study and analyze the basic operation of Operational Amplifier (OP-AMP-741)

List of Experiments
1. Study of Electronic equipment - CRO, CDS, and FG etc
2. Semiconductor Diode Characteristics (p-n diode and Zener diode)
3. Half Wave and Full wave Rectifiers
4. Transistor Characteristics – CE Configuration
5. Transistor Characteristics – CB Configuration
6. Verification of Logic Gates
7. Half Adder and Full Adder
8. Multiplexers and Decoders
9. Verification of Flip flops
10. Shift Register
11. Inverting and Non Inverting Amplifier
12. Summing and Difference Amplifier
 OBJECT ORIENTED PROGRAMING LAB (OOP(P))
IV Semester: CSE Scheme: 2017
Course Code Hours/Week Credit Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS209
Assessment
0 0 2 1 50 50 100
End Exam Duration: 3 Hrs

Course Outcomes: At the end of the course students will be able to

CO1: Implement class, object and constructor in java.
CO2: Develop programs using packages and Interfaces.
CO3: Perform operations on strings
CO4: Implement the concept of multithreading and file
CO5: Design applets with event handling mechanism

List of Experiments
1. Class, object, Constructor: Student details, complex number arithmetic operations, transpose
of a matrix.
2. Inheritance: Multilevel, Hierarchical
3. Packages: Access protection
4. Interface: Multiple inheritance using interface
5. String handling: String class and its methods
6. Exception handling: built-in exceptions and custom exceptions
7. Multithreading: creating multiple thread using Thread class and Runnable interface
8. Files: Reading and writing.
9. AWT controls: Drawing various shapes and factorial of a number
10. Event handling: mouse events and keyboard events

Reference Books :
1. Herbert Schildt [2008], [5th Edition], The Complete Reference Java2, TATA McGraw-
Hill.
 SOFT SKILLS LAB (SS(P))

III/IV Semester : Common for all Scheme : 2017

Branches
Course Code Hours/Week Credits Maximum Marks
Continuous Internal
L T P C Assessment TOTAL
HU204
0 0 2 1 100 100

Course Outcomes : At the end of the course students will be able to

CO1: Communicate effectively and enhance their interpersonal relationship building skills with
renewed self confidence
CO2: Work together in teams and accomplish objectives in a cordial atmosphere
CO3: Face interviews, GDs and give presentations
CO4: Understand and develop the etiquette necessary to present themselves in a professional setting
CO5: Learn the Principles of Personal effectiveness

List of Activities
1. Ice breaking Activities, Principles of Time and Stress Management
2. Art of speaking
3. Art of writing - Essay / Picture / Story
4. Business etiquette - Telephone and email
5. Presentation Skills - Power point making
6. Group Discussion – Objectives and Skills tested in a GD, types of GD, Dos and don'ts & practice
7. Team work - Drama / Skit / Role play
8. Paper / Poster Presentation
9. Problem Solving by lateral thinking puzzles
10. Know your General Awareness / Knowledge – Quiz
11. Principles of Personal excellence
12. Interview Skills

Reference Books :
1. Stephen R. Covey, “The Seven Habits of Highly Effective People”, Pocket Books Publishers,
London
2. Priyadarshani Patnaik, “Group Discussion and Interview Skills with VCD”, Foundation Books.
3. Sangeeta Sharma &Binod Mishra, “Communication Skills for Engineers and Scientists”, PHI
Learning Private Limited.
4. Shiv Khera, “You Can Win”, MacMillan India Publishers, New Delhi
5. Campus Connect Portals - TCS - https://campuscommune.tcs.com; Infosys -
http://campusconnect.infosys.com/