SEMESTER –I

29
 SEMESTER –I
Mathematics Foundation to Computer Science - I
CC101 25BCA401DS01 Mathematics Foundation 3L:0T:0P 3 Credits
to Computer Science - I
Note: The examiner has to set nine questions in all by setting two questions from each Unit and
Question No. 1 consisting of short-answer questions covering the entire syllabus. Students must
attempt five questions in all by selecting one question from each Unit and Question No. 1, which
is compulsory. All questions will carry equal marks.
Course Objectives
CO1: Provide a basic understanding of fundamental mathematical concepts such as sets,
functions, matrix algebra, and discrete mathematics.
CO2: This course enables the students to use mathematical models and techniques to analyze
and understand problems in computer science.
CO3: This course demonstrates how mathematical principles give a succinct abstraction of
computer science problems and help them to analyze them efficiently.

Course Content:

UNIT I: Set, Relation and Function:

Set, Set Operations, Properties of Set operations, Subset, Venn Diagrams, Cartesian Products.
Relations on a Set, Properties of Relations, Representing Relations using matrices and digraphs,
Types of Relations, Equivalence Relation, Equivalence relation and partition on set, Closures of
Relations, Warshall’s algorithm.
Functions, properties of functions (domain, range), composition of functions, surjective (onto),
injective (one-to-one) and bijective functions, inverse of functions.
Some useful functions for Computer Science: Exponential and Logarithmic functions,
Polynomial functions, Ceiling and Floor functions.

UNIT II:Counting and Recurrence Relation:

Basics of counting, Pigeonhole principle, permutation, combination, Binomial coefficients,
Binomial theorem.
Recurrence relations, modelling recurrence relations with examples, like Fibonacci numbers, the
tower of Hanoi problem. Solving linear recurrence relation with constant coefficients using
characteristic equation roots method.
UNIT III:Elementary Graph Theory:
Basic terminologies of graphs, connected and disconnected graphs, subgraph, paths and cycles,
complete graphs, digraphs, weighted graphs, Euler and Hamiltonian graphs.
Trees, properties of trees, concept of spanning tree. Planar graphs. Definitions and basic results
on the topics mentioned.

UNIT IV:Matrix Algebra:

Types of matrices, algebra of matrices–addition, subtraction, and multiplication of matrices,
determinant of a matrix, symmetric and skew-symmetric matrices, orthogonal matrix, rank of a
matrix, inverse of a matrix, applications of matrices to solve system of linear equations, Eigen
values and Eigen vectors, Caley-Hamilton theorem.

30
Text Books
1. Garg, Reena, Engineering Mathematics, Khanna Book Publishing Company, 2024.
(AICTE Recommended Textbook)
2. Garg, Reena, Advanced Engineering Mathematics, Khanna Book Publishing
Company,2023.
3. Kolman B., Busby R. and Ross S., Discrete Mathematical Structures, 6th Edition,
Pearson Education, 2015.
4. Deo Narsingh, Graph Theory with Application to Engineering and Computer Science,
Prentice Hall, India, 1979.
5. Vasishtha A. R. and Vasishtha A. K., Matrices, Krishna Prakashan, 2022.

Reference Books
1. Grimaldi Ralph P. and Ramana B. V., Discrete and Combinatorial Mathematics: An
Applied Introduction, Fifth Edition, Pearson Education, 2007.
2. Rosen Kenneth H. and Krithivasan Kamala, Discrete Mathematics and its Applications,
McGraw Hill, India, 2019.
3. West Douglas B., Introduction to Graph Theory, Second Edition, Pearson Education,
2015
Web Resources
1. https://nptel.ac.in/courses/106103205
2. https://nptel.ac.in/courses/111101115
*****
Problem Solving Techniques

SEC101 25BCA401SEC01 Problem Solving 3L:0T:4P 5 Credits

Techniques

Course Objectives

CO1: Understand basic terminology of computers, problem solving, programming Languages

and their evolution (Understand)
CO2: Create specification from problem requirements by asking questions to disambiguate the
requirement statement. (Create)
CO3: Design the solution from specification of a problem and write pseudo code of the
algorithm using basic building blocks or structured programming constructs (Sequence,
Selection and Repetition statement). (Create)
CO4: Translate an algorithm into a C computer program (Create)
CO5: Testing and analysing programs using debugging tools. (Analyze)

Prerequisite: This is an introductory programming course and hence no prerequisites

Course Content:
UNIT I: (CO-1, CO-2)
Problems And Problem Instances, Generalization and Special Cases, Types of Computational
Problems, Classification of Problems, Analysis of Problems, Solution Approaches, Algorithm
31
 Development, Analysis of Algorithm, Efficiency, Correctness, Role of Data Structures in
Problem Solving, Problem-Solving Steps (Understand the Problem, Plan, Execute, And
Review), Breaking the Problem into Subproblems, Input/Output Specification, Input Validation,
Pre and Post Conditions.

UNIT II: (CO-2, CO-3, CO-4)

Structured Programming Concepts: Sequence (Input/Output/Assignment), Selection (If, If-Else)
And Repetition (For, While, Do-While) Statements, Control Structure Stacking and Nesting.
Different Kinds of Repetitions: Entry Controlled, Exit Controlled, Counter Controlled, Definite,
Indefinite and Sentinel-Controlled Repetitions. Pseudocode and Flowcharts. Definition And
Characteristics of Algorithms, Standard Algorithm Format. Problems Involving Iteration and
Nesting: Displaying Different Patterns and Shapes Using Symbols and Numbers, Generating
Arithmetic and Geometric Progression, Fibonacci and Other Sequences, Approximate Values
For π, Sin(x), Cos(x), Etc. Using Taylor Series. Different Kinds of Data in The Real World and
How They are Represented in The Computer Memory. Representation of Integers: Signed
Magnitude Form, 1’s Complement And 2’s Complement. Representation of Real Numbers:
IEEE 754 Floating Point Representation. Representation of Characters: ASCII, UNICODE.
C Language: Introduction To Programming Languages, Different Generations of Programming
Languages. Typed Vs Typeless Programming Languages, History of C Language, An Empty C
Program. C Language Counterparts For Input (scanf()), Output (printf()) Statements,
Assignment, Arithmetic, Relational and Logical Operators. If, If-Else Statements, For, While,
Do-While Statements. Data Types. Translating Pseudocode/Algorithm to C Program.
Incremental Compilation and Testing of The C Program. Simple Problems Involving Input,
Output, Assignment Statement, Selection and Repetition. Good Coding Practices.

UNIT III: (CO-2, CO-3, CO-4)

Problems on Numbers: Extracting Digits of a Number (Left to Right and Right to Left),
Palindrome, Prime Number, Prime Factors, Amicable Number, Perfect Number, Armstrong
Number, Factorial, Converting Number from One Base to Another. Statistics (Maximum,
Minimum, Sum and Average) on a Sequence of Numbers which are Read using Sentinel
Controlled Repetition using only a few Variables.
C Language: else-if Ladder, switch Case, Increment/Decrement Operators, break and continue
Statements.

UNIT IV: (CO-2, CO-3, CO-4, CO-5)

Modular Programming, Top-Down and Bottom-Up Approaches to Problem Solving. Recursion.
Problems on Arrays: Reading and Writing of Array Elements, Maximum, Minimum, Sum,
Average, Median and Mode. Sequential And Binary Search. Any one Sorting Algorithm. Matrix
Operations.
C Language: Function Definition and Declaration (Prototype), Role of Return Statement, One
Dimensional and Two-Dimensional Arrays. String Functions. Other Operators, Operator
Precedence and Associativity. Debugging.

Text Books
1. Venkatesh, Nagaraju Y, Practical C Programming for Problem Solving, Khanna Book
Publishing Company, 2024.

32
2. AICTE’s Programming for Problem Solving (with Lab Manual), Khanna Book Publishing
Company, 2024.
3. Harvey Deitel and Paul Deitel, C How to Program, 9th edition, Pearson India, 2015.
4. R G Dromey, How to Solve It by Computer.

Reference Books

1. Brian W. Kernighan and Dennis Ritchie, The C Programming Language, 2nd edition, Pearson, 2015.
2. Jeri Hanly and Elliot Koffman, Problem Solving and Program Design in C, 8th edition, Pearson, 2015.

******

Problem Solving Techniques: Lab Problems

UNIT-II

1. Converting degrees Celsius to Fahrenheit and vice versa?

2. Display three input numbers in sorted (non-decreasing) order?
3. Given a positive integer value n (>= 0) display number, square and cube of numbers
from 1 to n in a tabular format?
4. Given an input positive integer number, display odd numbers from in the range [1,n]?
5. Display first mathematical tables, each table up to 10 rows? Generalise this to display
first n (> 0) mathematical tables up to m (m > 0) rows?
6. Display following patterns of n rows (n > 0), For the below examples n = 5? For each
pattern write a separate algorithm/program?

$ $ 12345 12345
$$ $$ 1234 1234
$$$ $$$ 123 123
$$$$ $$$$ 12 12
$$$$$ $$$$$ 1 1

7. Display the following patterns of n rows (n > 0), for the below examples n = 5?

Hollow square Triangle Patterns Square with Diamond

pattern: with numbers: diagonals: Pattern

##### 1
* * * *
# # 121 * *
# # 12321
*
# # 1234321 * * *
*
***
##### 123454321 * * *****
*
* * * ***
*
*
33
 * * *
*

8. Given the first term (a), difference/multiplier (d) and number of terms (n > 0), display
the first n terms of the arithmetic/geometric progression?
9. Display the first n (n > 0) terms of the fibonacci sequence?
10. Display the first n (n > 0) terms of the Tribonacci sequence?
11. Given two positive integer numbers n1 and n2 check if the numbers are consecutive
numbers of the fibonacci sequence?
12. Compute approximate value of π considering first n (n > 0) terms of the Taylor series
for π?
13. Compute approximate value of ex considering first n (n > 0) terms of the Taylor series
for ex?
14. Compute approximate value of sin(x)/cos(x) considering first n (n > 0) terms of the
Taylor series for sin(x)/cos(x)?

UNIT-III

1. Extract digits of an integer number (left to right and right to left)?

2. Given a sequence of digits form the number composed of the digits. Use sentinel
controlled repetition to read the digits followed by -1. For example, for the input 2 7 3
2 9 -1 the output number is 27329?
3. Check if a given positive integer number is a palindrome or not?
4. Compute character grade from the marks (0 ≤ marks ≤ 100) of a subject. Grading
Scheme: 80-100 : A, 60 - 79: B, 50 - 59: C, 40-49: D, 0-39: F? Solve this using both
else-if ladder and switch case?
5. Compute the sum of a sequence of numbers entered using sentinel controlled repetition?
6. Check if a given positive integer number is a prime number or not?
7. Compute prime factors of a positive integer number?
8. Check if two positive integer numbers are amicable numbers or not?
9. Check if a given positive integer number is a perfect number or not?
10. Check if a given positive integer number Armstrong number or not?
11. Converting a positive integer number (n > 0) from one base (inputBase) to another base
(outputBase) (2 <= input Base, outputBase <= 10). Input number should be validated
before converting to make sure the number uses only digits allowed in the input base?

34
 12. Write a program to display a number in text form. For example If the number is 5432
the output should be “FIVE FOUR THREE TWO”?
13. Using the grading scheme described in the question 4 (UNIT III), Compute how many
students awarded each grade and display the frequency as a bar chart (horizontal) using
single “*” for each student. Use sentinel controlled repetition (-1 as sentinel value) in
reading the students marks. Use else-if ladder/switch case to compute the grade and the
corresponding frequency.
Sample bar chart when the class has 7-A, 10-B, 3-C, 7-D and 1-F grades.

A:
*******
B:
**********
C: ***
D:
*******
F: *
14. Compute maximum, minimum, sum and average of a sequence of numbers which are
read using sentinel controlled repetition using only few variables?
15. Compute body mass index, BMI = weightinKGs / (HeightinMeters
*HeightinMeters), Both weight and height values are positive real numbers. Your
program should display BMI value followed by whether the person is Underweight,
Normal, Overweight or Obese using the below ranges:
BMI Values
Underweight: less than 18.5
Normal: >=18.5 and <25
Overweight: >=25 and < 30
Obese: >= 30

UNIT IV

1. Design a modularized algorithm/program to check if a given positive integer number is

a circular prime or not?
2. Design a modularized algorithm/program to compute a maximum of 8 numbers?
3. Design a modular algorithm/program which reads an array of n integer elements and
outputs mean (average), range (max-min) and mode (most frequent elements)?
4. Design a modular algorithm/program which reads an array of n integer elements and
outputs median?
5. Implement your own string length and string reversal functions?
6. Design algorithm/program to perform matrix operations addition, subtraction and
transpose?
7. Write a recursive program to count the number of digits of a positive integer number?
8. Recursive solutions for the following problems:
a. Factorial of a number?
b. Display digits of a number from left to right (and right to left)?
c. Compute xy using only multiplication?
35
 d. To print a sequence of numbers entered using sentinel controlled repetition in
reverse order?

******

Computer Architecture

CC102 25BCA401DS02 Computer 3L:0T:4P 5 Credits

Architecture
Note: The examiner has to set nine questions in all by setting two questions from each Unit
and Question No. 1 consisting of short-answer questions covering the entire syllabus. Students
must attempt five questions in all by selecting one question from each Unit and Question No.
1, which is compulsory. All questions will carry equal marks.

Course Objectives

CO1: To Understand the basics of Digital Electronics and Binary Number System
CO2: To Learn the implementation of Combinational Circuit.
CO3: To Learn the implementation of Sequential Circuit.
CO4: To Understand the Organization of basic computers.
CO5: To Understand the concept of Parallel Processing.
CO6: To understand the concept of memory organization.

Course Content:

UNIT-I
Digital Principles: Definition for Digital signals, Digital logic, Digital computers, Von
Neumann Architecture, Boolean Laws and Theorems, K-Map: Truth Tables to K-Map, 2, 3 and
4 variable K Map, K-Map Simplifications, Don’t Care Conditions, SOP and POS.
Number Systems: Decimal, Binary, Octal, Hexadecimal, Number System Conversions, Binary
Arithmetic, Addition and subtraction of BCD, Octal Arithmetic, Hexadecimal Arithmetic,
Binary Codes, Decimal Codes, Error detecting and correcting codes, ASCII, EBCDIC, Excess3
Code, The Gray Code.

UNIT-II
Combinational Circuits: Half Adder and Full Adder, Subtractor, Decoders, Encoder,
Multiplexer, Demultiplexer
Sequential Circuits: Flip-Flops- SR Flip- Flop, D Flip-Flop, J-K Flip-Flop, T Flip-Flop.
Register: 4 bit register with parallel load, Shift Registers- Bidirectional shift register with
parallel load Binary Counters-4 bit synchronous and Asynchronous binary counter.

UNIT-III
Basic Computer Organization and Design: Instruction Codes, Computer Registers, Computer
Instructions, Timing and Control, Instruction Cycle, Memory-Reference Instructions,
InputOutput Interrupt, Complete Computer Description, Design of Basic Computer, Design of

36
Accumulator logic. Central Processing Unit: Introduction, General Register Organization, Stack
Organization, Instruction Formats, Addressing Modes, Data Transfer and Manipulation,
Program Control, Reduced Instruction Set Computer(RISC), RISC Vs CISC.

UNIT-IV
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction
Pipeline, RISC Pipeline. Input-Output Organization: Peripheral Devices, Input-Output Interface,
Asynchronous data transfer, Modes of Transfer, Priority Interrupt, Direct memory Access,
Input-Output Processor(IOP).
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory, Associate
Memory, Cache Memory, Virtual Memory, Memory Management Hardware.

Text Books:
1. Donald P Leach, Albert Paul Malvino, Goutam Saha- “Digital Principles &
Applications” , Tata McGraw Hill Education Private Limited,2011Edition.
2. M. Morris Mano- “Computer System Architecture”, Pearson/Phi, Third Edition.

Reference Books:
1 William Stallings- “Computer Organization and Architecture”, Pearson/PHI, Sixth
Edition,
2 Andrew S. Tanenbaum- “Structured Computer Organization”, PHI /Pearson 4th Edition,
3 M.V .Subramanyam, “Switching Theory and Logic Design”, Laxmi Publications (P) Ltd.
4 Ikvinderpal Singh, Computer Organization Architecture, Khanna Book Publishing.

Suggestive Laboratory Experiments:

1. Verify logic behavior of AND, OR, NAND, NOR, EX-OR, EX-NOR, Invert and Buffer
gates.
2. To study and verify NAND as a Universal Gate
3. To verify De- Morgan’s theorem for 2 variables
4. Design and test of an S-R flip-flop using NAND/NOR gate.
5. Convert BCD to Excess-3 code using NAND gate
6. To Convert Binary to Grey Code
7. Verification of Truth Tables of J-K Flip-Flop using NAND/NOR gate
8. Realize Decoder and Encoder circuit using Basic Gates.
9. Design and implement the 4:1 MUX using gates.
10. Implementation of 4-Bit Parallel Adder Using 7483 IC.
11. Design and verify operation of half adder and full adder.
12. Design and verify operation of half subtractor.
13. Design and Implement a 4 bit shift register using Flip flops.
14. Implement Boolean function using logic gates in both SOP and POS
15. Design and Implement a 4 bit synchronous counter.
16. Design and verify 4 bit asynchronous counter.

37
 Hardware

1. Familiarize the computer system layout: marking positions of SMPS, motherboard,

FDD, HDD, CD, DVD and add on cards.
2. Identify the Computer Name and Hardware Specification (RAM capacity, Processor
type, HDD, 32 bit/ 64 bit)
3. Identify and Troubleshoot the problems of RAM, SMPS and motherboard
4. Configure BIOS settings- disable and enable USB and LAN 5. Adding additional RAM
to the system.(expanding RAM size).
6. To Study mother board layout of a system.
7. Demonstrate the assembly of a PC
8. Demonstration of various ports: CPU, VGA port, PS/2 (keyboard, mouse) ,USB, LAN,
Speaker, Audio.
9. Install and configure windows OS
10. To study the installation of Printer and trouble shooting.

*******
General English – I

AEC 101 25ENGX01AE01 General English - I 1L:1T:0P 2 Credits

Course Objective:
1. To provide learning environment to practice listening, speaking, reading and writing skills.
2. To assist the students to carry on the tasks and activities through guided instructions and
materials.
3. To effectively integrate English language learning with employability skills and training.
4. To provide hands-on experience through case-studies, mini-projects, group and individual
presentations.

Course Content:
Unit- I: Vocabulary Building and Basic Writing Skills
The concept of Word Formation, Root words from foreign languages and their use in English,
Acquaintance with prefixes and suffixes from foreign languages in English to form derivatives,
Synonyms, antonyms, and standard abbreviations.
Sentence Structures, Use of phrases and clauses in sentences, Importance of proper punctuation,
Creating coherence, Organizing principles of paragraphs in documents, Techniques for writing
precisely
Unit- II: Identifying Common Errors in Writing
Subject-verb agreement, Noun-pronoun agreement, Misplaced modifiers, Articles, Prepositions,
Redundancies
Unit- III: Nature and Style of sensible Writing

38
Describing, Defining, Classifying, providing examples or evidence, writing introduction and
conclusion, Module V: Writing Practices, Comprehension, Précis Writing, Essay Writing.
Unit-IV: Oral Communication (This Module involves interactive practice sessions in Language
Lab)
Listening Comprehension, Pronunciation, Intonation, Stress and Rhythm, Common Everyday
Situations: Conversations and Dialogues, Communication at Workplace, Interviews, Formal
Presentations.
Listening Comprehension, Pronunciation, Intonation, Stress and Rhythm, Common Everyday
Situations: Conversations and Dialogues, Communication at Workplace, Interviews, Formal
Presentations.
Text/Reference Books:
1. AICTE’s Prescribed Textbook: Communication Skills in English (with Lab Manual),
Anjana Tiwari, Khanna Book Publishing Co., 2023.
2. Effective Communication Skills. Kul Bhushan Kumar, Khanna Book Publishing, 2022.
3. Practical English Usage. Michael Swan. OUP. 1995.
4. Remedial English Grammar. F.T. Wood. Macmillan.2007
5. On Writing Well. William Zinsser. Harper Resource Book. 2001
6. Study Writing. Liz Hamp-Lyons and Ben Heasly. Cambridge University Press. 2006.
7. Communication Skills. Sanjay Kumar and PushpLata. Oxford University Press. 2011. 8.
Exercises in Spoken English. Parts. I-III. CIEFL, Hyderabad. Oxford University Press.

Alternative NPTEL/SWAYAM Course:

S.No. NPTEL/SWAYAM Course Instructor Host Institute
Name

1 English language for Prof. Aysha iqbal IIT MADRAS

competitive exams

2 Technical English for engineers Prof. Aysha iqbal IITM

Course Outcomes: The student will acquire basic proficiency in English including reading and
listening comprehension, writing and speaking skills
********

Indian Knowledge System

MDE 101 25SOCX01MD01 Indian 2L:0T:0P 2 Credits
Knowledge
System

*For Detailed Course Refer APPENDIX – II

39
 ********
Environmental Science and Sustainability
VAC 101 25CSAX01VA01 Environmental 2L:0T:0P 2 Credits
Science and
Sustainability

Course description:
This course aims to familiarize students with fundamental environmental concepts and their
relevance to business operations, preparing them to address forthcoming sustainability
challenges. It is designed to equip students with the knowledge and skills needed to make
decisions that account for environmental consequences, fostering environmentally sensitive and
responsible future managers. The course content is divided into four comprehensive units. Unit
1 introduces basic environmental principles, the man-environment relationship, and
sustainability issues.
Unit 2 focuses on ecosystems, biodiversity, and sustainable practices.
Unit 3 addresses environmental pollution, waste management, and sustainable development
strategies. Finally,
Unit 4 explores social issues, environmental legislation, and practical applications through
hands-on fieldwork. Through this holistic approach, students will gain a deep understanding of
environmental processes, the importance of sustainable practices, and their role in promoting
sustainability within business contexts.

Course Objective(s):
1. This course aims to familiarize students with basic environmental concepts, their
relevance to business operations, and forthcoming sustainability challenges.
2. This course will equip students to make decisions that consider environmental
consequences.
3. This course will enable future business graduates to become environmentally sensitive
and responsible managers.

Course Content:

Unit 1: Understanding Environment, Natural Resources, and Sustainability

Fundamental environmental concepts and their relevance to business operations; Components
and segments of the environment, the man-environment relationship, and historical
environmental movements. Concept of sustainability; Classification of natural resources, issues
related to their overutilization, and strategies for their conservation. Sustainable practices in
managing resources, including deforestation, water conservation, energy security, and food
security issues. The conservation and equitable use of resources, considering both
intergenerational and intergenerational equity, and the importance of public awareness and
education.

Unit 2: Ecosystems, Biodiversity, and Sustainable Practices

Various natural ecosystems, learning about their structure, functions, and ecological
characteristics. The importance of biodiversity, the threats it faces, and the methods used for its

40
conservation. Ecosystem resilience, homeostasis, and carrying capacity, emphasizing the need
for sustainable ecosystem management. Strategies for in situ and ex situ conservation, nature
reserves, and the significance of India as a mega diverse nation.

Unit 3: Environmental Pollution, Waste Management, and Sustainable Development

Various types of environmental pollution, including air, water, noise, soil, and marine pollution,
and their impacts on businesses and communities. Causes of pollution, such as global climate
change, ozone layer depletion, the greenhouse effect, and acid rain, with a particular focus on
pollution episodes in India. Importance of adopting cleaner technologies; Solid waste
management; Natural and man-made disasters, their management, and the role of businesses in
mitigating disaster impacts.

Unit 4: Social Issues, Legislation, and Practical Applications

Dynamic interactions between society and the environment, with a focus on sustainable
development and environmental ethics. Role of businesses in achieving sustainable development
goals and promoting responsible consumption. Overview of key environmental legislation and
the judiciary's role in environmental protection, including the Water (Prevention and Control of
Pollution) Act of 1974, the Environment (Protection) Act of 1986, and the Air (Prevention and
Control of Pollution) Act of 1981. Environmental justice, environmental refugees, and the
resettlement and rehabilitation of affected populations; Ecological economics, human
population growth, and demographic changes in India.

Readings:

Text Books (Latest Editions):

● Poonia, M.P. Environmental Studies (3rd ed.), Khanna Book Publishing Co.
● Bharucha, E. Textbook of Environmental Studies (3rd ed.) Orient Blackswan Private Ltd.
● Dave, D., & Katewa, S. S. Text Book of Environmental Studies. Cengage Learning India Pvt Ltd.
● Rajagopalan, R. Environmental studies: from crisis to cure (4th ed.). Oxford University Press.
● Miller, G.T. & Spoolman S. Living in the Environment. (20th ed.). Cengage.
● Basu, M., & Xavier Savarimuthu, S. J. Fundamentals of environmental studies. Cambridge
University Press.
● Roy, M. G. Sustainable Development: Environment, Energy and Water Resources. Ane Books.
● Pritwani, K. Sustainability of business in the context of environmental management. CRC Press.
● Wright, R.T. & Boorse, D.F. Environmental Science: Toward A Sustainable Future (13th ed,).
Pearson.
References

Web links:
● https://www.ourplanet.com
● https://www.undp.org/content/undp/en/home/sustainable-development-goals.html
● www.myfootprint.org
● https://www.globalchange.umich.edu/globalchange1/current/lectures/kling/ecosystem
/ecosystem.html

41
Course Outcome(s):

1. Explore the basic environmental concepts and issues relevant to the business and
management field.
2. Recognize the interdependence between environmental processes and socio-economic
dynamics.
3. Determine the role of business decisions, policies, and actions in minimizing
environmental degradation.
4. Identify possible solutions to curb environmental problems caused by managerial
actions.
5. Develop skills to address immediate environmental concerns through changes in
business operations, policies, and decisions.

******

42