M.D.

UNIVERSITY, ROHTAK
SCHEME OF STUDIES AND EXAMINATION
B.TECH (Computer Science and Engineering)
Common with
B.Tech. (Information Technology)
&
B.Tech. (Computer Science and Information Technology)
rd th
SEMESTER 3 & 4
Scheme effective from 2019-20

COURSE CODE AND DEFINITIONS

Course Code Definition
L Lecture
T Tutorial
P Practical
BSC Basic Science Courses
ESC Engineering Science Courses
HSMC Humanities and Social Sciences including Management courses
PCC Professional Core Courses
LC Laboratory Courses
MC Mandatory Courses
PT Practical Training
S Seminar
 B.Tech. (Computer Science and Engineering)
Common with B.Tech. (Information Technology) &
B.Tech. (Computer Science and Information Technology)
Scheme of Studies/Examination w.e.f. 2019-20
Semester- 3

Tot Examination Schedule

Hours per week Dur
al (Marks)
atio
Con Mar
n of
Sr. tact Cre k of
Course Code Course Title Pra Exa
No. Hrs. dit Cla The Tot
L T P ctic m
per ss ory al
al (Ho
wee wor
urs)
k k
Database
 PCC-CSE-
1 Management 3 0 0 3 3 25 75   100 3
201G
Systems

 PCC-CSE- Data Structures

2 3 0 0 3 3 25 75   100 3
203G & Algorithms

 PCC-CSE- Digital
3 3 0 0 3 3 25 75   100 3
205G Electronics

 PCC-CSE- Python
4 2 0 0 2 2 25 75   100 3
207G Programming

Mathematics - III
(Multivariable
 BSC-MATH-
5 Calculus and 2 0 0 2 2 25 75   100 3
203G
Differential
Equations)

Economics for
6  HSMC-01G 3 0 0 3 3 25 75   100 3
Engineers

Database
 LC-CSE-
7 Management 0 0 4 4 2 25   25 50 3
209G
Systems LAB

 LC-CSE- Digital
8 0 0 4 4 2 25   25 50 3
211G Electronics LAB

Data Structures
 LC-CSE-
9 & Algorithms 0 0 4 4 2 25   25 50 3
213G
LAB Using C
Python
 LC-CSE-
10 Programming 0 0 2 2 1 25   25 50 3
215G
LAB

Total 23 800
 B.Tech. (Computer Science and Engineering)
Common with B.Tech. (Information Technology) &
B.Tech. (Computer Science and Information Technology)
Scheme of Studies/Examination w.e.f. 2019-20
Semester- 4

Tot Examination Schedule

Hours per week Dur
al (Marks)
atio
Con Mar
n of
Sr. Course Title tact Cre k of
Course Code Pra Exa
No. Hrs. dit Cla The Tot
L T P ctic m
per ss ory al
al (Ho
wee wor
urs)
k k

1  PCC-CSE-202G Discrete 3 4 25 75   100 3

3 1 0
Mathematics

Computer
2  PCC-CSE-204G Organization & 3 0 0 3 3 25 75   100 3
Architecture

3  PCC-CSE-206G Operating 3 3 25 75   100 3

3 0 0
System

Object Oriented
4  PCC-CSE-208G 3 0 0 3 3 25 75   100 3
Programming

5  HSMC-02G Organizational 3 3 25 75   100 3

3 0 0
Behaviour

6  *MC-106G Environmental 4 0 - - - - 3
3 0 1
Sciences

7  PCC-CSE-210G Web 2 1 25 75  100 3

2 0 0
Technologies

8  LC-CSE-212G Operating 4 2 25   25 50 3
0 0 4
System LAB

Object Oriented
9  LC-CSE-214G Programming 0 0 4 4 2 25   25 50 3
LAB Using C++
Web
10. LC-CSE-216G Technologies 0 0 2 2 1 25 25 50 3
Lab
Total 22 750
*
is a mandatory non –credit course in which the students will be required
MC-106G
passing marks in theory.
NOTE: At the end of 4th semester each student has to undergo Practical Training of
4/6 weeks in an Industry/ Institute/ Professional Organization/ Research
Laboratory/ training centre etc. and submit typed report along with a certificate
from the organization & its evaluation shall be carried out in the 5th Semester.
 Database Management System

Course code PCC-CSE-201G

Category Professional Core Course
Course title Database Management System
L T P Credits
Scheme and Credits
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Objectives of the course

a. To understand the different issues involved in the design and implementation of a
database system.
b. To study the physical and logical database designs, database modeling, relational,
hierarchical, and network models
c. To understand and use data manipulation language to query, update, and manage a
database
d. To develop an understanding of essential DBMS concepts such as: database security,
integrity, concurrency, distributed database, and intelligent database, Client/Server
(Database Server), Data Warehousing.
e. To design and build a simple database system and demonstrate competence with the
fundamental tasks involved with modeling, designing, and implementing a DBMS.

Note: Examiner will set nine questions in total. Question one will be compulsory.
Question one will have 6 parts of 2.5 marks each from all units and remaining eight
questions of 15 marks each to be set by taking two questions from each unit. The
students have to attempt five questions in total, first being compulsory and selecting one
from each unit.

Unit: 1
Database system architecture: Data Abstraction, Data Independence, Data
Definition
Language (DDL), Data Manipulation Language (DML). Data models: Entity-relationship
model, network model, relational and object oriented data models, integrity
constraints, data manipulation operations.
Unit: 2
Relational query languages: Relational algebra, Tuple and domain relational calculus,
SQL3, DDL and DML constructs, Open source and Commercial DBMS - MYSQL, ORACLE,
DB2, SQL server.
Relational database design: Domain and data dependency, Armstrong's axioms, Normal
forms, Dependency preservation, Lossless design.
Query processing and optimization: Evaluation of relational algebra expressions, Query
equivalence, Join strategies, Query optimization algorithms.
Unit: 3
Storage strategies: Indices, B-trees, hashing,
Transaction processing: Concurrency control, ACID property, Serializability of
scheduling, Locking and timestamp based schedulers, Multi-version and optimistic
Concurrency Control schemes, Database recovery.

Unit: 4
Database Security: Authentication, Authorization and access control, DAC, MAC and
RBAC models, Intrusion detection, SQL injection.
Advanced topics: Object oriented and object relational databases, Logical databases,
Web databases, Distributed databases, Data warehousing and data mining.

Suggested books:
“Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F.
Korth, S. Sudarshan, McGraw-Hill.

Suggested reference books

“Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D.
Ullman, Computer Science Press.
“Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S.
Navathe, Pearson Education
“Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull, Victor
Vianu, Addison-Wesley

Course Outcomes
1. For a given query write relational algebra expressions for that query and
optimize the developed expressions
2. For a given specification of the requirement, design the databases using E R
method and normalization.
3. For a given specification, construct the SQL queries for Open source and
Commercial DBMS -MYSQL, ORACLE, and DB2.
4. For a given query optimize its execution using Query optimization algorithms
5. For a given transaction-processing system, determine the transaction atomicity,
consistency, isolation, and durability.
6. Implement the isolation property, including locking, time stamping based on
concurrency control and Serializability of scheduling.
 Data Structure & Algorithms

Course code PCC-CSE-203G

Category Professional Core Course

Course title Data Structure & Algorithms
L T P Credits
Scheme and Credits 3
3 0
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory.
Question one will have 6 parts of 2.5 marks each from all units and remaining eight
questions of 15 marks each to be set by taking two questions from each unit. The
students have to attempt five questions in total, first being compulsory and selecting one
from each unit.

Objectives of the course:

1. To impart the basic concepts of data structures and algorithms.

To understand concepts about searching and sorting techniques
To understand basic concepts about stacks, queues, lists, trees and graphs.
To enable them to write algorithms for solving problems with the
help of fundamental data structures

Unit 1:

Introduction: Basic Terminologies: Concept of Data Structure, Choice of right Data

Structure, Algorithms , how to design and develop algorithm , Complexity of algorithm.
Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm, Searching: Linear
Search and Binary Search Techniques and their complexity analysis.

Unit 2:

Stacks  and Queues: Stack  and its  operations: Algorithms and their complexity analysis,
Applications of Stacks: Expression Conversion and evaluation -corresponding
algorithms and complexity analysis. queue, Types of Queue: Simple Queue, Circular
Queue, Priority Queue; Operations on each types of Queues: Algorithms and their analysis.
Unit 3:

Linked Lists: Singly linked lists: Representation in memory, Algorithms of several

operations:  Traversing, Searching, Insertion into, Deletion from linked list; Linked
representation of Stack and Queue, Header nodes, Doubly linked list: operations on it and
algorithmic analysis; Circular Linked Lists: all operations their algorithms and the
complexity analysis.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary
Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees and their
algorithms with complexity analysis. Applications of Binary Trees. B Tree, B+ Tree:
definitions, algorithms and analysis.
Unit 4:

Sorting and Hashing: Objective and properties of different sorting algorithms:

Selection Sort, Bubble Sort, Insertion Sort, Selection Sort Quick Sort, Merge Sort,
Heap Sort; Performance and Comparison among all the methods.

Graph: Basic Terminologies and Representations, Graph search and traversal

algorithms and complexity analysis.

Suggested books:

“Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj Sahni,

Computer Science Press.

Suggested reference books:

Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by
Mark Allen Weiss, Addison-Wesley Publishing Company
“How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson Education.

Course outcomes

1. For a given algorithm student will able to analyze the algorithms to determine
the time and computation complexity and justify the correctness.
2. For a given Search problem (Linear Search and Binary Search) student will
able to implement it.
3. For a given problem of Stacks, Queues and linked list student will able to
implement it and analyze the same to determine the time and computation
complexity.
4. Student will able to write an algorithm Selection Sort, Bubble Sort, Insertion
Sort, Quick Sort, Merge Sort, Heap Sort and compare their performance in
term of Space and Time complexity.
5. Student will able to implement Graph search and traversal algorithms and
determine the time and computation complexity.
 DIGITAL ELECTRONICS

Course code PCC-CSE-205G

Category Professional Core Course

Course title Digital Electronics
L T P Credits
Scheme and Credits Semester 3
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory.
Question one will have 6 parts of 2.5 marks each from all units and remaining eight
questions of 15 marks each to be set by taking two questions from each unit. The
students have to attempt five questions in total, first being compulsory and selecting one
from each unit.

UNIT 1:
FUNDAMENTALS OF DIGITAL SYSTEMS AND LOGIC FAMILIES
Digital signals, digital circuits, AND, OR, NOT, NAND, NOR and Exclusive-OR operations,
Boolean algebra, examples of IC gates, number systems-binary, signed binary, octal
hexadecimal number, binary arithmetic, one’s and two’s complements arithmetic, codes,
error detecting and correcting codes.

UNIT 2:
COMBINATIONAL DIGITALCIRCUITS
Standard representation for logic functions, K-map representation, and simplification of
logic functions using K-map, minimization of logical functions. Don’t care conditions,
Multiplexer, De-Multiplexer/Decoders, Adders, Subtractors, BCD arithmetic, carry look
ahead adder, serial adder, ALU, elementary ALU design, popular MSI chips, digital
comparator, parity checker/generator, code converters, priority encoders,
decoders/drivers for display devices, Q-M method of function realization.

UNIT 3:
SEQUENTIAL CIRCUITS AND SYSTEMS
A 1-bit memory, the circuit properties of Bistable latch, the clocked SR flip flop, J- K-T and
D types flip flops, applications of flip flops, shift registers, applications of shift registers,
serial to parallel converter, parallel to serial converter, ring counter, sequence generator,
ripple (Asynchronous) counters, synchronous counters, counters design using flip flops,
special counter IC’s, asynchronous sequential counters, applications of counters.

UNIT 4:
A/D AND D/A CONVERTERS
Digital to analog converters: weighted resistor/converter, R-2R Ladder D/A converter,
specifications for D/A converters, examples of D/A converter lCs, sample and hold
circuit, Analog to digital converters: quantization and encoding, parallel comparator
A/D converter, successive approximation A/D converter, counting A/D converter, dual
slope A/D converter,
SEMICONDUCTOR MEMORIES AND PROGRAMMABLE LOGIC DEVICES
Memory organization and operation, expanding memory size, classification and
characteristics of memories, sequential memory, read only memory (ROM), read and
write memory(RAM), content addressable memory (CAM), ROM as a PLD,
Programmable logic array, Programmable array logic, complex Programmable logic
devices (CPLDS), Field Programmable Gate Array (FPGA).

Course
Outcomes:

At the end of this course, students will demonstrate the ability to

1. Understand working of logic families and logic gates.
2. Design and implement Combinational and Sequential logic circuits.
3. Understand the process of Analog to Digital conversion and Digital to
Analog conversion.
4. Use PLDs to implement the given logical problem.

REFERENCES:

1. R. P. Jain, "Modern Digital Electronics", McGraw Hill Education, 2009.

2. M. M. Mano, "Digital logic and Computer design", Pearson Education India, 2016.
3. A. Kumar, "Fundamentals of Digital Circuits", Prentice Hall India, 2016.
4. Nasib Singh Gill and J B Dixit, “Digital Design and Computer Organization”,
University Science Press, New Delhi
 Python Programming

Course code PCC-CSE-207G

Category Professional Core Course

Course title Python Programming
L T P Credits
Scheme and Credits Semester 3
2 0 0 2
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory.
Question one will have 6 parts of 2.5 marks each from all units and remaining eight
questions of 15 marks each to be set by taking two questions from each unit. The
students have to attempt five questions in total, first being compulsory and selecting one
from each unit.

Objectives of the course:

 To impart the basic concepts of Python programming.

 To understand syntax of Python language
 To create dynamic applications in Python language.
 To implement object oriented concepts using Python language

Detailed contents:

Unit 1:

Introduction: Fundamental ideas in computer science; modern computer systems,

installing Python; basic syntax, interactive shell, editing, saving, and running a script; The
concept of data types; variables, assignments; numerical types; arithmetic operators and
expressions; comments in the program; understanding error messages; Control
statements: if-else, loops (for, while)

Unit 2:
Strings, text files: String manipulations: subscript operator, indexing, slicing a string;
strings and number system: converting strings to numbers and vice versa. Binary, octal,
hexadecimal numbers; text files: reading/writing text and numbers from/to a file; creating
and reading a formatted file (csv or tab-separated).

Unit 3:

Lists, dictionary and Design with functions: Basic list operators, replacing, inserting,
removing an element; searching and sorting lists; dictionary literals, adding, and removing
keys, accessing and replacing values; traversing dictionaries. Hiding redundancy,
complexity; arguments and return values; Program structure and design. Recursive
functions.

Unit 4:

Object Oriented concepts: Classes and OOP: classes, objects, attributes and methods;
defining classes; design with classes, data modelling; persistent storage of objects,
Inheritance, polymorphism, operator overloading; abstract classes; exception handling, try
block.

Course outcomes

 For a given conceptual problem student will able to analyze the problem and write a
program in python with basic concepts.
 For a given problem of Strings and texts, student will able to analyze the problem
and write a program in python with basic concepts involving strings and texts.
 The knowledge of list and dictionary will enable student to implement in python
language and analyze the same.
 Student will able to write a program using functions to implement the basic
concepts of object oriented programming language

Suggested books:

“Fundamentals of Python: First Programs” Kenneth Lambert, Course Technology,

Cengage Learning, 2012

Suggested reference books:

“Introduction to Computer Science Using Python: A Computational Problem-Solving

Focus”, By Charles Dierbach, John Wiley & Sons, December 2012,
 Mathematics-III (Multivariable Calculus and Differential Equations)

Course code BSC-MATH-203G

Category Basic Science Course

Course title Mathematics-III (Multivariable Calculus and Differential
Scheme and Credits EL i T ) P Credits Semester 3
2 0 2
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question
one will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15
marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Unit-I
Multivariable Differential Calculus: Limit, Continuity and Partial derivatives,
Homogeneous functions, Euler’s Theorem, Total derivative, Maxima, Minima and Saddle
points, Lagrange’s method of undetermined multipliers

Unit-II
Multivariable Integral Calculus: Double integral, Change of order of integration, Change of
variables, Applications of double integral to find area enclosed by plane curves, Triple
integral

Unit-III
Ordinary Differential Equations of first order: Linear and Bernoulli’s equations, Exact
differential equations, Equations reducible to exact differential equations, Applications of
differential equations of first order and first degree to simple electric circuits, Newton’s
law of cooling, Heat flow and Orthogonal trajectories

Unit-IV
Ordinary Differential equations of second and higher order: Linear differential equations
of second and higher order, Complete solution, Complementary function and Particular
integral, Method of variation of parameters to find particular integral, Cauchy’s and
Legendre’s linear equations, Simultaneous linear differential equations with constant
coefficients, Applications of linear differential equations to oscillatory electric circuits

Reference Books:
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, Pearson Education.
2. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons.
3. B. V. Ramana, Higher Engineering Mathematics, Tata McGraw-Hill Publishing Company
Limited.
4. N. P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi
Publications.
5. B. S. Grewal, Higher Engineering Mathematics, Khanna Publishers.
6. W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value
Problems,Wiley India.
7. S. L. Ross, Differential Equations, Wiley India.

8. E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall India.

9. E. L. Ince, Ordinary Differential Equations, Dover Publications

Course Outcomes
The students will learn:
1. To deal with functions of several variables and evaluate partial derivative.
2. The mathematical tools needed in evaluating multiple integrals and their usage.
3. The effective mathematical tools for the solutions of ordinary differential equations
that model physical processes.
 ECONOMICS FOR ENGINEERS

Course code HSMC- 01G

Category Humanities/ Social Sciences/ Management
Course title Economics For Engineers
L T P Credits
Scheme and Credits
3 0 0 3
Branches (B. Tech.) Common For All Branches

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. Acquaint the students to basic concepts of economics and their
operational significance.
2. To stimulate the students to think systematically and objectively about
contemporary
economic problems.

UNIT-1

Definition of Economics- Various definitions, types of economics- Micro and Macro

Economics, nature of economic problem, Production Possibility Curve, Economic laws
and their nature, Relationship between Science, Engineering, Technology and Economic
Development.

Demand- Meaning of Demand, Law of Demand, Elasticity of Demand- meaning, factors

effecting it, its practical application and importance,
UNIT 2
Production- Meaning of Production and factors of production, Law of variable proportions,
and Returns to scale, Internal external economies and diseconomies of scale. Various
concepts of cost of production- Fixed cost, Variable cost, Money cost, Real cost,
Accounting cost, Marginal cost, Opportunity cost. Shape of Average cost, Marginal cost,
Total cost etc. in short run and long run.
UNIT-3
Market- Meaning of Market, Types of Market- Perfect Competition, Monopoly,
Monopolistic Competition and Oligopoly (main features).
Supply- Supply and law of supply, Role of demand & supply in price determination and
effect of changes in demand and supply on prices.
 UNIT-4
Indian Economy- Nature and characteristics of Indian economy as under developed,
developing and mixed economy (brief and elementary introduction), Privatization -
meaning, merits and demerits.
Globalization of Indian economy - merits and demerits.
Banking- Concept of a Bank, Commercial Bank- functions, Central Bank- functions,
Difference between Commercial & Central Bank.

COURSE OUTCOMES:
1. The students will able to understand the basic concept of economics.
2. The student will able to understand the concept of production and cost.
3. The student will able to understand the concept of market.
4. The student will able to understand the concept of privatization, globalization
and banks.

REFERENCES:
1. Jain T.R., Economics for Engineers, VK Publication.
2. Chopra P. N., Principle of Economics, Kalyani Publishers.
3. Dewett K. K., Modern economic theory, S. Chand.
4. H. L. Ahuja., Modern economic theory, S. Chand.
5. Dutt Rudar & Sundhram K. P. M., Indian Economy.
6. Mishra S. K., Modern Micro Economics, Pragati Publications.
7. Singh Jaswinder, Managerial Economics, dreamtech press.
8. A Text Book of Economic Theory Stonier and Hague (Longman’s Landon).
9. Micro Economic Theory – M.L. Jhingan (S.Chand).
10.Micro Economic Theory - H.L. Ahuja (S.Chand).
11.Modern Micro Economics : S.K. Mishra (Pragati Publications).
12.Economic Theory - A.B.N. Kulkarni & A.B. Kalkundrikar (R.Chand & Co).
 Database Management System Lab

Course code LC-CSE-209G

Category Professional Core Course
Course title Database Management System Lab
L T P Credits
Scheme and Credits 4
0 0 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Course Objectives:

 Keep abreast of current developments to continue their own professional

development
 To engage themselves in lifelong learning of Database management systems
theories and technologies this enables them to purse higher studies.
 To interact professionally with colleagues or clients located abroad and the ability
to overcome challenges that arises from geographic distance, cultural differences,
and multiple languages in the context of computing.
 Develop team spirit, effective work habits, and professional attitude in written and
oral forms, towards the development of database applications.

Contents:

i. Creation of a database and writing SQL queries to retrieve information from the
database.
ii. Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records
based on
conditions.
iii. Creation of Views, Synonyms, Sequence, Indexes, Save point.
iv. Creating an Employee database to set various constraints.
v. Creating relationship between the databases.
vi. Study of PL/SQL block.
vii. Write a PL/SQL block to satisfy some conditions by accepting input from the user.
viii. Write a PL/SQL block that handles all types of exceptions.
ix. Creation of Procedures.
x. Creation of database triggers and functions
xi. Mini project (Application Development using Oracle/ MySQL)
a) Inventory Control System
b) Material Requirement Processing.
c) Hospital Management System.
d) Railway Reservation System.
e) Personal Information System.
f) Web Based User Identification System.
g) Time Table Management System.
h) Hotel Management
 Digital Electronics Lab

Course code LC-CSE-211G

Category Professional Core Course
Course title Digital Electronics Lab
L T P Credits
Scheme and Credits 4 Semester-3
0 0 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Implementation all experiments with help of Bread- Board.

1. Study of Logic Gates: Truth-table verification of OR, AND, NOT, XOR, NAND and NOR
gates; Realization of OR, AND, NOT and XOR functions using universal gates.
2. Half Adder / Full Adder: Realization using basic and XOR gates.
3. Half Subtractor / Full Subtractor: Realization using NAND gates.
4. 4-Bit Binary-to-Gray & Gray-to-Binary Code Converter: Realization using XOR gates.
5. 4-Bit and 8-Bit Comparator: Implementation using IC7485 magnitude comparator chips.
6. Multiplexer: Truth-table verification and realization of Half adder and Full adder.
7. Demultiplexer: Truth-table verification and realization of Half subtractor and Full
subtractor.
8. Flip Flops: Truth-table verification of JK Master Slave FF, T-type and D-type FF.
9. Asynchronous Counter: Realization of 4-bit up counter and Mod-N counter.
10. Synchronous Counter: Realization of 4-bit up/down counter and Mod-N counter.
11. Shift Register: Study of shift right, SIPO, SISO, PIPO, PISO & Shift left operations.
12. DAC Operation: Study of 8-bit DAC , obtain staircase waveform.
13. ADC Operations: Study of 8-bit ADC
 Data Structures and Algorithms Lab Using C

Course code LC-CSE-213G

Category Professional Core Course
Course title Data Structures and Algorithms Lab Using C
L T P Credits
Scheme and Credits 4 Semester-3
0 0 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Data Structures Lab List of practical exercises, to be implemented using object-oriented

approach in C++ Language.
1. Write a menu driven program that implements following operations (using separate
functions) on a linear array:
 Insert a new element at end as well as at a given position
 Delete an element from a given whose value is given or whose position is
given
 To find the location of a given element
 To display the elements of the linear array
2. Write a menu driven program that maintains a linear linked list whose elements are
stored in on ascending order and implements the following operations (using
separate functions):
 Insert a new element
 Delete an existing element
 Search an element
 Display all the elements
3. Write a program to demonstrate the use of stack (implemented using linear array)
in converting arithmetic expression from infix notation to postfix notation.
4. Program to demonstrate the use of stack (implemented using linear linked lists) in
evaluating arithmetic expression in postfix notation.
5. Program to demonstration the implementation of various operations on a linear
queue represented using a linear array.
6. Program to demonstration the implementation of various operations on a circular
queue represented using a linear array.
7. Program to demonstration the implementation of various operations on a queue
represented using a linear linked list (linked queue).
8. Program to illustrate the implementation of different operations on a binary search
tree.
9. Program to illustrate the traversal of graph using breadth-first search
10. Program to illustrate the traversal of graph using depth-first search.
11. Program to sort an array of integers in ascending order using bubble sort.
12. Program to sort an array of integers in ascending order using selection sort.
13. Program to sort an array of integers in ascending order using insertion sort.
14. Program to sort an array of integers in ascending order using radix sort.
15. Program to sort an array of integers in ascending order using merge sort.
16. Program to sort an array of integers in ascending order using quick sort.
17. Program to sort an array of integers in ascending order using heap sort.
18. Program to sort an array of integers in ascending order using shell sort.
19. Program to demonstrate the use of linear search to search a given element in an
array.
20. Program to demonstrate the use of binary search to search a given element in a
sorted array in ascending order.
 Python Programming Lab

Course code LC-CSE-215G

Category Professional Core Course
Course title Python Programming Lab
L T P Credits
Scheme and Credits 2 Semester-3
0 0 1
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Objectives
 To write, test, and debug simple Python programs.
 To implement Python programs with conditionals and loops.
 Use functions for structuring Python programs.
 Represent compound data using Python lists, tuples, and dictionaries.
 Read and write data from/to files in Python.
List of Programs
1. Compute the GCD of two numbers.
2. Find the square root of a number (Newton‘s method)
3. Exponentiation (power of a number)
4. Find the maximum of a list of numbers
5. Linear search and Binary search
6. Selection sort, Insertion sort
7. Merge sort
8. First n prime numbers
9. Multiply matrices
10. Programs that take command line arguments (word count)
11. Find the most frequent words in a text read from a file
12. Simulate elliptical orbits in Pygame
13. Simulate bouncing ball using Pygame

Outcome:
 Write, test, and debug simple Python programs.
 Implement Python programs with conditionals and loops
 Develop Python programs step-wise by defining functions and calling them.
 Use Python lists, tuples, dictionaries for representing compound data.
 Read and write data from/to files in Python.
 Discrete Mathematics

Course code PCC-CSE-202G

Category Professional Core Course
Course title Discrete Mathematics
Scheme and Credits L T P Credits Semester - 4
3 1 4
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question
one will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15
marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Unit-I

Sets, Relation, Function and Propositional Logic: Operations and Laws of Sets, Cartesian
Products, Representation of relations, Binary Relation, Equivalence Relation, Partial
Ordering Relation, POSET, Hasse Diagram, Lattices and its types, Function, Bijective
functions, Inverse and Composite Function, Finite and infinite Sets, Countable and
Uncountable Sets, Cantor's diagonal argument and The Power Set theorem, Schroeder-
Bernstein theorem, Propositions, Logical operations, Conditional Statements, Tautologies,
Contradictions, Logical Equivalence, The use of Quantifiers

Unit-II

Basic Counting Techniques and Recurrence Relation: Pigeon-hole principle, Permutation

and Combination, the Division algorithm: Prime Numbers, The GCD: Euclidean Algorithm,
The Fundamental Theorem of Arithmetic., Linear recurrence relation with constant
coefficients, Homogenous Solutions, Particular Solutions, Total Solutions, Solving
recurrence relation using generating functions
 Unit-III

Algebraic Structures: Definitions and examples of Algebraic Structures with one Binary
Operation: Semi Groups, Monoids, Groups; Congruence Relation and Quotient Structures,
Permutation Groups, Cyclic groups, Normal Subgroups, Definitions and examples of
Algebraic Structures with two Binary Operation: Rings, Integral Domain, Fields; Boolean
Algebra and Boolean Ring, Identities of Boolean Algebra, Duality, Representation of
Boolean Function, Disjunctive and Conjunctive Normal Form
Unit-IV

Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub
Graph, Isomorphism, Multigraph and Weighted graph, Shortest path in Weighted graphs,
Eulerian paths and circuits, Hamiltonian path and circuits, Planar Graphs, Euler’s formulae,
Graph Colouring, Trees, Binary trees and its traversals, Trees Sorting, Spanning tree,
Minimal Spanning tree

Reference Books:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
2. Satinder Bal Gupta: A Text Book of Discrete Mathematics and Structures, University
Science Press, Delhi.
3. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics A Computer Oriented
Approach, Tata McGraw – Hill.
4. J.P. Tremblay and R. Manohar, Discrete mathematical structures with applications to
computer science, TMG Edition, TataMcgraw-Hill

5. Discrete Mathematics, Babu Ram, Pearson Publication

6. Discrete Mathematics, Semyour Lipschutz and Marc Lipson, Schaum’s outline

Course Outcomes
The students will learn
1. To solve mathematical problems based on concepts of set theory, relations,
functions and lattices.

2. To express logic sentence in terms of quantifiers and logical connectives.

3. To apply basic counting techniques to solve permutation and combination

problems.

4. To solve recurrence relations.

5. To classify algebraic structure of any given mathematical problem.

6. To evaluate Boolean functions and simplify expressions using the properties of
Boolean algebra

7. To develop the given problem as graph networks and solve with techniques of
graph theory.
 Computer Organization & Architecture

Course code PCC-CSE-204G

Category Professional Core Course
Course title Computer Organization & Architecture
L T P Credits
Scheme and Credits Semester-IV
3 0 0 3
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory.
Question one will have 6 parts of 2.5 marks each from all units and remaining eight
questions of 15 marks each to be set by taking two questions from each unit. The
students have to attempt five questions in total, first being compulsory and selecting one
from each unit.

Objectives of the course:

To expose the students to the following:

 How Computer Systems work & the basic principles
 Instruction Level Architecture and Instruction Execution
 The current state of art in memory system design
 How I/O devices are accessed and its principles.
 To provide the knowledge on Instruction Level Parallelism
 To impart the knowledge on micro programming
 Concepts of advanced pipelining techniques.

Unit 1
Data representation: Data Types, Complements, Fixed-Point Representation, Conversion
of Fractions, Floating-Point Representation, Gray codes, Decimal codes, Alphanumeric
codes, Error Detection Codes.
Register Transfer and Microoperations : Register Transfer Language, Register Transfer,
Bus and Memory Transfers, Arithmetic Microoperations, Logic Microoperations, Shift
Microoperations, Arithmetic Logic Shift Unit.
Unit 2
Basic Computer Organization and Design : Instruction Codes, Computer Registers,
Computer Instructions, Timing and Control, Instruction Cycle, Memory-Reference
Instruction, Input-Output Instruction, Complete Computer Description, Design of Basic
Computer, Design of Accumulator Logic.
Central Processing Unit : General Register Organization, Stack organization, Instruction
Format, Addressing Modes, Data Transfer and Manipulation, Program Control, RISC, CISC.

Unit 3
Pipelining: Basic Concepts of Pipelining, Throughput and Speedup, Pipeline Hazards.
Parallel Processors: Introduction to Parallel Processors, Concurrent access to
memory and Cache Coherency.

Unit 4
Input-output Organization : I/O device interface, I/O transfers–program controlled,
interrupt driven and DMA, Privileged and Non-Privileged Instructions, Software
Interrupts.
Memory organization: Memory Hierarchy, Main Memory, Auxiliary Memory,
Associative Memory, Cache Memory, Associative Mapping, Direct Mapping, Set-
Associative Mapping, Writing into Cache, Cache Initialization, Virtual Memory.

Suggested books:
1) “Computer System Architecture”, 3rd Edition by M.Morris Mano, Pearson.
2) “Computer Organization and Design: The Hardware/Software Interface”, 5th
Edition by David A. Patterson and John L. Hennessy, Elsevier.
3) “Computer Organization and Embedded Systems”, 6th Edition by
CarlHamacher, McGraw Hill Higher Education.

Suggested reference books:

1) “Computer Architecture and Organization”, 3rd Edition by John P. Hayes,

WCB/McGraw-Hill
2) “Computer Organization and Architecture: Designing for Performance”, 10th
Edition by William Stallings, Pearson Education.
3) “Computer System Design and Architecture”, 2nd Edition by Vincent P.
Heuring and Harry F. Jordan, Pearson Education.

Course outcomes :
1) Draw the functional block diagram of a single bus architecture of a computer and
 describe the function of the instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set.
2) Write assembly language program for specified microprocessor for computing

16 bit multiplication, division and I/O device interface (ADC, Control circuit,
serial port communication).
3) Write a flowchart for Concurrent access to memory and cache coherency in
Parallel Processors and describe the process.
4) Given a CPU organization and instruction, design a memory module and
analyze its operation by interfacing with the CPU.
5) Given a CPU organization, assess its performance, and apply design
techniques to enhance performance using pipelining, parallelism and RISC
methodology.
 Operating System

Course code PCC-CSE-206G

Category Professional Core Course

Course title Principles of Operating System
Scheme and L T P Credits
Credits Semester-4
3 0 0 3
Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory.
Question one will have 6 parts of 2.5 marks each from all units and remaining eight
questions of 15 marks each to be set by taking two questions from each unit. The
students have to attempt five questions in total, first being compulsory and selecting one
from each unit.

UNIT 1:

Introduction: Concept of Operating Systems, Generations of Operating systems, Types of

Operating Systems, OS Services.
Processes: Definition, Process Relationship, Different states of a Process, Process State
transitions, Process Control Block (PCB), Context switching. Thread: Definition, Various
states, Benefits of threads, Types of threads, Multithreading.
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers,
Scheduling
criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time;
Scheduling algorithms: Pre-emptive and Non-pre-emptive, FCFS, SJF, SRTF, RR Scheduling.

UNIT 2:
Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion, The
Producer\ Consumer Problem, Semaphores, Event Counters, Monitors, Message Passing,
Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem etc.
Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock
Prevention, and Deadlock Avoidance: Banker’s algorithm, Deadlock detection and
Recovery.
UNIT 3:

Memory Management: Basic concept, Logical and Physical address map, Memory
allocation: Contiguous Memory allocation – Fixed and variable partition–Internal and
External fragmentation and Compaction; Paging: Principle of operation – Page allocation
– Hardware support for paging, Protection and sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures
–Locality of reference, Page fault, Working Set, Dirty page/Dirty bit – Demand paging,
Page Replacement algorithms: Optimal, First in First Out (FIFO), Optimal Page
Replacement and Least Recently used (LRU).

UNIT 4:

File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed),
efficiency and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks. Case study on UNIX and WINDOWS
Operating System.

Suggested books:
 Operating System Concepts Essentials, 9th Edition by Avi Silberschatz, Peter
Galvin, Greg Gagne, Wiley Asia Student Edition.
 Operating Systems: Internals and Design Principles, 5th Edition, William
Stallings, Prentice Hall of India.
Suggested reference books:
 Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley,
Irwin Publishing
 Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-
Wesley
 Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall
of India
 Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati,
O'Reilly and Associates
Course Outcomes:
 CO1: Understand the structure and architectural components of OS to analyze and
design the applications to run in parallel. Moreover, students would be able to develop
scheduling algorithms to optimize various parameters like CPU utilization, Throughput,
Turnaround Time, Waiting Time, Response Time for research purpose.

CO2:Understand the design issues associated with Operating system (e.g. Mutual
exclusion, Deadlock detection etc.) to gain insight towards developing
algorithms/techniques for efficient deadlock handling.

CO3: For a given specification of memory organization, develop the techniques for
optimally allocating memory to processes by increasing memory utilization and for
improving the access time.

CO4: Design and implement file management system for a given specification.
Identify, use and evaluate the disk management policies with respect to various
performance evaluation parameters.
 Object Oriented Programming

Course code PCC-CSE-208G

Category Professional Core Course

Course title Object Oriented Programming
Scheme and L T P Credits
Credits Semester-4
3 0 0 3
Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question
one will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15
marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.
Unit - I
Object-Oriented Programming Concepts: Introduction, comparison between procedural
programming paradigm and object-oriented programming paradigm, basic concepts of
object-oriented programming — concepts of an object and a class, interface and
implementation of a class, operations on objects, relationship among objects, abstraction,
encapsulation, data hiding, inheritance, overloading, polymorphism, messaging.
Classes and Objects: Specifying a class, creating class objects, accessing class members,
access specifiers, static members, use of const keyword, friends of a class, empty classes,
nested classes, local classes, abstract classes, container classes, bit fields and classes.
Unit - II
Inheritance: Introduction, defining derived classes, forms of inheritance, ambiguity in
multiple and multipath inheritance, virtual base class, object slicing, overriding member
functions, object composition and delegation, order of execution of constructors and
destructors.
Pointers and Dynamic Memory Management: Declaring and initializing pointers, accessing
data through pointers, pointer arithmetic, memory allocation (static and dynamic), dynamic
memory management using new and delete operators, pointer to an object, this pointer,
pointer related problems - dangling/wild pointers, null pointer assignment, memory leak
and allocation failures.
Unit - III
Constructors and Destructors: Need for constructors and destructors, copy constructor,
dynamic constructors, explicit constructors, destructors, constructors and destructors with
static members, initializer lists.
Operator Overloading and Type Conversion: Overloading operators, rules for overloading
operators, overloading of various operators, type conversion - basic type to class type,
class type to basic type, class type to another class type.
Virtual functions & Polymorphism: Concept of binding - early binding and late binding,
virtual functions, pure virtual functions, abstract clasess, virtual destructors.
Unit - IV
Exception Handling: Review of traditional error handling, basics of exception handling,
exception handling mechanism, throwing mechanism, catching mechanism, rethrowing an
exception, specifying exceptions.
Templates and Generic Programming: Template concepts, Function templates, class
templates, illustrative examples.

TEXT BOOKS, AND/OR REFERENCE MATERIAL:

1. Bjrane Stroustrup, “C++ Programming language”,3rd edition, Pearson education
Asia(1997)
2. Lafore R.”Object oriented Programming in C++”,4th Ed. Techmedia,New Delhi(2002).
3. Yashwant Kenetkar,”Let us C++”,1stEd.,Oxford University Press(2006)
4. B.A. Forouzan and R.F. Gilberg,CompilerScience,”A structured approach using C++”
Cengage Learning, New Delhi.
 Course code HSMC-02G
Category
Course title ORGANIZATIONAL BEHAVIOUR
Scheme and Credits L T P Credits
3 0 0 3
Branches (B. Tech.)

Class work 25
Exam 75
Total 100 Marks
Duration of Exam 03 Hours

The objective of this course is to expose the students to basic concepts of management
and provide insights necessary to understand behavioral processes at individual, team
and organizational level.
Note: Examiner will set nine questions in total. Question one will be compulsory. Question
one will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15
marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

SYLLABUS
UNIT - 1
Introduction of Management- Meaning, definitions, nature of management; Managerial
levels, skills and roles in an organization; Functions of Management: Planning, Organizing,
staffing, Directing & Controlling, Interrelationship of managerial functions, scope of
management & Importance of management. Difference between management and
administration.
UNIT - 2
Introduction of organization:- Meaning and process of Organization, Management v/s
Organization; Fundamentals of Organizational Behavior: Concepts, evolution, importance
and relationship with other Fields; Contemporary challenges and opportunities of OB.
Individual Processes and Behavior-Personality- Concept, determinants and applications;
Perception- Concept, process and applications, Learning- Concept (Brief Introduction) ;
Motivation- Concept, techniques and importance
UNIT - 3
Interpersonal Processes- Teams and Groups- Definition of Group, Stages of group
development, Types of groups, meaning of team, merits and demerits of team;
difference between team and group, Conflict- Concept, sources, types, management
of conflict; Leadership: Concept, function, styles & qualities of leadership.
Communication – Meaning, process, channels of communication, importance and
barriers of communication.
UNIT 4
Organizational Processes: Organizational structure - Meaning and types of
organizational structure and their effect on human behavior; Organizational culture -
Elements, types and factors affecting organizational culture. Organizational change:
Concept, types & factors affecting organizational change, Resistance to Change.

Course Outcomes: By the end of this course the student will be able to:

1. Students will be able to apply the managerial concepts in practical life.

2. The students will be able to understand the concept of organizational behavior
at individual level and interpersonal level.
3. Students will be able to understand the behavioral dynamics in organizations.
4. Students will be able to understand the organizational culture and change

Suggested Books:
1. Robbins, S.P. and Decenzo, D.A. Fundamentals of Management, Pearson
Education Asia, New Delhi.
2. Stoner, J et. al, Management, New Delhi, PHI, New Delhi.
3. Satya Raju, Management – Text & Cases, PHI, New Delhi.
4. Kavita Singh, Organisational Behaviour: Text and cases. New Delhi: Pearson
Education.
5. Pareek, Udai, Understanding Organisational Behaviour, Oxford University
Press, New Delhi.
6. Robbins, S.P. & Judge, T.A., Organisational Behaviour, Prentice Hall of India,
New Delhi.
7. Ghuman Karminder, Aswathappa K., Management concept practice and cases,
Mc Graw Hill education.
8. Chhabra T. N., Fundamental of Management, Sun India Publications-New
Delhi.
 Environmental Sciences

Course code MC-106G

Category Mandatory Course

Course title Environmental Sciences
L T P Credits
Scheme and Credits
3 0 1 0

Branches (B. Tech.) Common For All Branches

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Unit-1 The Multidisciplinarynatureofenvironmentalstudies. Definition,

scope and importance. (2 problems.
lecture) c) Mineral resources : Use and exploitation,
Unit-2 Natural Resources : environmental effects of extracting and using
Renewable and non-renewable mineral resources, case studies.
resources : Natural resources d) Food resources : World food problems,
and associated problems. changes, caused by agriculture and
overgrazing, effects of modern agriculture,
a) Forest resources : Use and over-exploitation : fertilizer-pesticide problems, Water logging,
deforestation, case studies. Timber extraction, salinity, case studies.
mining dams and their effects on forests and
tribal people. e) Energy resources : Growing energy needs;
renewable and non- renewable energy sources,
b) Water resources : Use and over-utilization of use of alternate energy sources, case studies.
surface and ground water, floods, drought,
conflicts over water, dams- benefits and f) Land resources : Land as a resource, land
degradation, man induced landslides, soil
 erosion and desertification. option values.
* Role of an individual in conservation of natural * Biodiversityat global, National and local levels.
resources. * India as a mega-diversitynation.
* Equitable use of resources for sustainable * Hot-spots of biodiversity.
lifestyles.
* Threats to biodiversity: habitat loss,
(8 lectures)
poaching of wildlife, man-wildlife conflicts.
* Endangered and endemic species of India.
* Conservation of biodiversity : In-situ
Unit-3 Ecosystems : and ex-situ conservation of biodiversity.
* Producers, consumers and decomposers. (8 lectures)
* Energy flow in the ecosystem.
* Ecologicalsuccession.
* Food chains, food webs and ecological
pyramids.
* Introduction, types, characteristic features,
structure and function of the following eco-
system :
a. Forest ecosystem.
b.
Grassland
ecosystem. c.
Desert ecosystem.
d. Aquatic ecosystems (ponds, streams,
lakes, rivers, oceans, estuaries)
(6 lectures)
Unit-4 Biodiversityand its
conservation
* Introduction - Definition : Genetic, Species and
ecosystem diversity.
* Value of biodiversity: consumptive use,
productive use, social, ethical, aesthetic and
Unit-5 Environmentalpollution : * From unsustainable to sustainable
development.
Definition, causes, effects and control measures
of : * Urban problems related to energy.
a) Air pollution. * Water conservation, rain water harvesting,
b) watershed management.

Water * Resettlement and rehabilitation of people :

its problems and concerns case studies.
pollution c)
* Environmental ethics : Issues and
Soil possible solutions.
pollution * Climate change, global warming, acid rain,
d) ozone layer depletion, nuclear accidents
Marine and holocaust. Case studies.
pollution e) * Wasteland reclamation.
Noise
pollution
f)
Thermal
pollution g)
Nuclear
hazards
* Solids waste management: causes,
effects and control measures of urban and
industrial wastes.
* Role of an individual in prevention of
pollution.
* Pollution case studies.
* Disaster management : floods, earthquake,
cyclone and landslides.
(8 lectures)
Unit-6 Social issues and the Environment:
 * Consumerism and waste products. * Visit to a local polluted site-
* Environment ProtectionAct. urban/Rural/ Industrial/ Agricultural.
* Air (Prevention and Control of pollution) Act. * Study of common plants, insects, birds.
* Water (Prevention and Control of pollution) Act. * Study of simple ecosystems- pond, river, hill
slopes, etc. (Field work equal to 10 lecture
* Wildlife ProtectionAct.
hours).
* Forest ConservationAct.
* Issues involved inenforcement ofenvironmental
legislation.
* Public
awareness. (7 lectures)
Unit-7 Human population and the Environment.
Population growth, variation among
nations. Population explosion- Family
Welfare Programme. Environment and
human health.
Human
Rights.
Value
Educati
on.
HIV/AID
S.
Woman and Child Welfare
Role of Information Technology in Environment
and human health.
Case Studies. (6 lectures)
Unit-8 Field Work :
* Visit to a local area to document
environmental assets -
river/forest/grassland/hill/mountain.
 Refe 11. Jadhav, H & Bhosale, V.M. 1995. Environmental
renc Protection and Laws. Himalaya Pub. House,
es Delhi 284p.
1. Agarwal, K.C. 2001 Environmental Biology, Nidi 12. Mackinney, M.L. & Schoch, RM 1996,
Pub. Ltd. Environmental Science systems & solutions, Web
Bikaner. enhanced edition. 639p.
2. Bharucha, Frach, The Biodiversity of India, MApin 13. Mhaskar A.K., Mayyer Hazardous,
Publishing Pvt. Ltd. Ahmedabad-380013, India, E- Tekchno-Science
mail : mapin@icenet.net (R). Publications (TB).
3. Brunner R.C. 1989, Hazardous Waste 14. Miller T.G. Jr. Environmental Science,
Incineration, Mc. Graw Wadsworth Publishing
Hill Inc. 480p.
4. Clark R.S., Marine pollution, Slanderson Press
Oxford (TB).
5. Cunningham, W.P. Cooper, T.H. Gorhani, E &
Hepworth, M.T.
2001, EnvironmentalEncyclopedia, Jaico Pub.
House, Mumbai
1196 p.
6. De A.K., EnvironmentalChemistry, Wiley Eastern
Ltd.
7. Down to Earth, Centre for Science and
Environment (R).
8. Gleick, H.P., 1993. Water in crisis, Pacific Institute
for Studies in Dev. Environment & Security
Stockholm Env. Institute, Oxford Univ. Press,
473p.
9. Hawkins R.E. Encyclopedia of Indian Natural
History, Bombay
Natural HistorySociety, Bombay (R).
10. Heywood, V.H. & Watson, R.T. 1995. Global
Biodiversity
Assessment, Cambridge Uni. Press 1140p.
 C 23. Atext book environmental education G.V.S.
o. Publishers byDr.
(
J.
T
P.
B)
Ya
.
da
15. Odum, E.P. 1971, Fundamentals of Ecology. v.
W.B. Saunders
(M)
Co.
USA, Magazi
574p. ne (R)
16. Rao M.N. & Datta, A.K. 1987 Waste Water Refere
Treatment. Oxford
nce
& TBH Publ. Co. Pvt.
Ltd. 345p. (TB)
17. Sharma, B.K. 2001, Environmental Chemistry, Textbo
Goal Publ. ok
House,
Meerut. The scheme of the paper will be under :
18. Surveyof the Environment, The Hindu (M). The subject of Environmental Studies will be
19. Townsend C., Harper J. and Michael Begon. included as a qualifying paper in all UG Courses and
Essentials of the students will be required to qualify the same
Ecology, Blackwell otherwise the final result will not be declared and
Science (TB). degree will not be awarded.
20. Trivedi R.K., Handbook of Environmental
Laws, Rules, Guidelines, Comliances and
Standards, Vol. I and II Enviro Media (R).
21. TrideviR.K. and P.K. Goal, Introduction to air
pollution, Techno
Science
Publications
(TR).
22. Wagner K.D., 1998, Environmental
Management, W.B.
Saunders co. Philadelphia,
USA 499p.
The duration of the course will be 40 lectures. The
examination will be conducted along with the
semester examinations.
Exam. Pattern : In case of awarding the marks, the
paper will carry100 marks. Theory: 75 marks,
Practical/ Field visit : 25 marks. The structure of
the question paper will be :
Part- A: Short Answer Pattern : 15
marks Part- B : EssayType with inbuilt
choice : 60
marks Part-C : Field Work (Practical) :
25 marks Instructions for Examiners :
Part- A : Question No. 1 is compulsory and will
contain five short- answer type question of 3 marks
each covering the entire syllabus.
Part-B : Eight essay type questions (with inbuilt
choice) will be set from the entire syllabus and the
candidate will be required to answer any four of
them. Each essaytype question will be of 15 marks.
The examination of the regular students will be
conducted by the concerned college/Institute. Each
student will be required to score minimum 40%
marks separately in theory and practical/Field visit.
The marks in this qualifying paper will not be
included in determining the percentage of marks
obtained for the award of degree. However, these
marks will be shown in the detailed marks certificate
of the students.
 Web Technologies

Course code LC-CSE-210G

Category Professional Core Course

Course title Web Technologies
L T P Credits
Scheme and Credits
2 0 0 1

Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory.
Question one will have 6 parts of 2.5 marks each from all units and remaining eight
questions of 15 marks each to be set by taking two questions from each unit. The
students have to attempt five questions in total, first being compulsory and selecting
one from each unit.
Objectives of the course:
 To impart the basic concepts of Web Technologies
 To understand various client side technologies
 To create web pages
 To create dynamic applications on web through server side technologies

Detailed contents:

Unit 1:
Introduction: Concept of Internet- History of Internet, Protocols of Internet, World Wide
Web, URL, Web Server, Web Browser, HTML, HTTP, SMTP, POP3, MIME, IMAP.
Web site design principles, planning the site and navigation,

Unit 2:
HTML and CSS: History of HTML, Structure of HTML Document: Text Basics,
Document: Images and Multimedia, Links and webs, Document Layout, Cascading Style
Sheet: 4 Need for CSS, introduction to CSS, basic syntax and structure, using CSS,
background images, colors and properties, manipulating texts, using fonts, borders and
boxes, margins, padding lists, positioning using CSS,
Unit 3:
XML: Introduction of XML- Some current applications of XML, Features of XML,
Anatomy of XML document, The XML Declaration,   Element Tags-    Nesting and
structure, XML text and text formatting element, Table element, Mark-up Element and
Attributes, Document Type Definition (DTD), types. XML Objects, Checking Validity,
Understanding XLinks, XPointer, Event-driven Programming, XML Scripting.

Unit 4:
PHP: PHP Introduction, Structure of PHP, PHP Functions, AJAX with PHP, PHP Code
and the Complete AJAX Example. AJAX Database, Working of AJAX with PHP, Ajax
PHP Database Form, AJAX PHP MySQL Select Query.
Suggested books:

1. Steven Holzner,”HTML Black Book”, Dremtech press.

2. Web Technologies, Black Book, Dreamtech Press
3. Web Applications : Concepts and Real World Design, Knuckles, Wiley-India
4. Internet and World Wide Web How to program, P.J. Deitel & H.M. Deitel Pearson.

Suggested reference books:

1. Paul Deitel , Harvey Deitel, Abbey Deitel ,“Internet and world wide web – How to
Program”, Prentice Hall

Course outcomes

 For a given conceptual problem student will able to understand the basic process
of Web Technologies and their application domains
 For a given problem the student will able to analyze the problem and select which
technique is most suitable for developing a website.
 The knowledge of various techniques will enable student to implement in these
dynamic techniques using various tools to make interactive web pages.
 Student will able to write a program using these technologies to implement the
basic concepts of web.
 Operating System Lab

Course code LC-CSE-212G

Category Professional Core Course
Course title Operating System Lab
L T P Credits
Scheme and Credits 4
0 0 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Contents:
1 Introduction to UNIX File System.
2. File and Directory Related Commands in UNIX.
3. Essential UNIX Commands for working in UNIX environment.
4. I/O Redirection and Piping
5. Introduction to VI Editors.
6. Introduction of Processes in UNIX
7. Communication in UNIX and AWK.
8. Introduction of the concept of Shell Scripting.
9. Decision and Iterative Statements in Shell Scripting.
10. Writing the Shall Scripts for unknown problems.
Suggested Books:
1. UNIX Shell Programming by Yashavant Kanetkar.
2. UNIX Concepts and Applications by Sumitabha Das
Course Outcomes.
Co1: Understand the structure and architectural components of UNIX Operating System
to analyze and design the problem. Moreover, students would be able to know the Basic
Introduction of UNIX Operating System.
Co2: Basic Introduction of UNIX Commands that are used for operating the UNIX.
Co3: Introduction of Shell Scripting and VI Editor.so that the students get familiar with
writing the UNIX scripts in UNIX editor.
Co4: Students will establish themselves as effective professionals by solving real
problems with UNIX Shell Scripting knowledge and with attention to teamwork, critical
thinking and problem solving skills by Writing Shell Scrips of unknown problems
 Object Oriented Programming Lab Using C++

Course code LC-CSE-214G

Category Professional Core Course
Course title Object Oriented Programming Lab Using C++
L T P Credits
Scheme and Credits 4
0 0 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Contents:

1. [Classes and Objects] Write a program that uses a class where the member functions
are defined inside a class.
2. [Classes and Objects] Write a program that uses a class where the member functions
are defined outside a class.
3. [Classes and Objects] Write a program to demonstrate the use of static data
members.
4. [Classes and Objects] Write a program to demonstrate the use of const data
members.
5. [Constructors and Destructors] Write a program to demonstrate the use of zero
argument and parameterized constructors.
6. [Constructors and Destructors] Write a program to demonstrate the use of dynamic
constructor.
7. [Constructors and Destructors] Write a program to demonstrate the use of explicit
constructor.
8. [Initializer Lists] Write a program to demonstrate the use of initializer list.
9. [Operator Overloading] Write a program to demonstrate the overloading of increment
and decrement operators.
10. [Operator Overloading] Write a program to demonstrate the overloading of binary
arithmetic operators.
11. [Operator Overloading] Write a program to demonstrate the overloading of memory
management operators.
12. [Inheritance] Write a program to demonstrate the multilevel inheritance.
13. [Inheritance] Write a program to demonstrate the multiple inheritance.
14. [Inheritance] Write a program to demonstrate the virtual derivation of a class.
15. [Polymorphism] Write a program to demonstrate the runtime polymorphism.
16. [Exception Handling] Write a program to demonstrate the exception handling.
17. [Templates and Generic Programming] Write a program to demonstrate the use of
function template.
18. [Templates and Generic Programming] Write a program to demonstrate the use of
class template.
 Web Technologies Lab

Course code LC-CSE-216G

Category Professional Core Course
Course title Web Technologies Lab
L T P Credits
Scheme and Credits 2
0 0 1
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Contents:
HTML :
1. Simple HTML using
a. Heading elements
b. Text Elements
c. Logical Styles
d. Physical Styles
e. Ordered , Unordered and Definition list
2. Hyper Links
a. Image Link → Link to page containing Images and Videos
b. File Link
c. Single Page Link
3. Using Frames
a. Navigation Frame
b. Floating Frame
c. Inline Frame
4. Registration Form with Table
CSS:
Inline Style , Internal Style ,and External Style Sheets
XML :
1. Create a any catalog
2. Display the catalog created using CSS or XSL
PHP:
1. File operation
2. Regular Expression, Array, Math, String, Date functions
 MC-106G : (ENVIRONMENT SCIENCE)

Theory 75 Marks Field Work 25 Marks (Practical/Field visit)

Unit-1 The Multidisciplinary nature of environment studies. Definition,
scope and importance. (2 lecture) Unit-3 Ecosystems :
Unit-2 Natural Resources : * Producers, consumers and decomposers.
Renewable and non-renewable resources : * Energy flow in the ecosystem.
Natural resources and associated problems. * Ecological succession.
a) Forest resources : Use and over-exploitation : * Food chains, food webs and ecological
deforestation, case studies. Timber extraction, pyramids.
mining dams and their effects on forests and tribal * Introduction, types, characteristic features,
people. structure and function of the following eco-
system :
b) Water resources : Use and over-utilization of surface
and ground water, floods, drought, conflicts over a. Forest ecosystem.
water, dams-benefits and problems. b. Grassland ecosystem.
c) Mineral resources : Use and exploitation, environmental c. Desert ecosystem.
effects of extracting and using mineral resources, case d. Aquatic ecosystems (ponds, streams, lakes,
studies. rivers,
d) Food resources : World food problems, changes, oceans, estuaries) (6 lectures)
caused by agriculture and overgrazing, effects of Unit-4 Biodiversity and its conservation
modern agriculture, fertilizer-pesticide problems,
* Introduction - Definition : Genetic, Species and
Water logging, salinity, case studies.
ecosystem diversity.
e) Energy resources : Growing energy needs; renewable
and non-renewable energy sources, use of alternate * Value of biodiversity: consumptive use,
productive use, social, ethical, aesthetic and
energy sources, case studies.
option values.
f) Land resources : Land as a resource, land * Biodiversity at global, National and local levels.
degradation, man induced landslides, soil erosion
and desertification. * India as a mega-diversity nation.
* Role of an individual in conservation of natural resources. * Hot-spots of biodiversity.
* Equitable use of resources for sustainable lifestyles. * Threats to biodiversity: habitat loss, poaching
(8 lectures) of wildlife, man-wildlife conflicts.
* Endangered and endemic species of India.
* Conservation of biodiversity : In-situ and ex-situ
conservation of biodiversity.
(8 lectures)
Unit-5 Environmental pollution : * Consumerism and waste products.
Definition, causes, effects and control measures of : * Environment Protection Act.
a) Air pollution. * Air (Prevention and Control of pollution) Act.
b) Water pollution * Water (Prevention and Control of pollution) Act.
c) Soil pollution * Wildlife Protection Act.
d) Marine pollution * Forest Conservation Act.
e) Noise pollution * Issues involved in enforcement of environmental
legislation.
f) Thermal pollution
* Public awareness. (7 lectures)
g) Nuclear hazards
Unit-7 Human population and the Environment.
* Solids waste management: causes, effects
and control measures of urban and industrial Population growth, variation among nations.
wastes. Population explosion- Family Welfare Programme.
* Role of an individual in prevention of pollution. Environment and human health.
* Pollution case studies. Human Rights.
* Disaster management : floods, earthquake, Value Education.
cyclone and landslides.
HIV/AIDS.
(8 lectures)
Woman and Child Welfare
Unit-6 Social issues and the Environment:
Role of Information Technology in Environment and
* From unsustainable to sustainable development.
human health.
* Urban problems related to energy.
Case Studies. (6 lectures)
* Water conservation, rain water harvesting,
Unit-8 Field Work :
watershed management.
* Visit to a local area to document
* Resettlement and rehabilitation of people : its
environmental assets -
problems and concerns case studies.
river/forest/grassland/hill/mountain.
* Environmental ethics : Issues and possible solutions.
* Visit to a local polluted site-urban/Rural/
* Climate change, global warming, acid rain, ozone Industrial/ Agricultural.
layer depletion, nuclear accidents and holocaust. * Study of common plants, insects, birds.
Case studies.
* Study of simple ecosystems- pond, river, hill
* Wasteland reclamation. slopes, etc. (Field work equal to 10 lecture
hours).
References Publications (TB).
1. Agarwal, K.C. 2001 Environmental Biology, Nidi Pub. 14. Miller T.G. Jr. Environmental Science, Wadsworth
Ltd. Bikaner. Publishing
2. Bharucha, Frach, The Biodiversity of India, MApin
Publishing Pvt. Ltd. Ahmedabad-380013, India, E-mail :
mapin@icenet.net
(R).
3. Brunner R.C. 1989, Hazardous Waste Incineration,
Mc. Graw Hill Inc. 480p.
4. Clark R.S., Marine pollution, Slanderson Press Oxford (TB).
5. Cunningham, W.P. Cooper, T.H. Gorhani, E &
Hepworth, M.T. 2001, Environmental Encyclopedia,
Jaico Pub. House, Mumbai 1196 p.
6. De A.K., Environmental Chemistry, WileyEastern Ltd.
7. Down to Earth, Centre for Science and Environment (R).
8. Gleick, H.P., 1993. Water in crisis, Pacific Institute for
Studies in Dev. Environment & Security Stockholm
Env. Institute, Oxford Univ. Press, 473p.
9. Hawkins R.E. Encyclopedia of Indian Natural History,
Bombay Natural HistorySociety, Bombay(R).
10. Heywood, V.H. & Watson, R.T. 1995. Global
Biodiversity Assessment, Cambridge Uni. Press
1140p.
11. Jadhav, H & Bhosale, V.M. 1995. Environmental
Protection and Laws. Himalaya Pub. House, Delhi
284p.
12. Mackinney, M.L. & Schoch, RM 1996, Environmental
Science systems & solutions, Web enhanced edition.
639p.
13. Mhaskar A.K., Mayyer Hazardous, Tekchno-Science
Co. (TB).
15. Odum, E.P. 1971, Fundamentals of Ecology. W.B.
Saunders Co. USA, 574p.
16. Rao M.N. & Datta, A.K. 1987 Waste Water Treatment.
Oxford & TBH Publ. Co. Pvt. Ltd. 345p.
17. Sharma, B.K. 2001, Environmental Chemistry, Goal Publ.
House, Meerut.
18. Survey of the Environment, The Hindu (M).
19. Townsend C., Harper J. and Michael Begon. Essentials of
Ecology, Blackwell Science (TB).
20. Trivedi R.K., Handbook of Environmental Laws, Rules,
Guidelines, Comliances and Standards, Vol. I and II Enviro
Media (R).
21. Tridevi R.K. and P.K. Goal, Introduction to air pollution,
Techno Science Publications (TR).
22. Wagner K.D., 1998, Environmental Management, W.B.
Saunders co. Philadelphia, USA 499p.
23. Atext book environmental education G.V.S. Publishers
byDr. J.P. Yadav.
(M) Magazine
(R) Reference (TB)
Textbook

The scheme of the paper will be under :

The subject of Environmental Studies will be included as a
qualifying paper in all UG Courses and the students will be
required to qualify the same otherwise the final result will not be
declared and degree will not be awarded.
The duration of the course will be 40 lectures. The examination will
be conducted along with the semester examinations.
Exam. Pattern : In case of awarding the marks, the paper will carry
100 marks. Theory: 75 marks, Practical/ Field visit : 25 marks.
The structure of the question paper will be :
mark
Part- A: Short Answer Pattern : 15s
Part- B : EssayType with inbuilt mark
choice : 60s
mark
Part-C : Field Work (Practical) : 25s
Instructions for Examiners :
Part- A : Question No. 1 is compulsory and will contain five
short- answer type question of 3 marks each covering the entire
syllabus.
Part-B : Eight essay type questions (with inbuilt choice) will be set
from the entire syllabus and the candidate will be required to answer
any four of them. Each essay type question will be of 15 marks.
The examination of the regular students will be conducted by
the concerned college/Institute. Each student will be required to
score minimum 40% marks separately in theory and practical/Field
visit. The marks in this qualifying paper will not be included in
determining the percentage of marks obtained for the award of degree.
However, these marks will be shown in the detailed marks certificate
of the students.