Semester V

Sr. Course Codes Nomenclature of the Courses Hours per week Credits
No. L T P

1. PCC-CSE301-T/ Computer Graphics 3 0 0 3

PEC-IT402-T
2. PCC-CSE302-T/ Python Programming 3 0 0 3
PEC-IT308-T
3. PCC-CSE303-T/ High Speed Network 3 0 0 3
PEC-IT305-T Technologies
4. PCC-CSE304-T Cryptography and Network 3 0 0 3
Security
5. OEC-T Open Elective Course be opted 3 0 0 3
by students
6. HSMC301-T Economics for Engineers 2 0 0 2
7. MC104-T Essence of Indian Traditional 3 0 0 0
Knowledge
8. PCC-CSE301-P Computer Graphics Lab. 0 0 2 1
9. PCC-CSE302-P/ Python Programming Lab. 0 0 3 1.5
PCC-IT308-P
10. INT-CSE301 Industrial Training 0 0 0 1
Total Credit 20.5
 Computer Graphics

General Course Information

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

About the Course:

This course involves studying graphic techniques, algorithms and imaging models. Moreover, students learn
about the techniques for clipping, cropping, representing 2-D and 3-D objects.

Course Outcomes: By the end of the course students will be able to:
CO1. state basic concepts related to graphics. (LOTS: Level 1: Remember)
CO2. describe the principles of creating graphical objects and graphical user interface applications.
(LOTS: Level 2: Understand)
CO3. apply 2-D and 3-D transformations (rotation, scaling, translation, shearing) on geometric objects.
(LOTS: Level 3: Apply)
CO4. use different techniques for clipping and filling geometric objects. (LOTS: Level 3: Apply)
CO5. compare different graphics algorithms for different geometric objects. (HOTS: Level 4: Analyse)
CO6. create user-friendly interfaces for computer applications. (HOTS: Level 6: Create)

Course Content
Unit I
Introduction to Computer Graphics: What is Computer Graphics, Computer Graphics Applications, Computer
Graphics Hardware and software, Two dimensional Graphics Primitives: Points and Lines, Line drawing
algorithms: DDA, Bresenham’s; Circle drawing algorithms: Using polar coordinates, Bresenham’s circle drawing,
mid-point circle drawing algorithm; Filled area algorithms: Scan-line: Polygon filling algorithm, boundary filled
algorithm.

63
Unit II
Two/Three Dimensional Viewing: The 2-D viewing pipeline, windows, viewports, window to view port mapping;
Clipping: point, clipping line (algorithms):- 4 bit code algorithm, Sutherland-cohen algorithm, parametric line
clipping algorithm (Cyrus Beck). Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping
algorithm.
Two dimensional transformations: transformations, translation, scaling, rotation, reflection, composite
transformation.
Three dimensional transformations: Three-dimensional graphics concept, Matrix representation of 3-D
Transformations, Composition of 3-D transformation.

Unit III
Viewing in 3D: Projections, types of projections, the mathematics of planner geometric projections, coordinate
systems.
Hidden surface removal: Introduction to hidden surface removal, Z- buffer algorithm, scanline algorithm, area
sub-division algorithm.

Unit IV
Representing Curves and Surfaces: Parametric representation of curves: Bezier curves, B-Spline curves.
Parametric representation of surfaces; Interpolation method.
Illumination, shading, image manipulation: Illumination models, shading models for polygons, shadows,
transparency. What is an image? Filtering, image processing, geometric transformation of images.

Text and reference books:

1. James D. Foley, Andeies van Dam, Stevan K. Feiner and Johb F. Hughes, Computer Graphics
Principles and Practices, second edition, Addision Wesley, 2000.
2. Pradeep K Bhatia, Computer Graphics, 3rd edition, I K International Pub, New Delhi, 2013.
3. Donald Hearn and M. Pauline Baker, Computer Graphics 2nd Edition, PHI, 1999.
4. David F. Rogers, Procedural Elements for Computer Graphics Second Edition, T.M.H, 2001.
5. Alan Watt, Fundamentals of 3Dimensional Computer Graphics, Addision Wesley, 1999.
6. Corrign John, Computer Graphics: Secrets and Solutions, BPB, 1994.
7. Pilania & Mahendra, Graphics, GUI, Games & Multimedia Projects in C, Standard Pub., 2002.
8. N. Krishanmurthy, Introduction to Computer Graphics, T.M.H, 2002.

64
 Python Programming

General Course Information

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

About the Course:

Python is a popular open source programming language used for both standalone programs and scripting
applications in a wide variety of domains. It is free, portable, and powerful and is both relatively easy and
remarkably fun to use. In today’s era Python has found great applicability in machine learning, data analytics and
many other data science application. This is introductory course and covers most of the basic concepts required
for basic python programming. Some of the contents are advanced may be useful for data analytics purpose.

Course Outcomes: By the end of the course students will be able to:
CO1. outline various basic programming constructs including operators, character sets, basic data types and
control statements. (LOTS: level 1: Understand)
CO2. explain Python packages and their functionalities for data analysis. (LOTS: level 2: Understand)
CO3. solve problems using python programming. (LOTS: level 3: Apply)
CO4. analyse the results of data analysis or machine learning programs (HOTS: level 4: Analyse)
CO5. evaluate solutions according to the problem definition. (HOTS: level 5: Evaluate)
CO6. develop database applications in Python. (HOTS: level 6: Create)

Course Content
Unit I
Introduction to Python, History of Python, Features of Python, Python Identifiers, Python Character Set,
Keywords and Indentation, Comments, Command Line Arguments, Assignment Operator, Operators and
Expressions, print() Function, input() Function, eval() Function, Python Data Types: int, float, complex, Variables,
Mutable vs Immutable variables, Namespaces, Decision Statements: Boolean Type, Boolean Operators, if
statement, else statement, Nested Conditionals Statements, Multi-way Decision Statements (elif statement).

66
Unit II
Loop Control Statements: While loop, range() Function, For Loop, Nested Loops, Infinite Loop, Break
Statement, Continue Statement, Pass Statement, Introduction to Strings, String Operations: Indexing and Slicing,
Lists: Operations on List: Slicing, Inbuilt Functions for Lists, List Processing: Searching and Sorting, Dictionaries:
Need of Dictionary, Operations on Directories: Creation, Addition, Retrieving Values, Deletion; Tuples,
operations on Tuples, Inbuilt Functions for Tuples, Introduction to Sets, operations on sets.
Python Functions, Inbuilt functions, Main function, User Defined functions, Defining and Calling Function,
Parameter Passing, Actual and Formal Parameters, Default Parameters, Global and Local Variables, Recursion,
Passing Functions as Data, Lamda Function, Modules, Importing Own Module, Packages.

Unit III
Operations on File: Reading text files, read functions, read(), readline() and readlines(), writing Text Files, write
functions, write() and writelines(),Manipulating file pointer using seek, Appending to Files.
Python Object Oriented: Overview of OOP, Classes and objects, Accessing attributes, Built-In Class Attributes,
Methods, Class and Instance Variables, Destroying Objects, Polymorphism, Overlapping and Overloading of
Operators, Class Inheritance: super(), Method Overriding, Exception Handling, Try-except-else clause, Python
Standard Exceptions, User-Defined Exceptions

Unit IV
Databases in Python: Create Database Connection, create, insert, read, update and delete Operation, DML and
DDL Operation with Databases.
Python for Data Analysis: numpy: Creating arrays, Using arrays and Scalars, Indexing Arrays, Array
Transposition, Universal Array Function, Array Processing, Array Input and Output
Pandas: Series, Data Frame, Panel, Index objects, Re-indexing, Iteration, Sorting. Matplotlib: Python for Data
Visualization, Visualization Section, Sklearn: loading of dataset, learning and predicting, Model Persistence.

Text and Reference Books:

1. Ashok Namdev Kamthane, Programming and Problem Solving with Python, Mc Graw Hill Education
Publication, 2018.
2. John Guttag, Introduction to Computation and Programming using Python, Springer, Revised and
Expanded version (Referred by MIT), 2013.
3. Lutz, M., Learning Python: Powerful Object-Oriented Programming. O'Reilly Media, Inc., 2013.
4. Michael T Goodrich and Robertto. Thamassia, Micheal S Goldwasser, Data Structures and Algorithms
in Python, Wiley, 2016.
5. Y. Daniel Liang, Introduction to Programming Using Python, Pearson, 2013.
6. Reema Thareja, Python Programming Using Problem Solving Approach , Oxford Publications, 2017.
7. Dr. R. Nageswara Rao, Allen B. Downey, Core Python Programming , Think Python, O’Reilly Media,
2012.
8. Kenneth A. Lambert, The Fundamentals of Python: First Programs, Cengage Learning, 2011.

67
 High Speed Network Technologies

General Course Information

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

Pre-requisites: Basic knowledge of computer networks, layers of OSI reference model, protocols at different
layers of OSI reference model.

About the course:

High Speed Network Technologies is a professional core course based around Network Architectures, protocols
used across the layers, techniques used in communication and modes of data transfer. The course deals with
creating High Speed Networks for any organization/institute with its various phases/life cycles.

Course Outcomes: By the end of the course students will be able to:
CO1. define different high speed network technologies. (LOTS: Level 1: Remember)
CO2. explain working of different wired / wireless technologies suitable for LAN and WAN communication.
(LOTS: Level 2: Understand)
CO3. illustrate the mapping of OSI reference model to different high speed technologies and Internet Suite
of Protocols. (LOTS: Level 3: Apply)
CO4. analyze the performance of different high speed technologies in different scenarios / situations. (HOTS:
Level 4: Analyse)
CO5. design a network for any organization using high speed technologies along with Internet connectivity.
(HOTS: Level 6: Create)

Course Content

Unit I (High Speed LAN)

Gigabit Ethernet: Overview of fast Ethernet, Gigabit Ethernet – overview, specifications, layered protocol
architecture, frame format, network design using Gigabit Ethernet, applications, 10GB Ethernet – overview,
layered protocol architecture, frame format.
Fiber Channel: Fiber channel – overview, topologies, ports, layered protocol architecture, frame structure, class
of service.

69
UNIT II (High Speed WAN)
Frame Relay: Protocol architecture and frame format.
ISDN & B-ISDN: Channels, interfaces, addressing, protocol architecture, services.
ATM: Virtual circuits, cell switching, reference model, traffic management.

Unit III (Wireless LAN)

Wireless Networks: Existing and emerging standards, Wireless LAN (802.11), Broadband Wireless (802.16),
Bluetooth (802.15) their layered protocol architecture and security. Mobile Networks – GSM, CDMA.

Unit IV (Internet Suite of Protocols)

Internet Layer: IPV4 and IPV6, IP addressing, IP classes, CIDR.
Transport Layer: UDP/TCP protocols & architecture, TCP connection management.
Application Layer: DNS, E-Mail, Voice over IP.

Text and Reference Books:

1. Jochen Schiller, Mobile Communication, 2nd Edition, Pearson,2009.
2. Andrew S Tanenbaum, Computer Networks, 5th Edition, Pearson 2013.
3. William C Y Lee, Mobile Communication Engineering: Theory and Applications, 2nd Edition, McGraw Hill,
1997.

70
 Cryptography and Network Security

General Course Information

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

About the Course:

The increase in techniques to penetrate into systems has led to variety of information and Network attacks, To
mitigate the exploitation of the vulnerabilities leading to these attacks we need to adopt robust security
architecture into our premises. We have to choose between various security technologies such as cryptography,
Digital Signatures, Key Management, Program Security, Database security, Wifi security. In the current scenario
we require to secure end-to-end devices, Networks, Networking devices and clouds.

Course outcomes: By the end of the course students will be able to:
CO1. recognize need of cryptography and cryptographic Algorithms.(LOTS: Level 1: Remember)
CO2. represent security in terms of various techniques and algorithms. (LOTS: Level2: Understand)
CO3. apply mathematical techniques to cryptography for solving problems related to security issue. (LOTS:
Level 3: Apply)
CO4. identify various types of attacks for their mitigation/proactive and reactive treatment. (HOTS: Level
4: Analyze)
CO5. judge the security of an organization/institute by means of Network security devices/models/controls.
(HOTS: Level 5: Evaluate)
CO6. integrate different types of securities under one environment and evaluate its performance.(HOTS:
Level 6: Create)

Course content
Unit I

Cryptography: Overview of classical cryptosystems, stream and block ciphers, ciphers & cipher modes,
Substitution Ciphers: Mono-alphabetic Substitution and Poly-alphabetic Substitution, Transposition Ciphers: Rail
Fence, ScyTale, Book cipher, Vernam cipher, Vigenere Tabluae, Hill Cipher. Cryptanalysis of Classical
Cryptosystems.

72
Unit II

Mathematical Foundations: Elementary Number theory, Finite fields, Groups and Subgroups, Matrix
representations, Symmetric matrices and diagonalization, Number theory: Divisibility, gcd, prime numbers,
primality testing. Congruences, solution of congruences, Chinese remainder theorem, Fermat and Euler’s theorem,
Modular Arithmetic and its properties, Modular exponentiation.

Unit III

Cryptographic Algorithms and techniques: Private/Symmetric Key cryptography: DES and its variants, AES,
Feistel networks, Modes of operation, Public/Asymmetric Key Cryptography: RSA Algorithm, Elliptic Curve
Cryptography. Diffie Hellman Key Exchange Algorithm, Digital Signatures, Knapsack Algorithm, Public Key
Infrastructure, Kerberos, secret sharing schemes, Digital Certificates, X.509 Certificates.

Unit IV

Network Security: Attacks: types, detection, mitigation. Network Security Foundations, Defense Models, Access
Control: Authentication and Authorization Controls, Network Architecture, Network Device Security, Wireless
Security, Firewalls, Intrusion Detection Systems, Network Role-Based Security: Email- PGP, PEM, S-MIME.
Proxy servers. SSL, TLS. SET, SHTTP, IPSec. Virtual Private Networks security.

Text and Reference Books

1. William Stallings, Cryptography and Network security-Principles and Practices, Pearson Education,
Ninth Indian Reprint 2005.
2. Charlie Kaufman , Network Security : Private communication in Public World, Prentice-Hall
International, Inc. April 2008.
3. Roberta Bragg, Mark Rhodes-Ousley, Keith Strassberg, The Complete Reference Network Security,
McGraw hill Education, 2004.
4. Charles P. Fleeger, Security in Computing, 2nd Edition, Prentice Hall International Inc., 1996.

73
 Economics for Engineers

General Course Information

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

About the Course: This course is designed to provide the elementary and essential knowledge of economics
relevant to their profession as engineers. The graduating engineers will learn about the basic principles of
economics and cost benefit analysis for various economic alternatives. The course also gives an initial exposure
to issues and challenges for sustainable development.

Course Outcomes: By the end of the course students will be able to:
CO1. outline the principles of economics in general and economics in Indian context. (LOTS: Level 1:
Remember)
CO2. discuss concepts related to economics in general and particularly relevant to Indian scenario. (LOTS:
Level 2: Understand)
CO3. apply the principles of economics for solving problems related to Engineering sector. (LOTS: Level 3:
Apply)
CO4. carry out cost/benefit/, life cycle and breakeven analyses on one or more economic alternatives.
(HOTS: Level 4: Analyse)
CO5. judge the issues and challenges of sustainable development. (HOTS: Level 5: Evaluate)

Course Content
Unit I
Definition of Economics- various definitions, Nature of economic problem, Production possibility curve,
Economics laws and their nature. Relation between Science, Engineering, Technology and Economics. Concepts
and measurement of utility, Law of Diminishing Marginal Utility, Law of equi-marginal utility - its practical
applications and importance.

Unit II
Meaning of Demand, Individual and Market demand schedules, Law of demand, shape of demand curve,
Elasticity of Demand, measurement of elasticity of demand, factors affecting elasticity of demand, practical
importance and applications of the concept of elasticity of demand.

75
Meaning of production and factors of production; Law of variable proportions, Returns to scale, Internal and
External economics and diseconomies of scale.

Unit III
Various concepts of cost- Fixed cost, variable cost, average cost, marginal cost, money cost, real cost, opportunity
cost. Shape of average cost, marginal cost, total cost etc. in short run and long run both.
Meaning of Market, Types of Market - Perfect Competition, Monopoly, Oligopoly, Monopolistic Competition
(Main features of these markets)
Issues, Strategies and challenges for sustainable development for developing economies

Unit IV
Elements of Business/Managerial Economics and forms of organizations, Cost & Cost Control Techniques, Types
of Costs, Lifecycle Costs, Budgets, Break Even Analysis, Capital Budgeting, Application of linear Programming.
Investment Analysis- NPV, ROI, IRR, Payback Period, Depreciation, Time Value of Money (present and future
worth of cash flows).
Business Forecasting- Elementary techniques. Statements- Cash Flows, Financial. Case Study Method. Nature
and Characteristics of Indian Economy (brief and elementary introduction). Privatization - meaning, merits, and
demerits. Globalisation of Indian economy- merits and demerits.
WTO and TRIPs agreements.

Text and Reference Books:

1. Alfred William Stonier, D. C. Hague, A text book of Economic Theory, 5th edition, Longman Higher
Education, 1980.
2. K. K. Dewett, M. H. Navalur, Modem EconornicTheory, S. Chand, 2006.
3. H. L. Ahuja, Modern Microeconomic: Theory and Applications, S. Chand, 2017.
4. N. Gregory Mankiw, Principles of Economics, 7th edition, South-Western College Publishing, 2013.
5. Ruddar Dutt & K. P. M. Sundhram, Indian Economy, S. Chand, 2004.
6. V. Mote, S. Paul, G. Gupta, Managerial, Economics, McGraw Hill Education, 2017.
7. Saroj Pareek, Text book of Business Economics, Neha Publishers and Distributors, 2013.
8. William McDonough and Michael Braungart, Cradle to Cradle Remaking the Way We Make Things,
North Point Press, New York, 2002.
9. Sustainable Development Challenges, World Economic and Social Survey, United Nations Publication,
2013.

76
 Essence of Indian Traditional Knowledge

General Course Information

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

Pre-requisites: None

About the Course: This course is designed to acquaint students with Indian knowledge traditions It introduces
students to Vedic period, Post Vedic period, Sufi and Bhakti Movement in India, the ancient scientists of India
and social reform movements of 19th century.

Course Outcomes: By the end of the course students will be able to:
CO1. recognise the forms and sources of Indian traditional knowledge. (LOTS: Level 1: Remember)
CO2. identify the contribution of the great ancient Indian scientists and spiritual leaders to the world of
knowledge. (LOTS: Level 2: Understand)
CO3. apply the reasoning based on objectivity and contextual knowledge to address the social and cultural
issues prevalent in Indian society. (LOTS: Level 3: Apply)
CO4. differentiate the myths, superstitions from reality in context of traditional knowledge to protect the
physical and social environment. (LOTS: Level 4: Evaluate)
CO5. suggest means of creating a just and fair social environment that is free from any prejudices and
intolerance for different opinions and cultures. (LOTS: Level 6: Create)

Course Content
Unit I
Introduction to Indian Tradition Knowledge: Defining traditional knowledge, forms, sources and
dissemination of traditional knowledge.
Vedic Period: Vedas and Upanishads, Yogsutras of Patanjali
Post Vedic Period: Budhism, Janism and Indian Materialism: Charvak School of Thought
Unit II

Sufi and Bhakti Movement (14th to 17th century): सगुण-निगुुण भनि, Sufism and Sufi saints, Kabir, Nanak and Guru
Jambheshwar ji Maharaj etc., Composite Culture of Indian sub-continent.
Unit III
Jyotirao Phule and Savitri Bai Phule and other 19th Century Social Reform Movements;
India’s cultural heritage.

78
Unit IV

India’s Contribution to the world of knowledge: प्राचीन भारत के महान वैज्ञाननक: बौधायन, चरक, कौमारभत्ृ य
जीवन, सुश्रुत, आययभट, बराहममहहर, ब्रह्मगुप्त, नागाजुयन, वाग्भट; Astrology and Astronomy, Myths and Reality

Text and Reference Books:

1. A. L. Bhansam, The Wonder That was India, A Survey of the Culture of the, Indian Sub-Continent
before, the Coming of the Muslims, Vol 1, Groove Press, New York, 1959.
2. S. A. A. Rizvi, Wonder That was India, A Survey of the History and Culture of the Indian Sub-
Continent from the Coming of the Muslims to the British Conquest 1200-1700, Vol 2, Rupa and
Co. 2001.
3. प्रनतयोगगता दर्यण अनतररकताांक सीरीज–5 भारतीय कला एवां सांस्कृनत,
4. गुणाकर मूले, प्राचीन भारत के महान वैज्ञाननक, ज्ञान ववज्ञान प्रकाशन, नई हदल्ली, 1990.
5. B. V. Subbarayappa, A Historical Perspective of Science in India, Rupa Publications, New Delhi,
2013.
6. Thich Nhat Hanh, Nguyen Thi Hop, Mobi Ho , Old Path White Clouds: Walking in the Footsteps of
the Buddha, Parallax Press, 1991.
7. Hermann Hesse, Siddhartha, Simon & Brown, 2017.
8. साववत्री चांद्र शोभा, हहन्दी भक्कत साहहत्य में सामाक्जक मूल्य एवां सहहष्णुतावाद, नेशनल बक
ु ट्रस्ट, इांडिया,
2007.
9. Rosalind O’ Hanlon, Caste Conflict and Ideology, Mahatma Jyotirao Phule and low caste protest in
nineteen century, Western India, Camridge University Press, 2009.
10. Melanie P. Kumar, Savitribai Phule: Forgotten liberator, Infochange, 2009.
11. Leah Verghese, Ranjna, and Medha Sundar, Savitribai, Journey of a Trailblazer, Azim Prem Ji
University, 2014.

79