Semester- I

Programming and Problem Solving in C

Course Code MMC101 CIE Marks 50
Teaching Hours/Week (L:P:SDA/T) 2:2:0 SEE Marks 50
Total Hours of Pedagogy 40 hours Theory + 10 hours Lab Total Marks 100
Credits 04 Exam Hours 03
Course Learning objectives:
1. Implement the constructs of C Language.
2. Construct C Programs using basic programming constructs
3. Develop C programs using arrays and strings
4. Organize modular applications in C using functions
5. Integrate pointers and structures in C applications and Execute input/output and file handling
in C
Module-1
BASICS OF C PROGRAMMING Introduction to programming paradigms – Applications of C
Language - Structure of C program - C programming: Data Types - Constants – Enumeration
Constants - Keywords – Operators: Precedence and Associativity - Expressions - Input/Output
statements, Assignment statements – Decision making statements - Switch statement - Looping
statements – Preprocessor directives - Compilation process
Module-2
ARRAYS AND STRINGS Introduction to Arrays: Declaration, Initialization – One dimensional
array –Two dimensional arrays - String operations: length, compare, concatenate, copy – Selection
sort, linear and binary search.
Module-3
FUNCTIONS AND POINTERS Modular programming - Function prototype, function definition,
function call, Built-in functions (string functions, math functions) – Recursion, Binary Search using
recursive functions –Pointers – Pointer operators – Pointer arithmetic – Arrays and pointers – Array
of pointers – Parameter passing: Pass by value, Pass by reference.
Module-4
STRUCTURES AND UNION Structure - Nested structures – Pointer and Structures – Array of
structures – Self referential structures – Dynamic memory allocation - Singly linked list – typedef –
Union - Storage classes and Visibility.
Module-5
FILE PROCESSING Files – Types of file processing: Sequential access, Random access –
Sequential access file - Random access file - Command line arguments.
Sl. Experiments
NO
1 Simulation of a SimpleCalculator.

2
Implement Binary Search on Integers

3
Sort the given set of N numbers using Bubble sort.

4
Implement Matrix multiplication and validate the rules of multiplication.

5
An electricity board charges the following rates for the use of electricity: for the first 200 units 80 paise per unit:
for the next 100 units 90 paise per unit: beyond 300 units Rs 1 per unit. All users are charged a minimum of Rs.
100 as meter charge. If the total amount is more than Rs 400, then an additional surcharge of 15% of total
amount is charged. Write a program to read the name of the user, number of units consumed and print out the
charges.
6
Write functions to implement string operations such as compare, concatenate, and find string length. Use the
parameter passing techniques.
7
mplement structures to read, write and compute average- marks of the students, list the students scoring above
and below the average marks for a class of N students.
8
Write a C program to copy a text file to another, read both the input file name and target file name.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing
marks in SEE is 40% of the maximum marks of SEE. A student shall be deemed to have satisfied the
academic requirements and earned the credits allotted to each subject/ course if the student secures
not less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation)
and SEE (Semester End Examination) taken together.
CIE for the theory component of IPCC
1. Two Tests each of 20 Marks
2. Two assignments each of 10 Marks/One Skill Development Activity of 20 marks
3. Total Marks of two tests and two assignments/one Skill Development Activity added will be CIE
for 60 marks, marks scored will be proportionally scaled down to 30 marks.
CIE for the practical component of IPCC
• On completion of every experiment/program in the laboratory, the students shall be evaluated
and marks shall be awarded on the same day. The 15 marks are for conducting the experiment
and preparation of the laboratory record, the other 05 marks shall be for the test conducted at
the end of the semester.
• The CIE marks awarded in the case of the Practical component shall be based on the
continuous evaluation of the laboratory report. Each experiment report can be evaluated for 10
marks. Marks of all experiments‟ write- ups are added and scaled down to 15 marks.
• The laboratory test at the end /after completion of all the experiments shall be conducted for
50 marks and scaled down to 05 marks. Scaled-down marks of write-up evaluations and tests
added will be CIE marks for the laboratory component of IPCC for 20 marks.
SEE for IPCC
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours)
1. The question paper will be set for 100 marks and marks scored will be scaled down proportionately
to 50 marks.
2. The question paper will have ten questions. Each question is set for 20 marks.
3. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
4. The students have to answer 5 full questions, selecting one full question from each module.
The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical portion
will have a CIE component only. Questions mentioned in the SEE paper shall include questions
from the practical component).
• The minimum marks to be secured in CIE to appear for SEE shall be the 15 (50% of
maximum marks-30) in the theory component and 10 (50% of maximum marks -20) in the
practical component. The laboratory component of the IPCC shall be for CIE only. However,
in SEE, the questions from the laboratory component shall be included. The maximum of
04/05 questions to be set from the practical component of IPCC, the total marks of all
questions should not be more than the 20 marks.
• SEE will be conducted for 100 marks and students shall secure 40% of the maximum marks to
qualify in the SEE. Marks secured will be scaled down to 50. (Student has to secure an
aggregate of 50% of maximum marks of the course(CIE+SEE)
Suggested Learning Resources:
TEXT BOOKS:
1. ReemaThareja, “Programming in C”, Oxford University Press, Second Edition, 2016.
2. Kernighan, B.W and Ritchie,D.M, “The C Programming language”, Second Edition, Pearson
Education, 2015.

REFERENCES:

1. Paul Deitel and Harvey Deitel, “C How to Program with an Introduction to C++”, Eighth edition,
Pearson Education, 2018.

2. Yashwant Kanetkar, Let us C, 17th Edition, BPB Publications, 2020.

3. Byron S. Gottfried, “Schaum’s Outline of Theory and Problems of Programming with C”,
McGraw-Hill Education, 1996.

4. Pradip Dey, Manas Ghosh, “Computer Fundamentals and Programming in C”, Second 5. Edition,
Oxford University Press, 2013.

5. Anita Goel and Ajay Mittal, “Computer Fundamentals and Programming in C”, 1st Edition,
Pearson Education, 2013.

Skill Development Activities Suggested

• The students with the help of the course teacher can take up technical –activities which will enhance their
skill or the students should interact with industry (small, medium and large), understand their problems
or foresee what can be undertaken for study in the form of research/testing/projects, and for creative and
innovative methods to solve the identified problem. The prepared report shall be evaluated for CIE marks.
Course outcome (Course Skill Set)
At the end of the course the student will be able to :
Sl. No. Description Blooms Level
CO1 Demonstrate knowledge on C Programming constructs L5
CO2 Develop simple applications in C using basic constructs L4
CO3 Design and implement applications using arrays and strings L5
CO4 Develop and implement modular applications in C using functions L4
CO5 Develop applications in C using structures and pointers L4
Program Outcome of this course to all the Entire Syllabus
Sl. No. Description POs

1 Foundation Knowledge: Apply knowledge of mathematics, programming P01

logic and coding fundamentals for solution architecture and problem solving.

2 Problem Analysis: Identify, review, formulate and analyse problems for PO2
primarily focussing on customer requirements using critical thinking
frameworks.

3 Development of Solutions: Design, develop and investigate problems with PO3

as an innovative approach for solutions incorporating ESG/SDG goals.
4 PO4
Modern Tool Usage: Select, adapt and apply modern computational tools
such as development of algorithms with an understanding of the limitations
including human biases.

5 Individual and Teamwork: Function and communicate effectively as an PO5

individual or a team leader in diverse and multidisciplinary groups. Use
methodologies such as agile.

6 Project Management and Finance: Use the principles of project PO6

management such as scheduling, work breakdown structure and be conversant
with the principles of Finance for profitable project management.

7 Ethics: Commit to professional ethics in managing software projects with PO7

financial aspects. Learn to use new technologies for cyber security and insulate
customers from malware

8 Life-long learning: Change management skills and the ability to learn, keep PO8
up with contemporary technologies and ways of working.
Mapping of COS and POs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
CO1 X
CO2 X
CO3 X
CO4 X
CO5 X
 Semester- I
Discrete Mathematics and Graph Theory
Course Code MMC102 CIE Marks 50
Teaching Hours/Week (L:P:SDA/T) 2:0:1 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 3 Exam Hours 3
Course Learning objectives:
1. Analyze basic concepts of mathematical logic for analyzing propositions and proving
theorems
2. Apply sets and their operations algebraically to solve real-world problems.
3. Examine the basics of graph theory and their various properties.
4. Model problems using graphs and to solve these problems algorithmically.
5. Apply graph theory concepts to solve real world problems in Computer Networking,
Telecommunication Infrastructure, Transportation etc.

Module-1
Basic Structures: Sets, Principle of Inclusion, Exclusion and Pigeonhole principle Functions and
Matrices: Eigenvalues and Eigenvectors.

Module-2
Mathematical Logic, Propositional Logic, Applications of Propositional Logic, Propositional
Equivalences, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference Introduction
to Proofs
Module-3
Introduction to Graphs: Application of graphs – finite, infinite and bipartite graphs –
Incidence and Degree – Isolated vertex, pendant vertex and Null graph. Paths and circuits –
Isomorphism, sub-graphs, walks, paths and circuits, connected graphs, disconnected graphs
and components.
Module-4
Eulerian and Hamiltonian graphs: Euler graphs, Operations on graphs, Hamiltonian paths and
circuits, Travelling salesman problem. Directed graphs – types of digraphs, Digraphs and binary
relation.
Module-5
Graph Colouring: Colouring- Chromatic number, Chromatic polynomial, Matchings, Coverings,
Four colour problem and Five colour problem. Greedy colouring algorithm.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1.Two Unit Tests each of 25 Marks
2.Two assignments each of 25 Marks or one Skill Development Activity of 50 marks to attain the COs and
POs
The sum of two tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome defined for the course.

Semester-End Examination:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module
.

Suggested Learning Resources:

Text Books :
1. Kenneth H Rosen, “Discrete Mathematics and its Applications”, McGraw Hill publications,
7th edition.
2. Narsingh Deo, Graph theory with the applications to engineering & Computer Science,
Dovers Publications, 2016
3. J.A. Bondy and U.S.R. Murty. Graph theory with Applications, Springer, 1 st edition, 2008.

References Books

1. J.K Sharma “Discrete Mathematics”, Mac Millian Publishers India, 3rd edition,2011.
2. Garry Chartand and Ping Zhang, Introduction to Graph Theory, Tata McGraw-Hill, 2006.
3. Frank Harary, Graph Theory, Narosa Publishing House, Latest edition.

Web links and Video Lectures (e-Resources):

1. https://archive.nptel.ac.in/courses/111/106/111106086/
2. https://onlinecourses.nptel.ac.in/noc20_cs82/preview

Skill Development Activities Suggested

1) Translating English Sentences into logical statements

2) Applying Graph theory concepts to design State and National highways across the Country
Course outcome (Course Skill Set)
At the end of the course the student will be able to :
Sl. Description Blooms
No. Level
CO1 Understand basic concepts of mathematical logic for analyzing L2
propositions and proving theorems and Use sets and its operations
algebraically for solving real world problems.
CO2 Understand the basics of graph theory and their various properties L3
CO3 Model problems using graphs and to solve these problems L5
algorithmically
CO4 Apply graph theory concepts to solve real world problems in L5
Computer Networking, Telecommunication Infrastructure,
Transportation etc

Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1 X
CO2 X
CO3 X
CO4 X
 Semester- I
Database Management Systems (DBMS)
Course Code MMC103 CIE Marks 50
Teaching Hours/Week (L:P:SDA/T) 3:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 3 Exam Hours 3
Course Learning objectives:
● Analyze the basic concepts and the applications of database systems.
● Evaluate the different issues involved in the design and implementation of Database System.
● Explain the basic concepts of relational data model, entity relationship model, relational database
design, relational algebra and database language SQL and Postgre SQL.
● Design and build a simple database system and demonstrate competence with the fundamental
tasks involved with modelling, designing, and implementing a DBMS
Module-1
Introduction: Purpose of Database System, Views of data, data models, database management system, three-
schema architecture of DBMS, components of DBMS. E/R Model - Conceptual data modelling - motivation, entities,
entity types, attributes relationships, relationship types, E/R diagram notation, examples.
Data Models: Introduction to the Relational Model – Structure – Database Schema, Keys – Schema Diagrams.
Database design– Other Models, ER diagrams – ER Model - Entities, Attributes and Entity sets – Relationships and
Relationship sets – ER Design Issues – Concept Design – Conceptual Design with relevant Examples. Relational
Query Languages, Relational Operations

Module-2
Relational Algebra – Selection and projection set operations – renaming – Joins – Division – Examples of Algebra
overviews – Relational calculus – Tuple Relational Calculus (TRC) – Domain relational calculus (DRC).
Overview of the SQL Query Language – Basic Structure of SQL Queries, Data types, Creating a database, create a
table, drop the database, drop table, select table, insert a record, update record, delete a record, order by, group
by, triggers,Set Operations, Aggregate Functions , Nested Sub queries, Views, Procedures.

Module-3
Normalization – Introduction, Non loss decomposition and functional dependencies, First, Second, and third
normal forms – dependency preservation, Boyce/Codd normal form.
Higher Normal Forms - Introduction, Multi-valued dependencies and Fourth normal form, Join dependencies
and Fifth normal form
Module-4
Transaction Concept- Transaction State- Implementation of Atomicity and Durability – Concurrent Executions –
Serializability- Recoverability – Implementation of Isolation – Testing for serializability- Lock –Based Protocols –
Timestamp Based Protocols- Validation- Based Protocols – Multiple Granularity.

Module-5
Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions – Check Points - Buffer
Management – Failure with loss of nonvolatile storage.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Two Unit Tests each of 25 Marks
2. Two assignments each of 25 Marks or one Skill Development Activity of 50 marks
3. to attain the COs and POs
4. The sum of two tests, two assignments/skill Development Activities, will be scaled down to 50 marks
5. CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per
the outcome defined for the course.

Semester-End Examination:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module
.

Suggested Learning Resources:

Text Books:
1. Database System Concepts, Silberschatz, Korth, Mc Graw hill, 7th edition.
2. Database Management Systems, Raghu Ramakrishnan, Johannes Gehrke, TATA McGrawHill 3rd Edition.
3. Fundamentals of Database Systems, Elmasri and Navathe, 6th Edition, 2011, Pearson Education, ISBN-13:
978-0136086208.

Reference Books:
1. An Introduction to Database systems, C.J. Date, A.Kannan, S.Swami Nadhan, Pearson, Eight Edition.
2. Rob,Coronel, “Database Systems”, Seventh Edition, Cengage Learning.
3. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student Edition.
4. Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.
5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL,Shah, PHI.

Web links and Video Lectures (e-Resources):

1. dev.mysql.com
2. www. Postgressql.org.
3. https://www.w3schools.com/mysql/mysql_rdbms.asp
4. https://www.w3schools.in/dbms/intro

Skill Development Activities Suggested

● The ability to design, develop, and administer complex databases using tools such as SQL
(Structured Query Language)
● Configuring authentication and authorization. Easily configure user accounts, define access
policies, modify restrictions, and access scopes
Course outcome (Course Skill Set)
At the end of the course the student will be able to:
Sl. Description Blooms
No. Level
CO1 Demonstrate the basic elements of a relational database management system L2
CO2 Ability to identify the data models for relevant problems L3
CO3 Design entity relationship and convert entity relationship diagrams into L5
RDBMS and formulate SQL queries on the respect data

Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1 X
CO2 X X
CO3 X X
 Semester- I
Operating Systems
Course Code MMC104 CIE Marks 50
Teaching Hours/Week (L:P:SDA/T) 2:0:1 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 3 Exam Hours 03
Course Learning objectives:
● Explain the need and services of the operating system
● Explore how the operating system handles processes and manages memory.

Module-1
Introduction to Operating Systems, System Structure What operating systems do, Operating System
Operations, Computing Environments, Operating System Services, System Calls, Types of System
Calls, System Programs, Operating System Structure, System Boot
Process Concept Process Concept, Process Scheduling, Interprocess Communication
Module-2
Process Scheduling Basic Concepts, Scheduling Criteria, Scheduling Algorithms
Synchronization Background, The Critical Section Problem, Mutex Locks, Semaphores, Classic
Problems of Synchronization: Readers-Writers Problem, Dining Philosophers Problem using
Semaphores

Module-3
Deadlocks: System model, Deadlock Characterization, Methods for handling deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection and Recovery from Deadlock

Module-4
Memory Management Strategies Basic Hardware, Swapping, Contiguous Memory Allocation,
Segmentation, Paging,
Virtual Memory Management Background, Demand Paging, Page Replacement
Module-5
File System File concept, Access methods, Directory overview
Implementing File System Allocation methods, Free Space Management
 Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Two Unit Tests each of 25 Marks
2. Two assignments each of 25 Marks or one Skill Development Activity of 50 marks
3. to attain the COs and POs
4. The sum of two tests, two assignments/skill Development Activities, will be scaled down to 50 marks
5. CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per
the outcome defined for the course.

Semester-End Examination:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module

Suggested Learning Resources:

Text Books
● Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating Systems Principles, 10th
Edition, Wiley – India, 2019.
1. Reference Books:
1. D M Dhamdhere: Operating Systems – A Concept Based Approach, 3rd Edition, Tata
McGraw – Hill, 2017.
2. Harvey M Deital: Operating Systems, 3rdEdition, Addison Wesley, 1990.

Web links and Video Lectures (e-Resources):

● .https://www.google.com/search?q=Abraham+Silberschatz%2C+Peter+Baer+Galvin%2C+Greg+Gagne%3
A+Operating+Systems+Principles%2C+10th+Edition%2C+Wiley+%E2%80%93+India%2C+2019.&oq=Ab
raham+Silberschatz%2C+Peter+Baer+Galvin%2C+Greg+Gagne%3A+Operating+Systems+Principles%2C+
10th+Edition%2C+Wiley+%E2%80%93+India%2C+2019.&gs_lcrp=EgZjaHJvbWUyBggAEEUYOdIBCDEw
OTJqMGo3qAIAsAIA&sourceid=chrome&ie=UTF-8
● https://www.youtube.com/results?search_query=Harvey+M+Deital%3A+Operating+Systems%2C+3rdEdi
tion%2C+Addison+Wesley%2C+1990.
Skill Development Activities Suggested
• The students with the help of the course teacher can take up technical –activities which will enhance their
skill or the students should interact with industry (small, medium and large), understand their problems
or foresee what can be undertaken for study in the form of research/testing/projects, and for creative and
innovative methods to solve the identified problem. The prepared report shall be evaluated for CIE marks.
Course outcome (Course Skill Set)
At the end of the course the student will be able to :
Sl. No. Description Blooms Level
CO1 Describe the elements and various functionalities of the operating system L2
CO2 Apply the techniques of process management and demonstrate process L3
synchronization deadlock handling.
CO3 Analyze various memory management strategies and file handling. L4

Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
CO1 X
CO2 X
CO3 X X
 Semester- I
Web Technologies
Course Code MMC105 CIE Marks 50
Teaching Hours/Week (L:P:SDA/T) 3:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 3 Exam Hours 3
Course Learning objectives:
● Creating the small web page using HTML5 and CSS
● Developing the interactive web pages using JavaScript
● Create web pages using angular JS framework
Module-1
Web browsers, web servers, MIME, URL, HTTP
Introduction to HTML5 tags, Basic syntax and structure, text markups, images, lists, tables,
progress, Media tags-audio and video, forms, span and div tags.
Module-2
Introduction to CSS, Levels of CSS, Selectors, Font, color and Text Properties, BOX Model,
Introduction to JavaScript, JavaScript variables, operators, Conditional and loop statements in
JavaScript, Functions and Arrays in JavaScript

Module-3
Event Handling and Document Object model in JavaScript, Handling strings and working with
window object
Module-4
Introduction to AngularJS, Expressions, Modules, Directives, Model, Data binding, Controllers,
Scopes, Filters
Module-5
Services, Tables, Select box, Forms, Events, Validations
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Two Unit Tests each of 25 Marks
2. Two assignments each of 25 Marks or one Skill Development Activity of 50 marks
3. to attain the COs and POs
4. The sum of two tests, two assignments/skill Development Activities, will be scaled down to 50 marks
5. CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome defined for the course.

Semester-End Examination:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module
Suggested Learning Resources:
Books
1. Web Programming By Chris Bates , Wiley Publications
2. HTML5 Black Book by Dreamtech
3. Angular JS By Krishna Rungta

Web links and Video Lectures (e-Resources):

● https://www.w3schools.com/angular/default.asp
● https://www.tutorialspoint.com/angular8/index.htm

Skill Development Activities Suggested

● The students with the help of the course teacher can take up technical –activities which will enhance their
skill or the students should interact with industry (small, medium and large), understand their problems
or foresee what can be undertaken for study in the form of research/testing/projects, and for creative and
innovative methods to solve the identified problem. The prepared report shall be evaluated for CIE marks.

Course outcome (Course Skill Set)

At the end of the course the student will be able to :
Sl. Description Blooms
No. Level
CO1 Explain the fundamental concepts of web technologies L2
CO2 Create the web pages using HTML and CSS L3
CO3 Implement user interactive web pages L3
CO4 Demonstrate the single window applications using AngularJS L3

Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1 X
CO2 X X
CO3 X
CO4 X
 Semester- I
DBMS and Web Technologies Laboratory
Course Code MMCL106 CIE Marks 50
Teaching Hours/Week (L:P: SDA/T) 0:2:0 SEE Marks 50
Credits 2 Exam Hours 03
Course objectives:
• Create SQL queries for the small projects.
• Create database objects that include tables, constraints, indexes, and sequences.

Sl.NO Experiments
1 Create the following tables with properly specifying Primary keys, Foreign keys and solve the following queries.
BRANCH (Branchid, Branchname, HOD)
STUDENT (USN, Name, Address, Branchid, sem)
BOOK (Bookid, Bookname, Authorid, Publisher, Branchid)
AUTHOR (Authorid, Authorname, Country, age) BORROW
(USN, Bookid, Borrowed_Date)
Execute the following Queries:
i.List the details of Students who are all studying in 2nd sem MCA.
ii.List the students who are not borrowed any books.
iii. Display the USN, Student name, Branch_name, Book_name, Author_name, Books_Borrowed_Date of 2nd
sem MCA Students who borrowed books.
iv. Display the number of books written by each Author.
v.Display the student details who borrowed more than two books.
vi.Display the student details who borrowed books of more than one Author.vii.Display
the Book names in descending order of their names.
viii.List the details of students who borrowed the books which are all published by the same publisher.
2 Consider the following schema: STUDENT (USN, name, date_of_birth, branch, mark1, mark2, mark3, total,
GPA) Execute the following queries: i. Update the column total by adding the columns mark1, mark2, mark3. ii.
Find the GPA score of all the students. iii. Find the students who born on a particular year of birth from the
date_of_birth column. iv. List the students who are studying in a particular branch of study. v. Find the maximum
GPA score of the student branch-wise. vi. Find the students whose name starts with the alphabet “S”. vii. Find
the students whose name ends with the alphabets “AR”. viii. Delete the student details whose USN is given as
1001
3 Design an ER-diagram for the following scenario, Convert the same into a relational model and then solve the
following queries. Consider a Cricket Tournament “ABC CUP” organized by an organization. In the tournament
there are many teams are contesting each having a Teamid,Team_Name, City, a coach. Each team is uniquely
identified by using Teamid. A team can have many Players and a captain. Each player is uniquely identified by
Playerid, having a Name, and multiple phone numbers,age. A player represents only one team. There are many
Stadiums to conduct matches. Each stadium is identified using Stadiumid, having a stadium_name,Address (
involves city,area_name,pincode). A team can play many matches. Each match played between the two teams in
the scheduled date and time in the predefined Stadium. Each match is identified uniquely by using Matchid. Each
match won by any of the one team that also wants to record in the database. For each match man_of_the match
award given to a player.
Execute the following Queries:
i. Display the youngest player (in terms of age) Name, Team name, age in which he belongs of the
tournament.
ii. List the details of the stadium where the maximum number of matches were played.
iii. List the details of the player who is not a captain but got the man_of _match award at least in two
matches.
iv. Display the Team details who won the maximum matches.
v. Display the team name where all its won matches played in the same stadium.
4 A country wants to conduct an election for the parliament. A country having many constituencies. Each
constituency is identified uniquely by Constituency_id, having the Name, belongs to a state,Number_of_voters. A
constituency can have many voters. Each voter is uniquely identified by using Voter_id, having the Name, age,
address (involves Houseno,city,state,pincode). Each voter belongs to only one constituency. There are many
candidates contesting in the election. Each candidates are uniquely identified by using candidate_id, having Name,
phone_no, age, state. A candidate belongs to only one party.Thereare many parties. Each party is uniquely
identified by using Party_id, having Party_Name,Party_symbol. A candidate can contest from many constituencies
under a same party. A party can have many candidates contesting from different constituencies. No constituency
having the candidates from the same party. A constituency can have many contesting candidates belongs to
different parties. Each voter votes only one candidate of his/her constituencty.
Queries:
i. List the details of the candidates who are contesting from more than one constituencies which are
belongs to different states.
ii. Display the state name having maximum number of constituencies.
iii. Create a stored procedure to insert the tuple into the voter table by checking the voter age. If voter‟s age
is at least 18 years old, then insert the tuple into the voter else display the “Not an eligible voter msg”.
iv. Create a stored procedure to display the number_of_voters in the specified constituency. Where the
constituency name is passed as an argument to the stored procedure.
v. Create a TRIGGER to UPDATE the count of “ Number_of_voters” of the respective constituency in
“CONSTITUENCY” table , AFTER inserting a tuple into the “VOTERS” table.

5 Design an ER-diagram for the following scenario, Convert the same into a relational model, normalize Relations
into a suitable Normal form and then solve the following queries. A country can have many Tourist places . Each
Tourist place is identified by using tourist_place_id, having a name, belongs to a state, Number of kilometers away
from the 02.03.2021 updated 52/ 104 capital city of that state,history. There are many Tourists visits tourist places
every year. Each tourist is identified uniquely by using Tourist_id, having a Name, age, Country and multiple
emailids. A tourist visits many Tourist places, it is also required to record the visted_date in the database. A tourist
can visit a Tourist place many times at different dates. A Tourist place can be visited by many tourists either in the
same date or at different dates.
Queries:
i. List the state name which is having maximum number of tourist places.
ii. List details of Tourist place where maximum number of tourists visited.
iii. List the details of tourists visited all tourist places of the state “KARNATAKA”.
iv. Display the details of the tourists visited at least one tourist place of the state, but visited all states tourist
places.
v. Display the details of the tourist place visited by the tourists of all country.
6 Create an XHTML page that provides information about your department. Your XHTML page must use the
following tags: a) Text Formatting tags b) Horizontal rule c) Meta element d) Links e) Images f) Tables (Use of
additional tags encouraged).
7. Develop and demonstrate a XHTML file that includes Javascript script for the following problems: a) Input : A
number n obtained using prompt Output : The first n Fibonacci numbers b) Input : A number n obtained using
prompt Output : A table of numbers from 1 to n and their squares using alert
8. Develop and demonstrate, using JavaScript script, a XHTML document that contains three short paragraphs of
text, stacked on top of each other, with only enough of each showing so that the mouse cursor can be placed over
some part of them. When the cursor is placed over the exposed part of any paragraph, it should rise to the top to
become completely visible. Modify the above document so that when a text is moved from the top stacking
position, it returns to its original position rather than to the bottom
Demonstration Experiments (For CIE) if any
9 Consider the following database of student enrollment in courses and books adopted for each course.STUDENT
(regno#: string, name: string, major: string, bdate: date)
COURSE (course#: int, cname: string, dept: String)
TEXT (book_ISBN#: int, book_title: string, publisher: string, author: string)
ENROLL (regno#: string, course#: int, sem: int, marks: int) BOOK_ADOPTION
(course#: int, sem: int, book_ISBN: int)
✓ Create the above tables by properly specifying the primary keys and the foreign keys
✓ Enter at least 7 to 10 records to each table.
Execute SQL queries for the following requirements:
1) List out the student details, and their course details. The records should be ordered in a semester wise manner.
2) List out the student details under a particular department whose name is ordered in a semester wise
3) List out all the book details under a particular course
4) Find out the Courses in which number of students studying will be more than 2.
5) Find out the Publisher who has published more than 2 books.
10 Develop, test and validate an XHTML document that has checkboxes for apple (59 cents each), orange (49 cents
each), and banana (39 cents each) along with submit button. Each check boxes should have its own onclick
event handler. These handlers must add the cost of their fruit to a total cost. An event handler for the submit
button must produce an alert window with the message „your total cost is $xxx‟, where xxx is the total cost of
the chose fruit, including 5 percent sales tax. This handler must return „false‟ (to avoid actual submission of the
form data). Modify the document to accept quantity for each item using textboxes.
 6) Find out the authors who have written book for I semester, computer science course.
7) List out the student details whose total number of months starting from their date of birth is more than 225
8) Find out the course name to which maximum number of students have joined
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
• Create database objects.
• Design entity-relationship diagrams to solve given database applications.
• Implement a database schema for a given problem.
• Formulate SQL queries in Oracle for the given problem.
• Apply normalization techniques to improve the database design for the given problem.
• Build database and verify for its appropriate normalization for any given problem
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam
(SEE) is 50%. The minimum passing mark for the CIE is 50% of the maximum marks. A student
shall be deemed to have satisfied the academic requirements and earned the credits allotted to
each course. The student has to secure not less than 40%of maximum marks in the semester-
end examination(SEE). In total of CIE and SEE student has to secure 50% maximum marks of
the course.
Continuous Internal Evaluation (CIE):
CIE marks for the practical course is 50 Marks.
The split-up of CIE marks for record/ journal and test are in the ratio 60:40.
• Each experiment to be evaluated for conduction with observation sheet and record write-
up. Rubrics for the evaluation of the journal/write-up for hardware/software experiments
designed by the faculty who is handling the laboratory session and is made known to students
at the beginning of the practical session.
• Record should contain all the specified experiments in the syllabus and each experiment
write-up will be evaluated for 10 marks.
• Total marks scored by the students are scaled downed to 30 marks (60% of maximum
marks).
• Weightage to be given for neatness and submission of record/write-up on time.
• Department shall conduct 02 tests for 100 marks, the first test shall be conducted after the
8 week of the semester and the second test shall be conducted after the 14th week of the
th

semester.
• In each test, test write-up, conduction of experiment, acceptable result, and procedural
knowledge will carry a weightage of 60% and the rest 40% for viva-voce.
• The suitable rubrics can be designed to evaluate each student’s performance and learning
ability.
• The average of 02 tests is scaled down to 20 marks (40% of the maximum marks).
The Sum of scaled-down marks scored in the report write-up/journal and average marks of
two tests is the total CIE marks scored by the student.

Semester End Evaluation (SEE):

SEE marks for the practical course is 50 Marks.
SEE shall be conducted jointly by the two examiners of the same institute, examiners are
appointed by the University.
All laboratory experiments are to be included for practical examination.
(Rubrics) Breakup of marks and the instructions printed on the cover page of the answer script
to be strictly adhered to by the examiners. OR based on the course requirement evaluation
rubrics shall be decided jointly by examiners.
Students can pick one question (experiment) from the questions lot prepared by the internal
/external examiners jointly.
Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by
examiners.
General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure
and result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for
100 marks and scored marks shall be scaled down to 50 marks (however, based on course
type, rubrics shall be decided by the examiners)
Change of experiment is allowed only once and 10% Marks allotted to the procedure part to
be made zero.
The duration of SEE is 03 hours
Semester- II
Machine learning and Data analytics using Python
Course Code MMC201 CIE Marks 50
Teaching Hours/Week (L:P: 2:2:0 SEE Marks 50
SDA/T/T)
Total Hours of Pedagogy 50 Total Marks 100
Credits 04 Exam Hours 03
Course Learning Objectives:
1. Understand foundational concepts in machine learning and data analytics.
2. Gain proficiency in Python for data analysis and machine learning tasks.
3. Learn and apply various machine learning algorithms and techniques.
4. Develop skills in data preprocessing, visualization, and model evaluation.
5. Prepare students for industry roles involving data-driven decision making and
predictive modeling.
Module-1 08 Hours
Introduction to Machine Learning and Python:
Introduction to Machine Learning: Definition and importance of machine learning, Types
of machine learning: Supervised, unsupervised, and reinforcement learning, Applications of
machine learning in various domains.
Python for Data Analysis: Introduction to Python programming, Python libraries for data
analysis: NumPy, Pandas, Matplotlib, Data manipulation and visualization using Pandas
and Matplotlib.
Data Preprocessing: Data cleaning and transformation, Handling missing values and
outliers, Feature scaling and normalization.

Teaching Learning Process:

Lectures with PowerPoint presentations, Hands-on coding exercises using Jupyter
notebooks, Interactive discussions and problem-solving sessions, Assignments and quizzes
for assessment.
Module-2 08 Hours
Supervised Learning:
Regression: Linear regression, Polynomial regression, Model evaluation metrics: MAE,
MSE, RMSE. Classification: Logistic regression, K-Nearest Neighbors (KNN), Decision
Trees and Random Forests, Model evaluation metrics: Accuracy, precision, recall, F1-score,
ROC-AUC.
Model Training and Evaluation: Train-test split and cross-validation, Hyper parameter
tuning using GridSearchCV, Overfitting and underfitting.
Teaching Learning Process:
Lab exercises on regression and classification models, Practical coding sessions with real-
time problem-solving, Group projects on developing and evaluating supervised learning
models, Continuous assessment through quizzes and coding challenges.
Module-3 08 Hours
Unsupervised Learning:
Clustering: K-Means clustering, Hierarchical clustering, Evaluation of clustering results.
Dimensionality Reduction: Principal Component Analysis (PCA), Linear Discriminant
Analysis (LDA) t-Distributed Stochastic Neighbor Embedding (t-SNE).
Association Rule Learning: Apriori algorithm, Market Basket Analysis, Evaluation metrics
for association rules
Teaching Learning Process:
Lab exercises on clustering and dimensionality reduction, Practical coding sessions with
unsupervised learning techniques, Group projects on applying unsupervised learning to real-
world data, Continuous assessment through quizzes and practical tests.
Module-4 08 Hours
Advanced Machine Learning Techniques:
Ensemble Methods: Bagging and Boosting, Gradient Boosting Machines (GBM), Extreme
Gradient Boosting (XGBoost).
Support Vector Machines (SVM): Linear and non-linear SVM, Kernel trick, Model
evaluation and tuning.
Neural Networks and Deep Learning: Introduction to neural networks, Building and
training neural networks using TensorFlow and Keras, Convolutional Neural Networks
(CNN) and Recurrent Neural Networks (RNN).
Teaching Learning Process:
Practical sessions on advanced machine learning techniques, Interactive coding exercises to
implement neural networks, Group projects on applying advanced techniques to complex
data problems, Continuous assessment through quizzes and practical tests.
Module-5 08 Hours
Data Analytics and Real-World Applications:
Exploratory Data Analysis (EDA): Data visualization techniques, Statistical analysis and
hypothesis testing, Identifying patterns and insights from data.
Time Series Analysis: Introduction to time series data, Time series forecasting using
ARIMA and Prophet, Evaluating time series models.
Integrating Machine Learning Models: Deployment of machine learning models, Building
web applications with Flask and Django, Case studies on real-world applications of machine
learning.

Teaching Learning Process:

Lab exercises on EDA and time series analysis, Practical sessions on deploying machine
learning models, Group discussions on real-world case studies, Final project presentation
and assessment.
Sl. Experiments
NO
1 Implement and demonstratethe FIND-Salgorithm for finding the most specific hypothesis based on a given set
of training data samples. Read the training data from a .CSV file.
2
For a given set of training data examples stored in a .CSV file, implement and demonstrate the Candidate-
Elimination algorithmto output a description of the set of all hypotheses consistent with the training examples.
3
Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an appropriate data
set for building the decision tree and apply this knowledge to classify a new sample.
4
Write a program to implement the naïve Bayesian classifier for a sample training data set stored as a .CSV file.
Compute the accuracy of the classifier, considering few test data sets.
5
Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set. Print both correct and
wrong predictions.
6
Build an Artificial Neural Network by implementing the Backpropagation algorithm and test the same using
appropriate data sets.
7
Write a program to demonstrate Regression analysis with residual plots on a given data set.

8
Write a program to compute summary statistics such as mean, median, mode, standard deviationand variance of
the given different types of data.
9
Write a program to implement k-Means clustering algorithm to cluster the set of data stored in .CSV file.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing
marks in SEE is 40% of the maximum marks of SEE. A student shall be deemed to have satisfied the
academic requirements and earned the credits allotted to each subject/ course if the student secures not
less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and
SEE (Semester End Examination) taken together.
CIE for the theory component of IPCC
1. Two Tests each of 20 Marks
2. Two assignments each of 10 Marks/One Skill Development Activity of 20 marks
3. Total Marks of two tests and two assignments/one Skill Development Activity added will be CIE
for 60 marks, marks scored will be proportionally scaled down to 30 marks.
CIE for the practical component of IPCC
• On completion of every experiment/program in the laboratory, the students shall be evaluated
and marks shall be awarded on the same day. The 15 marks are for conducting the experiment
and preparation of the laboratory record, the other 05 marks shall be for the test conducted at
the end of the semester.
• The CIE marks awarded in the case of the Practical component shall be based on the
continuous evaluation of the laboratory report. Each experiment report can be evaluated for 10
marks. Marks of all experiments‟ write- ups are added and scaled down to 15 marks.
• The laboratory test at the end /after completion of all the experiments shall be conducted for 50
marks and scaled down to 05 marks. Scaled-down marks of write-up evaluations and tests
added will be CIE marks for the laboratory component of IPCC for 20 marks.
SEE for IPCC
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours)
1. The question paper will be set for 100 marks and marks scored will be scaled down proportionately
to 50 marks.
2. The question paper will have ten questions. Each question is set for 20 marks.
3. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
4. The students have to answer 5 full questions, selecting one full question from each module.
The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical portion
will have a CIE component only. Questions mentioned in the SEE paper shall include questions
from the practical component).
• The minimum marks to be secured in CIE to appear for SEE shall be the 15 (50% of maximum
marks-30) in the theory component and 10 (50% of maximum marks -20) in the practical
component. The laboratory component of the IPCC shall be for CIE only. However, in SEE,
the questions from the laboratory component shall be included. The maximum of 04/05
questions to be set from the practical component of IPCC, the total marks of all questions
should not be more than the 20 marks.
SEE will be conducted for 100 marks and students shall secure 40% of the maximum marks to qualify
in the SEE. Marks secured will be scaled down to 50. (Student has to secure an aggregate of 50% of
maximum marks of the course(CIE+SEE)
Suggested Learning Resources:
Text Books:
1. Practical Machine Learning for Data Analysis Using Python Abdulhamit Subasi.
2. Advance Machine Learning with Python by John Hearty.

Reference Textbooks:
1. "Python Machine Learning: Machine Learning and Deep Learning with Python, scikit-
learn, and
Tensor Flow " by Sebastian Raschka and Vahid Mirjalili.
2. "Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow" by Aurélien
Géron.
3. "Introduction to Machine Learning with Python".

Web links and Video Lectures (e-Resources):

● https://youtu.be/7eh4d6sabA0?si=JWHNJRVS6NhQOPYe
● https://youtu.be/kqtD5dpn9C8?si=LBep4HWaMFRrAPsD
● https://youtu.be/4SJ7bEILPJk?si=5LurvjzUOuCew1W9

Skill Development Activities Suggested

● The students with the help of the course teacher can take up technical –activities
which will enhance their skill or the students should interact with industry (small, medium
and large), understand their problems or foresee what can be undertaken for study in the
form of research/testing/projects, and for creative and innovative methods to solve the
identified problem. The prepared report shall be evaluated for CIE marks.
Course outcome (Course Skill Set)
At the end of the course the student will be able to:
Sl. No. Description Blooms Level
CO1 Demonstrate an understanding of machine learning concepts L3
and techniques.
 CO2 Perform data preprocessing and exploratory data analysis L4
using Python.
CO3 Develop and evaluate machine learning models using Python L5
libraries.
CO4 Apply machine learning algorithms to real-world data L4
problems.
CO5 Integrate data analytics and machine learning models into L5
practical applications.

Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
CO1 X X
CO2 X
CO3 X X
CO4 X X X
CO5 X X
Industry-Relevant Key Points:
● Emphasis on coding standards and best practices.
● Integration of version control systems (e.g., Git) in project work.
● Exposure to industry-standard tools and frameworks.
● Real-world application development projects.
● Focus on collaborative development and agile methodologies.

Semester- II
 Object Oriented Programming using Java
Course Code MMC202 CIE Marks 50
Teaching Hours/Week (L:P:SDA/T) 4:0:0 SEE Marks 50
Total Hours of Pedagogy 50 Total Marks 100
Credits 4 Exam Hours 3
Course Learning objectives:
● This subject will help to improve the analytical skills of object oriented programming Formal
introduction to Java programming language
● Overall development of problem solving and critical analysis
Module-1

The History and Evolution of Java: The Byte code, Features of Java An overview of Java: Object-
Oriented Programming, Structure of a Java program, Data Types and Variables, Type conversion and
casting, Arrays
Classes: Fundamentals, Declaring Objects, Assigning Object Reference Variables, Methods,
Constructors, this Keyword, Garbage Collection, Stack application
Methods and Classes: Overloading Methods, Using Objects as Parameters, Argument Passing,
Returning Objects, Access Control, static, final, Command-Line Arguments

Module-2
Inheritance: Basic concepts, Member Access and Inheritance, Practical Example Inheritance
types, super, constructors, Method Overriding, Dynamic Method Dispatch, Abstract Classes, final
with inheritance.
String Handling: String Constructor, String length, Special string Operations, Character
Extraction, String comparison, Modifying a string, String Buffer
Generics: About Generics, A simple Generic Example, General class with Two Type Parameters,
General form of generic class

Module-3
Packages and Interfaces: Packages, Packages and member access, Importing packages, Interfaces,
Default interface methods, Use static methods in an interface, Private Interface methods.
Exception handling: Fundamentals, Exception types, uncaught exceptions, try and catch, multiple
catch clauses, nested try statements, throw, throws, finally, Java’s built-in exceptions, User-defined
exceptions.
Module-4
Multithreaded Programming: Java thread model, main thread, creating thread, creating multiple
threads, isalive( ) and Join( ), thread priorities, synchronization
Input/Output: Exploring java.io - The I/O Classes and Interfaces, The Byte Streams

Module-5
 Event Handling: Two Event Handling Mechanisms, The Delegation Event Model, EventsEvent
Sources, Event Listeners, Event Classes- The MouseEventClass, Event Listener Interfaces-The
MouseListener Interface, the MouseMotionListener Interface, Delegation
Event Model – Handling Mouse Events.
AWT: Working with Windows, Graphics and Text
AWT Classes, Window Fundamentals, Working with Frame Windows, Graphic

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Two Unit Tests each of 25 Marks
2. Two assignments each of 25 Marksor oneSkill Development Activity of 50 marks
to attain the COs and POs
3. The sum of two tests, two assignments/skill Development Activities, will be scaled down to 50 marks
4. CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per
the outcome defined for the course.

Semester-End Examination:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module
.

Suggested Learning Resources:

Prescribed Text Book:: Java the Complete Reference Eleventh Edition by Herbert Schildt ,Tata
McGraw-hill Edition , 2019
Reference Text Books:

1) Introduction to JAVA Programming 9th Edition by Y. Daniel Liang , Pearson education, 2012
2) Programming in JAVA 5.0 1st Edition by James P Cohoon, Jack W Davidson, TATA McGraw
hill,2006

Web links and Video Lectures (e-Resources):

 1) https://ia800303.us. archive.org/ 26/items/ JavaJavaJavaObjectorientedProblemSolving/ jjj-
os.pdf
2) http://people.reed.edu/ ~jerry/121/materials/ artsciencejava.pdf
3) https://upload.wikimedia. org/wikipedia/ commons/e/e7/ Java_Programming.pdf
4) https://onlinecourses.swayam2.ac.in/aic20_sp1 3/preview
5) https://onlinecourses.swayam2.ac.in/aic20_sp1
6) https://www.classcentral.com/course/coursera-object-oriented-programming-in-java-4212

Skill Development Activities Suggested

● The students with the help of the course teacher can take up technical –activities which will enhance their
skill or the students should interact with industry (small, medium and large), understand their problems
or foresee what can be undertaken for study in the form of research/testing/projects, and for creative and
innovative methods to solve the identified problem. The prepared report shall be evaluated for CIE marks.
Course outcome (Course Skill Set)
At the end of the course the student will be able to :
1. Understand the basic principles of the object-oriented programming
2. Demonstrate an introductory understanding of graphical user interfaces, multi
3. Apply the knowledge of Java concepts to find the solution for a given problem.
4. Analyse the given Java application for correctness/functionalities.
5. Develop Java programs / applications for a given requirement.
●
Sl. Description Blooms
No. Level
CO1 Solve the given problem by applying OOP using java L2
CO2 Apply the fundamentals of Inheritance L2
CO3 Identify and list the different applications of event handling L3

Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1 X
CO2 X
CO3 X
CO4 X
CO5 X
 Semester- II
Data Structure and Algorithms
Course Code MMC203 CIE Marks 50
Teaching Hours/Week(L:P: 4:0:0 SEE Marks 50
SDA/T)
Total Hours of Pedagogy 50 Total Marks 100
Credits 04 Exam Hours 03
Course Learning Objectives:

1. To understand and implement fundamental data structures.

2. To develop efficient algorithms for solving problems.
3. To analyze the time and space complexity of algorithms.
4. To gain practical experience in applying data structures and algorithms to real-world
problems.
5. To prepare students for industry roles requiring strong foundations in data structures
and algorithmic thinking.
Module-1 10
Hours
Introduction to Data Structures and Algorithms:
Basic Concepts: Definition and importance of data structures, Abstract Data Types (ADTs),
Algorithm analysis: Time and space complexity, Big O notation. Arrays: Definition and
operations: Insertion, deletion, traversal, Multidimensional arrays, Applications of arrays.
Linked Lists: Singly linked list: Creation, insertion, deletion, traversal, Doubly linked list and
circular linked list, Applications of linked lists.

Teaching Learning Process:

Lectures with PowerPoint presentations, Hands-on coding exercises in C, Interactive
discussions and problem-solving sessions, Assignments and quizzes for assessment.

Module-2 10 Hours
Stacks, Queues, and Recursion:
Stacks: Definition and operations: Push, pop, peek, Applications: Expression evaluation,
backtracking, function calls. Queues: Definition and operations: Enqueue, dequeue, front,
rear, Types: Circular queue, priority queue, double-ended queue (deque), Applications of
queues. Recursion: Definition and principles of recursion, Recursive algorithms: Factorial,
Fibonacci series, Tower of Hanoi, Analysis of recursive algorithms.

Teaching Learning Process:

Case studies and real-world examples, Practical coding sessions, Group discussions and
problem-solving exercises, Mid-term project focusing on stack and queue applications.

Module-3 10 Hours
Trees and Graphs:
Trees: Definition and terminology: Root, leaf, internal node, height, depth, Binary trees:
Traversal (preorder, inorder, postorder), creation, insertion, deletion, Binary search trees
(BST), AVL trees, B-trees. Graphs: Definition and terminology: Vertices, edges, adjacency list,
adjacency matrix, Graph traversal algorithms: Depth-first search (DFS), breadth-first search
(BFS), Shortest path algorithms: Dijkstra’s algorithm, Floyd-Warshall algorithm.

Teaching Learning Process:

Lab exercises on tree and graph implementations, Interactive coding sessions with real-time
problem-solving, Group projects to develop tree and graph applications, Continuous
assessment through quizzes and coding challenges.

Module-4 10 Hours
Sorting and Searching Algorithms:
Sorting Algorithms: Basic concepts and classification, Comparison-based sorting: Bubble
sort, selection sort, insertion sort, quicksort, mergesort, heapsort, Non-comparison-based
sorting: Radix sort, counting sort. Searching Algorithms: Linear search and binary search,
Search in linked lists, trees, and graphs, Hashing: Hash functions, collision resolution
techniques (chaining, open addressing).

Teaching Learning Process:

Demonstrations and hands-on coding practice, Problem-solving sessions with practical use
cases, Case studies on the application of sorting and searching algorithms, Assignments and
group activities to solidify understanding.

Module-5 10 Hours
Advanced Data Structures and Applications:
Advanced Data Structures: Heaps: Definition, operations, heap sort, applications, Trie:
Definition, operations, applications in dictionary and spell-checking, Segment trees and
Fenwick trees: Definition, operations, range queries. Algorithm Design Techniques: Divide
and conquer, Greedy algorithms, Dynamic programming. Industry Applications: Real-
world applications of data structures and algorithms, Best practices in data structure and
algorithm implementation, Case studies of complex problem-solving using advanced data
structures.

Teaching Learning Process:

Practical sessions on advanced data structures, Industry guest lectures, Project-based
learning with real-world applications, Final project presentation and assessment.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam
(SEE) is 50%. The minimum passing mark for the CIE is 50% of the maximum marks.
Minimum passing marks in SEE is 40% of the maximum marks of SEE. A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each
subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum total
of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken
together.
Continuous Internal Evaluation:
1. Three Unit Tests each of 20 Marks
2. Two assignments each of 20 Marks or one Skill Development Activity of 40 marks
to attain the COs and POs
The sum of three tests, two assignments/skill Development Activities, will be scaled down
to 50 marks CIE methods /question paper is designed to attain the different levels of
Bloom’s taxonomy as per the outcome defined for the course.

Semester End Examination:

1. The SEE question paper will be set for 100 marks and the marks scored will be
proportionately reduced to 50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of
four sub-questions) from each module.
4. Each full question will have a sub-question covering all the topics under a module.
Suggested Learning Resources:
Text Books:

1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd Ed,
Universities Press, 2014.
2. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed, McGraw Hill,
2014.

Reference books:

1. Gilberg & Forouzan, Data Structures: A Pseudo-code approach with C, 2nd Ed, Cengage
Learning,2014.
2. Reema Thareja, Data Structures using C, 3rd Ed, Oxford press, 2012.
3. Jean-Paul Tremblay & Paul G. Sorenson, An Introduction to Data Structures with
Applications, 2 nd Ed, McGraw Hill, 2013
4. A M Tenenbaum, Data Structures using C, PHI, 1989
5. Robert Kruse, Data Structures and Program Design in C, 2nd Ed, PHI, 1996.
6. Introduction to the Design and Analysis of Algorithms, Anany Levitin: 2nd Edition, 2009.
Pearson.
7. Computer Algorithms/C++, Ellis Horowitz, SatrajSahni and Rajasekaran, 2nd Edition,
2014, Universities Press.

8. Algorithms, Kenneth A Berman and Jerome L Paul, Cengage Learning India Pvt Ltd, 2002
edition.

Web links and Video Lectures (e-Resources):

● https://www.youtube.com/watch?v=BBpAmxU_NQo
● https://www.youtube.com/watch?v=8hly31xKli0
● https://archive.nptel.ac.in/courses/106/106/106106127/

Skill Development Activities Suggested

● The students with the help of the course teacher can take up technical –activities
which will enhance their skill or the students should interact with industry (small, medium
and large), understand their problems or foresee what can be undertaken for study in the
form of research/testing/projects, and for creative and innovative methods to solve the
identified problem. The prepared report shall be evaluated for CIE marks.
Course outcome (Course Skill Set)
At the end of the course the student will be able to:
Sl. No. Description Blooms Level
CO1 Demonstrate an understanding of fundamental data structures L2
and algorithms.
CO2 Implement and manipulate data structures such as arrays, L4
linked lists, stacks, queues, trees, and graphs.
CO3 Develop algorithms for searching, sorting, and optimization L2
problems.
CO4 Analyze the efficiency and correctness of algorithms. L2
CO5 Apply data structures and algorithms to solve complex L4
problems in various domains.

Industry-Relevant Key Points:

● Emphasis on coding standards and best practices.
● Integration of version control systems (e.g., Git) in project work.
● Exposure to industry-standard tools and frameworks.
● Real-world application development projects.
● Focus on collaborative development and agile methodologies.
Mapping of COS and POs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
CO1 X X
CO2 X
CO3 X
CO4 X
CO5 X

Semester- II
 Software Engineering
Course Code MMC204 CIE Marks 50
Teaching Hours/Week (L:P:SDA/T) 2:0:1 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Course Learning objectives:
● Understand the importance of various Software Engineering Lifecycle Models.
● Document the Software Requirements Specification (SRS) for the identified system.
● Gain knowledge of the System Analysis and Design concepts using UML.
Module-1
SOFTWARE PROCESS AND AGILE DEVELOPMENT: Introduction to Software Engineering, Software
Process, Perspective and Specialized Process Models –Introduction to Agility-Agile process-Extreme
programming-XP Process-Case Study.
Module-2
REQUIREMENTS ANALYSIS AND SPECIFICATION: Requirement analysis and specification –
Requirements gathering and analysis – Software Requirement Specification – Formal system
specification – Finite State Machines – Petrinets –Object modelling using UML – Use case Model – Class
diagrams – Interaction diagrams – Activity diagrams – State chart diagrams – Functional modelling –
Data Flow Diagram- CASE TOOLS.
Module-3
SOFTWARE DESIGN: Software design – Design process – Design concepts – Coupling – Cohesion –
Functional independence – Design patterns – Model-view-controller – Publish-subscribe – Adapter –
Command – Strategy – Observer – Proxy – Facade – Architectural styles – Layered - Client Server -
Tiered - Pipe and filter- User interface design-Case Study
Module-4
TESTING AND MAINTENANCE : Testing – Unit testing – Black box testing– White box testing –
Integration and System testing–Regression testing – Debugging - Program analysis – Symbolic execution
– Model Checking Case Study.
Module-5
PROJECT MANAGEMENT: Software Project Management- Software Configuration Management - Project
Scheduling- DevOps: Motivation-Cloud as a platform-Operations- Deployment Pipeline:Overall
Architecture Building and Testing-Deployment- Tools- Case Study.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Two Unit Tests each of 25 Marks
2. Two assignments each of 25 Marks or one Skill Development Activity of 50 marks
to attain the COs and POs
3. The sum of two tests, two assignments/skill Development Activities, will be scaled down to 50 marks
4. CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per
the outcome defined for the course.

Semester-End Examination:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module
.

Suggested Learning Resources:

Books
1. Bernd Bruegge and Allen H. Dutoit, “Object-Oriented Software Engineering: Using UML, Patterns and Java”,
Third Edition, Pearson Education, 2009
2. Roger S. Pressman, Object-Oriented Software Engineering: An Agile Unified Methodology, First Edition, Mc
Graw-Hill International Edition, 2014.
3. Len Bass, Ingo Weber and Liming Zhu, ―DevOps: A Software Architect‘s Perspective, Pearson Education,
2016.
4. Rajib Mall, ―Fundamentals of Software Engineering, Third Edition, PHI Learning Private Limited, 2009
5. PankajJalote, ―Software Engineering, A Precise Approach, Wiley India, 2010.
Skill Development Activities Suggested
● The students with the help of the course teacher can take up technical –activities which will enhance their
skill or the students should interact with industry (small, medium and large), understand their problems
or foresee what can be undertaken for study in the form of research/testing/projects, and for creative and
innovative methods to solve the identified problem. The prepared report shall be evaluated for CIE marks.
Course outcome (Course Skill Set)
At the end of the course, the student will be able to:
Sl. No. Description Blooms Level
CO1 Describe the fundamental software process models and the principles of L2
requirement analysis.
CO2 Implement design patterns and architectural styles to construct software systems. L3
CO3 Utilize the software testing methodologies to ensure the quality and reliability of L3
software.
CO4 Analyze the integration of software project management practices with DevOps L4
principles to improve software delivery and operational efficiency.
Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1 X
CO2 X
CO3 X
CO4 X
Semester- II
Web Application Development
Course Code MMC205 CIE Marks 50
Teaching Hours/Week (L:P: 2:1:0 SEE Marks 50
SDA/T)
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Course Learning Objectives:
1. To understand the fundamental concepts and technologies of web application
development.
2. To gain proficiency in front-end and back-end web development.
3. To learn and apply modern web frameworks and libraries.
4. To develop skills in creating responsive and dynamic web applications.
5. To prepare students for industry roles requiring expertise in
web development.
Module-1 08 Hours
Introduction to Web Development and HTML5:
Web Development Basics: Introduction to web technologies and protocols, Client-server
architecture, Overview of front-end and back-end development
HTML5 Fundamentals: HTML5 elements and attributes, Semantic HTML5 tags, Forms and
input types, Multimedia elements (audio, video)
Advanced HTML5: Canvas and SVG for graphics, HTML5 APIs(Geolocation, Web Storage,
Web Workers), Offline web applications using AppCache.

Teaching Learning Process:

Lectures with PowerPoint presentations, Hands-on coding exercises in HTML5, Interactive
discussions and problem-solving sessions, Assignments and quizzes for assessment.
Module-2 08 Hours
CSS3 and Responsive Web Design:
CSS3 Basics: Introduction to CSS3, Selectors, properties, and values, Box model, layout, and
positioning, Flexbox and Grid layouts.
Responsive Web Design: Media queries, Responsive design principles, Fluid grids and
flexible images, Mobile-first design approach.
CSS Frameworks: Introduction to Bootstrap, Bootstrap components and utilities,
Customizing Bootstrap with Sass.

Teaching Learning Process:

Practical sessions on CSS3 and responsive design, Interactive coding exercises to implement
responsive layouts, Group projects on developing responsive web pages, Continuous
assessment through quizzes and assignments.
Module-3 08 Hours
JavaScript and DOM Manipulation:
JavaScript Basics: Introduction to JavaScript, Variables, data types, and operators, Control
structures (if-else, loops), Functions and scope
Document Object Model (DOM): DOM structure and manipulation, Event handling and
event listeners, Creating and modifying DOM elements, Form validation using JavaScript
Advanced JavaScript: Asynchronous JavaScript (callbacks, promises, async/await), AJAX
and Fetch API, Introduction to JavaScript libraries (e.g., jQuery).

Teaching Learning Process:

Lab exercises on JavaScript and DOM manipulation, Practical coding sessions with real-time
problem-solving, Group projects on creating interactive web applications, Continuous
assessment through quizzes and coding challenges.
Module-4 08 Hours
Front-End Frameworks and AngularJS:
Introduction to Front-End Frameworks: Importance of front-end frameworks, Overview of
popular frameworks (React, Angular, Vue)
AngularJS Basics: Introduction to AngularJS, Modules, controllers, and scope, Directives,
expressions, and filters
Advanced AngularJS: Services and dependency injection, Routing and single-page
applications (SPAs), Data binding and form handling, Custom directives and components.

Teaching Learning Process:

Practical sessions on AngularJS basics and advanced topics, Interactive coding exercises to
build AngularJS applications, Group projects on developing single-page applications,
Continuous assessment through quizzes and practical tests.
Module-5 08 Hours
Back-End Integration and Deployment:
Back-End Development: Introduction to server-side programming, Overview of server-side
languages (Node.js, PHP, Python), RESTful web services and APIs, Database integration
(SQL, NoSQL)
Full-Stack Development: Integrating front-end and back-end technologies, Developing full-
stack web applications, Case studies on full-stack applications
Deployment and Security: Web application deployment (cloud platforms, hosting services),
Security best practices for web applications, Authentication and authorization, Performance
optimization.
Teaching Learning Process:
Lab exercises on back-end development and integration, Practical sessions on deploying
web applications, Group discussions on web application security, Final project
presentation and assessment.

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Two Unit Tests each of 25 Marks
2. Two assignments each of 25 Marks or one Skill Development Activity of 50 marks
a. to attain the COs and POs
3. The sum of two tests, two assignments/skill Development Activities, will be scaled down to 50 marks
4. CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per
the outcome defined for the course.

Semester-End Examination:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced
to 50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-
questions) from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module

Suggested Learning Resources:

Text Books:
1. Web Programming By Chris Bates , Wiley Publications
2. HTML5 Black Book by Dreamtech
3. Angular JS By Krishna Rungta
4. Bootstrap essentials by Snig by Packt-open source .

Skill Development Activities Suggested

● Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
The students with the help of the course teacher can take up activities which will enhance
their activity based learning like Quizzes, Assignments and Seminars.
Course outcome (Course Skill Set)
At the end of the course the student will be able to:
Sl. No. Description Blooms Level
CO1 Demonstrate an understanding of web technologies and L1
protocols.
 CO2 Develop and deploy web applications using HTML5, CSS3, L1,L2
JavaScript, and modern frameworks.
CO3 Apply responsive design principles using frameworks like L3
Bootstrap.
CO4 Implement dynamic web applications using AngularJS. L4,L5
CO5 Integrate front-end and back-end technologies to create full- L5
stack web applications.

Industry-Relevant Key Points:

● Emphasis on coding standards and best practices.
● Integration of version control systems (e.g., Git) in project work.
● Exposure to industry-standard tools and frameworks.
● Real-world application development projects.
● Focus on collaborative development and agile methodologies.
Mapping of COS and POs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
CO1 X
CO2 X
CO3 X
CO4 X
CO5 X
 Semester- II
Object Oriented Programming using JAVA Laboratory
Course Code MMCL206 CIE Marks 50
Teaching Hours/Week (L:P: SDA/T) 0:2:0 SEE Marks 50
Credits 2 Exam Hours 03
Course objectives:
• Using java programming to develop programs for solving real-world problems.
• Reinforce the understanding of basic object-oriented programming concepts.

Sl.NO Experiments
1 Write a Java program to print the following triangle of numbers1
12
123
1234
12345

2 Write a Java program to list the factorial of the numbers 1 to 10. To calculate the factorial value, use while loop.
(Hint Fact of 4 = 4*3*2*1)
3 Write a Java program

• To find the area and circumference of the circle by accepting the radius from the user.

• To accept a number and find whether the number is Prime or not

4 Write a Java program to demonstrate a division by zero exception

5 Write a Java program to implement Inner class and demonstrate its Access protection.
6
Write a Java program to demonstrate Constructor Overloading and Method Overloading.

7 Write a JAVA program to demonstrate Inheritance. Simple Program on Java for the implementation of Multiple
inheritance using interfaces to calculate the area of a rectangle and triangle.
8
Write a Java applet program, which handles keyboard event.

Demonstration Experiments (For CIE) if any

9 Write a Java Program to create a window when we press

✓ M or m the window displays Good Morning

✓ A or a the window displays Good After Noon

✓ E or e the window displays Good Evening

✓ N or n the window displays Good Night

10 Write a Java program to implement a Queue using user defined Exception Handling (also make use of throw,
throws). a. Complete the following: b. Create a package named shape. c. Create some classes in the package
representing some common shapes like Square, Triangle, and Circle. d. Import and compile these classes in other
program.
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
• Demonstrate the fundamental data types and constructs of Java Programming by writing executable/interpretable
programs.
• Illustrate the object oriented principles with the help of java programs.
• Develop reusable and efficient applications using inheritance concepts of java.
• Learn the object oriented concepts and its implementation in Java.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE)
is 50%. The minimum passing mark for the CIE is 50% of the maximum marks. A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each
course. The student has to secure not less than 40%of maximum marks in the semester- end
examination(SEE). In total of CIE and SEE student has to secure 50% maximum marks of the
course.
Continuous Internal Evaluation (CIE):
CIE marks for the practical course is 50 Marks.
The split-up of CIE marks for record/ journal and test are in the ratio 60:40.
• Each experiment to be evaluated for conduction with observation sheet and record write-up.
Rubrics for the evaluation of the journal/write-up for hardware/software experiments designed
by the faculty who is handling the laboratory session and is made known to students at the
beginning of the practical session.
• Record should contain all the specified experiments in the syllabus and each experiment
write-up will be evaluated for 10 marks.
• Total marks scored by the students are scaled downed to 30 marks (60% of maximum
marks).
• Weightage to be given for neatness and submission of record/write-up on time.
• Department shall conduct 02 tests for 100 marks, the first test shall be conducted after the 8th
week of the semester and the second test shall be conducted after the 14th week of the semester.
• In each test, test write-up, conduction of experiment, acceptable result, and procedural
knowledge will carry a weightage of 60% and the rest 40% for viva-voce.
• The suitable rubrics can be designed to evaluate each student’s performance and learning
ability.
• The average of 02 tests is scaled down to 20 marks (40% of the maximum marks).
The Sum of scaled-down marks scored in the report write-up/journal and average marks of two
tests is the total CIE marks scored by the student.

Semester End Evaluation (SEE):

SEE marks for the practical course is 50 Marks.
SEE shall be conducted jointly by the two examiners of the same institute, examiners are
appointed by the University.
All laboratory experiments are to be included for practical examination.
(Rubrics) Breakup of marks and the instructions printed on the cover page of the answer script
to be strictly adhered to by the examiners. OR based on the course requirement evaluation rubrics
shall be decided jointly by examiners.
Students can pick one question (experiment) from the questions lot prepared by the internal
/external examiners jointly.
Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by
examiners.
General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and
result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100
marks and scored marks shall be scaled down to 50 marks (however, based on course type,
rubrics shall be decided by the examiners)
Change of experiment is allowed only once and 10% Marks allotted to the procedure part to be
made zero.
The duration of SEE is 03 hours

1
 Semester- II
Data Structures with Algorithms Laboratory
Course Code MMCL207 CIE Marks 50
Teaching Hours/Week (L:P: SDA/T/T) 0:2:0 SEE Marks 50
Credits 2 Exam Hours 03
Course objectives:
• Evaluate the Expressions like postfix, prefix conversions.
• Implementing various data structures viz. Stacks, Queues, Linked Lists, Trees and Graphs.

Sl.NO Experiments
1 Implement a Program in C for converting an Infix Expression to Postfix Expression.
2 Design, develop, and execute a program in C to evaluate a valid postfix expression using stack. Assume that the
postfix expression is read as a single line consisting of non-negative single digit operands and binary arithmetic
operators. The arithmetic operators are + (add), - (subtract), * (multiply) and / (divide).
3 Design, develop, and execute a program in C to simulate the working of a queue of integers using an array.
Provide the following operations: a. Insert b. Delete c. Display
4 Write a C program to simulate the working of a singly linked list providing the following operations: a. Display&
Insert b. Delete from the beginning/end c. Delete a given element
5 Write a C program to Implement the following searching techniques a. Linear Search b. Binary Search.
6 Write a C program to implement the following sorting algorithms using user defined functions: a. Bubble sort
(Ascending order) b. Selection sort (Descending order).
7 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm ( C programming)
8 From a given vertex in a weighted connected graph, find shortest paths to other vertices Using Dijkstra's
algorithm (C programming)
Demonstration Experiments ( For CIE ) if any
9 Using circular representation for a polynomial, design, develop, and execute a program in C to accept two
polynomials, add them, and then print the resulting polynomial.
10 Design, develop, and execute a program in C to evaluate a valid postfix expression using stack. Assume that the
postfix expression is read as a single line consisting of non-negative single digit operands and binary arithmetic
operators. The arithmetic operators are + (add), - (subtract), * (multiply) and / (divide).
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
• Implement the techniques for evaluating the given expression.
• Implement sorting / searching techniques, and validate input/output for the given problem.
• Implement data structures (namely Stacks, Queues, Circular Queues, Linked Lists, and Trees), its operations and
algorithms.
• Implement the algorithm to find whether the given graph is connected or not and conclude on the performance of
the technique implemented.

2
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The minimum
passing mark for the CIE is 50% of the maximum marks. A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to each course. The student has to secure not less than 40%of maximum marks in
the semester-end examination(SEE). In total of CIE and SEE student has to secure 50% maximum marks of the course.
Continuous Internal Evaluation (CIE):
CIE marks for the practical course is 50 Marks.
• The split-up of CIE marks for record/ journal and test are in the ratio 60:40.
• Each experiment to be evaluated for conduction with observation sheet and record write- up. Rubrics for the
evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is handling the
laboratory session and is made known to students at the beginning of the practical session.
• Record should contain all the specified experiments in the syllabus and each experiment write-up will be evaluated
for 10 marks.
• Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
• Weightage to be given for neatness and submission of record/write-up on time.
• Department shall conduct 02 tests for 100 marks, the first test shall be conducted after the 8th week of the semester
and the second test shall be conducted after the 14th week of the semester.
• In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will carry a
weightage of 60% and the rest 40% for viva-voce.
• The suitable rubrics can be designed to evaluate each student’s performance and learning ability.
• The average of 02 tests is scaled down to 20 marks (40% of the maximum marks). The Sum of scaled-down marks
scored in the report write-up/journal and average marks of two tests is the total CIE marks scored by the student.
Semester End Evaluation (SEE):
SEE marks for the practical course is 50 Marks.
SEE shall be conducted jointly by the two examiners of the same institute, examiners are appointed by the University.
All laboratory experiments are to be included for practical examination.

(Rubrics) Breakup of marks and the instructions printed on the cover page of the answer script to be strictly adhered to by
the examiners. OR based on the course requirement evaluation rubrics shall be decided jointly by examiners.

Students can pick one question (experiment) from the questions lot prepared by the internal /external examiners jointly.
Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result in -60%, Viva-voce
20% of maximum marks.
SEE for practical shall be evaluated for 100 marks and scored marks shall be scaled down to 50 marks (however, based on
course type, rubrics shall be decided by the examiners) Change of experiment is allowed only once and 10% Marks allotted
to the procedure part to be made zero. The duration of SEE is 03 hours