BCA Syllabus

Course Objectives

• Understand the fundamental mathematical concepts such as sets, functions, matrix algebra and discrete mathematics.
• Use mathematical models and techniques to analyse and understand problems in computer science.
• Understand how mathematical principles provide succinct abstractions of computer science problems and help to analyse them efficiently.
• Understand Eigen values, Eigen vectors and the Cayley-Hamilton Theorem, and analyse matrix transformations and their applications in various domains.

Course Content

1. Unit I: Set, Relation, and Function

   11 Lectures

   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.

   Exponential and Logarithmic functions, Polynomial functions, Ceiling and Floor functions.

2. Unit II: Counting and Recurrence Relation

   11 Lectures

   Basics of counting, Pigeonhole Principle, permutations, combinations, Binomial coefficients, and Binomial Theorem.

   Recurrence relations, their order, and methods for solving linear recurrence relations with constant coefficients using characteristic equation roots (real roots only). Non-linear recurrence relations and generating functions.

3. Unit III: Elementary Graph Theory

   11 Lectures

   Basic terminologies of graphs, connected and disconnected graphs, subgraphs, paths, and cycles, complete graphs, digraphs, weighted graphs, Euler and Hamiltonian graphs, as well as trees, their properties, the concept of spanning trees, and planar graphs, along with definitions and basic results related to these topics.

4. Unit IV: Matrix Algebra

   12 Lectures

   Types of matrices and their algebraic operations such as addition, subtraction, and multiplication. Determinants, symmetric and skew-symmetric matrices, orthogonal matrices, the rank and inverse of a matrix, and applications of matrices in solving systems of linear equations using Cramer's Rule. Eigen values, eigenvectors, Cayley-Hamilton Theorem.

Suggested Readings

• Kolman B., Busby R., and Ross S., Discrete Mathematical Structures, 6th Edition, Pearson Education, 2015.
• Deo Narsingh, Graph Theory with Application to Engineering and Computer Science, Prentice Hall India, 1979.
• Vasishtha A. R. and Vasishtha A. K., Matrices, Krishna Prakashan, 2022.
• Garg R., Engineering Mathematics, Khanna Book Publishing Company, 2024.
• Garg R., Advanced Engineering Mathematics, Khanna Book Publishing Company, 2023.
• Reference: Grimaldi Ralph P. and Ramana B. V., Discrete and Combinatorial Mathematics: An Applied Introduction, 5th Edition, Pearson Education, 2007.
• Reference: Rosen Kenneth H. and Krithivasan Kamala, Discrete Mathematics and its Applications, McGraw Hill, India, 2019.
• Reference: West Douglas B., Introduction to Graph Theory, 2nd Edition, Pearson Education, 2015.
• Reference: Stephen Andrilli and David Hecker, Elementary Linear Algebra, 4th Edition, Elsevier Science, 2010.
• Reference: Kenneth Rosen, Discrete Mathematics and its Applications, McGraw Hill.

Course Objectives

• Understand the basics of Digital Electronics and Binary Number System.
• Learn the implementation of Combinational Circuit.
• Learn the implementation of Sequential Circuit.
• Understand the Organization of basic computers.
• Understand the concept of parallel processing.
• Understand the concept of memory organization.

Course Content

1. Unit I

   11 Lectures

   Digital Principles: Definition of 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 systems, 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, Excess-3 Code, Gray Code.

2. Unit II

   11 Lectures

   Combinational Circuits: Half Adder, Full Adder, Subtractor, Decoders, Encoder, Multiplexer, Demultiplexer.

   Sequential Circuits: Flip-Flops – SR Flip-Flop, D Flip-Flop, J-K Flip-Flop, T Flip-Flop.

   Registers: 4-bit register with parallel load, shift registers – bidirectional shift register with parallel load. Binary Counters: 4-bit synchronous and asynchronous binary counter.

3. Unit III

   11 Lectures

   Basic Computer Organization: Instruction codes, computer registers, computer instructions, timing and control, instruction cycle, memory-reference instructions, input-output interrupt, complete computer description, design of basic computer, design of 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.

4. Unit IV

   12 Lectures

   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 (DMA), input-output processor (IOP).

   Arithmetic Algorithms: Integer multiplication using shift and add, Booth's algorithm, integer division, floating-point representations.

   Memory Organization: Memory hierarchy, main memory, auxiliary memory, associative memory, cache memory, virtual memory, memory management hardware.

Practical / Lab Exercises

1. Verify the logic behaviour of AND, OR, NAND, NOR, EX-OR, EX-NOR, Invert, and Buffer gates.
2. Study and verify NAND as a Universal Gate.
3. Verify De Morgan's theorem for two variables.
4. Design and test an S-R flip-flop using NAND/NOR gates.
5. Convert BCD to Excess-3 code using NAND gates.
6. Convert Binary to Gray Code.
7. Verify the truth tables of J-K Flip-Flop using NAND/NOR gates.
8. Realize Decoder and Encoder circuits using basic gates.
9. Design and implement a 4:1 MUX using gates.
10. Implement a 4-bit parallel adder using the 7483 IC.
11. Design and verify the operation of a half adder and full adder.
12. Design and verify the operation of a half subtractor.
13. Design and implement a 4-bit shift register using flip-flops.
14. Implement Boolean functions using logic gates in both SOP and POS forms.
15. Design and implement a 4-bit synchronous counter.
16. Design and verify a 4-bit asynchronous counter.
17. Hardware: Familiarize with the computer system layout: identifying SMPS, motherboard, FDD, HDD, CD, DVD, and add-on cards.
18. Hardware: Identify the computer name and hardware specifications (RAM capacity, processor type, HDD, 32-bit/64-bit architecture).
19. Hardware: Identify and troubleshoot issues related to RAM, SMPS, and the motherboard.
20. Hardware: Configure BIOS settings: enable/disable USB and LAN.
21. Hardware: Expand RAM size by adding additional RAM to the system.
22. Hardware: Study the motherboard layout of a computer system.
23. Hardware: Demonstrate the assembly of a PC.
24. Hardware: Demonstrate various ports: CPU, VGA port, PS/2 (keyboard, mouse), USB, LAN, Speaker, Audio.
25. Hardware: Install and configure the Windows Operating System.
26. Hardware: Study printer installation and troubleshooting.

Suggested Readings

• Leach, Donald P., Albert Paul Malvino, and Goutam Saha. Digital Principles and Applications. McGraw Hill Education, 2011.
• Mano, M. Morris. Computer System Architecture. 3rd ed., Pearson/PHI, 2006.
• Morris Mano, Digital Logic and Computer Design, Pearson/PHI.
• Floyd L. Thomas, Digital Fundamentals, Pearson.
• Reference: Stallings, William. Computer Organization and Architecture. 6th ed., Pearson/PHI, 2003.
• Reference: Tanenbaum, Andrew S. Structured Computer Organization. 4th ed., PHI/Pearson, 1999.
• Reference: Subramanyam, M. V. Switching Theory and Logic Design. Laxmi Publications, 2008.

Course Objectives

• Module: Indian Culture and Civilization.
• To introduce fundamentals of Ancient Indian Education to understand the pattern and purpose of studying Vedas, Vedangas, Upangas, Upveda, Purana and Itihasa.
• To help students to trace, identify and develop the ancient knowledge systems.
• To help understand the apparently rational, verifiable and universal solution from ancient Indian knowledge system for the holistic development of physical, mental and spiritual wellbeing.
• To build in the learners a deep-rooted pride in Indian knowledge, committed to universal human rights, well-being and sustainable development.

Course Content

1. Unit I: Introduction to IKS

   6 Lectures

   Caturdaśa Vidyāsthānam, 64 Kalas, Shilpa Śāstra, Four Vedas, Vedāṅga, Indian Philosophical Systems, Vedic Schools of Philosophy (Sāṃkhya and Yoga, Nyaya and Vaiśeṣika, Pūrva-Mīmāṃsā and Vedānta), Non-Vedic schools of Philosophical Systems (Cārvāka, Buddhist, Jain), Puranas (Maha-puranas, Upa-Puranas and Sthala-Puranas), Itihasa (Ramayana, Mahabharata), Niti Sastras, Subhasitas.

2. Unit II: Foundation Concept for Science & Technology

   6 Lectures

   Linguistics & Phonetics in Sanskrit (Panini's), Computational concepts in Astadhyayi, Importance of Verbs, Role of Sanskrit in Natural Language Processing, Number System and Units of Measurement, concept of zero and its importance, Large numbers & their representation, Place Value of Numerals, Decimal System, Measurements for time, distance and weight, Unique approaches to represent numbers (Bhūta Saṃkhya System, Kaṭapayādi System), Pingala and the Binary system, Knowledge Pyramid, Prameya – A Vaiśeṣikan approach to physical reality, constituents of the physical reality, Pramāṇa, Saṃśaya.

3. Unit III: Indian Mathematics & Astronomy in IKS

   6 Lectures

   Indian Mathematics, Great Mathematicians and their contributions, Arithmetic Operations, Geometry (Sulba Sutras, Aryabhatiya-bhasya), value of π, Trigonometry, Algebra, Chandah Sastra of Pingala, Indian Astronomy, celestial coordinate system, Elements of the Indian Calendar, Aryabhatiya and the Siddhantic Tradition, Pancanga – The Indian Calendar System, Astronomical Instruments (Yantras), Jantar Mantar of Raja Jai Singh Sawai.

4. Unit IV: Indian Science & Technology in IKS

   6 Lectures

   Indian S & T Heritage, sixty-four art forms and occupational skills (64 Kalas), Metals and Metalworking technology (Copper, Gold, Zinc, Mercury, Lead and Silver), Iron & Steel, Dyes and Painting Technology, Town Planning and Architecture in India, Temple Architecture, Vastu Sastra.

5. Unit V: Humanities & Social Sciences in IKS

   6 Lectures

   Health, Wellness & Psychology, Ayurveda Sleep and Food, Role of water in wellbeing, Yoga way of life, Indian approach to Psychology, the Triguṇa System, Body-Mind-Intellect-Consciousness Complex. Governance, Public Administration & Management reference to Ramayana, Artha Sastra, Kauṭilyan State.

Suggested Readings

• Prof. B Mahadevan, Textbook on IKS, IIM Bengaluru.
• Kapur K and Singh A. K. (Eds) (2005). Indian Knowledge Systems, Vol. 1. Indian Institute of Advanced Study, Shimla.
• Tatvabodh of Shankaracharya, Central Chinmaya Mission Trust, Bombay, 1995.
• Nair, Shantha N. Echoes of Ancient Indian Wisdom. New Delhi: Hindology Books, 2008.
• SK Das, The Education System of Ancient Hindus, Gyan Publication House, India.
• BL Gupta, Value and Distribution System in India, Gyan Publication House, India.
• Reshmi Ramdhoni, Ancient Indian Culture and Civilisation, Star Publication, 2018.
• Supriya Lakshmi Mishra, Culture and History of Ancient India (With Special Reference of Sudras), 2020.
• Gambirananda, Swami, Tr. Upanishads with the Commentary of Sankaracharya. Kolkata: Advaita Ashrama Publication Department, 2002.
• Ranganathananda, Swami. The Message of the Upanishads. Bombay: Bharatiya Vidya Bhavan, 1985.
• Om Prakash, Religion and Society in Ancient India, Bharatiya Vidya Prakashan, 1985.
• J Auboyer, Daily Life in Ancient India from Approximately 200 BC to AD 700, Munshi Ram Manoharlal Publication, 1994.
• DK Chakrabarty, Makkhan Lal, History of Ancient India (Set of 5 Volumes), Aryan Book International publication, 2014.
• Dr. Girish Nath Jha, Dr. Umesh Kumar Singh and Diwakar Mishra, Science and Technology in Ancient Indian Texts, DK Print World Limited.
• Swami BB Vishnu, Vedic Science and History – Ancient Indian's Contribution to the Modern World, 2015.
• Chatterjee, S.C. The Nyaya Theory of Knowledge. Calcutta: University of Calcutta Press, 1950.
• Dasgupta, Surendra. A History of Indian Philosophy. Motilal Banarsidass Publishing House, 1991. Vols. III & IV.
• Mercier, Jean L. From the Upanishads to Aurobindo. Bangalore: Asian Trading Corporation, 2001.
• M. Hiriyanna. Essentials of Indian Philosophy. London: Diane Publications, 1985.
• Hume, Robert Ernest, Tr. The Thirteen Principal Upanishads. Virginia: Oxford.
• Radhakrishnan, S. Principal Upanishads. New York: Harper Collins, 1963.
• Satprakashananda. The Methods of Knowledge according to Advaita Vedanta. Calcutta: Advaita Ashram, 2005.
• Potter, K.H. Encyclopaedia of Indian Philosophies, Vol. III. Delhi: Motilal Banarsidass Publishing House, 2015.

Course Objectives

• Understand basic terminology of computers, problem solving, programming languages and their evaluation.
• Develop algorithms, flowcharts and pseudo code to solve computational problems using structured approaches.
• Implement structured programming concepts and control structures using the C language.
• Solve numerical and statistical problems using control structures and C programming.
• Apply modular programming, recursion, and array/matrix operations in C programs.

Course Content

1. Unit I: Problem-Solving and Algorithm Development

   11 Lectures

   Problems and Problem Instances, Generalization and Special Cases, Types of Computational Problems, Classification of Problems, Analysis of Problems, Solution Approaches, Algorithm 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.

2. Unit II: Structured Programming Concepts

   11 Lectures

   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 and Basic Programming Constructs: 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.

3. Unit III: Problems on Numbers and Basic Statistical Operations

   11 Lectures

   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.

4. Unit IV: Modular Programming and Arrays

   12 Lectures

   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.

   Implementation in C Language: Function Definition and Declaration (Prototype), Role of Return Statement, Recursion, One Dimensional and Two-Dimensional Arrays. String Functions. Other Operators, Operator Precedence and Associativity.

   Debugging: identify and fix errors. Different types of debugging techniques.

Practical / Lab Exercises

1. Unit II – Basic Problem-Solving Techniques: Convert 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 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 (> 0) rows.
6. Display patterns of n rows (n > 0) using symbols and numbers (e.g. left- and right-aligned '$' triangles and decreasing number triangles, shown for n = 5); write a separate algorithm/program for each pattern.
7. Display the following patterns of n rows (n > 0): hollow square pattern, triangle patterns with numbers, square with diagonals, and diamond pattern (examples shown for n = 5).
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 eˣ considering first n (n > 0) terms of the Taylor series for eˣ.
14. Compute approximate value of sin(x)/cos(x) considering first n (n > 0) terms of the Taylor series for sin(x)/cos(x).
15. Unit III – Problems on Numbers: Extract digits of an integer number (left to right and right to left).
16. 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.
17. Check if a given positive integer number is a palindrome or not.
18. 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.
19. Compute the sum of a sequence of numbers entered using sentinel controlled repetition.
20. Check if a given positive integer number is a prime number or not.
21. Compute prime factors of a positive integer number.
22. Check if two positive integer numbers are amicable numbers or not.
23. Check if a given positive integer number is a perfect number or not.
24. Check if a given positive integer number is an Armstrong number or not.
25. Convert a positive integer number (n > 0) from one base (input base) to another base (output base) (2 <= input base, output base <= 10). The input number should be validated before converting to make sure the number uses only digits allowed in the input base.
26. 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".
27. Using the grading scheme described in question 4 (Unit III), compute how many students are awarded each grade and display the frequency as a horizontal bar chart using a 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.
28. Sample bar chart when the class has 7-A, 10-B, 3-C, 7-D and 1-F grades.
29. Compute maximum, minimum, sum and average of a sequence of numbers which are read using sentinel controlled repetition using only few variables.
30. Compute body mass index, BMI = weight in kg / (height in metres × height in metres). Both weight and height values are positive real numbers. Display the BMI value followed by whether the person is Underweight (less than 18.5), Normal (>= 18.5 and < 25), Overweight (>= 25 and < 30) or Obese (>= 30).
31. Unit IV: Design a modularized algorithm/program to check if a given positive integer number is a circular prime or not.
32. Design a modularized algorithm/program to compute a maximum of 8 numbers.
33. 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).
34. Design a modular algorithm/program which reads an array of n integer elements and outputs median.
35. Implement your own string length and string reversal functions.
36. Design algorithm/program to perform matrix operations addition, subtraction and transpose.
37. Write a recursive program to count the number of digits of a positive integer number.
38. Recursive solutions for: (a) factorial of a number; (b) display digits of a number from left to right and right to left; (c) compute xʸ using only multiplication; (d) print a sequence of numbers entered using sentinel controlled repetition in reverse order.

Suggested Readings

• Harvey Deitel and Paul Deitel, C How to Program, 9th edition, Pearson India, 2015.
• Dromey, R. G. How to Solve It by Computer. Pearson Education, 1982.
• Balaguruswamy, Programming in C, McGraw Hill.
• Kanetkar, Yashavant. Let Us C. BPB Publications, 2020.
• Venkatesh, Nagaraju Y., Practical C Programming for Problem Solving, Khanna Book Publishing Company, 2024.
• Reference: Brian W. Kernighan and Dennis Ritchie, The C Programming Language, 2nd edition, Pearson, 2015.
• Reference: Jeri Hanly and Elliot Koffman, Problem Solving and Program Design in C, 8th edition, Pearson, 2015.
• Reference: Goyal K. K., Sharma M. K., and Thapliyal M. P., Concept of Computer and C Programming, University Science Press.
• Reference: Yashavant Kanetkar, Exploring C, BPB Publications.
• Reference: K. R. Venugopal, Programming with C, Tata McGraw Hill.
• Reference: V. Rajaraman, Computer Programming in C, PHI.
• Reference: Byron Gottfried, Programming with C, Tata McGraw Hill.

Course Objectives

• Develop a strong vocabulary foundation and understand word formation, prefixes, suffixes, synonyms and antonyms to improve English language proficiency.
• Apply basic writing skills, including sentence structures, paragraph organization, coherence, and punctuation, to enhance written communication.
• Identify and correct common grammatical errors in writing, including subject-verb agreement, misplaced modifiers, and redundancy.
• Demonstrate the ability to write effectively using descriptive, definitional, and classificatory techniques, including providing examples and writing structured content.
• Improve written communication through comprehension, précis writing, and essay writing techniques.
• Develop oral communication skills, including pronunciation, intonation, workplace communication, and formal presentations, through interactive language lab sessions.

Course Content

1. Unit I: Vocabulary Building

   6 Lectures

   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.

2. Unit II: Basic Writing Skills

   6 Lectures

   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.

3. Unit III: Identifying Common Errors in Writing

   4 Lectures

   Subject-verb agreement, Noun-pronoun agreement, Misplaced modifiers, Articles, Prepositions, Redundancies, Tenses.

4. Unit IV: Nature and Style of Sensible Writing

   4 Lectures

   Describing, Defining, Classifying, providing examples or evidence, Writing introduction and conclusion.

5. Unit V: Writing Practices

   4 Lectures

   Comprehension, Précis Writing, Essay Writing.

6. Unit VI: Oral Communication

   6 Lectures

   Listening Comprehension, Pronunciation, Intonation, Stress and Rhythm, Common Everyday Situations: Conversations and Dialogues, Communication at Workplace, Interviews, Formal Presentations.

Suggested Readings

• Swan, Michael. Practical English Usage. Oxford University Press, 1995.
• Wood, F.T. Remedial English Grammar. Macmillan, 2007.
• Zinsser, William. On Writing Well. Harper Resource Book, 2001.
• Hamp-Lyons, Liz, and Ben Heasly. Study Writing. Cambridge University Press, 2006.
• Kumar, Sanjay, and Pushp Lata. Communication Skills. Oxford University Press, 2011.
• Exercises in Spoken English, Parts I-III. CIEFL, Hyderabad, Oxford University Press.
• Tiwari, Anjana. Communication Skills in English (with Lab Manual). Khanna Book Publishing Co., 2023.

Course Objectives

• Understand the environmental concepts, sustainability, and impact of resource exploitation on ecosystems and communities.
• Analyze the structure, function, and types of ecosystems, including ecosystem services and conservation strategies.
• Evaluate the role of businesses in sustainable development and the significance of environmental legislation and social issues.

Course Content

1. Unit I: Understanding Environment, Natural Resources, and Sustainability

   10 Lectures

   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. Land resources: Minerals, soil, agricultural crops, natural forest products, medicinal plants, and forest-based industries and livelihoods; Land cover, land use change, land degradation, soil erosion, and desertification; Causes of deforestation; Impacts of mining and dam building on environment, forests, biodiversity, and tribal communities.

   Water resources: Natural and man-made sources; Uses of water; Over exploitation of surface and ground water resources; Floods, droughts, and international & interstate conflicts over water.

   Energy resources: Renewable and non-renewable energy sources; Use of alternate energy sources; Growing energy needs; Energy contents of coal, petroleum, natural gas and bio gas; Agro-residues as a biomass energy source.

   The conservation and equitable use of resources, considering both intergenerational and intragenerational equity, and the importance of public awareness and education.

2. Unit II: Ecosystems, Biodiversity, and Sustainable Practices

   5 Lectures

   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 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.

3. Unit III: Social Issues, Legislation, and Practical Applications

   10 Lectures

   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.

   Development – Environment conflict (displacement, resettlement and rehabilitation) and compensation mechanism to project affected people (PAP); Sustainable Development Goals: India's National Action Plan on Climate Change and its major missions, human population growth, and demographic changes in India.

4. Unit IV: Environmental Pollution, Waste Management, and Sustainable Development

   5 Lectures

   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.

Suggested Readings

• Bharucha, E. Textbook of Environmental Studies. 3rd ed., Orient Blackswan Private Ltd., 2015.
• Dave, D., and S. S. Katewa. Text Book of Environmental Studies. Cengage Learning India Pvt Ltd, 2018.
• Rajagopalan, R. Environmental Studies: From Crisis to Cure. 4th ed., Oxford University Press, 2019.
• Miller, G.T., and Scott Spoolman. Living in the Environment. 20th ed., Cengage, 2018.
• Basu, M., and S. J. Xavier Savarimuthu. Fundamentals of Environmental Studies. Cambridge University Press, 2016.
• Roy, M. G. Sustainable Development: Environment, Energy and Water Resources. Ane Books, 2017.
• Pritwani, K. Sustainability of Business in the Context of Environmental Management. CRC Press, 2021.
• Wright, R.T., and Dorothy F. Boorse. Environmental Science: Toward A Sustainable Future. 13th ed., Pearson, 2020.

Course Objectives

• Understand correct lines of arguments and proofs.
• Understand mathematical techniques that are foundations for understanding advanced computational methods, including numerical methods and optimization.
• Understand various problem-solving strategies and methods to tackle both theoretical and practical challenges in computer science.

Course Content

1. Unit I: Logic and Methods of Proofs

   11 Lectures

   Propositions, logical operations (basic connectives), compound statements, construction of truth table, quantifiers, conditional statements, tautology, contradiction, logical equivalence. Conjunctive Normal Forms (CNF) and Disjunctive Normal Forms (DNF).

   Methods of Proofs: Rules of inference for propositional logic, modus ponens, modus tollens, syllogism, proof by contradiction, Mathematical Induction.

2. Unit II: Algebraic Structures

   11 Lectures

   Semi-group, Monoid, Group, Abelian Group, Subgroup, Properties of Subgroup, Cyclic group.

3. Unit III: Numerical Methods

   11 Lectures

   Concept and importance of errors in numerical methods.

   Solution of algebraic and transcendental equations: Bisection method and Newton-Raphson methods.

   Numerical Interpolation: Newton's Forward and Newton's Backward interpolation formula and Lagrange's formula.

   Numerical Integration: Quadrature Formula, Trapezoidal rule, Simpson's 1/3 rule and Simpson's 3/8 rule (only formulae and applications for all the topics mentioned in this unit).

4. Unit IV: Optimization Techniques

   12 Lectures

   Linear programming: Introduction, LP formulation, Graphical method for solving LPs with two variables, Special cases in graphical methods, Simplex method, Duality.

   Transportation problem: Definition, Linear form, North-west corner method, least cost method, Vogel's approximation method for finding feasible solution, MODI method for finding optimum solution.

Suggested Readings

• Kolman B., Busby R. and Ross S., Discrete Mathematical Structures, 6th Edition, Pearson Education, 2015.
• Sastry S. S., Introductory Methods of Numerical Analysis, Fifth Edition, PHI, 2022.
• Taha Hamdy A., Operations Research: An Introduction, Eighth Edition, Pearson Prentice Hall, 2003.
• Reference: Rosen Kenneth H. and Krithivasan Kamala, Discrete Mathematics and its Applications, McGraw Hill, India, 2019.
• Reference: Chakravorty J. G. and Ghosh P. R., Linear Programming and Game Theory, Moulik Library, 2017.
• Reference: Sharma J. K., Operations Research: Theory and Applications, Fourth Edition, Macmillan Publishers, 2007.
• Reference: S.D. Sharma, Operations Research (Theory Methods & Applications), 2014.
• Reference: Satinder Bal Gupta, Discrete Mathematics and Structures, McGraw Hill, 2010.

Course Objectives

• Understand the fundamental concepts of data structures and their classifications, including arrays and their operations.
• Develop the ability to implement and manipulate linked lists and apply hashing techniques for efficient data storage and retrieval.
• Apply stack, queue, and recursion concepts to solve complex computational problems in C programming.
• Implement tree and graph data structures to solve real-world problems and optimize data organization.

Course Content

1. Unit I: Definition, Classification and Operations of Data Structures

   11 Lectures

   Definition of data structures, Types of Data Structures: Linear and Non-Linear Data Structure, Algorithms: Complexity, Time-Space Tradeoff. Difference between algorithm and programs.

   Arrays: Definition and Classification of Arrays, Representation of Linear Arrays in Memory.

   Operations on Linear Arrays: Traversing, Inserting, Deleting, Searching, Sorting and Merging.

   Searching: Linear Search and Binary Search, Comparison of Methods. Sorting: Bubble Sort, Selection Sort, and Insertion Sort.

   Multi-Dimensional Arrays: Representation of Two-Dimensional Arrays in Memory, Matrices and Sparse Matrices, Multi-Dimensional Arrays.

2. Unit II: Linked Lists and Hashing

   11 Lectures

   Linked Lists: Definition, Comparison with Arrays, Representation, Types of Linked lists, Traversing, Inserting, Deleting and Searching in Singly Linked List, Doubly Linked List and Circular Linked List.

   Applications of Linked Lists: Addition of Polynomials.

   Hashing and Collision: Hashing, Hash Tables, Types of Hash Functions, Collision, Collision Resolution with Open Addressing and Chaining.

3. Unit III: Stacks, Queues, and Recursion

   11 Lectures

   Stacks: Definition, Representation of Stacks using Arrays and Linked List, Operations on Stacks using Arrays and Linked List.

   Application of Stacks: Arithmetic Expressions, Polish Notation, Conversion of Infix Expression to Postfix Expression, Evaluation of Postfix Expression.

   Recursion: Definition, Recursive Notation, Runtime Stack. Applications of Recursion: Factorial of Number, GCD, Fibonacci Series and Towers of Hanoi.

   Queues: Definition, Representation of Queues using Array and Linked List, Types of Queue: Simple Queue, Circular Queue, Double-Ended Queue, Priority Queue, Operations on Simple Queues and Circular Queues using Array and Linked List.

   Applications of Queues: Various use cases in problem-solving.

4. Unit IV: Graphs and Trees

   12 Lectures

   Graphs: Definition, Terminology, Representation, Traversal.

   Trees: Definition, Terminology, Binary Trees, Traversal of Binary Tree, Binary Tree Representation: Array Representation and Pointer (Linked List) Representation.

   Binary Search Tree: Inserting, Deleting and Searching in Binary Search Tree.

   Height Balanced Trees: AVL Trees, Insertion and Deletion in AVL Tree.

Practical / Lab Exercises

1. Array Operations: Write a program for insertion and deletion operations in an array.
2. Searching in an Array: Write a program to search for an element in an array using Linear Search and Binary Search.
3. Sorting an Array: Write a program to sort an array using Bubble Sort, Selection Sort, and Insertion Sort.
4. Merging Arrays: Write a program to merge two arrays.
5. Matrix Operations: Write a program to add and subtract two matrices; write a program to multiply two matrices.
6. Singly Linked List Operations: Write a program to insert an element into a Singly Linked List (at the beginning, at the end, at a specified position); write a program to delete an element from a Singly Linked List (at the beginning, at the end, a specified element).
7. Doubly Linked List Operations: Write a program to perform the following operations in a Doubly Linked List: create; search for an element.
8. Circular Linked List Operations: Write a program to perform the following operations in a Circular Linked List: create; delete an element from the end.
9. Stack Operations: Write a program to implement stack operations using an array; write a program to implement stack operations using a linked list.
10. Polynomial Addition: Write a program to add two polynomials using linked lists.
11. Postfix Evaluation: Write a program to evaluate a postfix expression using a stack.
12. Recursion Operations: Write a program to perform the following using recursion: find the factorial of a number; find the GCD of two numbers; solve the Towers of Hanoi problem.
13. Queue Operations: Write programs to implement simple queue operations using an array, circular queue operations using an array, and circular queue operations using a linked list.
14. Binary Search Tree (BST) Operations: Write a program to perform preorder, inorder and postorder traversal on a binary search tree; write a program to perform insertion operation in a binary search tree.

Suggested Readings

• Seymour Lipschutz, Data Structures with C, Schaum's Outlines, Tata McGraw-Hill, 2011.
• Yashavant Kanetkar, Data Structures Through C, 4th Edition, BPB Publications, 2022.
• Cormen T. H., Leiserson C. E., Rivest R. L., and Stein C., Introduction to Algorithms, PHI, 2011.
• R. S. Salaria, Data Structures & Algorithms, Khanna Book Publishing.
• S. K. Shrivastava, Data Structures Through C in Depth, BPB Publications.
• Reference: Reema Thareja, Data Structures Using C, Second Edition, Oxford University Press, 2014.
• Reference: Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Freed, Fundamentals of Data Structures in C, Second Edition, Universities Press, 2007.
• Reference: RB Patel, Expert Data Structures, Khanna Book Publishing.

Course Objectives

• Understand the components, services, and structures of operating systems and different types of OS.
• Analyze process scheduling, multithreading, and CPU scheduling algorithms.
• Apply concepts of process synchronization and solve deadlock problems using appropriate techniques.
• Implement memory management techniques, file systems, and disk scheduling algorithms.
• Lab outcomes: implement CPU scheduling algorithms; understand and solve critical section problems; apply file allocation and frame management techniques; implement page replacement algorithms.

Course Content

1. Unit I: Operating Systems (OS) Overview

   11 Lectures

   Definition, Evolution of OS, Components & Services of OS, Structure, Architecture, types of Operating Systems, Batch Systems, Concepts of Multiprogramming and Time Sharing, Parallel, Distributed, and real-time Systems.

   Operating Systems Structures: Operating system services and system calls, system programs, operating system structure, operating systems generations.

2. Unit II: Process Management

   11 Lectures

   Process Definition, Process states, Process State transitions, Process Scheduling, Process Control Block, Threads, Concept of multithreads, Benefits of threads, Types of threads.

   Process Scheduling: Definition, Scheduling objectives, Scheduling algorithms, CPU scheduling Preemptive and Non-preemptive Scheduling algorithms (FCFS, SJF and RR), Performance evaluation of the scheduling Algorithms.

3. Unit III: Process Synchronization

   11 Lectures

   Introduction, Inter-process Communication, Race Conditions, Critical Section Problem, Mutual Exclusion, Semaphores, problems of synchronization, readers and writers problem, dining philosophers problem, Monitors.

   Deadlocks: System model, deadlock characterization, deadlock prevention, avoidance, Banker's algorithm, Deadlock detection, and recovery from deadlocks.

4. Unit IV: Memory Management

   12 Lectures

   Logical and Physical address map, Swapping, Memory allocation, MFT, MVT, Internal and External fragmentation and Compaction, Paging, and Segmentation.

   Virtual Memory: Demand paging, Page Replacement algorithms, Allocation of frames, thrashing.

   I/O Management: Principles of I/O Hardware: Disk structure, Disk scheduling algorithms.

   File system interface: File Concept, Access Methods, Directory Structure, File System Structure, Allocation Methods, and Free-Space Management.

   System Protection: Goals, Principles, Domain of Protection, Access Matrix, Access Control.

Practical / Lab Exercises

1. Write a C program to simulate the FCFS CPU Scheduling algorithm.
2. Write a C program to simulate the SJF CPU Scheduling algorithm.
3. Write a C program to simulate the Round Robin CPU Scheduling algorithm.
4. Write a C program to simulate Banker's Algorithm for Deadlock Avoidance.
5. Write a C program to implement the Producer – Consumer problem using semaphores.
6. Write a C program to illustrate the IPC mechanism using Pipes.
7. Write a C program to illustrate the IPC mechanism using FIFOs.
8. Write a C program to simulate Paging memory management technique.
9. Write a C program to simulate Segmentation memory management technique.
10. Write a C program to simulate the Best Fit contiguous memory allocation technique.
11. Write a C program to simulate the First Fit contiguous memory allocation technique.
12. Write a C program to simulate the concept of Dining-Philosophers problem.
13. Write a C program to simulate the MVT algorithm.
14. Write a C program to implement FIFO page replacement technique.
15. Write a C program for implementing sequential file allocation method.

Suggested Readings

• Silberschatz, Abraham, et al. Operating System Principles. 7th ed., Wiley India, 2006.
• Stallings, William. Operating Systems: Internals and Design Principles. 5th ed., Pearson Education, 2006.
• Silberschatz and Galvin, Operating System Concepts, Wiley.
• Dhananjay M. Dhamdhere, Operating Systems: A Concept-based Approach, McGraw Hill.
• Reference: Tanenbaum, Andrew S. Modern Operating Systems. 3rd ed., Prentice Hall India, 2007.
• Reference: Das, Sumitabha. UNIX Concepts and Applications. 4th ed., Tata McGraw-Hill, 2014.

Course Objectives

• Understand the fundamental concepts of Object-Oriented Programming (OOP) and Java language structure.
• Apply decision-making, branching, looping, and operator usage in Java programming.
• Implement concepts of classes, objects, inheritance, polymorphism, arrays, and strings in Java programs.
• Develop Java programs using packages and exception handling mechanisms.

Course Content

1. Unit I

   11 Lectures

   Fundamentals of Object-Oriented Programming – Basic Concepts of Object-Oriented Programming (OOP), Benefits and Applications of OOP.

   Java Evolution – Java Features, Difference between Java, C and C++, Java and Internet, Java Environment.

   Overview of Java Language – Setting up Java Development Environment (JDK, IDEs), Introduction to Simple Java Program, Use of Comments and Math functions, Application of two classes, Java Program Structure, Java Tokens and Statements, Implementing Java Program and JVM, Command Line Arguments.

2. Unit II

   11 Lectures

   Constants, Variables and Data Types – Constants, Variables, Primitive & Non-Primitive Data Types, Declaration of Variables, Giving values to Variables, Symbolic Constants, Typecasting.

   Operators & Expressions – Arithmetic operators, Relational operators, Logical operators, Assignment operators, Increment & Decrement operators, Conditional operators, Bitwise operators, Arithmetic Expressions, Evaluation of Expressions, Type Conversions in Expressions, Operator Precedence & Associativity.

   Decision Making, Branching & Looping – Decision Making with Control Statements (if-else, switch-case), Looping Statements (for, while, do-while), Jump in loops, Labeled loops.

3. Unit III

   11 Lectures

   Classes, Objects and Methods – Java Keywords, Defining Class, Instance Variables & Methods, Creating Objects, Methods Declaration, Constructors, this keyword, Static Members (Variables & Methods).

   Arrays, Strings and Vectors – 1D Arrays, Creating an Array, 2D Arrays, Strings, Vectors, Wrapper Classes, Enumerated Types.

   Inheritance – Defining Classes & Objects, Access Modifiers, Extending Classes and Implementing Interfaces, Multiple Inheritance using Interfaces and Polymorphism (Method Overloading & Overriding Methods).

4. Unit IV

   12 Lectures

   Packages – Basics of Packages, System Packages, Creating and Accessing Packages, Creating User-Defined Packages, Adding Class to a Package.

   Exception Handling – Using the main keywords of exception handling: try, catch, throw, throws and finally; Nested try, Multiple catch statements, Creating User-Defined Exceptions.

Practical / Lab Exercises

1. Write a program to read two numbers from the user and print their product.
2. Write a program to print the square of a number passed through command line arguments.
3. Write a program to send the name and surname of a student through command line arguments and print a welcome message for the student.
4. Write a Java program to find the largest number out of n natural numbers.
5. Write a Java program to find the Fibonacci series & Factorial of a number using recursive and non-recursive functions.
6. Write a Java program to multiply two given matrices.
7. Write a Java program for sorting a given list of names in ascending order.
8. Write a Java program that checks whether a given string is a palindrome or not (e.g., MADAM is a palindrome).
9. Write a Java program to read n number of values in an array and display them in reverse order.
10. Write a Java program to perform mathematical operations. Create a class called AddSub with methods to add and subtract. Create another class called MulDiv that extends from AddSub class to use the member data of the superclass. MulDiv should have methods to multiply and divide. A main function should access the methods and perform the mathematical operations.
11. Create a Java class called Student with the following details as variables within it: USN, NAME, BRANCH, PHONE, PERCENTAGE. Write a Java program to create n Student objects and print the USN, Name, Branch, Phone, and Percentage of these objects with suitable headings.
12. Write a Java program that displays the number of characters, lines, and words in a text.
13. Write a Java program to create a class called Shape with methods called getPerimeter() and getArea(). Create a subclass called Circle that overrides the getPerimeter() and getArea() methods to calculate the area and perimeter of a circle.
14. Write a Java program to create a class Employee with a method called calculateSalary(). Create two subclasses Manager and Programmer. In each subclass, override the calculateSalary() method to calculate and return the salary based on their specific roles.
15. Write a Java program using an interface called 'Bank' having a function 'rate_of_interest()'. Implement this interface to create two separate bank classes SBI and PNB to print different rates of interest. Include additional member variables and constructors in classes SBI and PNB.
16. Write a Java package program for the class Book and then import the data from the package and display the result.
17. Write a Java program for finding the cube of a number using a package for various data types and then import it into another class and display the results.
18. Write a Java program for demonstrating the divide by zero exception handling.
19. Write a Java program that reads a list of integers from the user and throws an exception if any numbers are duplicates.
20. Create an exception subclass UnderAge, which prints "Under Age" along with the age value when an object of UnderAge class is printed in the catch statement. Write a class ExceptionDemo in which the method test() throws UnderAge exception if the variable age passed to it as an argument is less than 18. Write the main() method to demonstrate the working of the program.

Suggested Readings

• Balaguruswamy, E. Programming with JAVA: A Primer. 7th ed. India: McGraw Hill Education, 2023.
• Schildt, H. Java: The Complete Reference. 12th edition. McGraw-Hill Education, 2022.
• Somasundaram, K. Programming in Java 2, Jaico Publishing House.
• Reference: Liang, Y. Daniel. Introduction to Java Programming. 7th ed., Pearson, 2008.
• Reference: Malhotra, S., and S. Choudhary. Programming in Java. 2nd ed., Oxford UP, 2014.
• Reference: Ivor Horton, Beginning Java 2, SPD Publication.
• Reference: Ramesh Bangia, Learning JAVA-2, Khanna Book Publishing Co (P) Ltd.

Course Objectives

• Understand the concepts of webpage, markup language along with CSS.
• Understand the core concepts of JavaScript including functions, events, DOM manipulation, and form validation.
• Apply AJAX, XML, and JSON to create dynamic and interactive web applications.

Course Content

1. Unit I

   7 Lectures

   Introduction to HTML: History of HTML, objectives, basic structures of HTML, header tags, body tags, paragraph tags, and formatting tags. Tags for form creation: TABLE, FORM, TEXTAREA, SELECT, IMG, IFRAME, FIELDSET, ANCHOR, AUDIO, and VIDEO. Lists in HTML, introduction to the DIV tag, NAVBAR design.

   Introduction to CSS: Types of CSS, selectors, and responsiveness of a web page.

   Introduction to Bootstrap: Downloading/linking Bootstrap, using Bootstrap classes, understanding the grid system in Bootstrap. Bootstrap typography, Jumbotron, button group, Glyphicons, pagination, pager, list group, and carousel.

   Introduction to WWW: Protocols and programs, applications and development tools, web browsers, DNS, web hosting providers. Setting up Windows/Linux/Unix web servers, web hosting in the cloud, and types of web hosting.

2. Unit II

   8 Lectures

   Introduction to JavaScript: Functions and events, Document Object Model (DOM) traversal using JavaScript. Output systems in JavaScript: alert, throughput, input box, and console. Variables and arrays in JavaScript, date, and string handling.

   Manipulating CSS through JavaScript: Form validation techniques: required validator, length validator, and pattern validator.

   Advanced JavaScript: JavaScript error handling, JavaScript Object-Oriented Programming (OOP), JavaScript libraries and frameworks, JavaScript Browser Object Model (BOM), and ES6 features.

   Combining HTML, CSS, and JavaScript: Handling events and buttons, controlling the browser.

   Introduction to AJAX: Purpose, advantages, disadvantages, AJAX-based web applications, and alternatives to AJAX.

   Introduction to XML: Uses, key concepts, DTD & schemas, XSL, XSLT, XSL elements, and transforming XML using XSLT.

   Introduction to XHTML: Key concepts and features.

   Introduction to JSON: Keys and values, types of values, arrays, and objects.

Practical / Lab Exercises

1. Part A: Create your class time table using table tag.
2. Part A: Design a webpage for your college containing a description of courses, departments, faculties, library, etc., using list tags, href tags, and anchor tags.
3. Part A: Create a web page using Frame with rows and columns where you will have a header frame, left frame, right frame, and status bar frame. On clicking in the left frame, information should be displayed in the right frame.
4. Part A: Create your resume using HTML, using text, link, size, color, and lists.
5. Part A: Create a web page of a supermarket using internal CSS.
6. Part A: Use inline CSS to format the resume that you have created.
7. Part A: Use external CSS to format your timetable created.
8. Part A: Use all the CSS (inline, internal, and external) to format the college web page that you have created.
9. Part A: Write an HTML program to create your college website for mobile devices.
10. Part B: Write an HTML/JavaScript page to create a login page with validations.
11. Part B: Develop a simple calculator for addition, subtraction, multiplication, and division operations using JavaScript.
12. Part B: Use regular expressions for validations in the login page using JavaScript.
13. Part B: Write a program to retrieve data from a text file and display it using AJAX.
14. Part B: Create an XML file to store Student Information like Register Number, Name, Mobile Number, DOB, and Email-ID.
15. Part B: Create a DTD for the XML file created.
16. Part B: Create an XML schema for the XML file created.
17. Part B: Create an XSL file to convert the XML file to an XHTML file.
18. Part B: Write a JavaScript program using a switch case.
19. Part B: Write a JavaScript program using any five events.
20. Part B: Write a JavaScript program using built-in JavaScript objects.
21. Part B: Write a program for populating values from JSON text.
22. Part B: Write a program to transform JSON text into a JavaScript object.

Suggested Readings

• Laura Lemay, Mastering HTML, CSS & JavaScript Web Publishing, BPB Publications, 2016.
• Thomas A. Powell, The Complete Reference HTML & CSS, Fifth Edition, 2017.
• Shruti Kohli, Web Technologies, BPB Publications.
• Web Technologies: Black Book, Dreamtech Press.
• Reference: Silvio Moreto, Bootstrap 4 By Example, e-book, 2016.
• Reference: Tanweer Alam, Web Technologies, Khanna Book Publishing, 2011.
• Reference: Jeffrey C. Jackson, Web Technologies, Pearson.
• Reference: Uttam K. Roy, Web Technologies, Oxford Higher Education.
• Reference: Kogent Learning Solutions, Web Technologies, Dreamtech.

Course Objectives

• Understand the history, structure, and interpretation of the Indian Constitution, including Fundamental Rights, Duties, and State Policy Principles.
• Analyze the structure and functioning of the Union Government, including the roles and powers of the President, Prime Minister, and Parliament.
• Explain the structure and working of the State Government and its administrative framework, including the Governor, Chief Minister, and State Secretariat.
• Evaluate the role of local administration and the Election Commission in the functioning of democracy at the grassroots level.

Course Content

1. Unit I: The Constitution

   6 Lectures

   Introduction, The History of the Making of the Indian Constitution, Preamble and the Basic Structure, and its interpretation, Fundamental Rights and Duties and their interpretation, State Policy Principles.

2. Unit II: Union Government

   6 Lectures

   Structure of the Indian Union, President – Role and Power, Prime Minister and Council of Ministers, Lok Sabha, and Rajya Sabha.

3. Unit III: State Government

   6 Lectures

   Governor – Role and Power, Chief Minister and Council of Ministers, State Secretariat.

4. Unit IV: Local Administration

   6 Lectures

   District Administration, Municipal Corporation, Zila Panchayat.

5. Unit V: Election Commission

   6 Lectures

   Role and Functioning, Chief Election Commissioner, State Election Commission.

Suggested Readings

• Bhargava, Rajeev. Ethics and Politics of the Indian Constitution. Oxford University Press, 2008.
• Fadia, B.L. The Constitution of India. Sahitya Bhawan, 2017.
• Basu, D.D. Introduction to the Constitution of India. Lexis Nexis, 2018.
• Case: Rustom Cavasjee Cooper v. Union of India. (1970) 1 SCC 248.
• Case: State of Rajasthan v. Mohan Lal Vyas. AIR 1971 SC 2068.
• Case: Mithilesh Garg v. Union of India. (1992) 1 SCC 168: AIR 1992 SC 221.
• Case: Chintamanrao v. The State of Madhya Pradesh. AIR 1951 SC 118.
• Case: Cooverjee B. Bharucha v. Excise Commissioner, Ajmer. AIR 1954 SC 220.
• Case: T. B. Ibrahim v. Regional Transport Authority, Tanjore. AIR 1953 SC 79.

Course Objectives

• Understand fundamental concepts of statistics, apply measures of central tendency, and analyze data using measures of dispersion, develop practical data analysis skills.
• Understand the concept of correlation, compute and interpret correlation measures and understand the concept of regression.
• Understand fundamental concepts of probability, analyze random variables and their distributions, and apply standard probability distributions.
• Understand the concept of sampling and sampling distribution, apply concepts of statistical inference, perform hypothesis testing, chi square test and develop data-driven decision-making skills.

Course Content

1. Unit I

   12 Lectures

   Basic Concepts of Statistics: Qualitative and Quantitative Data, Classification of Data, Construction of Frequency Distribution, Diagrammatic Representation of Data.

   Measures of Central Tendency: Arithmetic Mean, Median and Mode, Their Properties.

   Measures of Dispersion: Range, Coefficient of Range, Quartiles, Quartile Deviations, Mean Deviations, Coefficient of Mean Deviations, Standard Deviation and Variance for All Types of Frequency Distribution.

2. Unit II

   10 Lectures

   Correlation: Definition, Scatter Diagram, Types of Correlation, Measures — Karl Pearson's Correlation Coefficient and Spearman's Rank Correlation Coefficient.

   Regression: Definition of Regression, Regression Lines, Regression Coefficients.

3. Unit III

   12 Lectures

   Concepts of Probability: Experiment and Sample Space, Events and Operations with Events, Probability of an Event, Basic Probability Rules, Applications of Probability Rules, Conditional Probability.

   Random Variables: Discrete and Continuous Random Variable, Probability Distribution of a Random Variable, Probability Mass Function, Probability Density Function, Expectation and Variance of a Random Variable.

   Standard Probability Distributions: Binomial Distribution, Poisson Distribution, Mean and Variance of Binomial and Poisson Distribution, Normal Distribution, Exponential Distribution.

4. Unit IV

   11 Lectures

   Sampling Distribution: Concept of Population and Sample, Parameter and Statistic, Sampling Distribution of Sample Mean and Sample Proportion.

   Statistical Inference: Estimation and Hypothesis Testing (Only Concept).

   Hypothesis Testing for a Single Population: Concept of a Hypothesis Testing, Tests Involving a Population Mean and Population Proportion (Z Test and T Test).

   Chi Square Test for Independence of Attributes and Goodness of Fit.

Suggested Readings

• Das N.G., Statistical Methods, Combined Edition, Tata McGraw Hill, 2010.
• Ross Sheldon M., Introduction to Probability and Statistics for Engineers and Scientists, 6th Edition, Elsevier, 2021.
• Miller Irwin and Miller Marylees, Mathematical Statistics with Applications, Seventh Edition, Pearson Education, 2005.
• Statistical Methods by S. P. Gupta, Sultan Chand Publication.
• Pal Nabendu and Sarkar Sahadeb, Statistics: Concepts and Applications, Second Edition, PHI, 2013.
• Montgomery Douglas and Runger George C., Applied Statistics and Probability for Engineers, Wiley, 2016.
• Fundamental of Applied Statistics by S.C. Gupta & V.K. Kapoor, Sultan Chand Publication.
• Probability, Random Variables and Stochastic Processes by A. Papoulis and S.U. Pillai, TMH.

Course Objectives

• Understanding core concepts of DBMS, keys, and ER model.
• Proficiency in database design and SQL and normalization.
• Application of advanced database techniques and transactions.
• Knowledge of NoSQL database and Big Data.

Course Content

1. Unit I

   12 Lectures

   Introduction to Databases: Definition and Importance of DBMS, History and Evolution of DBMS, Characteristics of DBMS, Advantages and Disadvantages of DBMS, Roles of Database Users and Administrators.

   Data Models: Introduction to Data Models, Types of Data Models (Hierarchical, Network, Relational, Object-Oriented), Importance of Data Models in DBMS.

   Database Design: Keys: Primary Key, Candidate Key, Super Key, Foreign Key, Composite Key, Alternate Key, Unique Key, Surrogate Key; Constraints in a Table: Primary Key, Foreign Key, Unique Key, NOT NULL, CHECK; Entity-Relationship (ER) Model, Entities and Entity Sets, Attributes and Relationships, ER Diagrams, Key Constraints and Weak Entity Sets, Extended ER Features, Introduction to the Relational Model and Relational Schema.

2. Unit II

   12 Lectures

   Relational Algebra and Calculus: Introduction to Relational Algebra. Operations: Selection, Projection, Set Operations, Join Operations, Division, Tuple and Domain Relational Calculus.

   Structured Query Language (SQL): SQL Basics: DDL and DML, Aggregate Functions (Min(), Max(), Sum(), Avg(), Count()), Logical Operators (AND, OR, NOT), Predicates (Like, Between, Alias, Distinct), Clauses (Group By, Having, Order By, Top/Limit), Inner Join, Natural Join, Full Outer Join, Left Outer Join, Right Outer Join, Equi Join.

   Advanced SQL: Analytical Queries, Hierarchical Queries, Recursive Queries, Views, Cursors, Stored Procedures and Functions, Packages, Triggers, Dynamic SQL.

   Normalization and Database Design: Functional Dependencies: Definition, Armstrong's Axioms, Properties (Reflexivity, Augmentation, Transitivity), Types (Trivial, Non-Trivial, Partial and Full Functional Dependency), Closure of Functional Dependencies, Normal Forms (1NF, 2NF, 3NF, BCNF), Denormalization.

3. Unit III

   11 Lectures

   Transaction Management: ACID Properties, Transactions and Schedules, Concurrent Execution of Transactions, Lock-Based Concurrency Control, Performance of Locking, Transaction Support in SQL, Introduction to Crash Recovery, 2PL, Serializability and Recoverability, Introduction to Lock Management, Dealing with Deadlocks.

   Database Storage and Indexing: Data on External Storage, File Organizations and Indexing, Index Data Structures, Comparison of File Organizations, Indexes and Performance Tuning, Guidelines for Index Selection, Basic Examples of Index Selection.

4. Unit IV

   10 Lectures

   NoSQL Databases and Big Data: Introduction to NoSQL, Data Models: Document, Key Value, Column Family, Graph. Uses and Features of NoSQL Document Databases. CAP Theorem, BASE vs ACID, CRUD Operations, MongoDB Operators, Overview of Big Data Technologies: Hadoop, MongoDB, Cassandra.

   Database Security and Advanced Topics: Introduction to Database Security, Access Control, Discretionary Access Control, Introduction to Data Warehousing, OLAP, Data Mining.

Practical / Lab Exercises

1. Draw an ER Diagram of Registrar Office.
2. Draw an ER Diagram of Hospital Management System.
3. Reduce the ER diagram of the Registrar Office into tables.
4. Reduce the ER diagram of the Hospital Management System into tables.
5. Consider the schema: Supplier (SID, Sname, branch, city, phone), Part (PID, Pname, color, price), Supplies (SID, PID, qty, date_supplied).
6. DDL Commands: Create the above tables.
7. DDL Commands: Add a new attribute state in supplier table.
8. DDL Commands: Remove attribute city from supplier table.
9. DDL Commands: Modify the data type of phone attribute.
10. DDL Commands: Change the name of attribute city to address.
11. DDL Commands: Change a table's name, supplier to sup.
12. DDL Commands: Use truncate to delete the contents of supplies table.
13. DDL Commands: Remove the part table from database.
14. DML Commands: Insert at least 10 records in tables supplier, part, and supplies.
15. DML Commands: Show the contents in tables supplier, part, and supplies.
16. DML Commands: Find the name and city of all suppliers.
17. DML Commands: Find the name and phone-no of all suppliers who stay in 'Delhi'.
18. DML Commands: Find all distinct branches of suppliers.
19. DML Commands: Delete the record of the supplier whose SID is 204001.
20. DML Commands: Delete all records of supplier table.
21. DML Commands: Delete all records of suppliers whose city starts with capital A.
22. DML Commands: Find the supplier names which have 'lk' in any position.
23. DML Commands: Find the supplier name where 'R' is in the second position.
24. DML Commands: Find the name of supplier whose name starts with 'V' and ends with 'A'.
25. DML Commands: Change the city of all suppliers to 'BOMBAY'.
26. DML Commands: Change the city of supplier 'Vandana' to 'Goa'.
27. Queries with Constraints: Create the supplier table with Primary Key constraint.
28. Queries with Constraints: Create supplies table with Foreign Key constraint.
29. Queries with Constraints: Create a part table with UNIQUE constraint.
30. Queries with Constraints: Create supplier table with Check constraints.
31. Queries with Constraints: Create supplier table with Default constraint.
32. Queries on TCL: Create Save point.
33. Queries on TCL: Rollback to Save point.
34. Queries on TCL: Use Commit to save.
35. Queries on Aggregate Functions: Find the minimum, maximum, average and sum of costs of parts.
36. Queries on Aggregate Functions: Count the total number of parts present.
37. Queries on Aggregate Functions: Retrieve the average cost of all parts supplied by 'Mike'.
38. Queries on GROUP BY, HAVING and ORDER BY Clauses: Display total price of parts of each color.
39. Queries on GROUP BY, HAVING and ORDER BY Clauses: Find the branch and the number of suppliers in that branch for branches which have more than 2 suppliers.
40. Queries on GROUP BY, HAVING and ORDER BY Clauses: Find all parts sorted by name in ascending order and cost in descending order.
41. Queries on GROUP BY, HAVING and ORDER BY Clauses: Find the branch and the number of suppliers in that branch.
42. Queries on Analytical, Hierarchical, Recursive nature: Find out the 5th highest earning employee details.
43. Queries on Analytical, Hierarchical, Recursive nature: Which department has the highest number of employees with a salary above $80,000, and what percentage of employees in that department have a salary above $80,000?
44. Queries on Analytical, Hierarchical, Recursive nature: Retrieve employee table details using the hierarchy query and display that hierarchy path starting from the top level indicating if it is a leaf and there exists a cycle.
45. Queries on Analytical, Hierarchical, Recursive nature: What is the average salary for employees in the top 2 departments with the highest average salary, and what is the hierarchy of departments and sub-departments for these top 2 departments?
46. Queries on Analytical, Hierarchical, Recursive nature: Use recursion to retrieve the employee table and display the result in breadth first and depth first order.
47. Queries on Analytical, Hierarchical, Recursive nature: Write a recursive query to show the equivalent of level, connect_by_root, and connect_by_path.
48. Queries on Analytical, Hierarchical, Recursive nature: Use recursion to retrieve the employee table and display the result in depth first order showing id, parentid, level, root_id, path and leaf.
49. Queries on Operators: Find the pname, phoneno and cost of parts which have cost equal to or greater than 200 and less than or equal to 600.
50. Queries on Operators: Find the sname, SID and branch of suppliers who are in 'local' branch or 'global' branch.
51. Queries on Operators: Find the pname, phoneno and cost of parts for which cost is between 200 and 600.
52. Queries on Operators: Find the pname and color of parts, which has the word 'NET' anywhere in its pname.
53. Queries on Operators: Find the PID and pname of parts with pname either 'NUT' or 'BOLT'.
54. Queries on Operators: List the suppliers who supplied parts on '1st May 2000', '12 JAN 2021', '17 Dec 2000', '10 Jan 2021'.
55. Queries on Operators: Find all the distinct costs of parts.
56. Join Operators: Perform Inner Join on two tables.
57. Join Operators: Perform Natural Join on two tables.
58. Join Operators: Perform Left Outer Join on tables.
59. Join Operators: Perform Right Outer Join on tables.
60. Join Operators: Perform Full Outer Join on tables.
61. Set Theory Operators: Show the use of UNION operator with union compatibility.
62. Set Theory Operators: Show the use of INTERSECT operator with union compatibility.
63. Set Theory Operators: Show the use of MINUS operator with union compatibility.
64. Set Theory Operators: Find the Cartesian product of two tables.
65. Queries on Set Theory Operators: List all parts except 'NUT' and 'BOLT' in ascending order of costs.
66. Queries on Set Theory Operators: Display all parts that have not been supplied so far.
67. Queries on Set Theory Operators: Display the supplier names who have supplied 'green' part with cost 500 Rupees AND 'red' part with cost 400 Rupees.
68. Queries on Set Theory Operators: Display the supplier names who have supplied 'green' part with cost 500 Rupees OR 'red' part with cost 400 Rupees.
69. Queries on Set Theory Operators: Display the name of suppliers who have supplied all parts that are 'red' in color.
70. PL/SQL Programs: Write a PL/SQL code to add two numbers.
71. PL/SQL Programs: Write a PL/SQL code for Fibonacci series.
72. PL/SQL Programs: Write a PL/SQL code for greatest of 3 numbers.
73. PL/SQL Programs: Write a PL/SQL code for area and circumference of a circle.
74. PL/SQL Programs on Cursors: Write a program using CURSOR to display SID and city of 1st record of supplier.
75. PL/SQL Programs on Cursors: Write a program using cursors to display the SID and City of all suppliers and then print the count of suppliers.
76. PL/SQL Programs on Triggers, Procedures and Functions: Write a program using TRIGGER on UPDATE.
77. PL/SQL Programs on Triggers, Procedures and Functions: Write a command to see the effect of trigger.
78. PL/SQL Programs on Triggers, Procedures and Functions: Write a program using PROCEDURE to increase the cost by Rs. 1000 for part whose PID is passed as an argument.
79. PL/SQL Programs on Triggers, Procedures and Functions: Write a procedure to update the city of a supplier whose SID and city are passed as arguments and the procedure returns the name of supplier whose city is updated.
80. PL/SQL Programs on Triggers, Procedures and Functions: Write a function to return the total number of suppliers.
81. PL/SQL Programs on Triggers, Procedures and Functions: Write a function to return the PID of part, for which the part name is passed.
82. PL/SQL Programs on Triggers, Procedures and Functions: Write a function to find the sum total of costs of all parts.
83. PL/SQL Programs on Implicit Cursors: Insert a record using %ROWTYPE.
84. PL/SQL Programs on Implicit Cursors: Write a code using %NOTFOUND, %FOUND, %ROWCOUNT.
85. PL/SQL Programs on Implicit Cursors: Write a code using %TYPE.
86. MongoDB Queries: Create a collection and insert documents into it using insertOne() and insertMany().
87. MongoDB Queries: Select all documents in collection.
88. MongoDB Queries: Find the count of all suppliers.
89. MongoDB Queries: Find all records that have city='Delhi'.
90. MongoDB Queries: Retrieve all documents that have color equal to 'red' or 'green'.
91. MongoDB Queries: Retrieve all documents where part_name is 'P1' or price is less than 200.
92. MongoDB Queries: Update the record of 'Geeta', set city='Bombay' and phoneno='11223344'.
93. MongoDB Queries: Delete all records where price is greater than 5000.
94. MongoDB Queries: Display only the name and city of the supplier.
95. MongoDB Queries: Sort all suppliers on city and display only the first two records.

Suggested Readings

• Ramakrishnan, Raghu, and Johannes Gehrke. Database Management Systems. 3rd ed., McGraw-Hill, 2018.
• Rosenzweig, Benjamin, and Elena Rakhimov. Oracle PL/SQL by Example. 5th ed., Prentice Hall, 2015.
• Dayley, Brad. NoSQL with MongoDB in 24 Hours. 1st ed., Sams Publishing, 2024.
• SQL, PL/SQL The Programming Language of Oracle, Ivan Bayross, BPB Publication.
• C. J. Date, Introduction to Database System, Pearson.
• Bipin Desai, An Introduction to Database System, Galgotia Publication.
• Fundamentals of Database Systems, Ramez Elmasri and Shamkant B. Navathe, Addison-Wesley.
• Korth, Henry F., et al. Database System Concepts. 7th ed., McGraw-Hill, 2019.
• Oracle SQL & PL/SQL Programming Fundamentals, Djoni Darmawikarta.

Course Objectives

• Acquire a comprehensive understanding of the software development lifecycle and its application in contemporary software engineering practices.
• Develop proficiency in project management methodologies and strategic decision-making for successful software project execution.
• Master the art of software design, development, and testing to produce robust and efficient software solutions.

Course Content

1. Unit I

   12 Lectures

   The Evolving Role of Software, Changing Nature of Software, Layered Technology, A Process Framework, Process Models: Waterfall Model, Incremental Process Models, Evolutionary Process Models, Unified Process, Spiral Model.

   Agile Software Development: Agility Principles, Agile Methods, Plan-Driven and Agile Development, Extreme Programming, Scrum, A Tool Set for the Agile Process.

2. Unit II

   12 Lectures

   Software Requirements Engineering: Functional and Non-Functional Requirements, The Software Requirements Document, Requirements Specification, Requirements Engineering Processes, Requirements Elicitation and Analysis, Requirements Validation, Requirements Management.

   Risk Management: Reactive vs Proactive Risk Strategies, Software Risks, Risk Identification, Risk Projection, Risk Refinement, RMMM, RMMM Plan.

   Project Planning: Software Pricing, Plan-Driven Development, Project Scheduling, Agile Planning, Estimation Techniques.

3. Unit III

   11 Lectures

   Design: Design Process and Design Quality, Design Concepts, The Design Model, Software Architecture, Data Design, Architectural Design, Basic Structural Modeling, Class Diagrams, Sequence Diagrams, Collaboration Diagrams, Use Case Diagrams, Component Diagrams.

   Software Implementation — Relationship Between Design and Implementation: Implementation Issues and Programming Support Environment; Coding the Procedural Design, Coding Style and Review of Correctness and Reliability.

   Testing Strategies: A Strategic Approach to Software Testing, Test Strategies for Conventional Software, Black-Box and White-Box Testing, Validation Testing, System Testing, The Art of Debugging.

   Product Metrics: Software Quality, Metrics for Analysis Model, Metrics for Design Model, Metrics for Source Code, Metrics for Testing, Metrics for Maintenance.

4. Unit IV

   10 Lectures

   Quality Management: Quality Concepts, Software Quality Assurance, Software Reviews, Formal Technical Reviews, Statistical Software Quality Assurance, Software Reliability.

   Release Management: Release Planning, Development and Build Plans, Release Strategies, Risk Management, and Post-Deployment Monitoring.

   Product Sustenance: Maintenance, Updates, End of Life, Migration Strategies.

Suggested Readings

• Sommerville, Ian. Software Engineering. 10th ed., Pearson Education, 2015.
• Pressman, Roger S., and Bruce R. Maxim. Software Engineering: A Practitioner's Approach. 8th ed., McGraw Hill Education, 2015.
• Gill, N.S. Software Engineering. Khanna Publishing House, 2023.
• Fundamentals of Software Engineering, Rajib Mall, PHI.

Course Objectives

• Develop modular Python programs.
• Apply suitable Python programming constructs, built-in data structures using Python libraries to solve a problem.
• Understand basic data visualization and file handling in Python.

Course Content

1. Unit I

   10 Lectures

   Introduction: History and Application Areas of Python; Structure of Python Program; Identifiers and Keywords; Operators and Precedence; Basic Data Types and Type Conversion; Statements and Expressions; Input/Output Statements.

   Strings: Creating and Storing Strings, Built-In Functions for Strings; String Operators, String Slicing and Joining; Formatting Strings.

   Control Flow Statements: Conditional Flow Statements; Loop Control Statements; Nested Control Flow; Continue and Break Statements, Continue, Pass and Exit.

2. Unit II

   10 Lectures

   Functions: Built-In Functions, Function Definition and Call; Scope and Lifetime of Variables, Default Parameters, Command Line Arguments; Lambda Functions; Assert Statement; Importing User Defined Module.

   Mutable and Immutable Objects: Lists, Tuples and Dictionaries; Commonly Used Functions on Lists, Tuples and Dictionaries. Passing Lists, Tuples and Dictionaries as Arguments to Functions. Using Math and NumPy Module for List of Integers and Arrays. Python Classes/Objects, Python Inheritance, Python Polymorphism, Python RegEx.

3. Unit III

   10 Lectures

   Files: Types of Files; Creating, Reading and Writing on Text and Binary Files; The Pickle Module, Reading and Writing CSV Files. Reading and Writing of CSV and JSON Files.

   Exception Handling: Try-Except-Else-Finally Block, Raise Statement, Hierarchy of Exceptions, Adding Exceptions.

   Python Tkinter, Widgets, Geometry Manager, GUI Application.

   Data Visualization: Plotting Various 2D and 3D Graphics; Histogram; Pie Charts; Sine and Cosine Curves.

Practical / Lab Exercises

1. Write a program to find whether a number is a prime number.
2. Write a program to print m raised to power n, where m and n are read from the user.
3. Write a program having a parameterized function that returns True or False depending on whether the parameter passed is even or odd.
4. Write a program to print the summation of the following series up to n terms: 1-2+3-4+5-6+7...
5. Write a menu driven program to perform the following operations on strings using string built-in functions: (a) find the frequency of a character in a string; (b) replace a character by another character in a string; (c) remove the first occurrence of a character from a string; (d) remove all occurrences of a character from a string.
6. Write a program that accepts two strings and returns the indices of all the occurrences of the second string in the first string as a list. If the second string is not present in the first string, then it should return -1.
7. Using NumPy module write a menu driven program to: (a) create an array filled with 1's; (b) find maximum and minimum values from an array; (c) dot product of 2 arrays; (d) reshape a 1-D array to 2-D array.
8. Write a function that takes a sentence as input from the user and calculates the frequency of each letter. Use a variable of dictionary type to maintain the count.
9. Consider a tuple t1=(1,2,5,7,9,2,4,6,8,10). Write a program to: (a) print contents of t1 in 2 separate lines such that half values come on one line and other half in the next line; (b) print all even values of t1 as another tuple t2; (c) concatenate a tuple t2=(11,13,15) with t1; (d) return maximum and minimum value from t1.
10. Write a function that reads a file file1 and copies only alternative lines to another file file2. Alternative lines copied should be the odd numbered lines.
11. Write a Python program to handle a ZeroDivisionError exception when dividing a number by zero.
12. Write a program that reads a list of integers from the user and throws an exception if any numbers are duplicates.
13. Write a program that makes use of a function to display sine, cosine, polynomial, and exponential curves.
14. Take as input the months and profits made by a company ABC over a year. Represent this data using a line plot. Generated line plot must include X axis label name = Month Number and Y axis label name = Total Profit.

Suggested Readings

• Taneja, Sheetal, and Naveen Kumar. Python Programming: A Modular Approach with Graphics, Database, Mobile and Web Applications. Pearson, 2017.
• Venkatesh, Nagaraju Y. Introduction to Python Programming. Khanna Publishing House, 2021.
• Python Programming Using Problem Solving Approach, Reema Thareja, Oxford University Press, latest edition.
• Downey, Allen. Think Python. 2nd ed., O'Reilly, 2015.
• Dowling, Bob. An Introduction to Python for Absolute Beginners. Cambridge University Press, 2015.
• Guttag, John. Introduction to Computation and Programming Using Python. 2nd ed., PHI India, 2016.
• Python Programming: A Modern Approach, Vamsi Kurama, Pearson, 2010.

Course Objectives

• Understand basic building blocks of creating a venture.
• Identify a business opportunity and translate it into a viable business model.
• Identify the elements of the Indian entrepreneurship ecosystem and take relevant benefits from the constituents.
• Know the legacy of family businesses and key differentiations from entrepreneurship; stabilizing operations, building a team from scratch and scaling the business.
• Understand the nuances of operating a startup — low budget marketing.

Course Content

1. Unit I: Introduction to Entrepreneurship & Family Business

   7 Lectures

   Definition and Concept of Entrepreneurship, Entrepreneur Characteristics, Classification of Entrepreneurs, Role of Entrepreneurship in Economic Development — Start-Ups, Knowing the Characteristics of Family Business with Discussion on Few Indian Cases of Family Business like Murugappa, Dabur, Wadia, Godrej, Kirloskar etc.

2. Unit II: Evaluating Business Opportunity

   7 Lectures

   Sources of Business Ideas and Opportunity Recognition, Guesstimating the Market Potential of a Business Idea, Feasibility Analysis of the Idea, Industry, Competition and Environment Analysis.

3. Unit III: Building Blocks of Starting Ventures

   8 Lectures

   Low-Cost Marketing using Digital Technologies, Team Building from Scratch, Venture Funding, Establishing the Value-Chain and Managing Operations, Legal Aspects like IPR and Compliances.

4. Unit IV: Start-Up Ecosystem

   8 Lectures

   Components of the Start-Up Ecosystem Including Incubators, Accelerators, Venture Capital Funds, Angel Investors etc., Various Govt. Schemes like Start-Up India, Digital India, MSME etc., Sources of Venture Funding Available in India, Source of Technology, Intellectual Property Management.

Suggested Readings

• Startup India Learning Program. Start Up India, www.startupindia.gov.in.
• Roy, Rajeev. Entrepreneurship. Oxford University Press, 2022.
• Ireland, R. Duane, and Bruce R. Barringer. Entrepreneurship: Successfully Launching New Ventures. Pearson Publishing, 2020.
• Agarwal, Rajiv. Family Business Management. Sage Publishing, 2022.
• Tiwari, Anish. "Mapping the Startup Ecosystem in India." Economic & Political Weekly, 2003.
• Ramachandran, K. Indian Family Businesses: Their Survival Beyond Three Generations. ISB Working Paper Series, 2011.

Course Objectives

• Understand the fundamental concepts of computer networks and their applications.
• Develop problem-solving skills related to network design, implementation, and troubleshooting.
• Implement network protocols.
• Configure network devices.

Course Content

1. Unit I: Introduction to Computer Networks

   11 Lectures

   Overview of Computer Networks: Definition and Objectives, Applications and Examples of Network Components and Architecture, Data Communication Components and Characteristics, Data Representation and Data Flow.

   Network Models: OSI Model: Layers and Functions, TCP/IP Model: Layers and Functions, Comparison Between OSI and TCP/IP Models.

   Network Topologies: Physical vs. Logical Topologies, Common Topologies: Star, Ring, Bus, Mesh, Hybrid, Advantages and Disadvantages of Each Topology.

   Data Transmission: Guided and Unguided Media, Analog vs. Digital Signals, Transmission Modes: Simplex, Half-Duplex, Full-Duplex, Bandwidth and Latency.

   Networking Devices: Routers, Switches, Hubs, Bridges, Gateways, Functions and Configurations of Each Device.

2. Unit II: Data Link Layer and Networking Protocols

   11 Lectures

   Data Link Layer Fundamentals: Functions of the Data Link Layer, Framing, Error Detection, and Error Correction, Flow Control Mechanisms.

   Ethernet: Ethernet Standards and Frame Structure, MAC Addressing and ARP, Ethernet Switching: Basic Concepts and Methods.

   Network Protocols: Introduction to TCP/IP Protocol Suite, IP Addressing: IPv4 and IPv6, Subnetting and CIDR Notation. Address Resolution Protocol (ARP): ARP Operation and Table, ARP Spoofing and Security Considerations.

   Virtual LAN (VLAN): Concept of VLAN, VLAN Tagging and Configuration, Benefits and Use Case.

3. Unit III: Network Layer and Transport Layer

   11 Lectures

   Network Layer: IP Routing: Static vs. Dynamic Routing, Routing Protocols: RIP, OSPF, BGP, Network Address Translation (NAT).

   Transport Layer: TCP vs. UDP: Characteristics and Use Cases, TCP Handshake and Connection Management, Flow Control and Congestion Control in TCP.

   Congestion Control Algorithms: Techniques: Slow Start, Congestion Avoidance, Fast Retransmit, Fast Recovery, TCP Variants: TCP Reno, TCP Vegas.

   Quality of Service (QoS): QoS Principles and Mechanisms, Differentiated Services (DiffServ) and Integrated Services (IntServ). Network Security Fundamentals: Threats and Vulnerabilities, Basic Security Mechanisms: Firewalls, VPNs, and Encryption.

4. Unit IV: Application Layer and Emerging Technologies

   12 Lectures

   Application Layer Protocols: HTTP/HTTPS: Structure and Operation, FTP, SMTP, POP3, IMAP: Protocols and Uses, DNS: Domain Name System and Resolution.

   Network Applications: Web Browsing, Email Communication, File Transfer, Voice over IP (VoIP) and Streaming.

   Emerging Technologies: Software-Defined Networking (SDN), Network Function Virtualization (NFV), Internet of Things (IoT) and its Impact on Networking.

   Network Management: SNMP: Simple Network Management Protocol, Network Monitoring Tools, and Techniques.

   Future Trends in Networking: 5G and Beyond, Network Automation and Artificial Intelligence in Networking.

Practical / Lab Exercises

1. Configure Basic Network Settings: IP Address Configuration.
2. Configure Basic Network Settings: Subnet Mask and Gateway Settings.
3. Implement Network Protocols: Write a simple Python script to perform DNS resolution.
4. Implement Network Protocols: Implement a basic HTTP client-server application.
5. Network Simulation: Use network simulation tools (e.g., Cisco Packet Tracer) to design and simulate network topologies.
6. Network Simulation: Configure routers and switches in a simulated environment.
7. Performance Measurement: Measure network performance using tools like ping, traceroute, and iperf.
8. Performance Measurement: Analyze network traffic using Wireshark.
9. Implement VLANs: Configure VLANs on a switch and verify using simulation tools.
10. Set Up a Simple Web Server: Deploy a basic web server and configure HTTP/HTTPS access.
11. Network Security Lab: Implement basic firewall rules and VPN configurations. Perform vulnerability scanning and analyze results.
12. Network Troubleshooting: Diagnose and resolve common network issues.
13. Network Troubleshooting: Use troubleshooting commands and techniques to fix connectivity problems.

Suggested Readings

• Tanenbaum, Andrew S., and David J. Wetherall. Computer Networks. 5th ed., Pearson Education, 2011.
• Kurose, James F., and Keith W. Ross. Computer Networking: A Top-Down Approach. 8th ed., Pearson, 2021.
• Comer, Douglas E. Computer Networks and Internets. 6th ed., Pearson, 2014.
• Shay, William A. Understanding Communications and Networks. 3rd ed., Cengage Learning, 2004.
• Forouzan, Behrouz A. Data Communications and Networking. 5th ed., McGraw-Hill Education, 2012.
• Peterson, Larry L., and Bruce S. Davie. Computer Networks: A Systems Approach. 6th ed., Morgan Kaufmann, 2019.

Course Objectives

• Understand the basic algorithm designing paradigms.
• Get the basic knowledge on how to analyze an algorithm.
• Synthesize efficient algorithms in common design situations and real-life problems.

Course Content

1. Unit I

   11 Lectures

   What is an algorithm? Design and performance analysis of algorithms, time complexity, space complexity.

   Asymptotic notations (O, Ω, Θ) to measure growth of a function and application to measure complexity of algorithms.

   Analysis of sequential search, bubble sort, selection sort, insertion sort, matrix multiplication.

   Recursion: Basic concept. Analysis of recursive algorithms, Master's theorem.

2. Unit II

   11 Lectures

   The Divide & Conquer Design Technique: The general concept. Binary search, finding the maximum and minimum, merge sort, quick sort. Best and worst case analysis for the mentioned algorithms. Strassen's matrix multiplication. Lower bound for comparison-based sorting.

   The Greedy Design Technique: The general concept. Applications to general Knapsack problem, finding minimum weight spanning trees: Prim's and Kruskal's algorithms, Dijkstra's algorithm for finding single source shortest paths problem.

3. Unit III

   11 Lectures

   The Dynamic Programming Design Technique: Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths — Warshall's and Floyd's; The general concept, all pair shortest paths problem (Floyd-Warshall's algorithm), 0/1 Knapsack problem, Resource Allocation Problem, Longest Common Sub-sequence.

   Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency List. Graph Traversal: Depth First Search and Breadth First Search, Connected Component.

4. Unit IV

   12 Lectures

   Backtracking, Branch and Bound with Examples such as Travelling Salesman Problem.

   Computational Intractability: Overview of non-deterministic algorithms, P, NP, NP-Complete and NP-hard problems.

Suggested Readings

• Cormen, Thomas H., et al. Introduction to Algorithms. 3rd ed., PHI Publication, 2009.
• Horowitz, Ellis, et al. Fundamentals of Computer Algorithms. University Press (I) Pvt. Ltd., 2012.
• Levitin, Anany. Introduction to the Design and Analysis of Algorithms. 3rd ed., Pearson, 2012.
• Design and Analysis of Algorithm, Gajendra Sharma, Khanna Book Publishing, 2010.
• Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. The Design & Analysis of Computer Algorithms. Addison Wesley Publications, 1983.
• Kleinberg, Jon, and Eva Tardos. Algorithm Design. Pearson Education, 2006.
• Computer Algorithms, Sara Baase, Allen Van Gelder, Pearson Education, 2003.

Course Objectives

• Understand the characteristics of rational agents, and the environment in which they operate, and gain insights about problem-solving agents.
• Gain insights about uninformed and heuristic search techniques and apply them to solve search applications.
• Appreciate the concepts of knowledge representation using propositional logic and predicate calculus and apply them for inference/reasoning.
• Obtain insights about planning and handling uncertainty through probabilistic reasoning and fuzzy sets.
• Obtain a basic understanding of the AI domains and their applications and examine the legal and ethical issues of AI.

Course Content

1. Unit I: Introduction to AI

   9 Lectures

   What is AI? Intelligent Agents: Agents and environment, the concept of Rationality, the nature of environment, the structure of Agents.

   Knowledge-Based Agents: Introduction to Knowledge-Based Agents, The Wumpus World as an Example World.

   Problem-solving: Problem-solving agents.

2. Unit II: Advanced Search Techniques

   12 Lectures

   Uninformed Search: DFS, BFS, Iterative Deepening Search. Informed Search: Best First Search, A* search, AO* search.

   Adversarial Search & Games: Two-player zero-sum games, Minimax Search, Alpha-Beta pruning.

   Constraints and Constraint Satisfaction Problems (CSPs), Backtracking search for CSP.

   Evolutionary Search Techniques: Introduction to evolutionary algorithms, Genetic algorithms, Applications of evolutionary search in AI.

3. Unit III: Logical Reasoning and Uncertainty

   12 Lectures

   Logic: Propositional logic, First-order predicate logic, Propositional versus first-order inference, Unification and lifting.

   Inference: Forward chaining, Backward chaining, Resolution, Truth maintenance systems.

   Introduction to Planning: Blocks World problem, STRIPS.

   Handling Uncertainties: Non-monotonic reasoning, Probabilistic reasoning, Introduction to Fuzzy set theory.

4. Unit IV: Domains and Applications of AI

   12 Lectures

   Domains in AI: Introduction to Machine Learning, Computer Vision, Robotics, Natural Language Processing, Deep Neural Networks, and their Applications.

   Expert Systems: The architecture and role of expert systems, including two case studies.

   Legal and Ethical Issues: Concerns related to AI.

Suggested Readings

• M.C. Trivedi, A Classical Approach to Artificial Intelligence, Khanna Book Publishing Company, 2024 (AICTE Recommended Textbook).
• Nilsson Nils J, Artificial Intelligence: A New Synthesis, Morgan Kaufmann Publishers Inc., San Francisco, CA, ISBN: 978-1-55-860467-4.
• Dan W Patterson, Introduction to Artificial Intelligence & Expert Systems, PHI Learning, 2010.
• Rajiv Chopra, Data Science with Artificial Intelligence, Machine Learning and Deep Learning, Khanna Book Publishing Company, 2024.
• M.C. Trivedi, Introduction to AI and Machine Learning, Khanna Book Publishing Company, 2024.
• Russell, S. and Norvig, P., Artificial Intelligence: A Modern Approach, 3rd edition, Prentice Hall.
• Van Hirtum, A. & Kolski, C. (2020). Constraint Satisfaction Problems: Algorithms and Applications. Springer.
• Rajiv Chopra, Machine Learning and Machine Intelligence, Khanna Book Publishing Company, 2024.

Course Objectives

• Propose real-time innovative product designs and choose appropriate frameworks, strategies, techniques during prototype development.
• Observe and assimilate unstructured information to well framed solvable problems.
• Know wicked problems and how to frame them in a consensus manner that is agreeable to all stakeholders using appropriate frameworks, strategies, techniques during prototype development.
• Analyze emotional experience and inspect emotional expressions to better understand users while designing innovative products.

Course Content

1. Unit I: Basics of Design Thinking

   8 Lectures

   Concept of Innovation and its Significance in Business, Creative Thinking Process and Problem Solving Approaches, Design Thinking Approach and its Objective, Design Thinking and Customer Centricity — Real World Examples of Customer Challenges, Use of Design Thinking to Enhance Customer Experience, Parameters of Product Experience, Alignment of Customer Expectations with Product, Discussion on Global Success Stories like Airbnb, Apple, IDEO, Netflix etc., Four Stages of Design Thinking Process — Empathize, Define, Ideate, Prototype, Implement.

2. Unit II: Learning to Empathize and Define the Problem

   7 Lectures

   Know the Importance of Empathy in Innovation Process — How can students Develop Empathy Using Design Tools?, Observing and Assimilating Information, Individual Differences & Uniqueness, Group Discussion and Activities to Encourage the Understanding, Acceptance and Appreciation of Individual Differences, Wicked Problems, Identification of Wicked Problems around us and the Potential Impact of their Solutions.

3. Unit III: Ideate, Prototype, and Implement

   8 Lectures

   Templates of Ideation like Brainstorming, Systems Thinking, Concept of Brainstorming — How to Reach Consensus on Wicked Problems?, Mapping Customer Experience for Ideation, Know the Methods of Prototyping, Purpose of Rapid Prototyping, Implementation.

4. Unit IV: Feedback, Re-Design & Re-Create

   7 Lectures

   Feedback Loop, Focus on User Experience, Address Ergonomic Challenges, User Focused Design, Final Concept Testing, Final Presentation — Solving Problems through Innovative Design Concepts & Creative Solutions.

Suggested Readings

• Brown, Tim. Change by Design: How Design Thinking Transforms Organizations and Inspires Innovation. Harvard Business Review Press, 2008.
• Krishnan, R. T., and V. Dabholkar. 8 Steps to Innovation. Collins Publishing, 2013.
• Balaguruswamy, E. Developing Thinking Skills (The Way to Success). Khanna Book Publishing Company, 2023.
• Cross, Nigel. Design Thinking. Bloomsbury, 2011.