SEMESTER-III

Sr. Course Codes Nomenclature of the Courses Hours per week Credits
No.
LT
BSC201-T Mathematics-1II 3 0
PCC-CSE201-T/ Data Structures and Algorithms
PCC-IT201-T
PCC-CSE202-T/ Object Oriented Programming 3

PCC-1T-202-T using C++

PCC-CSE203-T/Discrete MathematicS 3

PCC-IT203-T
.
PCC-CSE204-T Computer Organisation and 3 0 3

PCC-IT204-T |Architecture
MC102-T Environmental Science 3 0 0 0

. PCC-CSE201-P/ Data Structures and Algorithms

PCC-IT201-P using C/C++ Lab.

PCC-CSE202-P/ Object Oriented Programming 0

PCC-IT202-P using C++ Lab.

Total Credits 19
 Mathematics III

General Course Information

Course Code: BSC201-T Course Assessment Methods (internal: 30; external: 70)
Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
Type: Basic Sciences assignments (6 marks), and the end- semester examination
(70 marks).
Contact Hours: 3 hours/week
For the end semester examination, nine questions are to be
Mode: Lectures (L) set by the examiner. A candidate is required to attempt 5
Examination Duration: 3 hours questions in all. All questions carry equal marks. Question
number 1 will be compulsory and based on the entire
syllabus. It will contain seven parts of 2 marks each.
Question numbers 2 to 9 will be given by setting two
questions from each of the four units of the syllabus. A
candidate is required to attempt the remaining four questions
by selecting one question from each of the four units.
Pre-requisites: Mathematics I and Mathematics II

About the Course

This is an advanced mathematics course that offers the knowledge of Fourier Series, Fourier Transtorms,
Functions of Complex Variables. These concepts are essential for students to solve problems in image processing.
digital signal processing and other related engineering tields,

Course Outcomes: By the end of the course students will be able to:
co1. define concepts and terminology of Fourier Series and Fourier transforms, Functions of complex
variables and Power Seriesetc.(LOTS: ILevel 1: Remember)
coz. solve problems using Fourier transforms in domains like digital electronics and image processing.
(LOTS: Level 3:Apply)
co3. apply principles of functions of complex variables to solve computational problems. (LOTS: Level
co4. compare
3: Apply) various concepts related to Fourier transforms and functions of complex variables. (HOTS:

Level 4: Analyse)
CO5. select suitable method for given computational engineering problems and related domain. (HOTS:
Level 4: Evaluate)
cO6. integrate the knowledge of Fourier Series and Fourier transforms, Functions of complex variables,
and Power Series for solving real world problems. (HOTS: Level 6: Create)

Course Content
Unit I

Fourier Serices and Fourier Transforms: Euler's formulae, conditions for a Fourier expansion, change of interval
Fourler expansion of odd and even functions, Fourier expansion of square wave, rectangular wave, saw-toothed
wave, half and full rectified wave, half range sine and cosine serles.

Unit I1
Fourier integrals, Fourler transforms, Shifting theorem (both on time and frequency axes), Fourier transforms of
derivatives, Fourler transforms of integrals, Convolutlon theorem, Fourier transform of Dirac delta function.

20

UnitI

Functions of Complex Varlable: Definiton, Exponentlal function. Trigonometric and Hyperbolte functions,
Logarithmic functions. LImit and Continuity of a functton, Differentiability and Analytictty. Cauchy-Riemann
equations, necessary and sufficient conditions for a functon to be analytic. polar form of the Cauchy-Riemann
equations. Harmonic functlons.

Unit

Complex integral, Cauchy Gaursat theorem (without proo), Cauchy integral formula (without proof), Power
series, radius and circle of convergence, Taylor's Maclaurin's and Laurent's serties. Zeroes and singularities of
complex functions, Residues. Evaluation of real integrals using residues (around unit and semi-circle only).

Text and Reference Books:

1. F.Kreyszig, Advanced Engineering Mathematics, 10th edition, Wiley, 2015.
2. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 44th edition, 1965.
3. R.K. Jain, S.R.K. Iyenger. Advance Engineering. Mathematies, 4 edtion, Narosa Publishing House,
2012.
4. Michael D. Greenberg, Advanced Enginering Mathematies, 2d edlton, Pearson Education, 2002.
5. Johnson and Miller Probability and statistics for Engineers, 8h editon, Pearson Education India, 2015.
 Data Structures and Algorithms

General Course Information

Course Code: PCC-CSE201-T/

Course Assessment Methods (internal: 30; external: 70
PCC-IT201-T
Two minor examinations (20 marks), Class Pertormance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Type: Professional Core
marks).
Contact Hours: 3hours/week
For the end semester examination, nine questions are to be set
Mode: Lectures (L) by the examiner. A candidate is required to attempt 5 questions
in all. All questions carry equal marks. Question number I will
Examination Duration: 3 hours be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.
Pre-requisites: Programming in C

About the Course:

Data Structure and Algorithms is a core and an essential course for every graduate in Computer Science and
Engineering. This course introduces data structures like arrays, linked lists, trees and graphs etc. and various operations
to be implemented on these data structures for solving real world problems. It includes various sorting and searching
algorithms as well. Futher, it incorporates complexity analysis of algorithms implemented on various data structures

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

CO1. deseribe various types of data structures and operations that can be implemented on these data structures.
(LOTS: Level 1: Remember)
CO2. demonstrate the use of various data structures and their related operations. (LOTS: Level 2: Understand)
Co3. apply data structure to solve computational problems. (LOTS: Level 3: Apply)
CO4. compare the suitability of alternative data structures and prescribed operations for various problem
situations. (HOTS: Level 4: Analyse).
CO5. defend solutions with respect to effective storage of data and efficiency of the required operations for
solving real world problems. (HOTS: Level 5: Evaluate)

Course Content
Unit I

Introduction to data structures and their types, Abstract data types, Linear lists: Arrays and linked lists: memory
representations, implementing operations like traversing, searching. inserting and deleting etc. Applications of arrays
and linked lists. Representing sets and polynomials using linked lists.

Unit)

Stack and Queue: Static and linked implementations, Operations and Applications. Circular queues, Tress, Binary
trees and related terminology, Tree traversals (Recursive). Threaded Binary Trees, Binary Search Trees
implementation and operations, Priority queues.

Unit III

Height Balanced or AVL trees and B trees. Graph definitions and related terminology, memory representations and
related operations (traversal, insertion, deletion, search), Path Matrix, Warshall's Shortest path algorithm Hashing,
Hash tables, hash function and collision resolution.

Unit

Sequential and binary search, Sorting algorithms: Bubble sort, Selection sort, Insertion sort, Quick sort, Merge sort,
Count sort, Heap sort, Comparison of searching and sorting techniques based on their complexity analysis, Time and
space complexity of algorithms: Asymptotic analysis, Big 0, Omega, Theta notations.

Text and Reference Books:

1. Aho, A. V., Ullman, J. D., and Hopcroft, J. E., Data Structures and Algorithms, Addison-Wesley, 1983.
Langsam Yedidyah, Augenstein J Moshe, Tenenbaum M Aaron, Data Structures using C and C++,
3edition, PHI, 2009.
3. Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C., Introduction to Algorithmns, MIT Press, 2009.
4. Robert L. Kruse, Data Structure and Program Design in C, Pearson Education India, 2007.
5. Weiss, M. A., Data Structures and Algorithm Analysis in C++, Addison-Wesley, 2007.
6. Sahni, S., Data Structures, Algorithms, and Applications in C++, WCB/McGraw-Hill, 2001
 Object Oriented Programming using C++

General Course Information

Course Code: PCC-CSE202-T/ Course Assessment Methods (internal: 30; external: 70)
PCC-IT202-T Two minor examinations (20 marks), Class Performance
measured through percentage of lectures attended (4 marks),
Course Credits: 3 assignments (6 marks), and the end- semester examination (70
Type: Professional Core marks).
For the end semester examination, nine questions are to be set
Contact Hours: 3 hours/week by the examiner. A candidate is required to attempt 5 questions
Mode: Lectures (L) in all. All questions carry equal marks. Question numberl will
be compulsory and based on the entire syllabus. It will contain
Examination Duration: 3 hours seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: Knowledge of computer fundamentals and problem solving using C programming

About the Course:

Objected Oriented Programming using C++ is an essential course for every graduate in Computer Science and
Engineering. This course introduces the Object Oriented concepts such as data encapsulation, data hiding, data
abstraction, reusability, exception handling etc., and their implementation using C++.

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

CO. List the concepts related to object oriented paradigms. (LOTS: Level 1: Remember)
CO2. Distinguish between structured and object oriented approaches to programming. (LOTS: Level 2:
Understand)
cO3. Apply object oriented constructs for problem solving. (LOTS: Level 3: Apply)
CO4. Detect logical and run time errors and suggest appropriate modifications. (HOTS: Level 4: Analyse)
CO5. Justify the design of a program for a given problem. (HOTS: Level 5: Evaluate)
CO6. Design solutions to programming problems using multiple object oriented programming constructs
together. (HOTS: Level 6: Create)

Course Content

Unit I

Introduction to object oriented programming. C++ standard library, basics of a typical C++ environment, illustrative
simple C++ programs, new features of ANSI C++ standard, 0OPs concepts: Information hiding, encapsulation, data
abstraction, access modifiers, controlling access to a class level, method, or variable (public, protected. private, block
level, scope and mutable), other modifiers. Structure of class and struct in memory, accessing members of structures,
Class scope and accessing class members, separating interface from implementation, pre-processors directives, macro
programs, header files and namespaces, default constructors, chained constructor, default arguments with constructors,
constant object and const member functions, object as member of class, use of destructors, virtual destructors,
controlling access function and utility functions, function overloading.

Unit II
Inline function, friend function and friend classes, using this pointer, dynamic memory allocation with new and delete,
static class members, proxy class, polymorphism concepts, overloading, overriding methods, abstract classes,
reusability, class's behaviors, inheritance, base classes and derived classes, protected members, casting base-class
pointers to derived-class pointers, using member functions, overriding base-class members in a derived-class, public,
protected and private inheritance, using constructors and destructors in derived classes, implicit derived-class object
to base- class object conversion, composition vs. inheritance.

Unit III

Virtual functions, abstract base classes and concrete classes, new classes and dynamic binding, virtual destructors
fundamentals of operator overloading, restrictions on operators overloading. operator functions as class members vs.
as friend functions, overloading, <<, >> overloading unary operators, overloading binary operators. I/O Streams, files
handling, creating a sequential access file, reading data from a sequential access file, updating sequential access files,
random access files, creating a random access file, writing data randomly to a random access file, reading data
sequentially from a random access file.

UnitIIV

Managing Console I/O, stream input/output classes and objects, stream output, stream input, unformatted VO (with
read and write), stream manipulators, stream format states, stream error states, exception handling. basics of C++
exception handling (try, throw, catch), rethrowing an exception, specific exception. processing unexpected exceptions,
stack unwinding, exception handling in constructors and destructors, inheritance with exception introduction to
generic classes, function templates, overloading template functions, class template, non-type parameters, templates
and inheritance, templates and friends, templates and static members, container, iterator, algorithm and functional
classes.
 Diserete Mathematics

General Course Information

Course Code: PCC-CSE203-T7

Course Assessment Methods (internal: 30; external: 70)
PCC-IT203-T Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination
Type: Professional Core (70 marks).
Contact Hours: 3 hours/week For the end semester examination, nine questions are to be set
by the examiner. A candidate is required to attempt 5
Mode: Lectures () questions in all. All questions carry equal marks. Question
number 1 will be compulsory and based on the entire
Examination Duration: 3 hours
syllabus. It will contain seven parts of 2 marks each.
Question numbers 2 to 9 will be given by setting two
questions from each of the four units of the syllabus. A
candidate is required to attempt the remaining four questions
by selecting one question from each of the four units.

Pre-requisites: Basic knowledge of Number Theory, Calculus and Algebra

About the Course:

Discrete Mathematics is a core and an essential course for every graduate in Computer Science and Engineering. This
branch of mathematics mainly deals with diserete objects (as computer runs on discrete steps). t provides a
mathematical language for computer science to resolve many real world problems by incorporating different methods
applicable to various discrete structures. This course introduces set theory, propositional calculus, algebraic structures,
recurrence relations and graph theory.

Course Outcomes: By the end of the course a student would be able to:

cO. outline various discrete structures and the related operations. (LOTS: Level 1: Remember)
CO2. illustrate different discrete structures with the help of examples. (LOTS: Level 2: Understand)
CO3. apply appropriate techniques to solve problems related to discrete structures.(LOTS: Level 3:Apply)
C04. justify the solutions with the help of proofs. (HOTS: Level 5: Evaluate)
CO5. combine techniques related to discrete structures for solving real world problems. (HOTS: Level 6:
Create)

Course Content
Unit I

Set Theory: Introduction to Set Theory, Venn Diagrams, Set Operations, Algebra of Sets, Duality, Finite, Infinite Sets
and Counting Principle, Classes of Sets, Power Sets, Partitions, Multi Sets, Relations: Cartesian Product,
Representation of Relations, Types of Relation, Equivalence Relations and Partitions, Partial Ordering Relations,
Functions: Definition, Types of Functions, Composition of Functions, Inverse Function, Recursively Defined
Functions.

Unit II

Logic and Propositional Calculus: Introduction, Propositions and Compound Propositions, Basic Logical Operations,
Propositions and Truth Tables, Tautologies and Contradictions, Logical Equivalence, Algebra of Propositions,
Conditional and Bi-conditional Statements, Algebraic Structures: Group Axioms, Monoid, Semi-Groups, Subgroups,
Abelian Group, Cosets, Normal Subgroup. Cyclic Group, Permutation Group, Lagrange's Theorem, Homomorphism,

Isomorphism, Automorphism, Rings, Integral Domains and Fields (Also, some basic and standard results related to
Groups, Rings, ID and Fields).

Unit III

Recursion and Recurrence Relation: Polynomials and their evaluation, Sequences, Introduction to AP, GP and AG
Series, Partial Fractions, Recurrence Relation, Linear Recurrence Relations with Constant Coefficients, Linear
Homogeneous Recurrence Relations with Constant Coefficients, Particular Solution- Homogeneous Linear Difference
Equations, Non-Homogeneous Linear Difference Equations, Total Solution, Generating Functions.

Unit IV

Graphs Theory: Introduction to Graphs, Multi Graph, Directed and Undirected Graphs, Subgraphs, Bipartite Graphs,
Regular Graphs, Connected Graphs, Homomorphic and Isomorphic Graphs, Cut points and Bridges, Paths and
Circuits, Euler Graph, Hamiltonian Graph, Planar Graph, Euler Formula, Weighted Graphs, Dijkstra's Shortest Path
Algorithm for Weighted Graphs, Trees, Spanning Trees, Minimum Spanning Tree (Prim's and Kruskal>'s Algorithm).

Text and Reference Books:

1. J.P. Trembley and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science,
Tata McGraw Hill- 13th reprint, 2012
2. Kenneth H. Rosen, Discrete Mathematics and its applications, 6th Edition, Tata McGraw Hill, 2011.
3. Richard Johnsonbaugh, Discrete Mathematics, 6th Edition, Pearson Education Asia, 2011.
4. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 3d Edition, 2010.
5. B. Kolman, R. C. Busby and S. C. Ross, Discrete Mathematical structures, 6th Edition, PHI, 2010.
6. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill, 3rd Edition, 2008.
 Computer Organization and Architecture

General Course Information

Course Code: PCC-CSE204-T Course ASsessment Methods (internal: 30; external: 70)
PCC-1T204-T Two minor examinations each of 20 marks, Class Performance
measured hrough percentage of lectures attended (4 marks)
Course Credits: 3
Assignment and quiz (6 marks), and end semester examination
Type: Professional Core
or 70 marKS.

Contact Hours: 3 hours/week For the end semester examination, nine questions arc to be set
by the examiner. Question number one will be compulsory and
Mode: Lectures
based on the entire syllabus. It will contain seven short answers
Examination Duration: 3 hours
type questions each of marks 2. Rest of the cight questions are
to be given by setting two questions from each of the four units
of the syllabus. A candidate is required to attempt any other
four questions selecting one from each of the remaining four
units. All questions carry cqual marks.

Pre-requisites: Digital Electronics and computer systems.

About the Course:

Computer Architecture and organization describes the role of instruction set architecture in digital computer, main
memory, and input/output devices. It illustrates the simple data path and control design for processors. t helps to
understand the different operations and concept of instructions. It would enable the students to learn the basic function

and architecture of moderm computer systems

Course Outcomes: By the end of the course students will be able to:
CO1. outline the general concepts of digital electronics and computer organisation and architecture. (LOTS:

Level 1: Remember)
co2. discuss the basic components and their intcrfacing (LOTS: Level 2: Understand)
CO3. apply instructions for performing different operations. (LOTS: Level 3: Apply)
CO4. analyse the effect of addressing modes on the execution time ofa program.(HOTS: Level 4: Analyse)

CO5. contrast different types of memory, their architecture and access methods. (HOTS: Level 5: Evaluate)
CO6. Design of simple computer with different instruction sets. (HOTS: Level 6: Create)

Course Content

Unit I
Basic Principles: Boolean algebra and Logic gates, Combinational logic blocks (Adders, Subtractors, Multiplexers,
Encoders, decoders, demultiplexers, KMaps), Sequential logic blocks (Flip-Flops, Registers, Counters); Flynn's
classification of computers (SISD, MISD, MIMD); Performance metrics: MIPS, MFLOPS; CPU Architecture types:
computer register, (accumulator, register, stack, memory/ register) detailed data path of a typical register based CPU.

Unit II
Computer Organization: Store program control concept, Instruction codes, timing and control, instruction cycle; type
of instructions: memory reference, register reference, 1/O reference;, Basics of Logic Design, accumulator logic,

Control memory; Micro Programmed Control: address sequencing, micro-instruction tormats, micro-program
Sequencer, Implementation of control unit.

Unit Im
Instruction Set Architecture & Parallelism: Instruction set based classification of processors (RISC, CISC, and their

comparison); Stack Organization, Instruction Formats; addressing modes: register, immediate, direct, indirect,
indexed; Operations in the instruction set: Arithmetic and Logical, Data Transfer, Control Flow; Types of interrupts;
Introduction to Parallelism: Goals of parallelism (Exploitation of concurrency, throughput enhancement); Amdahl's
law, Instruction level parallelism (pipelining, super scaling-basic features); PrOcessor level parallelism

(Multiprocessor systems overview).

Unit IV

Memory Hierarchy & VO Techniques: The need for a memory hierarchy (Locality of referencc principle, Memory
hierarchy in practice: Cache, main memory and scondary memory. Memory parameters: acess/ cycle time, cost per
bit); Main memory (Semiconductor RAM & ROM organization, memory expansion, Static & dynamic memory
types); Cache memory (Associative & direct mapped cache organizations; input-output interface, mode of transfer,

DMA (Direct memory transfer).

Text and Reference Books:

1. Mano, M. Moris, Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd., 1981
2. M. Morris Mano, Computer System Architecture, Prentice Hall of India Pvt. Ltd., I1993.
3. Milles J.Murdocca, Vincent P. Heuring, Computer Architecture and Organization, An Integrated Approach,
JohnWiley & Sons Inc., 2007.
4. William Stallings, 10th edition, Computer Organization and Architecture, Prentice Hall, 2016.
5. Heuring, VP, Jordan, H.F, Computer Systems Design and Architecture, Addison Wesley.1997.
6. R.P Jain, Modern Digital Electronics, 3d Edition, Tata McGraw Hill,, 2003.
 Environmental Science

General Course Information

Course Code: MC102-T

Course Assessment Methods (internal: 30; external: 70)
Course Credns. Iwo minor examinations (20 marks), Class Performance
ype: Mandatory Course
Contact Hours: 2 hours/week measured through percentage of lectures attended (4 marks)
Mode: Lectures (L) assignments (6 marks), and the end- semester examination (70
Examination Duration: 3 hours marks).
For the end semester examination, nine questions are to be set
by the examiner. A candidate is required to attempt 5 questions
in all. All questions carry equal marks. Question number I will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units

Pre-requisites: None

About the Course and its Outcomes:

This is a mandatory course to enhance the knowledge, skills and attitude of the graduating engineers to the
environment By studyng this course students will understand our natural environment and its relationship with
human activities.

Course outcomes: By the end of the course a student will be able to:

CO. state the environment related Issues and challenges In sustalnable development
CO2. demonstrate the understanding of varlous environment hazards and means of protecton agatnst these
hazards. (LOTS: Level 2: Understand)
cO3. apply irreplaceable tool to provide fîrst-hand knowledge on varlous environmental aspects in the entire
learning process. (LOTS: Level 3: Apply)
CO4. analyze impacts of human business and developmental activities on the environment. (HOTS: Level 4:
analyze)
Cos. design and evaluate strategies for sustainable management of environmental eco-systems.(HOTS: Level 6:
design)

Course content
Unit-I

Multidisciplinary nature of Environmental studies: Definition, scope and importance, need for public awareness
Concept, Structure and function of an ecosy stem: Producers, consumers and decomposers, Energy low in the
ecosystem,Ecological SuccessionFood chains, Food webs and ecological pyramids; Introduction, types,
characteristiCs Teatures, structure and tunction of Forest ecosystem, Girassland ecosystem Desert ecosystem, Aquatic
ecosystem (Ponds, Stream, lakes, rivers, oceans, estuaries), Biodiversity: Introduction, Definition: genetic, species
jand ecosystem diversity, Bi0-geographical classilication of India, Value of biodiversity: consumptive use, productive
use, social ethical, aesthetic and option values; Biodiversity at global, national and local level, India as a mega-
diversity nation, Hot-spot of biodiversity, Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife
contlicts, Endangered and endemic species of India, Conservation of biodiversity: In-situ and Ex-situ conservation of
biodiversity.

Unit-II

Renewable and non-renewable resources, Natural resources and associated problems.Forest resources: Use and over-
exploitation, deforestation, case studies, Timber extraction, mining, dams and their effects on forests and tribal people
Water resources: Use and over utilization of surface and ground water, floods, droughts confliets over water, dams
benefits and problems, Mineral resources: Use and exploitation, environmental effects of extracting and mineral
resources, Food resources: world tood problem, changes caused by agriculture and overgraz1ng, effects of modern
agriculture, fertil1zer-pesticide problems, water logging, salinity; Energy resources: Growing energy needs, renewable
studies, Land resources: Land as a resouree
land
g ddegradation,
main induced landslides.
a n o n , main soil erosion
landslides, soil erosion and desertification, Role of an individual in conservation of
natural resources, Equitable use of resources tor suitable lifestyle.

Unit-1

Definition of Environment Pollution, Causes, effects and control measures of: Air Pollution, Water Pollution, Soil
pollution, Marine pollution, Noise pollution, Themal pollution, Nuclear hazards, Solid waste Management: Causes
effects and control measures of urban and industrial wastes, Role of and individual in prevention of pollution, Pollution
case studies; Disaster management: floods, earthquake, cyclone and landslides, Climate change, global warming, acid
rain, ozone layer depletion, nuclear accidents and holocaust, Case studies, different lawS related to environment:

Environment Protection Act, Air (Prevention and Control of Pollution) Act, Water (Prevention and Control of
Pollution) Act, Wildlife Protection Act, Forest Conservation Act., Issues involved in enforcement of environmental
legislation, Public awareness

Unit-IV

Social issues and the Environment: From unsustainable to Sustainable development, Urban problems related to
energy, Water conservation, rain water harvesting, watershed management, Resettlement and rehabilitation of people;
its problem and concern, case studies, Environment ethics: Issues and possible solutions, Wasteland reclamation,
Consumerism and waste products; Human Population growth, variation among nation, Population explosion- Family
Welfare Programme, Environment and human health, Human Rights, Value Education, HIV/AIDS, Women and Child
Welfare, Role of Information Technology in Environment and human health, Case Studies.
Field Work: Visit to a local area to document environmental assets- river/forest/grassland/hill/mountain, Study of
Simple ecosystems ponds, river, hill slopes etc, Study of common plants, insects, birds, Visit to a local polluted site-

Urban/Rural/lndustrial/ Agricultural.

Text and Reference Books

1. Erach Bharucha, Environmental Studies for Undergraduate Courses, University press pvt. Ltd. (India),
2005.
2. Dr. D. D. Mishra, Fndamental concepts in Emvironmental studies, S. Chand publications, 2008.
3. Dr. S.V.S. Rana, Essentials of Ecology and Emvironmental Science, PHI Learning Pvt. Ltd Delhi, 2013.
4. Anil Kumar De, Environmental Chemistry, Wiley Eastern Limited, 1994.
5. T.G. Miller, Emvironmental Science, Wadsworth Publishing Co, 134edition, 2013.
6. P.D. Sharma, Ecology and Emvironment, Rastogi publications, 13t edition, 2003.
 Data Structures and Algorithms using C/C+Lab.

General Course Information

Course Code: PCC-CSE201-P/

Course Assessment Methods (internal: 30; external: 70)
PCC-IT201-P
The internal and external assessment is based on the level of
Course Credits: 2 participation in lab. Sessions and the timely submission oflab
experiments/assignments, the quality ofsolutions designed for
Type: Professional Core Lab. Course
the assignments, the performance in VIVA-VOCE, the quality
Contact Hours: 4 hours/week of lab. file and ethical practices followed.
Mode: Lab practice and assignments The internal examination is conducted by the course
coordinato. The external examination is conducted by external
examiner appointed by the Controller of Examination in
association with the internal examiner appointed by the
Chairperson ofthe Department.
Pre-requisites: Programming in C language.

About the Course:

This lab. course involves implementation of basic and advance data structures and various operations on these data
structures. The objective of the lab course is to train the students to solve the problems related to data structures and
choose the appropriate data structure for solving computational problem efficiently.

Course Outcomes: By the end of the lab course a student would be able to:

COl. Implement various data structures and the related operations. (LOTS: Levels 3: Apply)
CO2. Analyse space and time complexity of algorithms. (HOTS: Level 4: Analyse)
C03. Compare solutions on the basis of the appropriateness of data structure used and the efficiency of the
operations implemented. (HOTS: Level 5: Evaluate)
CO4. Integrate knowledge of data structures to solve real world problems related to data structure and
algorithms. (HOTS: Level 6: Create)
cO5. Create written records for the given assignments with problem definition, design of solution and
conclusions. (HOTS: Level 6: Create)
CO6. Demonstrate ethical practices while solving problems individually or in groups (LOTS: Level 3: Apply).
List of experiments/assignments

1. Two assignments related to creating and manipulating matrices and linear lists.
2. Two assignments associated with linked list, operations on linked lists and their applications.
3. Two assignments on array and linked implementation of stacks and queues.
4. Two assignments on trees and their applications.
5. Two assignments on graphs and their applications.
6. Two assignments on different searching and sorting methods along with their complexity analysis.
7. One assignment on challenging problems on data structures to be given in groups.

Note:
The actual experiments/assignments will be designed by the course coordinator. One assignment should be designed
to be done in groups of two or three students. The assignments must meet the objective of the course and the levels of
the given course outcomes. The list of assignments and schedule of submission will be prepared by the course
coordinator at the beginning of the semester.
 Object Oriented Programming using C++ Lab.

General Course Information

Course Code: PCC-CSE202-P
Course Assessment Methods (internal: 30; external: 70)
PCC-IT202-P
The internal and external assessment is based on the level of
Course Credits: 2
participation in lab. sessions and the timely submission of lab
Type: Professional Core Lab. Course experiments/assignments, the quality of solutions designed for
the assignments, the performance in VIVA-VOCE, the quality
Contact Hours: 4hours/week
of lab. file and ethical practices followed.
Mode: Lab practice and assignments
The internal_examination is conducted by
the
course
coordinator. The external examination is conducted by
external examiner appointed by the Controller of Examination
in association with the internal examiner appointed by the
Chairperson of the Department.
Pre-requisites: Problem solving using C Lab.

About the course:

The lab course provides the opportunity to students to solve problems using Object Oriented Framework in C++
language. This includes implementing the concepts of data abstraction, data hiding. and encapsulation, reuse of code
and, compile and runtime polymorphism.

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

COl. implement problems with object oriented framework. (LOTS: Level 3: Apply)
CO2. analyse the structure of programs for modular design. (HOTS: Level 4: Analyse)
CO3. evaluate robustness of a program by testing it on test/use cases. (HOTS: Level 5: Evaluate)
CO4. design class hierarchies for implementing inheritance/polymorphism. (HOTS: Level 6: Create)
COs. create a lab record of assignments including problem definitions, design of solutions and conclusions.
(HOTS: Level 6: Create)
CO6. demonstrate ethical practices and solve problems individually or in a group. (LOTS: Level 3: Apply)

List of assignments

1. Create two classes DM and DB which store the value of distances. DM stores distances in meters and
centimeters and DB in feet and inches. Write a program that can read values for the class objects and add
of DM Use a to carry out the addition operation. The
one object with another objectof DE. friend function
object that stores the results maybe a DM object or DB objects, depending on the units in which the result
is required. The display should be in the format of feet and inches or meters and centimeters depending on
the object on display.

2. Create a class rational which represents a numerical value by two double values- NUMERATOR &
DENOMINATOR. Include the following public member Functions:

constructor with no arguments (default).

constructor with two arguments.

void reduce 0 that reduces the rational number by eliminating the highest common factor between

'the
numerator and denominator
Overload + operator to add two rational number.
 Overload >> operator to enable input through cin.

Overload << operator to enable output through cout.

Write the main 0 function to test all the funetions in the class.
3. A hospital wants to create a database regarding its indoor patients. The information to be stored includes

a) Name of the patient b) Date of admission c) Disease d) Date of discharge

Create a structure to store the date (year, month and day as its members). Create a base class to store the
above information. The member function should include functions to enter information and display a list of
all the patients in the database. Create a derived class to store the age of the patients. List the information
about all the pediatric patients (less than twelve yeas in age).

4. Make a class Employee with a name and salary. Make a class Manager inherited from Employee. Add an
instance variable named department of type string. Supply a method to toStringthat prints the manager's
name, department and salary. Make a class Executlve inherited from Manager. Supply a method
tostringthat prints the string "Executive" followed by the information stored in the Manager superclass
object. Supply a test program that tests these classes and methods.

5. Imagine a tollbooth with a class called "tollBooth'. The two data items are of type unsigned int to hold the
total number of cars, and a type double to hold the total amount of money collected. A constructor
initializes both to 0. A member function called 'payingCar()' increments the car total and adds 0.50 to the
cash total. Another function, called 'nopay Car ()', increments the car total but adds nothing to the cash
total. Finaly, a member function called displays the two totals. Include a program to test this class. This
program should allow the user lo push one key to count a paying car, and another to count a nonpaying car.
Pushing the ESC kay should cause the program to print out the total cars and total cash and then exit.

6. Write a function called 'revers_it0' that reverses a string (an array of char). Use a for loop that swaps the
first and last characters, then the second and next to last characters and so on. The string should be passed
to 'revers_it0' as an argument. Write a program to exercise 'revers_it )'. The program should get a string
from the usercall of revers_it ) function and print out the result. Use an input method that allows
embedded blanks. Test the program with phrase, "Guru Jambheshwar University of Science & Technology.
Hisar
7. Write a program related to file handling with all the exception handling provisions.

8. C++ program to wTite and read time in/from binary file using fstream. Use exception handling wherever
possible.

9. Write a program to implement string classusing STL.

10. Write a program to implement run time polymorphism.

Note:
The experiments/assignments may vary from session to session and will be designed by the course coordinator. The
assignments must meet the objective of the course and the levels of the given course outcomes. The course
coordinator will provide the schedule for submission of the assignment.