Bachelor of Technology (Computer Science and Engineering)

Credit Based Scheme of Studies/Examination(Modified)

Semester IV (w.e.f Session 2019-2020)
Examination Schedule (Marks) Durat
ion of
Hours/ Exam
S.
Course No. Subject L:T:P Week Credits Minor (Hrs)
No. Major Test Practical Total
Test
1 PC-CS-202A Discrete Mathematics 3:0:0 3 3 75 25 0 100 3
PC-CS-204A Internet Technology
2 3:0:0 3 3 75 25 0 100 3
and Management
3 PC-CS-206A Operating Systems 3:0:0 3 3 75 25 0 100 3
Design and Analysis of
4 PC-CS-208A Algorithms
3:0:0 3 3 75 25 0 100 3
HM-921A Organizational
5 3:0:0 3 3 75 25 0 100 3
Behaviour
PC-CS-210AL Internet Technology
6 0:0:4 4 2 0 40 60 100 3
and Management Lab
PC-CS-212AL Operating Systems
7 0:0:4 4 2 0 40 60 100 3
Lab
PC-CS-214AL Design and Analysis of
8 0:0:4 4 2 0 40 60 100 3
Algorithms Lab
Total 27 21 375 245 180 800

Environmental
9 MC-901A* 3:0:0 3 0 75 25 0 100 3
Sciences

*MC-901A is a mandatory credit-less course and student has to get passing marks in order to qualify for the award of
B.Tech. Degree.
 PC-CS202A Discrete Mathematics
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3
Purpose To provide the conceptual knowledge of Discrete structure.
Course Outcomes (CO)
CO1 To study various fundamental concepts of Set Theory and Logics.
CO2 To study and understand the Relations, diagraphs and lattices.
CO3 To study the Functions and Combinatorics.
CO4 To study the Algebraic Structures.

Unit 1 Set Theory and Logic

Fundamentals - Sets and subsets, Venn Diagrams, Operations on sets, Laws of Set Theory, Power Sets and Products, Partition of sets,
The Principle of Inclusion- Exclusion.
Logic : Propositions and Logical operations, Truth tables, Equivalence, Implications, Laws of Logic, Normal forms, Predicates and
quantifiers, Mathematical Induction.

Unit 2: Relations, diagraphs and lattices

Product sets and partitions, relations and diagraphs, paths in relations and diagraphs, properties of relations, equivalence and partially
ordered relations, computer representation of relations and diagraphs, manipulation of relations, Transitive closure and Warshall’s
algorithm, Posets and Hasse Diagrams, Lattice.

Unit 3 Functions and Combinatorics

Definitions and types of functions: injective, subjective and bijective, Composition, identity and inverse, Review of Permutation and
combination-Mathematical Induction, Pigeon hole principle, Principle of inclusion and exclusion, Generating function-Recurrence
relations.

Unit 4: Algebraic Structures

Algebraic structures with one binary operation - semi groups, monoids and groups, Product and quotient of algebraic structures,
Isomorphism, homomorphism, automorphism, Cyclic groups, Normal sub group, codes and group codes, Ring homomorphism and
Isomorphism.

Suggested Books:
• Elements of Discrete Mathematics C.L Liu, 1985, Reprinted 2000, McGraw Hill
• Discrete Mathematics - Revised (SIE) (Schaum's Outline Series), LIPSCHUTZ , TMH
• Discrete mathematical structures by B Kolman RC Busby, S Ross PHI Pvt. Ltd.
• Discrete Mathematical Structures with Applications to Computer Science , by Tremblay J.P, and Manohar R., McGraw Hill
Book Company, 1975, International Edition, 1987.
• Discrete and Combinatorial mathematics ", Ralph P., Grimaldi, Addison-Wesley Publishing Company, Reprinted in 1985.
• Discrete Mathematics and its Applications ", Kenneth H.Rosen, McGraw Hill Book Company, 1999. Sections: 7.1 to 7.5.
• Discrete Mathematics for computer scientists and Mathematicians, Joe L. Mott, Abraham

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
 PC-CS204A Internet Technology and Management
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3
Purpose To provide the conceptual knowledge of Internet and methodologies used in web and secure internet
communication and networking.
Course Outcomes (CO)
CO1 To study various fundamental concepts of Internetworking techniques with their characteristics.
CO2 To study and understand the requirements for world-wide-web formats and techniques.
CO3 To study the E-mail functioning and basics of HTML, XML and DHTML languages.
CO4 To study the functioning of Servers and Privacy and Security related mechanisms.

UNIT-1 : THE INTERNET

Introduction to networks and internet, history, Internet, Intranet and Extranet, Working of Internet, Internet Congestion, internet culture,
business culture on internet. Collaborative computing and the internet. Modes of Connecting to Internet, Internet Service Providers(ISPs),
Internet address, standard address, domain name, DNS, IP.v6.Modems, Speed and time continuum, communications software; internet
tools.

UNIT-II : WORLD WIDW WEB

Introduction, Miscellaneous Web Browser details, searching the www: Directories search engines and meta search engines, search
fundamentals, search strategies, working of the search engines, Telnet and FTP, HTTP, Gophar Commands, TCP/IP. Introduction to
Browser, Coast-to-coast surfing, hypertext markup language, Web page installation, Web page setup, Basics of HTML and formatting
and hyperlink creation.Using FrontPage Express, Plug-ins.

UNIT-III : INTERNET PLATEFORM AND MAILING SYSTEMS

Introduction, advantages and disadvantages, User Ids, Pass words, e-mail addresses, message components, message composition,
mailer features, E-mail inner workings, E-mail management, MIME types, Newsgroups, mailing lists, chat rooms, secure-mails, SMTP,
PICO, Pine, Library cards catalog, online ref. works.
Languages: Basic and advanced HTML, Basics of scripting languages – XML, DHTML, Java Script.

UNIT-IV : SERVERS
Introduction to Web Servers: PWS, IIS, Apache; Microsoft Personal Web Server. Accessing and using these servers.
Privacy and security topics: Introduction, Software Complexity, Attacks, security and privacy levels, security policy, accessibility and
risk analysis, Encryption schemes, Secure Web document, Digital Signatures, Firewalls, Intrusion detection systems

Suggested Books:
• Internet and World Wide Programming, Deitel,Deitel and Nieto, 2012, Pearson Education
• Fundamentals of the Internet and the World Wide Web, Raymond Greenlaw and Ellen Hepp, TMH- 2012
• Inline/Online: Fundamentals of The Internet And The World Wide Web, GREENLAW, TMH
• Complete idiots guide to java script,. Aron Weiss, QUE, 2013
• Network firewalls, Kironjeet syan -New Rider Pub.2014
• Networking Essentials – Firewall Media.Latest-2015
• www.secinf.com
• www.hackers.com
• Alfred Glkossbrenner-Internet 101 Computing MGH, 2013

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
 PC-CS-206A OPERATING SYSTEMS
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3
Purpose To familiarize the students with the basics of Operating Systems.
Course Outcomes (CO)
CO1 To understand the structure and functions of Operating system.
CO2 To learn about processes, threads and scheduling algorithms.
CO3 To understand the principle of concurrency.
CO4 To understand the concept of deadlocks.
CO5 To learn various memory management schemes.
CO6 To study I/O management and file systems.
CO7 To study the concept of protection and security.

UNIT 1
Introduction: Introduction to OS. Operating system functions, Different types of O.S.: batch process, multi-programmed, time-sharing,
real-time, distributed, parallel.
System Structure: Computer system operation, I/O structure, storage structure, storage hierarchy, different types of protections,
operating system structure (simple, layered, virtual machine), O/S services, system calls.

UNIT II
CPU scheduling: scheduling criteria, preemptive and non-preemptive scheduling, scheduling algorithms, algorithm evaluation, multi-
processor scheduling.
Threads: overview, benefits of threads, user and kernel threads.
Process Management: Concept of processes, process states, process control, co-operating processes, inter-process communication.
Process Synchronization: background, critical section problem, critical region, synchronization hardware, Classical problems of
synchronization, semaphores.

UNIT III
Deadlocks: Concept of deadlock, deadlock characterization, deadlock prevention, deadlock avoidance, deadlock detection, recovery
from deadlock.
Memory Management: background, logical vs. physical address space, contiguous memory allocation, paging, segmentation,
segmentation with paging. Concept of fragmentation.
Virtual Memory: background, demand paging, concept of page replacement, page replacement algorithms , allocation of frames,
thrashing.
UNIT IV
File Systems: file concept, file organization and access methods, allocation methods, directory structure, free-space management
I/O Management: I/O hardware, polling, interrupts, DMA, kernel I/O subsystem (scheduling, buffering, caching, spooling and device
reservation)
Disk Management: disk structure, disk scheduling (FCFS, SSTF, SCAN,C-SCAN) , disk reliability, disk
Performance parameters
Protection and Security:
Goals of protection and security, security attacks, authentication, program threats, system threats, threat monitoring.
Case studies: UNIX file system, Windows file system

Suggested Books:
• Operating System Concepts”, Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne, Wiley
• Operating systems: a concept based approach”, Dhananjay M. Dhamdhere, McGraw Hill .
• Operating Systems : Internals and Design Principles, William Stallings, Pearson
• Operating Systems Design and Implementation” ,(Prentice Hall Software Series) Andrew S Tanenbaum and Albert S Woodhull.
• Taub and Schilling, Principles of Communication Systems, TMH.
• Mithal G K, Radio Engineering, Khanna Pub.
• Sirnon Haykin, Communication Systems, John Wiley.

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.

PC-CS208A Design and Analysis of Algorithms

 Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3 Hrs.
Purpose To introduce advanced data structures and algorithms concepts involving their implementation for solving
complex applications.
Course Outcomes (CO)
CO1 To introduce the basic concepts of Data Structures and their analysis.
CO2 To study the concept of Dynamic Programming and various advanced Data Structures.
CO3 To introduce various Graph algorithms and concepts of Computational complexities.
CO4 To study various Flow and Sorting Networks

Unit 1: Introduction
Review:- Elementary Data Structures, Algorithms and its complexity(Time and Space), Analysing Algorithms, Asymptotic Notations,
Priority Queue, Quick Sort.

Recurrence relation:- Methods for solving recurrence(Substitution , Recursion tree, Master theorem), Strassen multiplication.

Unit 2: Advanced Design and analysis Techniques

Dynamic programming:- Elements, Matrix-chain multiplication, longest common subsequence,
Greedy algorithms:- Elements , Activity- Selection problem, Huffman codes, Task scheduling problem, Travelling Salesman Problem.

Advanced data Structures:- Binomial heaps, Fibonacci heaps, Splay Trees, Red-Black Trees.

Unit 3: Graph Algorithms

Review of graph algorithms:-Traversal Methods(Depth first and Breadth first search),Topological sort, Strongly connected components,
Minimum spanning trees- Kruskal and Prims, Single source shortest paths, Relaxation, Dijkstras Algorithm, Bellman- Ford algorithm,
Single source shortest paths for directed acyclic graphs, All pairs shortest paths- shortest paths and matrix multiplication, Floyd-Warshall
algorithm.

Computational Complexity:-Basic Concepts, Polynomial Vs Non-Polynomial Complexity, NP- hard and NP-complete classes.

Unit 4: Network and Sorting Algorithms

Flow and Sorting Networks Flow networks, Ford- Fulkerson method, Maximum Bipartite matching, Sorting Networks, Comparison
network, The zero- One principle, Bitonic sorting network, Merging networks

Suggested Books :
• Corman, Leiserson and Rivest : Introduction to Algorithms, 2/e, PHI
• Das Gupta :Algorithms, TMH.
• Horowitz, Ellis and Sahni, Sartaj: Fundamentals of Computer Algorithms. Galgotia Publications
• Aho, Hopcroft and Ullman: The Design and Analyses of Computer Algorithms. Addison Wesley.
• R.B.Patel: Expert Data Structures with C, Khanna Publications , Delhi, India, 2nd Edition 2004, ISBN 81-87325-07-0.
• R.B.Patel and M.M.S Rauthan: Expert Data Structures with C++, Khana Publications, Delhi , India, 2nd Edition 2004,ISBN
87522-03-8

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
 HM-921A Organizational Behavior
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3
Purpose To make the students conversant with the basics concepts of organizational culture and behavior for nurturing
their managerial skills.
Course Outcomes (CO)
CO1 An overview about organizational behavior as a discipline and understanding the concept of individual
behavior.
CO2 Understand the concept and importance of personality ,emotions and its importance in decision making and
effective leadership.
CO3 Enabling the students to know about the importance of effective motivation and its contribution in group
dynamics and resolving conflicts.
CO4 Understand how to overcome organizational stress by maintaining proper organizational culture and effective
communication.

Unit 1
Introduction to Organizational Behavior: Concept and importance of Organizational Behavior, Role of Managers in OB, Foundations
or Approaches to Organizational Behavior, Challenges and Opportunities for OB.
Foundation of individual behavior: Biographical characteristics, concept of Abilities and Learning , Learning and Learning Cycle,
Components of Learning, concept of values and attitude, types of attitude, attitude and workforce diversity.
Unit 2
Introduction to Personality and Emotions: Definition and Meaning of Personality, Determinants of Personality, Personality Traits
Influencing OB, Nature and Meaning of Emotions, Emotions dimensions, concept of Emotional intelligence
Perception and individual decision making: Meaning of perception, factors influencing perception, Rational decision making process,
concept of bounded rationality. Leadership- Trait approaches, Behavioral approaches, Situational approaches, and emerging approaches
to leadership.
Unit-3
Motivation: concept and theories of Motivation, theories of motivation-Maslow, Two Factor theory, Theory X and Y,ERG Theory,
McClelland’s Theory of needs, goal setting theory, Application of theories in Organizational Scenario, linkage between MBO and goal
setting theory, employee recognition and involvement program.
Foundations of Group Behavior and conflict management :Defining and classifying of Groups, stages of group development, Informal
and Formal Groups – Group Dynamics, Managing Conflict and Negotiation , a contemporary perspective of intergroup conflict, causes
of group conflicts, Managing intergroup conflict through Resolution.
Unit-4:
Introduction to Organizational Communication: Meaning and Importance of Communication process, importance of Organizational
Communication, Effective Communication, Organizational Stress: Definition and Meaning , Sources and Types of Stress, Impact of
Stress on Organizations, Stress Management Techniques.
Introduction to Organization Culture- Meaning and Nature of Organization Culture, Types of Culture, Managing Cultural Diversity,
Managing Change and Innovation – Change at work, Resistance to change, A model for managing organizational change.

Suggested Books
• Colquitt, Jason A., Jeffery A. LePine, and Michael Wesson. Organizational Behavior: Improving Performance and
Commitment in the Workplace. 5th ed. New York: McGraw-Hill Education, 2017.
• Hitt, Michael A., C. Chet Miller, and Adrienne Colella. Organizational Behavior. 4th ed. Hoboken, NJ: John Wiley, 2015.
• Robbins, Stephen P., and Timothy Judge. Organizational Behavior. 17th ed. Harlow, UK: Pearson Education, 2017.
• Stephen P. Robins, Organisational Behavior, PHI Learning / Pearson Education, 11th edition, 2008.
• Schermerhorn, Hunt and Osborn, Organisational behavior, John Wiley.
• UdaiPareek, Understanding OrganisationalBehaviour, Oxford Higher Education.
• Mc Shane and Von Glinov, OrganisationalBehaviour, Tata Mc Graw Hill.
• Aswathappa, K., OrganisationalBehaviour– Text and Problem, Himalaya Publication

Note: The Examiner will be given the question paper template and will have to set the question paper
according to the template provided along with the syllabus.
 PC-CS210AL Internet Technology and Management Lab
Lecture Tutorial Practical Credit Minor Test Practical Total Time
0 0 4 2.0 40 60 100 3 Hour
Purpose Learn the internet and design different web pages using HTML .
Course Outcomes (CO)
CO1 Understanding different PC software and their applications.
CO2 To be able to learn HTML.
CO3 To be able to write Web pages using HTML.
CO4 To be able to install modems and understand the e-mail systems.

PC Software: Application of basics of MS Word 2000, MS Excel 2000, MS Power Point 2000, MS Access 2000, HTML
1. To prepare the Your Bio Data using MS Word
2. To prepare the list of marks obtained by students in different subjects and show with the help of chart/graph the average, min
and max marks in each subject.
3. Prepare a presentation explaining the facilities/infrastructure available in your college/institute.
4. Design Web pages containing information of the Deptt.
HTML Lists:
1. Create a new document that takes the format of a business letter. Combine <P> and <BR> tags to properly separate the
different parts of the documents. Such as the address, greeting, content and signature. What works best for each?
2. Create a document that uses multiple <BR> and <P> tags, and put returns between <PRE> tags to add blank lines to your
document see if your browser senders them differently.
3. Create a document using the <PRE>tags to work as an invoice or bill of sale, complete with aligned dollar values and a total.
Remember not to use the Tab key, and avoid using emphasis tags like <B> or <EM> within your list.
4. Create a seven-item ordered list using Roman numerals. After the fifth item, increase the next list value by 5.
5. Beginning with an ordered list, create a list that nests both an unordered list and a definition list.
6. Use the ALIGN attribute of an <IMG> tags to align another image to the top of the first image.. play with this feature, aligning
images to TOP, MIDDLE and BOTTOM.
7. Create a ‘table of contents’ style page (using regular and section links) that loads a different document for each chapter or
section of the document.
Internet:
1. Instilling internet and external modems, NIC and assign IP address.
2. Study of E-mail system.
3. Create your own mail-id in yahoo and indiatimes.com.
4. Add names (mail-id’s) in your address book, compose and search an element.

NOTE: A student has to perform at least ten experiments. Seven experiments should be performed from the above list.
Remaining three experiments may either be performed from the above list or designed & set by the concerned
institution as per the scope of the syllabus.
 PC-CS212AL Operating Systems Lab
Lecture Tutorial Practical Credit Sessional Practical Total Time
0 0 4 2.0 40 60 100 3
Purpose To familiarize the students with the basics of Operating Systems.
Course Outcomes (CO)
CO1 To understand the CPU scheduling.
CO2 To learn about memory management.
CO3 To understand system calls.
CO4 To understand the concept of file operations.
CO5 To learn various classical problems.

1. Simulation of the CPU scheduling algorithms a) Round Robin b) SJF c) FCFS d) Priority
2. Program for paging techniques of memory management.
3. Program for page replacement algorithms
4. Simulation of Bankers Deadlock Avoidance and Prevention algorithms.
5. Program for Implementation of System Calls.
6. Program for File Permissions
7. Program for File Operations.
8. Program for File Copy and Move.
9. Program for Dining Philosophers Problem.
10. Program For Producer – Consumer Problem concept.
11. Program for disk scheduling algorithms.

NOTE: A student has to perform at least ten experiments. Seven experiments should be performed from the above list.
Remaining three experiments may either be performed from the above list or designed & set by the concerned institution
as per the scope of the syllabus.
 PC-CS214AL Design and Analysis of algorithms Lab
Lecture Tutoria Practical Credit Minor Test Practical Total Time
l
0 0 4 2.0 40 60 100 3
Purpose The student should be made to Learn the algorithm analysis techniques, become familiar with the different
algorithm design techniques and Understand the limitations of Algorithm power.
Course Outcomes (CO)
CO1 The student should be able to Design algorithms for various computing problems.
CO2 The student should be able to Analyze the time and space complexity of algorithms.
CO3 The student should be able to Critically analyze the different algorithm design techniques for a given
problem.
CO4 The student should be able to Modify existing algorithms to improve efficiency.

1. Sort a given set of elements using the Quick sort method and determine the time required to sort the elements. Repeat the
experiment for different values of n, the number of elements in the lIst to be sorted and plot a graph of the time taken versus n.
The elements can be read from a file or can be generated using the random number generator.
2. Using Open, implement a parallelized Merge Sort algorithm to sort a given set of elements and determine the time required to
sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a
graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator.
3. a. Obtain the Topological ordering of vertices in a given digraph.
b. Compute the transitive closure of a given directed graph using Warshall's algorithm.
4. Implement 0/1 Knapsack problem using Dynamic Programming.
5. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm.
6. Find Minimum Cost Spanning Tree of a given undirected graph using Kristal’s algorithm.
7. a. Print all the nodes reachable from a given starting node in a digraph using BFS method.
b. Check whether a given graph is connected or not using DFS method.
8. Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For
example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given
problem instance doesn't have a solution.
9. Implement any scheme to find the optimal solution for the Traveling Salesperson problem and then solve the same problem
instance using any approximation algorithm and determine the error in the approximation.
10. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
11. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm. Parallelize this algorithm, implement it using Open and
determine the speed-up achieved.
12. Implement N Queen's problem using Back Tracking.
13. Use divides and conquers method to recursively implement Binary Search

NOTE: A student has to perform at least ten experiments. Seven experiments should be performed from the above list.
Remaining three experiments may either be performed from the above list or designed & set by the concerned
institution as per the scope of the syllabus.

MC-901A Environmental Sciences

 Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 0 75 25 100 3 Hrs.
Purpose To learn the multidisciplinary nature, scope and importance of Environmental sciences.
Course Outcomes (CO)
CO1 The students will be able to learn the importance of natural resources.
CO2 To learn the theoretical and practical aspects of eco system.
CO3 Will be able to learn the basic concepts of conservation of biodiversity.
CO4 The students will be able to understand the basic concept of sustainable development.
UNIT 1
The multidisciplinary nature of environmental studies, Definition, Scope and Importance, Need for public awareness, Natural
Resources: Renewable and Non-Renewable Resources: Natural resources and associated problems.
(a) Forest Resources: Use and over-exploitation, deforestation, case studies. Timber eztraction, 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 overgazing, 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 induced landslides, soil erosion and desertification.
Role of an individual in conservation of natural resources, Equitable use of resources for sustainable lifestyle.
UNIT II
Ecosystem-Concept of an ecosystem. Sturcture and function of an ecosystem, 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 ecosystem: (a) Forest Ecosystem, (b) Grassland Ecosystem, (c)
Desert Ecosystem and (d) Aquatic Ecosystems (ponds, streams, lakes, rivers, oceans, esturaries
Field Work: Visit to a local area to document Environment assets-river/forest/grassland/hill/mountain, Visit to a local polluted site-
Urban /Rural Industrial/Agricultural, Study of common plants, insects and birds, Study of simple ecosystems-pond, river, hill, slopes
etc. (Field work equal to 5 lecture hours).
UNIT III
Biodiversity and its conservation: Introduction, Definition: genetic, species and ecosystem diversity. Biogeographical
classification of India. Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values.
Biodiversityof global, National and local levels. India as a mega-diversity nation Hot spots of Biodiversity, Threats to biodiversity:
Habitat loss, poaching of wild life, man-wildlife conflicts, Endangered and endemic species of India, Conservation of Biodiversity-
In situ and Ex-Situ conservation of biodiversity.
Environmental Pollution Definition: Cause, effects and control measures of (a) Air Pollution (b) Water Pollution (c) Soil Pollution
(d) Marine Pollution (e) Noise Pollution (f) Thermal Pollution (g) Nuclear Hazards
Solid waste management- cause, 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
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 problems and
concerns, Case Studies: Environmental ethics-issues and possible solutions. Climate change, global warming, acid rain, ozone
layer depletion, nuclear accidents and holocaust. Case studies: Wasteland Reclamation, Consumerism and waste products,
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, Human
population and the Environment, Population growth, variation among nations, 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, Drugs and their effects; Useful and harmful drugs, Use and abuse
of drugs, Stimulant and depressan drugs, Concept of drug de-addiction, Legal position on drugs and laws related to drugs.
Suggested Books
• Environmental Studies- Deswal and Deswal. Dhanpat Rai and Co.
• Environmental Science and Engineering Anandan, P. and Kumaravelan, R. 2009. Scitech Publications (India) Pvt. Ltd.,
India
• Environmental Studies. Daniels Ranjit R. J. and Krishnaswamy. 2013. Wiley India.
• Environmental Science- Botkin and Keller. 2012. Wiley , India
Note: The Examiner will be given the question paper template to set the question paper.