M.D.

UNIVERSITY, ROHTAK
SCHEME OF STUDIES AND EXAMINATION
B.TECH (Computer Science and Engineering)
Common with
B.Tech. (Informa on Technology)
&
B.Tech. (Computer Science and Informa on Technology)
SEMESTER 3rd& 4th
Modi ed Scheme e ec ve from 2020-21

COURSE CODE ANDDEFINITIONS

Course Code Definiti

L Lecture ons
T Tutorial
P Practical
BSC Basic ScienceCourses
ESC EngineeringScienceCourses
HSMC Humanities and Social Sciences includingManagementcourses
PCC Professional Core Courses
LC Laboratory Courses
MC Mandatory Courses
PT Practical Training
S Seminar

fi

ti

ff
ti

ti

 B.Tech. (Computer Science and Engineering)

Common with B.Tech. (Information Technology) &
B.Tech. (Computer Science and Information Technology)
Scheme ofStudies/Examination w.e.f. 2019-20
Semester-3

Tota Examination Schedule

Hours per week Dur
l (Marks)
atio
Cont Mar n of
Sr. act Cre k of
Course Code Course Title Exa
No. Hrs. dit Clas The Prac Tota
L T P m
per s ory tical l (Ho
wee wor urs)
k k
Database
1 PCC-CSE-201G Management 3 0 0 3 3 25 75 100 3
Systems

Data Structures &

2 PCC-CSE-203G 3 0 0 3 3 25 75 100 3
Algorithms

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

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

Mathema cs - III
(Mul variable
BSC-
5 Calculus and 2 0 0 2 2 25 75 100 3
MATH-203G
Di eren al
Equa ons)

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

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

Digital Electronics
8 LC-ESC-211G 0 0 3 3 1.5 25 25 50 3
LAB

Data Structures &

9 LC-CSE-213G Algorithms LAB 0 0 3 3 1.5 25 25 50 3
Using C

Python
10 LC-CSE-215G 0 0 3 3 1.5 25 25 50 3
Programming LAB

Total 23 800
ff

ti
ti
ti
ti

 B.Tech. (Computer Science and Engineering)

Common with B.Tech. (Information Technology) &
B.Tech. (Computer Science and Information Technology)
Scheme ofStudies/Examination w.e.f. 2019-20
Semester-4

Tota Examination Schedule

Hours per week Dur
l (Marks)
atio
Cont Mar n of
Sr. Course Title act Cre k of
Course Code Exa
No. Hrs. dit Clas The Prac Tota
L T P m
per s ory tical l (Ho
wee wor urs)
k k

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

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

3 PCC-CSE-206G OperatingSystem 3 0 0 3 3 25 75 100 3

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

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

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

7 PCC-CSE-210G Web Technologies 3 0 0 3 3 25 75 100 3

OperatingSystem
8 LC-CSE-212G 0 0 3 3 1.5 25 25 50 3
LAB

ObjectOriented
9 LC-CSE-214G Programming LAB 0 0 3 3 1.5 25 25 50 3
Using C++

Web Technologies
10. LC-CSE-216G 0 0 2 2 1 25 25 50 3
Lab

Total 23 750

*MC-106G is a mandatory non –credit course in which the students will be required passing marks in
theory.
NOTE: At the end of 4th semester each student has to undergo Prac cal Training of 4/6 weeks in an
Industry/ Ins tute/ Professional Organiza on/ Research Laboratory/ training centre etc. and submit typed
report along with a cer cate from the organiza on & its evalua on shall be carried out in the 5th
Semester.

Discrete Mathema cs

ti

ti
ti
fi

ti

ti

ti
ti
 Coursecode PCC-CSE-202G

Category Professional Core Course

Coursetitle Discrete Mathema cs

Scheme and Credits L T P Credit Semester - 4
s
3 1 4
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Dura on of Exam 03 Hours

Note: Examiner will set nine ques ons in total. Ques on one will be compulsory. Ques on one
will have 6 parts of 2.5 marks each from all units and remaining eight ques ons of 15 marks
each to be set by taking two ques ons from each unit. The students have to a empt ve
ques ons in total, rst being compulsory and selec ng one from each unit.

Unit-I

Sets, Rela on, Func on and Proposi onal Logic: Opera ons and Laws of Sets, Cartesian
Products, Representa on of rela ons, Binary Rela on, Equivalence Rela on, Par al Ordering
Rela on, POSET, Hasse Diagram, La ces and its types, Func on, Bijec ve func ons, Inverse
and Composite Func on, Finite and in nite Sets, Countable and Uncountable Sets, Cantor's
diagonal argument and The Power Set theorem, Schroeder-Bernstein theorem, Proposi ons,
Logical opera ons, Condi onal Statements, Tautologies, Contradic ons, Logical Equivalence,
The use of Quan ers

Unit-II

Basic Coun ng Techniques and Recurrence Rela on: Pigeon-hole principle, Permuta on and
Combina on, the Division algorithm: Prime Numbers, The GCD: Euclidean Algorithm, The
Fundamental Theorem of Arithme c., Linear recurrence rela on with constant coe cients,
Homogenous Solu ons, Par cular Solu ons, Total Solu ons, Solving recurrence rela on using
genera ng func ons

Unit-III

Algebraic Structures: De ni ons and examples of Algebraic Structures with one Binary
Opera on: Semi Groups, Monoids, Groups; Congruence Rela on and Quo ent Structures,
Permuta on Groups, Cyclic groups, Normal Subgroups, De ni ons and examples of Algebraic
ti
ti
ti

ti

ti

ti
ti
ti
ti
ti
ti
ti
fi
ti
fi
ti

ti
ti
ti

ti
fi
ti
ti
ti
ti
ti
tti
ti
ti
ti
fi
ti
ti
ti
ti
ti
fi
ti
ti
ti
ti
ti
ti
ti
ti

ti
ti
ti
ti
tt
ti
ti
ffi
ti
ti
fi
 Structures with two Binary Opera on: Rings, Integral Domain, Fields; Boolean Algebra and
Boolean Ring, Iden es of Boolean Algebra, Duality, Representa on of Boolean Func on,
Disjunc ve and Conjunc ve Normal Form
Unit-IV

Graphs and Trees: Graphs and their proper es, Degree, Connec vity, Path, Cycle, Sub Graph,
Isomorphism, Mul graph 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 Sor ng, Spanning tree, Minimal
Spanning tree

Reference Books:
1. Kenneth H. Rosen, Discrete Mathema cs and its Applica ons, Tata McGraw – Hill
2. Sa nder Bal Gupta: A Text Book of Discrete Mathema cs and Structures, University Science
Press, Delhi.
3. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathema cs A Computer Oriented
Approach, Tata McGraw – Hill.
4. J.P. Tremblay and R. Manohar, Discrete mathema cal structures with applica ons to
computer science, TMG Edi on, TataMcgraw-Hill

5. Discrete Mathema cs, Babu Ram, Pearson Publica on

6. Discrete Mathema cs, SemyourLipschutz and Marc Lipson, Schaum’s outline

Course Outcomes
The students will learn
1. To solve mathema cal problems based on concepts of set theory, rela ons, func ons
and la ces.

2. To express logic sentence in terms of quan ers and logical connec ves.

3. To apply basic coun ng techniques to solve permuta on and combina on problems.

4. To solve recurrence rela ons.

5. To classify algebraic structure of any given mathema cal problem.

6. To evaluate Boolean func ons and simplify expressions using the proper es of
Boolean algebra

7. To develop the given problem as graph networks and solve with techniques of graph
theory.
ti
tti

ti

ti
ti
ti
ti
ti
ti
ti

ti
ti
ti
ti

ti
ti

ti
fi
ti

ti
ti
ti
ti
ti

ti
ti
ti
ti

ti
ti
ti
ti

ti

ti
ti

ti
 Computer Organiza on & Architecture

Course code PCC-CSE-204G

Category Professional Core Course

Course tle Computer Organiza on & Architecture

Scheme and L T P Credi

Credits ts Semester-IV
3 0 0 3

Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Dura on of Exam 03 Hours

Note: Examiner will set nine ques ons in total. Ques on one will be compulsory. Ques on
one will have 6 parts of 2.5 marks each from all units and remaining eight ques ons of 15
marks each to be set by taking two ques ons from each unit. The students have to a empt
ve ques ons in total, rst being compulsory and selec ng one from each unit.

Objec ves of the course:

To expose the students to the following:

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

Unit 1
Data representa on: Data Types, Complements, Fixed-Point Representa on, Conversion of
Frac ons, Floa ng-Point Representa on, Gray codes, Decimal codes, Alphanumeric codes,
Error Detec on Codes.
Register Transfer and Microopera ons : Register Transfer Language, Register Transfer, Bus and
Memory Transfers, Arithme c Microopera ons, Logic Microopera ons, Shi Microopera ons,
Arithme c Logic Shi Unit.

Unit 2
Basic Computer Organiza on and Design : Instruc on Codes, Computer Registers, Computer
Instruc ons, Timing and Control, Instruc on Cycle, Memory-Reference Instruc on, Input-
fi
ti
ti
ti

ti
ti
ti
ti
ti
ti
ti
ti
ft
ti

fi

ti
ti

ti
ti
ti
ti
ti

ti
ti
ti
ti

ti

ti

ti
ti

ti
ti
ft

ti
ti
tt
ti
ti
 Output Instruc on, Complete Computer Descrip on, Design of Basic Computer, Design of
Accumulator Logic.
Central Processing Unit : General Register Organiza on, Stack organiza on, Instruc on
Format, Addressing Modes, Data Transfer and Manipula on, Program Control, RISC, CISC.

Unit 3
Pipelining: Parallel Processing, Amdahl’s law, Pipelining, Arithme c Pipeline, Instruc on
Pipeline, Pipeline Hazards, RISC Pipeline.
Parallel Processors: Introduc on to Parallel Processors, Concurrent access to memory
andCache Coherency.
Vector Processing : Vector Opera ons, Memory Interleaving, Supercomputers, Array
Processors: A ached Array Processor, SIMD Array Processor.

Unit 4
Input-output Organiza on : I/O deviceinterface, I/O transfers–program controlled,
interrupt driven and DMA, Privileged and Non-Privileged Instruc ons, So ware
Interrupts.
Memory organiza on: Memory Hierarchy, Main Memory, Auxiliary Memory, Associa ve
Memory, Cache Memory, Associa ve Mapping, Direct Mapping, Set-Associa ve Mapping,
Wri ng into Cache, Cache Ini aliza on, Virtual Memory.

Suggested books:
1) “Computer System Architecture”, 3rd Edi on by M.Morris Mano, Pearson.
2) “Computer Organiza on and Design: The Hardware/So ware Interface”, 5th
Edi on by David A. Pa erson and John L. Hennessy, Elsevier.
3) “Computer Organiza on and Embedded Systems”, 6th Edi on by CarlHamacher,
McGraw Hill Higher Educa on.

Suggested reference books:

1) “Computer Architecture and Organiza on”, 3rd Edi on by John P. Hayes, WCB/
McGraw-Hill
2) “Computer Organiza on and Architecture: Designing for Performance”, 10th
Edi on by William Stallings, Pearson Educa on.
3) “Computer System Design and Architecture”, 2nd Edi on by Vincent P. Heuring
and Harry F. Jordan, Pearson Educa on.

Course outcomes :
1) Draw the func onal block diagram of a single bus architecture of a computer and
describe the func on of the instruc on execu on cycle, RTL interpreta on of
instruc ons, addressing modes, instruc on set.
2) Write assembly language program for speci ed microprocessor for compu ng

16 bit mul plica on, division and I/O device interface (ADC, Control circuit, serial
port communica on).
3) Write a owchart for Concurrent access to memory and cache coherency in
Parallel Processors and describe the process.
ti
ti
ti

ti
fl
ti

tt
ti
ti
ti
ti

ti

ti
ti
ti
ti

tt

ti
ti

ti
ti

ti
ti
ti
ti
ti
ti

ti

ti
ti

fi

ti
ti
ti
ti
ti

ti
ft
ti

ti

ti
ti
ti
ti
ti

ft
ti

ti
ti
 4) Given a CPU organiza on and instruc on, design a memory module and analyze
its opera on by interfacing with the CPU.
5) Given a CPU organiza on, assess its performance, and apply design techniques to
enhance performance using pipelining, parallelism and RISC methodology.
ti
ti
ti
ti

 Opera ng System

Course code PCC-CSE-206G

Category Professional Core Course
Course tle Principles of Opera ng System
Credi
Scheme and L T P
ts Semester-4
Credits
3 0 0 3

Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Dura on of Exam 03 Hours

Note: Examiner will set nine ques ons in total. Ques on one will be compulsory. Ques on
one will have 6 parts of 2.5 marks each from all units and remaining eight ques ons of 15
marks each to be set by taking two ques ons from each unit. The students have to a empt
ve ques ons in total, rst being compulsory and selec ng one from each unit.

UNIT 1:

Introduc on: Concept of Opera ng Systems, Genera ons of Opera ng systems, Types of
Opera ng Systems, OS Services.
Processes: De ni on, Process Rela onship, Di erent states of a Process, Process State
transi ons, Process Control Block (PCB), Context switching. Thread: De ni on, Various states,
Bene ts of threads, Types of threads, Mul threading.
Process Scheduling: Founda on and Scheduling objec ves, Types of Schedulers, Scheduling
criteria: CPU u liza on, Throughput, Turnaround Time, Wai ng Time, Response Time;
Scheduling algorithms: Pre-emp ve and Non-pre-emp ve, FCFS, SJF, SRTF, RR Scheduling.

UNIT 2:
Inter-process Communica on: Cri cal Sec on, Race Condi ons, Mutual Exclusion, The
Producer\ Consumer Problem, Semaphores, Event Counters, Monitors, Message Passing,
Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem etc.
Deadlocks: De ni on, Necessary and su cient condi ons for Deadlock, Deadlock
Preven on, and Deadlock Avoidance: Banker’s algorithm, Deadlock detec on and Recovery.

UNIT 3:
fi
fi
ti
ti
ti
ti
ti

ti
ti
ti

fi
fi
ti
ti
ti
ti
ti
fi

ti
ti
ti

ti
ti

ti
ti
ti
ti

ffi
ti
ff

ti
ti
ti
ti
ti
ti
ti
ti
ti
fi
ti
ti

ti

tt

ti

 Memory Management: Basic concept, Logical and Physical address map, Memory
alloca on: Con guous Memory alloca on – Fixed and variable par on–Internal and External
fragmenta on and Compac on; Paging: Principle of opera on – Page alloca on – Hardware
support for paging, Protec on 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: Op mal, First in First Out (FIFO), Op mal Page Replacement and
Least Recently used (LRU).

UNIT 4:

File Management: Concept of File, Access methods, File types, File opera on, Directory
structure, File System structure, Alloca on methods (con guous, linked, indexed), e ciency
and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk reliability,
Disk forma ng, Boot-block, Bad blocks. Case study on UNIX and WINDOWS Opera ng System.
Compara ve Study of Latest Opera ng System: Evolu on, Architecture and Characteris cs of
various Opera ng systems like MS-Windows, Ubuntu, Mac OS, Fedora, Solaris, Free BSD,
Chrome OS, CentOS, Debian, Deepin

Suggested books:
• Opera ng System Concepts Essen als, 9th Edi on by AviSilberschatz, Peter Galvin,
Greg Gagne, Wiley Asia Student Edi on.
• Opera ng Systems: Internals and Design Principles, 5th Edi on, William Stallings,
Pren ce Hall of India.
Suggested reference books:
• Opera ng System: A Design-oriented Approach, 1st Edi on by Charles Crowley,
Irwin Publishing
• Opera ng Systems: A Modern Perspec ve, 2nd Edi on by Gary J. Nu , Addison-
Wesley
• Design of the Unix Opera ng Systems, 8th Edi on by Maurice Bach, Pren ce-Hall of
India
• Understanding the Linux Kernel, 3rd Edi on, Daniel P. Bovet, Marco Cesa , O'Reilly
and Associates
Course Outcomes:

CO1: Understand the structure and architectural components of OS to analyze and design
the applica ons to run in parallel. Moreover, students would be able to develop scheduling
algorithms to op mize various parameters like CPU u liza on, Throughput, Turnaround
Time, Wai ng Time, Response Time for research purpose.

CO2:Understand the design issues associated with Opera ng system (e.g. Mutual
exclusion, Deadlock detec on etc.) to gain insight towards developing algorithms/
techniques for e cient deadlock handling.
ti

ti
ti
ti
ti
ti

ti
ti
ti
tti
ti
ti

ti

ffi
ti

ti
ti

ti
ti

ti


ti
ti
ti

ti
ti

ti
ti

ti
ti

ti


ti
ti

ti
ti

ti
ti
ti
ti
ti


ti

ti
tt
ti
ti
ti
ti
ti
ffi
ti

 CO3: For a given speci ca on of memory organiza on, develop the techniques for
op mally alloca ng memory to processes by increasing memory u liza on and for
improving the access me.

CO4: Design and implement le management system for a given speci ca on. Iden fy, use
and evaluate the disk management policies with respect to various performance
evalua on parameters.
ti
ti
ti
ti

fi

fi
ti
ti
fi
ti
ti
ti
ti
 Object Oriented Programming

Course code PCC-CSE-208G

Category Professional Core Course
Course tle Object Oriented Programming
Credit
Scheme and L T P
s Semester-4
Credits
3 0 0 3

Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Dura on of Exam 03 Hours

Note: Examiner will set nine ques ons in total. Ques on one will be compulsory. Ques on one
will have 6 parts of 2.5 marks each from all units and remaining eight ques ons of 15 marks
each to be set by taking two ques ons from each unit. The students have to a empt ve
ques ons in total, rst being compulsory and selec ng one from each unit.
Course Objectives

1. To understand how the C++ is superset of C by incorporating the Object oriented features
in C language.

2. To apply the syntax and semantics of C++ Programming language.

3. To learn the designing of C++ classes.

4. To learn how to efficiently use the memory using Pointers and Dynamic Memory
Management

5. To learn how to implement different types of constructors and the use of destructor.

6. To learn how to implement the concept of data abstraction and encapsulation.

7. To learn how to perform different types of overloading i.e. operators and functions.

8. To learn how inheritance helps to reuse the code.

9. To learn how we can implement dynamic binding with polymorphism.

10. To learn the use of exception handling in C++ programs.

11. To learn how to design and use of generic classes with templates.

Unit - I
ti
ti

ti

fi

ti
ti

ti
ti

ti

tt
ti
fi
 Object-Oriented Programming Concepts: Introduc on, 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 implementa on of a
class, opera ons on objects, rela onship among objects, abstrac on, encapsula on, data
hiding, inheritance, overloading, polymorphism, messaging.
Classes and Objects: Specifying a class, crea ng class objects, accessing class members, access
speci ers, sta c members, use of const keyword, friends of a class, empty classes, nested
classes, local classes, abstract classes, container classes, bit elds and classes.
Unit - II
Inheritance: Introduc on, de ning derived classes, forms of inheritance, ambiguity in mul ple
and mul path inheritance, virtual base class, object slicing, overriding member func ons, object
composi on and delega on, order of execu on of constructors and destructors.
Pointers and Dynamic Memory Management: Declaring and ini alizing pointers, accessing data
through pointers, pointer arithme c, memory alloca on (sta c 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 alloca on failures.
Unit - III
Constructors and Destructors: Need for constructors and destructors, copy constructor,
dynamic constructors, explicit constructors, destructors, constructors and destructors with sta c
members, ini alizer 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 func ons & Polymorphism: Concept of binding - early binding and late binding, virtual
func ons, pure virtual func ons, abstract clasess, virtual destructors.
Unit - IV
Excep on Handling: Review of tradi onal error handling, basics of excep on handling,
excep on handling mechanism, throwing mechanism, catching mechanism, rethrowing an
excep on, specifying excep ons.
Templates and Generic Programming: Template concepts, Func on templates, class templates,
illustra ve examples.

TEXT BOOKS, AND/OR REFERENCE MATERIAL:

1. BjraneStroustrup, “C++ Programming language”,3rd edi on, Pearson educa on Asia(1997)
2. LaforeR.”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 Outcomes

A er the comple on of the course, the students will

• Understand the concept of Object Oriented Programming through C++.

• Iden fy importance of object oriented programming and di erence between Procedural

programming and object oriented programming features.
ft
ti
ti
fi
ti
ti
ti
ti

ti

ti
ti
ti
ti
ti
ti

ti
ti

ti
ti
fi

ti
ti
ti
ti
ti

ti

ti
ti

ff
fi

ti
ti
ti

ti

ti

ti
ti
ti
ti

ti
ti

ti

 • be able to make use of objects and classes for developing programs.

• be able to use various object oriented concepts to solve di erent problems.

• be able to develop the programs /Projects using some advanced features of C++
Programming.

ff

 ORGANIZATIONAL BEHAVIOUR

Course code
HSMC-02G
Category Humanities and Social Sciences includingManagementcourses
Course tle ORGANIZATIONAL BEHAVIOUR
Scheme and L T P Credit Semester 4
Credits s
3 0 0 3
Branches (B. Tech.) Common to all branches

Class work 25
Exam 75
Total 100 Marks
Dura on of Exam 03 Hours

The objec ve 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
organiza onal level.
Note: Examiner will set nine ques ons in total. Ques on one will be compulsory. Ques on one
will have 6 parts of 2.5 marks each from all units and remaining eight ques ons of 15 marks
each to be set by taking two ques ons from each unit. The students have to a empt ve
ques ons in total, rst being compulsory and selec ng one from each unit.

SYLLABUS
UNIT - 1
Introduc on of Management- Meaning, de ni ons, nature of management; Manageriallevels,
skills and roles in an organiza on; Func ons of Management: Planning, Organizing, sta ng,
Direc ng & Controlling, Interrela onship of managerial func ons, scope of management &
Importance of management. Di erence between management and administra on.
UNIT - 2
Introduc on of organiza on:- Meaning and process of Organiza on, Management v/s
Organiza on; Fundamentals of Organiza onal Behavior: Concepts, evolu on, importance
andrela onship with other Fields; Contemporary challenges and opportuni es of OB. Individual
Processes and Behavior-Personality- Concept, determinants andapplica ons; Percep on-
Concept, process and applica ons, Learning- Concept (Brief Introduc on) ; Mo va on-
Concept, techniques and importance
UNIT - 3
Interpersonal Processes- Teams and Groups- De ni on of Group, Stages of
groupdevelopment, Types of groups, meaning of team, merits and demerits of team;
di erence between team and group, Con ict- Concept, sources, types, management of
con ict; Leadership: Concept, func on, styles & quali es of leadership. Communica on –
Meaning, process, channels of communica on, importance and barriersof
communica on.
ff
fl
ti
ti
ti
ti
ti

ti
ti
ti
ti
ti

ti

fi

ti
ti
ti
ff
ti
ti
ti
ti

ti

fl
ti
fi
ti
ti
ti
ti
ti
fi
ti
ti
ti
ti

ti
ti
ti
ti
ti

tt
ti
ti
ti
ffi
fi
ti
ti
 UNIT 4

Organiza onal Processes: Organiza onal structure - Meaning and types oforganiza onal
structure and their e ect on human behavior; Organiza onal culture - Elements, types
and factors a ec ng organiza onal culture. Organiza onal change: Concept, types &
factors a ec ng organiza onal 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 prac cal life.
2. The students will be able to understand the concept of organiza onal behavior at
individual level and interpersonal level.
3. Students will be able to understand the behavioral dynamics in organiza ons.
4. Students will be able to understand the organiza onal culture and change

Suggested Books:
1. Robbins, S.P. and Decenzo, D.A. Fundamentals of Management, Pearson
Educa on 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, Organisa onalBehaviour: Text and cases. New Delhi: Pearson
Educa on.
5. Pareek, Udai, Understanding Organisa onalBehaviour, Oxford University
Press, New Delhi.
6. Robbins, S.P. & Judge, T.A., Organisa onalBehaviour, Pren ce Hall of India, New
Delhi.
7. GhumanKarminder, Aswathappa K., Management concept prac ce and cases, Mc
Graw Hill educa on.
8. Chhabra T. N., Fundamental of Management, Sun India Publica ons-New
Delhi

ti
ti

ff
ti

ti
ff
ti

ti

ff
ti
ti

ti
ti
ti

ti
ti
ti

ti
ti

ti
ti
ti
ti

ti

ti
 Web Technologies

Course code LC-CSE-210G

Category Professional Core Course

Course tle Web Technologies
Credi
Scheme and L T P
ts Semester 4
Credits
3 0 0 3
Branches (B. Computer Science and Engineering
Tech.)
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Dura on of Exam 03 Hours

Note: Examiner will set nine ques ons in total. Ques on one will be compulsory. Ques on
one will have 6 parts of 2.5 marks each from all units and remaining eight ques ons of 15
marks each to be set by taking two ques ons from each unit. The students have to a empt
ve ques ons in total, rst being compulsory and selec ng one from each unit.
Objec ves of the course:
• To impart the basic concepts of Web Technologies
• To understand various client side technologies
• To create web pages
• To create dynamic applica ons on web through server side technologies

Detailed contents:

Unit 1:
Introduc on:Concept of Internet- History of Internet, Protocols of Internet, World Wide
Web, URL, Web Server, Web Browser.
HTML and CSS:History of HTML, Structure of HTML Document: Text Basics, Document:
Images and Mul media, Links and webs, Document Layout, Cascading Style Sheet: Need for
CSS, introduc on to CSS, basic syntax and structure using CSS, inline, internal and external
CSS

Unit 2: XML: Introduc on of XML- Some current applica ons of XML, Features of XML,
Anatomy of XML document, structuring data, XML namespace, Document Type De ni ons
and Schemas, Document object model, DOM methods, XSL, SAX, SOAP
fi

ti
ti

ti
ti
ti
ti
ti

fi
ti

ti
ti

ti

ti
ti
ti

ti
fi
tt
ti
ti
Unit 3: PHP: PHP Introduc on, Structure of PHP, PHP Func ons, String processing and
regular expression, viewing client/server environment variable, form processing, Connec ng
to a database, cookies, operator precedence

Unit 4:AJAX: AJAX with PHP, PHP Code and the Complete AJAX Example, AJAX Database,
Working of AJAX livesearch with PHP, Ajax PHP Database Form, AJAX PHP MySQL Database,
connect, create DB, create table, insert data, select query

Suggested books:

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

2. Web Technologies, Black Book, Dreamtech Press
3. Web Applica ons : 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”, Pren ce Hall

Course outcomes

• For a given conceptual problem student will able to understand the basic process of
Web Technologies and their applica on 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 interac ve web pages.
• Student will able to write a program using these technologies to implement the basic
concepts of web.
ti
ti

ti
ti

ti

ti

ti
 Opera ng System Lab

Course code LC-CSE-212G

Category Professional Core Course
Course tle Opera ng System Lab
Credi
Scheme and L T P
ts Semester 4
Credits
0 0 3 1.5
Branches (B. Computer Science and Engineering
Tech.)
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Dura on of Exam 03 Hours

Contents:
1 Introduc on to UNIX File System.
2. File and Directory Related Commands in UNIX.
3. Essen al UNIX Commands for working in UNIX environment.
4. I/O Redirec on and Piping
5. Introduc on to VI Editors.
6. Introduc on of Processes in UNIX
7. Communica on in UNIX and AWK.
8. Introduc on of the concept of Shell Scrip ng.
9. Decision and Itera ve Statements in Shell Scrip ng.
10. Wri ng the Shall Scripts for unknown problems.
Suggested Books:
1. UNIX Shell Programming by YashavantKanetkar.
2. UNIX Concepts and Applica ons by Sumitabha Das
Course Outcomes.
Co1: Understand the structure and architectural components of UNIX Opera ng System to
analyze and design the problem. Moreover, students would be able to know the Basic
Introduc on of UNIX Opera ng System.
Co2: Basic Introduc on of UNIX Commands that are used for opera ng the UNIX.
Co3: Introduc on of Shell Scrip ng and VI Editor.so that the students get familiar with
wri ng the UNIX scripts in UNIX editor.
Co4: Students will establish themselves as e ec ve professionals by solving real problems
with UNIX Shell Scrip ng knowledge and with a en on to teamwork, cri cal thinking and
problem solving skills by Wri ng Shell Scrips of unknown problems
ti
ti
ti
ti
ti
ti
ti
ti

ti
ti
ti
ti
ti
ti
ti

ti
ti
ti
ti
ti

ti

ti

ti
ff

ti
tt
ti

ti

ti
ti
ti

 Object Oriented Programming Lab Using C++

Course code LC-CSE-214G

Category Professional Core Course
Course tle Object Oriented Programming Lab Using C++
Credi
Scheme and L T P
ts Semester 4
Credits
0 0 3 1.5
Branches (B. Computer Science and Engineering
Tech.)
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Dura on of Exam 03 Hours

Contents:

1. [Classes and Objects] Write a program that uses a class where the member func ons are
de ned inside a class.
2. [Classes and Objects] Write a program that uses a class where the member func ons are
de ned outside a class.
3. [Classes and Objects] Write a program to demonstrate the use of sta c 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. [Ini alizer Lists] Write a program to demonstrate the use of ini alizer 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
arithme c operators.
11. [Operator Overloading] Write a program to demonstrate the overloading of memory
management operators.
12. [Inheritance] Write a program to demonstrate the mul level inheritance.
13. [Inheritance] Write a program to demonstrate the mul ple inheritance.
14. [Inheritance] Write a program to demonstrate the virtual deriva on of a class.
15. [Polymorphism] Write a program to demonstrate the run me polymorphism.
16. [Excep on Handling] Write a program to demonstrate the excep on handling.
17. [Templates and Generic Programming] Write a program to demonstrate the use of
func on template.
18. [Templates and Generic Programming] Write a program to demonstrate the use of class
template.
fi
fi
ti
ti
ti
ti
ti

ti

ti
ti
ti

ti
ti
ti
ti

ti
ti

 Web Technologies Lab

Course code LC-CSE-216G

Category Professional Core Course
Course tle Web Technologies Lab
Credi
Scheme and L T P
ts Semester 4
Credits
0 0 2 1
Branches (B. Computer Science and Engineering
Tech.)
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Dura on 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 De ni on 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. Naviga on Frame
b. Floa ng Frame
c. Inline Frame
4. Registra on 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 opera on
2. Regular Expression, Array, Math, String, Date func ons

MC-106G : (ENVIRONMENT SCIENCE)

Course code MC-106G

Category Mandatory Course

Course tle Environmental Sciences

ti
ti

ti

ti
ti
ti

ti

fi

ti

ti

 Credi
Scheme and L T P
ts Semester 4
Credits
3 0 1 0
Branches (B. Common For All Branches
Tech.)
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Dura on of Exam 03 Hours

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

Unit-1 The Multidisciplinary nature of environment induced landslides, soil erosion

studies. Definition, and desertification.
scope and importance. * Role of an individual in conservation of
(2 lecture)
natural resources.
Unit-2 Natural Resources :
* Equitable use of resources for sustainable
Renewable and non-renewable resources : lifestyles.
Natural resources and associated problems. (8 lectures)
a) Forest resources : Use and over-
exploitation : deforestation, case
studies. Timber extraction, mining
dams and their effects on forests
and tribal people.
b) Water resources : Use and over-
utilization of surface and ground
water, floods, drought, conflicts
over water, dams-benefits and
problems.
c) Mineral resources : Use and
exploitation, environmental effects of
extracting and using mineral
resources, case studies.
d) Food resources : World food
problems, changes, caused by
agriculture and overgrazing,
effects of modern agriculture,
fertilizer-pesticide problems, Water
logging, salinity, case studies.
e) Energy resources : Growing
energy needs; renewable and non-
renewable energy sources, use of
alternate energy sources, case
studies.
f) Land resources : Land as a
resource, land degradation, man
ti

 Unit-3 Ecosystems :
* Producers, consumers and
decomposers.
* Energy flow in the ecosystem.
* Ecological succession.
* 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 Biodiversity and its conservation
* Introduction - Definition : Genetic,
Species and ecosystem diversity.
* Value of biodiversity: consumptive
use, productive use, social, ethical,
aesthetic and option values.
* Biodiversity at global, National and
local levels.
* India as a mega-diversity nation.
* Hot-spots of biodiversity.
* Threats to biodiversity: habitat loss,
poaching 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

Definition, causes, effects and control measures of products.
: * Environment Protection Act.
a) Air pollution. * Air (Prevention and Control of
b) Water pollution pollution) Act.

c) Soil pollution * Water (Prevention and Control of

pollution) Act.
d) Marine pollution
* Wildlife Protection Act.
e) Noise pollution
* Forest Conservation Act.
f) Thermal pollution
* Issues involved in enforcement of
g) Nuclear hazards environmental legislation.

* Solids waste management: * Public awareness.

causes, effects and control (7 lectures)
measures of urban and Unit-7 Human population and the
industrial wastes. Environment.
* Role of an individual in prevention of Population growth, variation among nations.
pollution. Population explosion- Family Welfare
* Pollution case studies. Programme.
* Disaster management : floods, Environment and human health.
earthquake, cyclone and Human Rights.
landslides.
Value Education.
(8 lectures)
HIV/AIDS.
Unit-6 Social issues and the Environment:
Woman and Child Welfare
* From unsustainable to sustainable
development. Role of Information Technology in
Environment and human health.
* Urban problems related to energy.
Case Studies.
* Water conservation, rain water (6 lectures)
harvesting, watershed
Unit-8 Field Work :
management.
* Visit to a local area to document
* Resettlement and rehabilitation
environmental assets - river/
of people : its problems and
forest/grassland/hill/mountain.
concerns case studies.
* Environmental ethics : Issues and
* Visit to a local polluted site-
possible solutions. urban/Rural/ Industrial/
* Climate change, global warming,
Agricultural.
acid rain, ozone layer depletion, * Study of common plants, insects,
nuclear accidents and holocaust. birds.
Case studies. * Study of simple ecosystems-
* Wasteland reclamation. pond, river, hill slopes, etc. (Field
work equal to 10 lecture hours).

 References Co. (TB).

1. Agarwal, K.C. 2001 Environmental 15. Odum, E.P. 1971, Fundamentals of
Biology, Nidi Pub. Ltd. Bikaner. Ecology. W.B. Saunders Co. USA,
2. Bharucha, Frach, The Biodiversity of 574p.
India, MApin Publishing Pvt. Ltd. 16. Rao M.N. & Datta, A.K. 1987 Waste
Ahmedabad-380013, India, E-mail :
Water Treatment. Oxford & TBH Publ.
mapin@icenet.net
Co. Pvt. Ltd. 345p.
(R).
17. Sharma, B.K. 2001, Environmental
3. Brunner R.C. 1989, Hazardous
Chemistry, Goal Publ. House, Meerut.
Waste Incineration, Mc. Graw Hill
Inc. 480p. 18. Survey of the Environment, The Hindu
4. Clark R.S., Marine pollution, Slanderson Press (M).
Oxford (TB). 19. Townsend C., Harper J. and Michael
5. Cunningham, W.P. Cooper, T.H. Begon. Essentials of Ecology,
Gorhani, E & Hepworth, M.T. 2001, Blackwell Science (TB).
Environmental Encyclopedia, Jaico 20. Trivedi R.K., Handbook of
Pub. House, Mumbai 1196 p. Environmental Laws, Rules,
6. De A.K., Environmental Chemistry, Guidelines, Comliances and Standards,
WileyEastern Ltd. Vol. I and II Enviro Media (R).
7. Down to Earth, Centre for Science and 21. Tridevi R.K. and P.K. Goal,
Environment (R). Introduction to air pollution, Techno
8. Gleick, H.P., 1993. Water in crisis, Science Publications (TR).
Pacific Institute for Studies in Dev. 22. Wagner K.D., 1998, Environmental
Environment & Security Stockholm Management, W.B. Saunders co.
Env. Institute, Oxford Univ. Press, Philadelphia, USA 499p.
473p.
23. Atext book environmental education
9. Hawkins R.E. Encyclopedia of G.V.S. Publishers byDr. J.P. Yadav.
Indian Natural History, Bombay
(M) Magazine
Natural HistorySociety, Bombay(R).
(R)
10. Heywood, V.H. & Watson, R.T.
Ref
1995. Global Biodiversity
ere
Assessment, Cambridge Uni. Press
1140p. nce
(TB
11. Jadhav, H & Bhosale, V.M. 1995.
Environmental Protection and Laws. )
Himalaya Pub. House, Delhi 284p. Tex
12. Mackinney, M.L. & Schoch, RM 1996, tbo
Environmental Science systems & ok
solutions, Web enhanced edition. 639p.
13. Mhaskar A.K., Mayyer Hazardous, The scheme of the paper will be under :
Tekchno-Science Publications (TB). The subject of Environmental Studies will be
14. Miller T.G. Jr. Environmental Science, included as a qualifying paper in all UG
Wadsworth Publishing 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 However, these marks will be

be 40 lectures. The examination shown in the detailed marks
will certificate
be conducted along with the of the students.
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 :

Part- A: Short 1 m
Answer Pattern : 5 ar
k
Part- B : 6 m
EssayType with : 0 ar
inbuilt choice k
Part-C : Field 2 m
Work (Practical) : 5 ar
k
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.