3. To create a product landing page for a fictional product or an existing one.

HTML to be used
to structure the page and CSS to style the layout, typography, buttons, and images. Main
focus to be on creating an engaging page that effectively showcases the chosen product.

4. To incorporate CSS animation effects into a web page. Use CSS transitions, transforms, and
keyframe animations to add interactive and engaging elements to the website. Create
animations for hover effects, scrolling effects, image sliders, or menu transitions.

5. Redesign an existing website using HTML and CSS. Analyze the original design and propose
improvements to the layout, typography, color scheme, and overall user experience.

6. Create a webpage layout using CSS Flexbox or CSS Grid. Design a responsive layout that
organizes content in a visually appealing way. Experiment can be performed with different
grid or flexbox properties to create flexible and responsive designs.

7. To design and style an interactive form using HTML and CSS. They should incorporate
various form elements such as text inputs, checkboxes, radio buttons, and select dropdowns.
Apply CSS styling to improve the form's visual appearance and user experience.

Note: The assignments listed below are illustrative examples and not an exhaustive list. They serve as
a starting point to cover various aspects of the course.

Suggested Readings.

1. Mastering HTML, CSS & Java Script Web Publishing, Laura Lemay, Rafe Colburn, Jennifer
Kyrnin, BPB Publication.
2. Web designing and development, Satish Jain, BPB Publications.
3. HTML & CSS: Thecompletereference, Thomas Powell, McGraw Hill education.
4. Web programming with HTML5, CSS and JavaScript, John Dean, Joneas and Bartlet
learning.
5. SamsTeachYourself HTML, CSS, and JavaScript AllinOne, Julie C Meloni, Pearson
Education.
6. Learning Web App development, Semmy Purewal, O’Reilly.

Semester - III
Paper Paper type Paper name Credit Contact hours
Theory Data Structure 3 45
DSC/CC-3 Practical Data Structure Lab 1 30
DSC/CC-4 Theory Computer Architecture & 3 45
Organization
Practical Computer Architecture & 1 30
Organization lab
SEC – 3 Theory Mobile App Development 2 30
Practical Mobile App Development lab 2 45

CMSM - Theory: Data Structure

23 | P a g e
DSC/Core Course-3, Theory, Semester – 3, Credits - 03, Contact hours - 45.

Introduction to Data Structure 01 hour

Abstract Data Type.
Arrays 02 hours
Multi-dimensional Arrays, Sparse Matrices. Polynomial representation
Linked Lists 08 hours
Introduction to Linked Lists:Definition and importance, Comparison with arrays,
applications of linked lists.
Types of Linked Lists: Singly, Circular and Doubly Lists, Polynomial
representation, Basic Operations: Creation of a singly connected linked list,
traversing a linked list, Insertion into a linked list, deletion from a linked list.
Stacks 04 hours
Array and linked representation of stack, Prefix, Infix and Postfix expressions, utility
and conversion of these expressions from one to another, evaluation of postfix and
prefix expression using stack, applications of stack, limitations of Array
representation of stack.
Queues 04 hours
Array and Linked representation of Queue, Circular Queue, De-queue, Priority
Queues.
Recursion 04 hours
Developing Recursive Definition of Simple Problems and their implementation;
Advantages and Limitations of Recursion; Understanding what goes behind
Recursion (Internal Stack Implementation), Tail recursion.
Trees 12 hours
Introduction to Tree as a data structure: Binary Trees (Recursive and Iterative
Traversals), Binary Search Tree (Traversal, Insertion, Deletion and Searching),
Threaded Binary Trees (Traversal and advantages).
Searching and Sorting 06 hours
Linear Search, Binary Search, Comparison of Linear and Binary Search with respect
to time complexity, Selection Sort, Bubble sort, Insertion Sort, Merge Sort, Quick
sort, Heap sort, Shell Sort, Radix sort, Comparison of Sorting Techniques with
respect to time complexity.

Hashing 04 hours
Introduction to Hashing, Different hashing Techniques, Collision and resolving
collision by Open Addressing, Closed Hashing, Separate Chaining, Choosing a Hash
Function.

CMSM - Practical: Data Structure Lab

DSC/Core Course-3, Practical, Semester – 3, Credits - 01, Contact hours - 30.
Platform/Compiler: GCC
Lab based on Data Structure theory except Threaded Binary Tree, Shell Sort, Radix Sort and
hashing.

1. Write a program to search an element from a list. Give user the option to perform Linear or Binary
search.
2. Write a program to sort a list of elements. Give user the option to perform sorting using Insertion
sort, Bubble sort or Selection sort.
3. Implement Linked List. Include functions for insertion, deletion and search of a number, reverse the
list and concatenate two linked lists.

24 | P a g e
4. Implement Doubly Linked List. Include functions for insertion, deletion and search of a number,
reverse the list.
5. Implement Circular Linked List. Include functions for insertion, deletion and search of a number,
reverse the list.
6. Perform Stack operations using Linked List implementation.
7. Perform Stack operations using Array implementation.
8. Perform Queue operations using Array and linked list implementation.
9. Create and perform different operations on Double-ended Queues using Linked List
implementation.
10. Write a program to scan a polynomial using linked list and add two polynomials.
11. Write a program to create a Binary Search Tree and include following operations in tree:
(a) Insertion (Recursive and Iterative Implementation).
(b) Deletion.
(c) Search a node in BST.
(d) Display its preorder, postorder and inorder traversals recursively.
(e) Display its preorder, postorder and inorder traversals Iteratively.
(f) Display its level-by-level traversals.
(g) Count the non-leaf nodes and leaf nodes.
(h) Display height of tree.
(i) Create a mirror image of tree.
12. Write a program to reverse the order of the elements in the stack using additional stack.
13. Write a program to reverse the order of the elements in the stack using additional Queue.

Note: These are only sample programs; more can be included related to the theory.

Text/ Reference Books

1. Fundamentals of Data Structures in C, Horowitz, Sahni, Anderson-Freed, University Press.

2. Data Structures: A Pseudocode approach with C, Gilberg and Forouzan, Cengage Learning.
3. Data Structure using C, E Balagurusamy, McGraw Hill.
4. Data Structures Using C and C++, Aaron M. Tanenbaum, M J. Augenstein, Langsam, PHI.
5. Classic Data Structures, Debasis Samanta, Second Edition, EEE, PHI.
6. Data Structures, Seymour Lipschutz, Schaum's Outlines, Tata McGraw Hill.
7. Data Structures Through C (A practical approach), G.S Baluja, Dhanpat Rai & Co.

CMSM - Theory: Computer Architecture & Organization

DSC/Core Course-4, Theory, Semester – 3, Credits - 03, Contact hours - 45.
Basic Structure of Computers (Qualitative discussion) 2 hours
Basic functional units, basic operational concept, bus structure, software, performance,
multiprocessor and multicomputer, IAS Computer, Historical Perspectives.
Register Transfer and Micro-operation
Register transfer language, register transfer, bus and memory transfers, three state bus 4 hours
buffers, memory transfer, arithmetic and logical micro-operations, shift and arithmetic
shifts.
Basic Computer Organization and Design
Stored program organization, computer registers, common bus system, timing and 5 hours
control, instruction cycle, fetch decode, Computer Instructions, register reference
instructions, memory reference instruction, input-output and Interrupt, design of basic
25 | P a g e
computer, design of accumulator logic.
CPU Organization
Arithmetic and Logic Unit (ALU) - Combinational ALU, 2'S complement subtraction 6 hours
unit, Booth’s algorithm for multiplication, restoration division algorithm and hardware.
General register organization, control word, accumulator based, register based, Stack
type CPU organization.
Control Unit
Hardwired Control Unit (basic concept), Micro-programmed Control Unit: Control 6 hours
memory, address sequencing, conditional branching, mapping of instructions,
subroutine.
CPU Registers
Program Counter, Stack Pointer Register, Memory Address Register, Instruction 4 hours
Register, Memory Buffer Register, Flag registers, Temporary Registers.
Instructions.
Operational code, operands, zero, one, two and three address instruction, instruction 5 hours
types, addressing modes, data transfer and manipulation instructions, Program control
instructions.
CISC and RISC processors 1 hour
Introduction, relative merits and De-merits.
Computer Peripherals 3 hours
VDU, Keyboard, Mouse, Printer, Scanner (Qualitative approach).
Input / Output Organization: Polling, Interrupts, subroutines, memory mapped I/O,
I/O mapped IO, DMA, I/O bus and protocol, SCSI, PCI, USB, bus arbitration. 4 hours
Memory
Primary memory: ROM, PROM, EPROM, EEPROM, Flash memory, SRAM, DRAM, 5 hours
Cache Memory: mapping functions, replacement algorithms, interleaving, hit and rate
penalty, virtual memories, address translation, memory management requirements,
Secondary Storage: Solid State drives (SSD), Magnetic hard disks, Optical disks,
magnetic tape systems.

Computer Organization Lab.

CMSM -DSC/Core Course-3, Practical, Credits: 01, Contact hours:30.
(1). Construct an Arithmetic Unit capable of performing 4-bit subtraction and Addition using 2's
complement method. Use Parallel Adders and other necessary logic gates.
(2). Construct a 2-bit logical unit using logic gates capable of performing 2-bit, Bitwise ORing,
ANDing, XORing and inversion
(3). Construct a 4-bit ALU unit which can perform the following operation;

Selection Function
S1 S0
0 0 Addition
0 1 Subtraction
1 0 XOR-ing
1 1 Complement

(4). Construct a 2-bit Carry Look Ahead (CLA) Adder using logic gates.
(5). Study and construct a 1-digit BCD/Decimal adder using parallel adders and other necessary logic
gates.
(6). Construct a Binary Multiplier using basic logic gates.
(7). Subtraction with 1's complement method using parallel adders and logic gates(necessary).

26 | P a g e
(8). Construction of BCD Subtractor with 9'S complement method using parallel adders.
(9). Construction of BCD Subtractor with 10'S complement method using parallel adders.
(10). Binary magnitude comparators (up to 4 bits) using parallel adder and logic gates.
(11). Cascading of 4-bit parallel adder (7483/74283) to construct an 8-bit adder circuit.
(12). Construct a Serial in Serial out 2/4-bit register.
(13). Construct a 2-bit Universal Shift register.
(14). Construct a 2/4-bit ring counter using edge triggered D Flip-Flops.
(15). Construct a 4 - bit Johnson Counter.
(16). Horizontal and Vertical Cascading of Memory modules (7489/74189).
(17). Code converters using memory modules.

Text/Reference Books
1. Computer System Architecture, Morries Mano, Pearson.
2. Computer Organization & Architecture, Williams Stallings, Pearson.
3. Computer Organization, Hamacher, Vranesic and Zaky, McGraw Hill.
4. Computer Architecture and Organization, Govindrajalu, Tata McGraw Hill.
5. Computer Architecture and Organization, J P Hayes, Tata McGraw Hill.
6. Structured Computer Organization, Andrew S. Tanenbaum, Austin, Pearson.

Note: Laboratory work must be conducted using integrated circuits on a breadboard, along with other
necessary devices and equipment.

CMSM - Theory: Mobile Application Development

SEC-3 Course, Theory, Semester – 3, Credits - 02, Contact hours - 30.

Mobile App development using Flutter and Dart

Introduction to Flutter
Introducing Flutter, defining widgets and elements, understanding Widget lifecycle 02 hours
events, understanding the Widget tree and the element tree, Installing the Flutter SDK,
Android Setup: Install Android Studio, Setup the Android Emulator.

Creating Your First Flutter App

02 hours
Setting Up the Project, using hot reload, using themes to style your App, understanding
Stateless and Stateful Widgets, using external packages.
Learning Dart basic

Purpose of DART and its use, Commenting code, Running the main() entry Point,
referencing variables, declaring variables, using Operators, using flow statements, 04 hours
using functions, Import packages, using classes, Implementing Asynchronous
Programming.
Creating Starter Project Template
02 hours
Creating and Organizing Folders and Files, Structuring Widgets.
Widget Tree

Introduction to Widgets, Building the Full Widget Tree, Building a Shallow Widget 02 hours
Tree

27 | P a g e
Using Common Widgets

Using basic widgets, using Images and Icons, using decorators, using the Form Widget 02 hours
to validate text fields, checking orientation.
User Interface (UI) Development

Animation: Animated container, Crossfade, Opacity, controller.

Navigation: Using navigator, Hero Animation, Bottom navigation bar, Bottom app
bar, Tabbar and view. 08 hours
Scrolling: Card, list view, list tile, Gridview, using Stack.
Layout: High level view of layout, Creating layout.
Interactivity: Set up Gesture detector, Draggable and Dragtarget Widgets, Moving
and Scaling, Dismissible Widget.

Finalizing App development

Understanding the JSON Format, Using Database Classes to Write, Read, and Serialize 08 hours
JSON, Formatting Dates, sorting a list of dates, Retrieving Data with the
FutureBuilder, Building the Journal App, Adding the Journal Database Classes,
Adding the Journal Entry Page, Finishing the Journal Home Page.

Adding Firebase and Firestore Backend

Introduction to Firebase and Cloud Firestore, Structuring and Data Modelling Cloud
Firestore, Viewing Firebase Authentication Capabilities, Viewing Cloud Firestore
Security Rules, Configuring the Firebase Project, adding a Cloud Firestore Database
and Implementing Security, Building the Client Journal App,
Adding Authentication and Cloud Firestore Packages to the Client App, Adding Basic
Layout to the Client App, Adding Classes to the Client App.

CMSA- Practical: Mobile App Development

SEC-3, Practical, Semester – 3, Credits - 02, Contact hours - 45.

Here are some practical assignments for mobile app development using Flutter:

1. Basic Flutter Mobile App

- Create a simple Flutter app with a single screen that displays "Hello, Flutter!".
- Add a button that changes the text to "Hello, World!" when pressed.

2. Personal Profile MobileApp

- Develop an app that displays your personal profile, including your name, photo, and a brief bio.
- Use different Flutter widgets such as `Container`, `Row`, `Column`, and `Text`.

3. Weather MobileApp
- Develop a weather app that fetches and displays weather information for a given location.
- Use an API like OpenWeatherMap or any other suitable and display the data using Flutter widgets.

4. Quiz MobileApp
- Create a quiz app with multiple-choice questions.
28 | P a g e
 - Show the user's score at the end of the quiz.
- Use `ListView` for displaying questions and options.

5. Photo Gallery Mobile App

- Develop a photo gallery app that displays images from a user's device.
- Implement features like viewing images in full screen, deleting, and sharing images.

Optional (App development for practice)

1. Simple Calculator
- Build a basic calculator app that can perform addition, subtraction, multiplication, and division.
- Use `TextField` for input and `RaisedButton` for operations.

2. Todo List App

- Create a todo list app where users can add, edit, and delete tasks.
- Use a `ListView` to display the list of tasks.

3. Recipe App
- Create a recipe app that displays a list of recipes.
- Each recipe should have a detail page with ingredients and instructions.
- Implement navigation between the list and detail pages.

4. Notes App
- Build a notes app where users can create, view, edit, and delete notes.
- Use local storage (e.g., `SharedPreferences` or `sqflite`) to save the notes.

5. Expense Tracker
- Develop an expense tracker app that allows users to log their expenses.
- Display a summary of expenses by category and date.
- Use charts to visualize spending patterns.

6. E-commerce App
- Develop a simple e-commerce app with a product list and product detail pages.
- Implement a shopping cart where users can add products and proceed to checkout.

7. Chat App
- Build a basic chat application with a login screen and a chat screen.
- Use a backend service like Firebase for real-time messaging.

8. Fitness Tracker
- Create a fitness tracker app that logs workout activities.
- Display statistics like total time spent, calories burned, and workout history.

9. Music Player
- Create a music player app that can play audio files from the device.
- Implement basic controls like play, pause, next, and previous.

10. Travel Guide App

- Build a travel guide app that provides information about different travel destinations.
- Include features like a map view, destination details, and user reviews.

29 | P a g e
Reference books and other resources
1. Flutter Complete Reference by Alberto Miola
2. Beginning Flutter: A Hands-On Guide to App Development by Marco L. Napoli
3. Flutter in Action by Eric Windmill
4. Flutter for Beginners by Thomas Bailey and Alessandro Biessek
5. Pragmatic Flutter by Priyanka Tyagi
6. Online documentations by Google on Flutter: https://docs.flutter.dev/

Semester - IV
Paper Paper type Paper name Credit Contact hours
Theory Computational Mathematics 3 45
DSC/CC-5 Practical Computational Mathematics lab 1 30
using C Lab
Theory Microprocessor and its Applications 3 45
DSC/CC-6 Practical Microprocessor – 8085 Lab 1 30
Theory Operating System 3 45
DSC/CC-7 Practical Operating System Lab 1 30
Theory Object Oriented Programming 3 45
DSC/CC-8 Practical Object Oriented Programming lab 1 30

Semester - 4
CMSM- Theory: Computational Mathematics
DSC/Core Course-5, Theory, Semester – 4, Credits - 03, Contact hours - 45.

Introduction 08 hours
Set Theory: Finite and Infinite Sets, Uncountable Infinite Sets, Relations: Properties
of Binary Relations, Closure, Partial Ordering Relations, Equivalence, Functions:
definition, one-to-one, onto and invertible, Mathematical Functions: Exponential and
Logarithmic, Counting: Mathematical Induction, Pigeonhole Principle, Permutation
and Combination, Binomial Theorem, Principle of Inclusion and Exclusion.

Introduction to Probability 08 hours

Elementary events, Sample space, Classical and Axiomatic definition of Probability,
Theorems on Total Probability, Conditional Probability, Bernoulli Trials and
Binomial Distribution, Bayes’ Theorem, Random Variables, Expectation, Variance,
Standard Deviation.

Growth of Functions 04 hours

Asymptotic Notations, Standard notations and common functions with simple
30 | P a g e