9.

CURRICULUM STRUCTURE
(L - Number of Lecture Hours; T – Number of Tutorial Hours; P-Number of Practical Hours)

FIRST YEAR
1st Semester
Courses
S. No Code Course Title/ Name L-T-P Credits
Category
1 HS1001 Communicative English SMASH 2-0-2 3

2 MA1001 Algebra and Calculus SMASH 3-0-0 3

3 CH1002 Engineering Chemistry-II SMASH 3-0-2 4

Basics of Electrical and Electronics
4 EE1001 SMASH 2-0-2 3
Engineering
5 CS1101 Programming Fundamentals MAJOR 3-0-0 3

6 CS1102 Digital Computer Fundamentals MAJOR 2-0-0 2

7 CS1103 Programming Fundamentals Lab MAJOR 0-0-3 2

Total Credits 20

2nd Semester
Courses
S. No Code Course Title/ Name L-T-P Credits
Category
1 PH1001 Engineering Physics-I SMASH 3-0-2 4

2 ME1002 Engineering Graphics SMASH 1-0-4 3

3 CS1104 Data Structures MAJOR 3-0-0 3

Object Oriented Programming using
4 CS1105 MAJOR 3-0-0 3
Java
Computer Organization and
5 CS1106 MAJOR 3-0-0 3
Architecture
6 CS1107 Data Structures Lab MAJOR 0-0-3 2

7 CS1108 Object Oriented Programming Lab MAJOR 0-0-3 2

Total Credits 20
Credits Earned at the end of First Year: 40

Page 5 of 157
PH1001 ENGINEERING PHYSICS-I [(3-0-2); Credits: 4]

Pre-requisite: NIL
Course Objectives:

• To enable the students to refresh their basics of Physics and orient themselves in implemen-
tation of concepts in engineering
• To give an exposure to principles of quantum mechanics and solid-state physics
• To provide knowledge of functional materials used in Engineering applications
• To gain practical knowledge by applying the experimental methods to understand various
concepts in Physics.
• Apply the analytical techniques and graphical analysis to the experimental data.

Contents:
Simple harmonic motion-energy of SHM; damped oscillations; forced oscillations and
resonance Conditions; Wave equation; Superposition of waves and standing waves; Theory of
interference of light- Newton’s rings, Diffraction.
Inadequacy of classical mechanics-Wave and particle duality of radiation-de Broglie concept
of matter waves-Heisenberg’s uncertainty principle-Schrödinger wave equation-Interpretation
of wave function- Eigen values and Eigen functions Superposition Principle-Particle confined
in one dimensional infinite square well potential.
Crystalline and amorphous solids-system of crystals-Miller indices-atomic radius-coordination
number-atomic packing factor calculation-Bragg’s law. Classical and quantum theory of
electrical conductivity, origin of band theory of solids, semiconductors- extrinsic and intrinsic-
concept of band gap, pn junction diode; optical properties, Magnetism-types and properties-
Hard and soft magnetic materials, applications, dielectric properties of materials;
Superconductivity-types, Meissner effect, applications.
Spontaneous and stimulated emissions-Einstein’s coefficients-Population inversion and lasing
action, Coherence-Properties and types of lasers-Applications. Optical fiberNumerical
aperture-Types of fibers- Fiber optics communication principle-Fiber optic sensors.

List of Experiments:

1. Modulus of rigidity using torsional pendulum.

2. Sonometer- frequency of tuning fork
3. Series LCR circuit-resonance phenomenon.
4. I-V characteristics of pn-junction diode/ Zener diode, LED.
5. Charge-discharge characteristics of RC circuit
6. Determination of resistivity and band gap of a semiconductor
7. Wavelength of laser using Michelson interferometer.
8. Young’s modulus of a material- uniform bending.
9. Measurement of Temperature using thermo-couple.
10. Specific heat of Liquid- and verification of Newton’s law of cooling.

Page 23 of 157
Course Outcomes:
• CO1.Students will be able to relate different kind of oscillations to standard differential
equations, and basics of optical phenomena.
• CO2. Students will be able to understand the fundamentals quantum computing, and
to understand quantum mechanical approach to understand the electronic properties of
materials.
• CO3. Learners get introduced to vide range of functional materials that are used in
engineering applications.
• CO4. Learner will acquire skills for using different scientific instruments and tools to
record the data, and to obtain quantitative results
• CO5. Develop basic communication skills through teamwork and interpreting the re-
sults.

Text Books:
1. M. N. Avadhanulu and Dr. P. G. Kshirsagar, “A Textbook of Engineering Physics” S.
Chand and Company, ISBN: 978-8121908177.
2. Arthur Beiser, Shobhit Mahajan, “Concepts of modern physics”, McGraw Hill
Education; ISBN: 978-0070151550.

Reference Books:
1. William D. Callister, Jr., “Materials Science and Engineering-An Introduction” adapted
by R. Balasubramanian, Wiley, ISBN: 9781119321590.
2. R. A. Serway and J. W. Jewett, “Physics for Scientists and Engineers”, Cengage
Learning, ISBN: 978-1-133-95405-72014.
3. Rolf E Hummel, “Electronic properties of materials” Springer, ISBN:
9781441981639.
4. Harnam Singh and P.S. Hemne, “B.Sc. Pracatical Physics”. S. Chand Publishing,
ISBN: 978-8121904698.

Page 24 of 157
ME1002 ENGINEERING GRAPHICS [(1-0-4); Credits: 3]
Pre-requisite: NIL

Course objective:
• Discuss the various tools, methods to configure the technical drawing with necessary
details.
• Construct the various geometries, cut sections, developments using the engineering
graphics tools.
• Prepare the isometric view/ projections from orthogonal view, vice versa.

Contents:
Drawing standard – BIS, dimensioning, lettering, type of lines, scaling conventions. conic
sections – Orthographic Projection – Development of surfaces – Isometric projection and
isometric views – Construction of perspective projection – Converting isometric into
orthographic drawings.

Course Outcomes:
At the end of the course, the students will be able to
● CO1. Perform the geometrical constructions and making multiple views of the objects.
● CO2. Construct the various geometry by combine the various views of lines, solids,
surfaces into orthographic and other projections.

Text Books:
1. K Venugopal, “Engineering Graphics”, New Age International Publishers; ISBN: 978-
8122415452

Reference Books:

1. Jolhe, D. A., “Engineering Drawing with an Introduction to Auto CAD”, McGraw Hill
Education, ISBN: 978-0070648371
2. Shah, M. B. and Rana, B. C., “Engineering Drawing”, Pearson Education, ISBN: 978-
8131759714
3. Basant Agarwal and Agarwal C.M., “Engineering Drawing”, Tata McGraw Hill Pub-
lishing Company Limited, New Delhi, ISBN: 978-9353167448

Page 25 of 157
CS1104 DATA STRUCTURES [(3-0-0); Credits:3]
Pre-requisite:
CS1101- Programming Fundamentals

Course Objectives:

• To introduce basic data structures.

• To analyze applications for the data structures.
• To analyze suitability of searching and sorting techniques for different applications.
Contents:
Stacks and Queues: Representations and applications; Recursion, Tower of Hanoi, Prefix,
Infix, Postfix, and its Applications; Dynamic storage management, Garbage collection, Linked
Lists: Singly linked list, Doubly linked lists, Circularly linked lists, Applications; Trees:
Concepts, Binary Trees, BST, Traversal, Expression manipulation, Symbol table construction,
Height balanced trees, Minimum spanning trees, B-Trees, B+ Trees, Applications; Graphs:
Representation of graphs, BFS, DFS, Shortest path problems; String representation,
manipulations, Pattern matching, Applications; Sorting Techniques: Selection, Bubble,
Insertion, Merge, Heap, Quick, Radix sort and Address calculation; Searching Techniques:
Linear search, Binary search, Hash table methods.
Course Outcome:
At the end of the course, the students will be able to
• CO1. Understand different data structures in C programming language.
• CO2. Implement operations like searching, insertion & deletion, traversing
mechanism etc. on various data structures.
• CO3. Apply various data structures in problem solving.
• CO4. Analyse algorithmic performance of various data structures.
• CO5. Develop appropriate data structure solutions to solve real-world problems.

Text Book:
1. Jean Paul Tremblay and Paul G. Sorenson, “An Introduction to Data Structures with
Applications”, Tata McGraw Hill, ISBN: 978-0074624715

Reference Book:
1. Alfred V. Aho, John E. Hopcroft, Jeffrey D.Ullman, “Data Structure and Algorithms”,
Pearson Education, ISBN: 978-8178081021.

2. Sara Baase and Allen Van Gelder, “Computer Algorithms - Introduction to Design
and Analysis”, Pearson Education, ISBN: 978-0201612448.
3. Sartaj Sahni, “Data Structures, Algorithms and Applications in C++”, Silicon Press,
978-0929306322.

Online Resources:
1. https://nptel.ac.in/courses/106102064

Page 26 of 157
CS1105 OBJECT ORIENTED PROGRAMMING USING JAVA [(3-0-0); Credits:3]

Pre-requisite:
CS1101 - Programming Fundamentals
Course Objectives:
• To understand the concepts of Classes, Objects and Methods.
• To understand the concept of Inheritance, Polymorphism and Interfaces in Java.
• To understand the concept of Packages, Threads, and Streams.

Contents:
Principles of Object-Oriented Programming, Basic concepts of procedure-oriented and object-
oriented programming, Classes, Objects, Constructors, Methods, Finalizer, Encapsulation,
Access Modes, JVM, Inheritance: Hierarchies, Super and subclasses, Visibility modes;
Polymorphism: Static and Dynamic, Abstract Classes; Interfaces, Packages, Exception
Handling, Multithreading, File Streams, and GUI Programming.
Course Outcomes:
At the end of the course, the students will be able to
• CO1. Understand object-oriented programming concepts.
• CO2. Apply the concept of Inheritance, Polymorphism, Interfaces, Exception
Handling, and File Streams.
• CO3. Analyse the working of multiple threads in JAVA.
• CO4. Evaluate the programs for critical errors.
• CO5. Design solutions using object-oriented and GUI programming concepts to solve
real world problems.

Text Books:
1. Herbert Schildt and Dale Skrien, “Java Fundamentals – A comprehensive Introduc-
tion”, McGraw Hill, ISBN: 9780078022074.
Reference Books:
1. Herbert Schildt, “Java: The Complete Reference”, McGraw Hill, ISBN: 978-
0070636774.
2. Timothy Budd, “Understanding Object-Oriented Programming with Java”, Pearson Ed-
ucation, ISBN: 978-8131708354.

Online Resources:
1. https://nptel.ac.in/courses/106105191

Page 27 of 157
CS1106 COMPUTER ORGANIZATION AND ARCHITECTURE
[(3-0-0); Credits: 3]
Pre-requisite: NIL

Course Objectives:
• To understand the basic components and its interaction in a computer system.
• To understand the representation of data at machine level.
• To understand the data flow and operations performed by each component of the com-
puter system on the input data.
Contents:

Basic structure of Computers- Addressing modes, Arithmetic and Memory operations, Basic
I/O operations, Arithmetic Unit- Addition, Subtraction, Booth’s algorithm for multiplication,
Restoring and Non-restoring Division, FP representation and operations, Processing unit,
Datapath, Hardwired control, Micro programmed control, Pipelining, Hazards, RAM, Cache,
I/O Organization, DMA.
Course Outcomes:
At the end of the course, the students will be able to
• CO1. Explain the basic components of a computer system.
• CO2. Design Arithmetic and Logic Unit
• CO3. Explain the functionalities and organization of processor subunits
• CO4. Perform binary arithmetic computation on data according to the algorithms
• CO5. Explain the working of different I/O devices.
Text Books:

1. C. Hamacher, Z. Vranesic, S. Zaky, "Computer Organization", McGraw Hill, ISBN: 978-

1259005275.
Reference Books:

1. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The Hard-
ware/Software Interface”, Elsevier, ISBN: 978-9351073376.
2. W. Stallings, "Computer Organization and Architecture", Pearson education, ISBN: 978-
0134101613.

Page 28 of 157
CS1107 DATA STRUCTURES LAB [(0-0-3); Credits:2]

Pre-requisite: CS1103 - Programming Fundamentals Lab

Course Objectives:
• To develop skills to design and analyze simple linear and nonlinear data structures.
• To gain knowledge in practical applications of data structures.
• To strengthen the ability to identify and apply the suitable data structure for the given
real-world problem.
Contents:
1. Operations on Stacks
2. Implementation of Tower of Hanoi
3. Conversion of infix expressions to postfix and evaluation of postfix expressions
4. Operations on Queues
5. Implementation of priority queue, DEQUEUE
6. Operations on Linked List
7. Doubly Linked List and Circular Linked List Implementation
8. Tree Traversal: Pre-Order, Post-Order, In-Order, and Level Order Traversals
9. Implementation of Binary Search Tree
10. Graph Representation: Breadth First Search, Depth First Search
11. Implementation of Sorting techniques
12. Implementation of Searching techniques

Course Outcomes:
At the end of the course, the students will be able to
• CO1. Analyse various linear and non-linear data structures.
• CO2. Demonstrate the working nature of different types of data structures and their
applications.
• CO3. Evaluate the time & space efficiency of various data structures.
• CO4. Implement the searching and sorting algorithms.
• CO5. Choose the appropriate data structure for solving real world problems.

Page 29 of 157
CS1108 OBJECT ORIENTED PROGRAMMING LAB [(0-0-3); Credits:2]

Pre-requisite: CS1103-Programming Fundamentals Lab

Course Objectives:
• Design classes and objects to represent real-world entities.
• To understand the concepts of OOPs.
• To learn solving real-world problem using OOPs concepts.
• Formal introduction to Java programming language
Contents:
1. Program to define a structure of a basic JAVA program.
2. Program to define Classes, Objects, Constructors, Methods, and Finalizer.
3. Program to demonstrate Inheritance.
4. Program to demonstrate Polymorphism.
5. Program to demonstrate Packages.
6. Program to demonstrate Exception Handling.
7. Program to demonstrate Multithreading.
8. Program to demonstrate File Streams.
9. Program to demonstrate Applet structure and event handling.

Course Outcomes:
At the end of the course, the students will be able to
• CO1. Write Java programs using OOP principles and proper program structuring
• CO2. Develop solutions using the concept of Inheritance, Polymorphism,
Interfaces, and File Streams
• CO3. Implement Java programs to handle exceptions using exception handling
• CO4. Create Multithreaded programs
• CO5. Design solutions using object-oriented and GUI programming concepts to solve
real world problems

Page 30 of 157