NIRMA UNIVERSITY, INSTITUTE OF TECHNOLOGY

Proposed Teaching & Examination Scheme

Bachelor of Technology (Computer Science and Engineering)
SEMESTER – VI

Department Elective–II
Sr. Course Title L T P C
No
1 Internet of Things 3 0 2 4
2 UI-UX Design 3 0 2 4
3 Advanced Data Structures 3 0 2 4
4 Network Security# 3 0 2 4
5 Contemporary Programming 3 0 2 4
6 Graph Theory 3 0 2 4
7 Mobile Application Development 3 0 2 4
8 VLSI Programming** 3 0 2 4
9 Deep Learning 3 0 2 4
10 Introduction to Game Development 3 0 2 4

** VLSI Programming will not be offered to the students who have opted for a Minor in VLSI.

#Students who have opted for a Minor in Cyber Security will not be permitted to select this
department electives course.
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: Internet of Things
Course Type: Department Elective-II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. summarise the architectural components and platforms of the IoT ecosystem (BL2)
2. apply appropriate access technology and protocols as per the application (BL3)
requirement
3. appraise the role of big data, cloud computing, and data analytics in a typical IoT (BL5)
system
4. design applications with suitable lightweight data processing and communication (BL6)
Methodologies.

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction, applications, need and scope of IoT, IoT reference model 07
and Various IoT architectures, functional stack, Processors, and
Operating Systems for resource-constrained devices
Unit-II M2M Communication, Sensors and actuators, smart objects, 12
Connecting objects, protocols, and access technologies like
IEEE802.15.4, LoRaWAN, LTE-M, BLE, NB-IoT, Sigfox
Unit-III IoT network layer, 6LoWPAN, IPv6: IPv6 structure, addressing, 07
routing, interconnecting issues, 6LoWPAN: forwarding, addressing,
header compression, neighbor discovery, Routing in LLN, RPL
Unit-IV Application layer protocols, CoAP, MQTT, AMQP, XMPP, Integrating 09
Internet Services with Interoperable data encoding with XML, JSON,
and CBOR, Sensor data models and representation, lightweight web
services for IoT
Unit-V Data analytics for IoT, machine learning, Big Data Analytics tools like 07
NoSQL, and Hadoop, Securing IoT, Challenges in IoT security,
provisions for securing IoT network
Unit-VI Case studies on IoT applications: Connected Vehicles and Autonomous 03
Vehicles, Industrial IoT, IoMT (Internet of Medical Things), Smart Grid

Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents
 Suggested Readings/ References:
1. David Hanes, G. Salgueiro, IoT Fundamentals - Networking Technologies, Protocols,
and Use Cases for Internet of Things, Cisco Press
2. Jean-Philippe Vasseur, Adam Dunkels, Interconnecting Smart Objects with IP: The Next
Internet, Morgan Kaufmann
3. Pethuru Raj, Anupama Raman, The Internet of Things - Enabling Technologies,
Platforms and Use Cases, CRC Press
4. Robert Stackowiak, Art Licht, VenuMantha and Louis Nagode, Big Data and The
Internet of Things, Apress
5. Peter Waher, Learning Internet of Things, Packt Publishing Ltd
6. Daniel Kellmereit, Daniel Obodovski, The Silent Intelligence: The Internet of Things,
DND Ventures
7. Olivier Hersent, David Boswarthick, Omar Elloumi, The Internet of Things: Key
Applications and Protocols, Wiley

Suggested List of Experiments:

Sr. Title Hours
No.
1 Building basic electronic circuits using various components and exploring 02
ESP8266, ESP32, and Arduino IDE.
2 Programming the boards – ESP, Arduino 02
3 Access sensors and control actuator using HTTP protocol 02
4 Interfacing temperature and ultrasonic sensor with micro-controller 04
5 Integrating Bluetooth, RFID, and LoRa transceivers with different IoT 04
platforms
6 Upload sensor data to a cloud platform 02
7 Publish and Subscribe with MQTT 04
8 Application development using COAP 04
9 Interfacing IoT boards with platforms like IFTTT 02
10 Simulate IoT network on Cooja Simulator focusing on 6LowPAN 04
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: UI-UX Design
Course Type: Department Elective-II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4
Course Learning Outcomes (CLO):
At the end of the course, the students will be able to –
1. explain the iterative user-centered design of graphical user interfaces (BL2)
2. apply the user Interfaces to different devices and requirements (BL3)
3. evaluate UX design, including information modelling, requirement gathering, and (BL5)
content management
4. create high-fidelity visual designs by converting wireframes, incorporating (BL6)
principles of Gestalt Theory, and considering various screen types.

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction to UI/UX: What is User Interface Design (UI) -The 12
Relationship Between UI and UX, Roles in UI/UX, A Brief Historical
Overview of Interface Design, Interface Conventions, Approaches to
Screen Based UI, Template vs Content, Formal Elements of Interface
Design, Active Elements of Interface Design, Composing the Elements
of Interface Design, UI Design Process, Visual Communication design
component in Interface Design
The foundation of UX design: Good and poor design, Understanding
Your Users, Designing the Experience, Elements of User Experience,
Visual Design Principles, Functional Layout, Interaction design,
Introduction to the Interface, Navigation Design, User Testing,
Developing and Releasing Your Design, Information architecture and
sitemaps, User journey maps, Interaction design: task flows, Overview
of grids & page types, Developing low/high fidelity wireframes
Unit-II User Research: Role of research in the UX design process, Overview 08
of research methods, Introduction to heuristic testing, Reading user
personas and empathy maps.
Unit-III Visual Design and UI: Principles of visual design, including Gestalt 07
Theory, Colour & typography for UI, Interactions and micro-
interactions, understanding various sections of a screen (Web, iOS and
Android), Converting wireframes into high fidelity visual design,
Design for devices: understanding web & mobile
Unit-IV UX Strategy: Information modelling: hierarchies and relationship 08
Gathering requirements, working with content: inventory, sorting,
schema, labelling, way-finding, Overview of e-commerce platforms,
 Understanding mobile apps, Design process, Introduction to project
management
Unit-V Brand Experience Design: Brand strategy: business goal, purpose, 10
values, audience, persona and positioning, Elements of visual identity:
typography, colour, iconography, patterns, Visual design for various
page types
Introduction to design system: elements, components, patterns, pages
and assets, and portfolio development.
Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents

Suggested Readings/ References:

1. Russ Unger and Carolyn Chandler, A Project Guide to UX Design: For user experience
designers in the field or in the making, New Riders Publishing.
2. Jesse James Garrett, The Elements of User Experience: User-Centred Design for the
Web and Beyond, Second Edition, Pearson Education.
3. Wilbert O. Galitz, The Essential Guide to User Interface Design: An Introduction to GUI
Design Principles and Techniques, Wiley.

Suggested List of Experiments:

Sr. No. Title Hours
1 Working on a visual design that includes lines, spaces, textures, negative 02
spaces, spacing, Font properties, Colors, and Filling empty parts with
visuals.
2 Identify some key UX influencers and try to categorize them into one or two 04
of the quadrants.
3 Recreating an excellent existing design pixel-for-pixel, Filters, Sort UI 02
4 Identify and implement Content Strategy related concepts 02
5 To implement a personal learning project. 02
6 To design a portfolio project using UI-UX 04
7 A real app or site. - design 1-3 screens of an app/website. 02
8 To design a Product Page for an e-commerce website 04
9 To design a Portfolio Site Splash Page 04
10 To design a Pricing Page for a SaaS Startup 04
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: Advanced Data Structures
Course Type: Department Elective-II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. interpret the trade-offs involved in choosing between different data structures (BL2)
2. apply advanced data structures to solve real-world problems (BL3)
3. analyse the time and space complexity of algorithms (BL4)
4. design and implement advanced data structures. (BL6)

Unit Contents Teaching

Hours
(Total 45)
Unit-I Search Trees: Models of Search Trees, Properties and transformations, 09
height of search tree, basic find, insert and delete, returning from leaf to
root, dealing with non-unique keys, queries for keys in an interval,
building optimal search trees, converting trees to lists, removing a tree.
Unit-II Balanced Search Trees: Height-balanced and weight-balanced trees, 09
B-trees, Red Black Trees and Trees of almost optimal height, Finger
trees and level linking, trees with partial rebuilding, Splay Trees, Skip
Trees, Joining and Splitting Balanced Search Trees.
Unit-III Tree Search for Set of Intervals: Interval Trees, Trees for the union 09
of intervals, trees for sums of weighted intervals, trees for interval-
restricted maximum sum queries, orthogonal range trees, higher
dimensional segment trees, other systems of building blocks, range
counting and semigroup model, Quad-tree, kd–trees and related
structures.
Unit-IV Heaps: Array-based heaps, heap-ordered trees and half-ordered trees, 09
Leftist Heaps, Skew heaps, Binomial heaps, changing keys in heaps,
Fibonacci heaps, heaps of optimal complexity, Double ended heap
structures and multidimensional heaps, heap-related structures with
constant time updates.
Unit-V Union – Find and related structures: Union – Find, Union Find with 06
copies and dynamic segment trees, list splitting, Problems on root-
directed trees, maintaining a linear order
Data Structure Transformations: Making structures dynamic and
persistent
Unit-VI Hashing and dictionary operations: Static & Dynamic Hashing 03
techniques, Tries and compressed tries, Dictionaries allowing errors in
queries, Suffix Trees, Suffix arrays
Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents

Suggested Readings/ References:

1. Peter Brass, Advanced Data Structures, Cambridge University Press
2. Suman Saha, S. Shukla, Advanced Data Structures: Theory and application, CRC press
3. A.A. Puntambekar, Advanced Data Structures, Technical Publications

Suggested List of Experiments:

Sr. Title Hours
No.
1 Implement shadow copying technique for STACK data structure to solve the 02
MAXZISE problem.
2 Implement a balanced binary search tree (AVL). The search tree operations 04
create, insert, delete, and display should be included. The input for creating
the tree should be taken from a text/CSV file.
The content of the file should be a unique key-object pair.
3 Rebalancing operations can be delayed until a certain threshold is attained. 04
The scapegoat tree uses partial rebuilding to balance a search tree. Implement
a scapegoat tree to demonstrate the partial rebuilding operation.
4 Skip list structures are used to retrieve the data faster. Implement the 02
structure up to the third level. Show the effect of the insert and delete
operation.
5 Write a program to split a balance search tree at 04
i. Root ii. A given point of split.
6 Segment trees are useful for finding the range sum of a given interval. Write 02
a program to demonstrate the usage of the segment tree structure to find the
range sum of numbers in a given range. Example: Given
Index 0 1 2 3 4 5 6 7 8 9
Data 2 3 4 5 6 7 8 9 10 11

Sum (0,4) = 20
Sum (2,6) = 30
7 Implement heap data structure using linked list structure. The list should 04
retrieve high-priority objects every time the extract operation is performed.
8 Write a program to implement a union-find structure. The program should 04
demonstrate the structure representation of the set and list the items of the
selected set.
9 Suffix arrays are preprocessed structures that can be used to solve the 02
classical substring matching problem. Implement suffix arrays for a long
string sequence and demonstrate the matching operation.
10 Hash tables are important data structures. However, hash tables are subject 02
to collision. Implement a program with a collision resolution technique with
Insert, delete, and display operation
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: Network Security
Course Type: Department Elective–II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. demonstrate a clear understanding of fundamental network security concepts, (BL2)
terminologies, and principles
2. analyse common network security threats, vulnerabilities, and attack vectors (BL4)
3. explain the principles of cryptography and apply cryptographic techniques to (BL5)
protect data and communications
4. develop security policies and procedures to ensure compliance with relevant (BL6)
standards and regulations

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction to Network Security: Introduction to network security 05
concepts and terminology, The importance of network security in
modern technology, Overview of security policies and procedures,
introduction to Cryptography
Unit-II Information Security: Fundamentals of cryptography, Symmetric and 10
asymmetric encryption, Block Ciphers and DES, Advanced Encryption
Standard (AES), Block Cipher Operations, Pseudo Random Number
Generation and Stream Ciphers, Diffie Hellman Key Exchange, CRT
Problem, RSA
Unit-III Network Threats and Defence: Types of network threats: malware, 10
phishing, DoS, etc., Attack vectors and methods, Intrusion Detection
Systems (IDS) and Intrusion Prevention Systems (IPS), Understanding
firewalls: types, technologies, and configurations, Access control and
security policies.
Unit-IV Network Security: Secure Socket Layer (SSL) Architecture and 10
working, Transport Level Security (TLS) including HTTPS, HTTPS
Use, Secure Shell SSH Protocol, port forwarding Electronic Mail
Security: Email Security Enhancements, Pretty Good Privacy (PGP),
S/MIME, IP Security, IPSec, IPSec key management
Unit-V Virtual Private Networks (VPNs) and Wireless Network Security: 10
VPN principles and types, VPN protocols and encryption, Wireless
network security threats and solutions, Wireless encryption protocols
Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents

Suggested Readings/ References:

1. William Stallings, Cryptography and Network Security: Principles and Practice,
Pearson.
2. D. R. Stinson: Cryptography: Theory and Practice (Discrete Mathematics and Its
Applications), CRC Press.
3. B. Schneier: Applied cryptography: protocols, algorithms, and source code in C, John
Wiley & Sons.
4. Bernard Menezes: Network Security & Cryptography, Cengage Learning.

Suggested List of Experiments:

Sr. Title Hours
No.
1 Implementation and crypt-analysis of shift-based ciphers- Caesar Cipher, 02
ROT-13 cipher)
2 Implementation of Transposition ciphers (Single as well as Multilevel) 02
3 Exploration of various tools to perform encryption and decryption 02
4 Cryptography implementation using block-cipher DES 04
5 Asymmetric Cryptography- Creation of RSA key, RSA encryption and 04
decryption
6 Simulating the Key Distribution Scenario for Symmetric Key Cryptography 04
using the simulator of your choice
7 Use of Snort/Wireshark tool for Network Intrusion Detection Systems to 04
monitor network traffic and analyze attack patterns
8 Configure and test VPN connections using technologies such as IPsec or 02
OpenVPN
9 Perform vulnerability scans using tools like Nessus or OpenVAS to 04
identify potential security weaknesses.
10 Set up network security monitoring tools to collect and analyze logs for signs 02
of security incidents.
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: Contemporary Programming
Course Type: Department Elective-II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. classify the major programming paradigms (BL2)
2. identify building blocks for various contemporary programming languages (BL3)
3. defend the principles and techniques involved in the design and implementation (BL5)
of modern programming languages
4. develop hands-on skills in contemporary programming languages. (BL6)

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction to Contemporary Languages: Role of programming 05
languages, towards high-level programming languages, problems of
Scale, programming paradigms, Language implementation. The need
for structured programming, syntax-directed control flow, design
considerations
Unit-II Basics of GO: Introduction to GO programming, data types, variables, 10
constants, decision making, looping, functions, arrays, pointers,
structures, slice, maps, range, error handling, strings, basics of module
and tools
Unit-III Kotlin Programming Language: Introduction to Kotlin programming, 10
data types, variables, control flow, class and objects, functions, Basic of
App development using Kotlin, an overview of the standard library,
multiplatform development, and tools
Unit-IV Swift Programming Language: Overview of Swift, Swift 10
Environment, Data Types, Control Flow, Functions, Closures and
Collections, Enumerations and Structures, OOPs, Applications
Unit-V R Programming: Overview, Environment Setup, Basic Syntax, Data 10
Types, Variables, Operators, Decision Making, Loops, Functions,
Strings, Vectors, Lists, Matrices, Arrays, Factors, Data Frames,
Packages, Data Reshaping, File Handling, Error Handling, Data
Interfaces, Data Visualisation, basics of R Charts & Graphs and R
Statistics

Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents
Suggested Readings/ References:
1. Sethi R., Programming Languages concepts & constructs, Pearson Education
2. Alan A. A. Donovan, Brian W. Kernighan, The Go Programming Language, O’Reilly
3. Dawn Griffiths, David Griffiths, Head First Kotlin, O’Reilly
4. Aaron Hillegass and Christian Keur, iOS Programming, The Big Nerd Ranch Guide
5. Tilman M. Davies, The Book of R: A First Course in Programming and Statistics, No
Starch Press

Suggested List of Experiments:

Sr. Title Hours
No.
1 Introduction to Contemporary Programming Languages, Syntax 02
Implementation
2 Basics of Go language building blocks 02
3 Develop Golang programs to compare the equality of struct, slice, and map 02
4 Basics of Kotlin Language. 04
5 Application Development using Kotlin Language 04
6 Understand the swift framework 02
7 Basics of Swift Language. 04
8 Application Development using Swift Language 02
9 Learn basics of R Language. 04
10 Data Analysis using R 04
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: Graph Theory
Course Type: Department Elective - II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. explain fundamental graph theory concepts, including graph discovery, (BL2)
definitions, set operations, and matrix representations
2. apply graph theory to solve connected graphs, shortest path, and weighted graph (BL3)
problems
3. analyse properties of trees and graphs with an understanding of combinatorial (BL4)
and geometric aspects
4. elaborate the concepts of graph theory and connect them with applications. (BL6)

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction to Graph Theory: Discovery of graphs, Definitions, and 10
Set Operations on Graphs: Union, Sum, Complement, Difference,
Cartesian Product, Composition, and Fusion. Sub-graphs, Isomorphic
graphs, Matrix representations of graphs, Degree of a vertex, directed
walks, paths, and cycles, Connectivity in digraphs, Eulerian and
Hamilton digraphs, Graphic sequences, Graph-theoretic model of the
LAN problem, Havel-Hakimi criterion, Realization of a graphic
sequence.
Unit-II Connected Graphs and Shortest paths: Connected graphs, Distance, 09
Cut-vertices and cut-edges, Blocks, Connectivity, Weighted graphs, and
shortest paths, Weighted graphs, Djkstra’s shortest path algorithm,
Floyd-Warshall’s shortest path algorithm.
Unit-III Trees: Properties, Pendant Vertices, Distance and Canters in a tree, 09
Rooted and Binary Trees, Counting Trees, Spanning Trees and
Fundamental Circuits, Number of Spanning Trees.
Unit-IV Planar and Dual Graphs: Combinatorial vs. geometric Graphs, Planar 07
Graphs, Kuratwoski Graphs, Theorems, Detection of Planarity,
Geometric and Combinatorial Dual, Thickness, and Crossings.
Unit-V Coloring, Covering, and Partitioning: Basic Definitions, Cliques and 10
chromatic number, Chromatic Polynomials, Mycielski’s theorem,
Greedy coloring algorithm, Coloring of chordal graphs, Brooks
theorem, Edge Colorings, Matchings, Coverings, The four-color
conjecture and five-color theorem.
Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents

Suggested Readings/ References:

1. N. Deo, Graph theory with applications to engineering and computer science, Courier
Dover Publications
2. JA Bondy and USR Murty, Graph theory with applications. Bulletin of the American
Mathematical Society, The Macmillian Press Ltd.
3. Doughlous B. West, Introduction to graph theory, Upper Saddle River, NJ: Prentice Hall.
4. Gary Chartard and Ping Zhang, A First Course in Graph Theory, Courier Corporation.
5. Geir Agnarsson and Raymond Greenlaw, Graph Theory: Modelling Applications, and
Algorithms, Pearson/Prentice Hall.

Suggested List of Experiments:

Sr. Title Hours
No.
1 Use an adjacency matrix and adjacency list to represent the graph. Use any 02
of the representations to find the union, intersection, complement, sum, and
difference of two graphs.
2 Write a program to check whether two graphs are isomorphic to each other 04
or not.
3 Use the Havel-Hakimi theorem and check whether the given degree 02
sequence is graphical or not.
4 Write a program to find all the spanning trees of a complete directed graph. 04
5 Write a program to find the minimum cut edges from a given graph. (Use 02
Kerger’s Algorithm).
6 Write a program to find all the articulation points from a given graph. (Use 04
DFS tree)
7 Write a program to check whether the graph is planar or not. Apply 04
elementary reduction and check for the resultant three conditions of
planarity.
8 Write a program to find the maximum clique from a given graph. 04
9 Write a program to find the chromatic number of a given graph. 02
10 Write a program to apply a four-color conjecture to the LAN topology 02
represented graphically.
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: Mobile Application Development
Course Type: Department Elective-II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. explain the mobile application development approaches, platforms, tools, and (BL2)
development environment
2. make use of basic building blocks, user interface components, and communication (BL3)
components to develop mobile applications
3. develop Android applications through database storage and data sharing (BL6)
4. elaborate the use of advanced APIs related to sensors, web, networks, and location-
(BL6)
based services.

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction to Mobile Application Development: Mobile Operating 05
Systems, Mobile Application Development Approaches, Mobile
Applications Development Platforms
Introduction to Android: The Android Platform, Android Studio,
Android SDK, Android Installation
Unit-II Android Application Design Essentials: Android Context, Activities, 12
Intents, Receiving and Broadcasting Intents, Services, Android
Manifest File, Intent Filter and Permissions
Android User Interface Design Essentials: User Interface Elements
and Designing User Interface with Layouts
Notifications and Alarms: Performance and Memory Management,
Android Notifications and Alarms
Unit-III Storing and Retrieving Data: Synchronization and Replication of 10
Mobile Data, Storing and Retrieving data from SQLite, Working with
Content Provider, Reading and Writing to Contacts
Unit-IV Graphics: Performance and Multithreading, Graphics and UI 08
Performance, Android Graphics, Android Multimedia, Accessing
Device Sensors, Accessing Camera, Data and Files, Working with
Videos, Images and Audio.
Unit-V Communications via Network and the Web: Communications 10
Model, Android Networking and Web Telephone, Wireless
Connectivity and Mobile Apps, Android Telephony
Mobility and Location-Based Services: Working Offline Sync and
Caching, Android Field Service App
Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents

Suggested Readings/ References:

1. Brian and Bill Phillips, ‘Android Programming: The Big Nerd Ranch Guide (Big Nerd
Ranch Guides)’, Addison-Wesley
2. Griffiths, Dawn, and David Griffiths. ‘Head First Android Development’, O’Reilly
Media.
3. Reto Meier, Professional Android 4 Application Development, Wrox Publication
4. Afreen C. Firza, ‘Mobile Applications Development’, Book Rivers
5. Wei-Meng Lee, Beginning Android 4 Application Development, Wrox Press
6. Greg Nudelman, Android Design Patterns, Interaction Design Solutions for Developers,
John Wiley & Sons

Suggested List of Experiments:

Sr. Title Hours
No.
1 To configure and understand the Android structure and IDE tool with 02
Android Studio.
Description: Make sure you have installed at least 2 Android APIs and run
the Hello World program on virtual and real devices.
2 To design and develop a basic level calculator that includes input items from 04
the user and performs operations, namely addition, subtraction,
multiplication, and division, and displays the results to the user.
3 To develop an application, use list view to list out some items on the screen. 02
By selecting any of the items, the system displays complete information
about that item.
4 To develop an application using spinner view to list some items on the screen 02
by selecting any of the items, the system displays complete information
about that item. Also, the addition and deletion of the items from the spinner
view are shown.
5 To create a user-defined notification for some broadcast event that occurred. 02
(either system event or user-defined events you can consider)
6 To create a user-defined notification for some broadcast event that occurred. 02
(either system event or user-defined events you can consider)
7 To implement a Database in Android - using SQLite (Local Database) 06
To Design a database application that has the following functionalities:
a) Implement a database-oriented application for mobile: Create a database,
create a minimum of two tables, and then show the following operation:
i) Addition of records,
ii) Updating of records,
iii) Deletion of records,
iv) retrieving of records based on some criteria searching for records
b) Show the Navigation of records through first, last, previous, and next
operations.
8 To design an app that implements an animated welcome activity of your 04
application, which shows some kind of animation using a multithreading
concept.
9 To demonstrate Parsing: design an app that uses JSON Parsing 04
(retrieving data from a server) for an application to fetch data from a
remote server to a local system.
10 To design an app that shows the user’s current location on Google Maps. 02
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: VLSI Programming
Course Type: Department Elective-II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4
Course Learning Outcomes (CLO):
At the end of the course, the students will be able to –
1. identify the various VLSI design styles, approaches, and IC fabrication design process(BL3)
2. analyse the CMOS-based circuit design (BL4)
3. design the various digital VLSI circuits (BL6)
4. develop the verification and testing of the VLSI circuit. (BL6)

Unit Contents Teaching

Hours
(Total 45)
Unit-I Fundamentals of VLSI: Introduction of VLSI, Historical 10
perspective, Objective and organization, Overview of VLSI Design
Methodologies, VLSI design flow, Design Hierarchy, Concept of
Regularity, Modularity and Locality, VLSI design Styles, Design
Quality, Packaging Technology, CAD Technology
Unit-II MOSFET Basics: Basics, V-I Characteristics, MOSFET scaling, 10
Small-geometry effects, MOSFET capacitances, Switching in
MOS, Challenges with MOS, MOS Alternate Technologies, Low
Power Technology
Unit-III VLSI Design fundamentals: Combinational and sequential MOS 10
logic circuit designs
Unit-IV VLSI Verification: Need for verification, Test bench, verification 10
language, simulation tool, functional and code coverage.
Unit-V VLSI Testing: Need of testing, roles of testing, fault methods, 05
Introduction to High-level synthesis.

Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents
Suggested Readings/ References:
1. Sung-Mo Kang, Yusuf Leblebici, CMOS Digital Integrated Circuits Analysis & Design,
McGraw Hill
2. M. Bushnell, Vishwani Agrawal, Essentials of Electronic Testing for Digital, Memory
and Mixed-Signal VLSI Circuits, Springer
3. Samir Palnitkar, Verilog HDL, SunSoft Press

Suggested List of Experiments:

Sr. Title Hours
No.
1 Introduction of Hardware descriptor language (HDL) simulator. 04
2 Realization of Logic Gates using Verilog HDL 02
3 To design a half adder and a full adder using Verilog HDL 02
4 To design a 4X1 multiplexer using Verilog HDL 04
5 To design a 4-bit parallel adder using Verilog HDL 02
6 Write Verilog code for binary to gray code converter 02
7 To design a Decoder using Verilog HDL. 04
8 To design various Flipflops using Verilog HDL 02
9 To design and verify Logic Gates using Test Bench using Verilog HDL 04
10 To design and verify 4X1 multiplexer using Test Bench using Verilog HDL 02
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech (CSE)
Course Code: XXXX
Course Title: Deep Learning
Course Type: Department Elective-II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. identify the strengths and weaknesses of the deep network (BL3)
2. analyse the suitability of different deep networks for problems in various domains (BL4)
3. interpret the functioning and math behind the deep learning architectures (BL5)
4. design and implement deep networks for solving problems pertaining to computer (BL6)
science and interdisciplinary research.

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction: Introduction to AI, Machine Learning and Deep 05
Learning, basics of supervised and unsupervised learning, gradient
descent, linear regression, Artificial Neural Networks, forward and
backpropagation
Unit-II Convolutional Neural Networks: Fundamentals of CNN, model 15
training and inferencing for classification and regression, hyper-
parameters tuning, state-of-the-art CNN architectures, Transfer
Learning
Unit-III Sequence Learning: Recurrent Neural Networks (RNN), Long 10
short-term memory (LSTM), Gated Recurrent Unit (GRU), Attention
and Transformer Networks
Unit-IV Deep Unsupervised Learning: Auto-encoders, Generative 05
Adversarial Networks (GAN)
Unit-V Reinforcement learning: Markovian Decision Process, Basic 05
Decision problem, Bellman Equation, Q-learning, Deep
reinforcement learning.
Unit-VI Case Studies: Case studies related to image processing, computer 05
vision, video processing, object detection and tracking

Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study content.
Suggested Readings/ References:
1. Zhang, Aston, Dive into deep learning. Cambridge University Press.
2. Glassner, Andrew. Deep learning: a visual approach. No Starch Press
3. Prince, Simon JD. Understanding Deep Learning. MIT Press
4. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press
5. Adam Gibson, Josh Patterson, Deep Learning, O'Reilly Media, Inc.
6. Ronald T. Kneusel, Practical Deep Learning, No starch press.

Suggested List of Experiments:

Sr. Title Hours
No.
1 Kaggle: Titanic – Machine Learning from Disaster 02
2 Basics of Tensorflow and Keras 02
3 Conventional Feed Forward Neural Network on MNIST. 02
Write code using (a) Sequential Class, (b)Model Class API
4 Kaggle: Digit Recognizer (Digit Recognizer Kaggle) 02
5 Kaggle: CIFAR-10 - Object Recognition in Images Use transfer learning. 04
6 Image Segmentation & Detection Using Deep Networks 04
7 Auto Encoders for Dimensionality Reduction 02
8 Build a language model using RNN. Write functions to sample novel 04
sentences and find the probability of the input sentence. Also, the Recurrent
Neural Network was used for Sentiment Analysis.
9 Recurrent Neural Network for Image Captioning 04
10 GAN for MNIST-like image generation 04
 NIRMA UNIVERSITY
Institute: Institute of Technology
Name of Programme: BTech in CSE
Course Code: XXXX
Course Title: Introduction to Game Development
Course Type: Department Elective–II
Year of Introduction: 2024-25

L T Practical Component C
LPW PW W S
3 0 2 - - - 4

Course Learning Outcomes (CLO):

At the end of the course, the students will be able to –
1. infer the design principles of the gaming application (BL2)
2. make use of audio and visual effects in game development (BL3)
3. recommend architectural design using the game development process (BL6)
4. develop games using various game engines. (BL6)

Unit Contents Teaching

Hours
(Total 45)
Unit-I Introduction to gaming: Introduction and History of Games. Game 06
Development Methodologies. Introduction to Game Design Process,
Deconstructing Classic games. Understanding the rules of the classic
games.
Unit-II Basics of Game Designing: 2D environment - Form and Shape, 09
Anatomy and Proportions, Perspective, Breaking Down Color, Lighting
and Shading.2D background - Form and Shape - Anatomy and
Proportions Perspective - Breaking Down Color - Lighting and Shading
- 2D Character Design Primitives – Textures - creating face –
expressions – anatomy - body parts – cartoon making. Introduction to
Unity Game Engine, Intro to Tools & navigation, Terrain system in
Unity, Camera control in Unity, Scene Navigation, Project setting /
Player setting, Game publishing using Unity
Unit-III UI and UX: 2D Platformer builds with assets. Intro to C# programming 10
in Unity Constants and variables, Integers, Floats and Strings, Arrays
and Lists, Arithmetical operators, using if statements, writing while
statements, writing for statements, & all Other Basic C# Concepts in
Unity
Unit-IV Effects: Lighting & Shading in Unity: Material & texturing in Unity, 10
Physics Lighting and Rendering in Unity. Audio in Unity: Working
with Audio Source, Working with Audio Listener
Unit-V 3D Designing: Developing 3D Game using Unity Engine Exporting 10
Assets from 3D Software, Different Types of cameras in Unity,
Character Navigation, 3rd Person Camera movement, Creating Enemy
characters runtime, Animation control in Unity, Graphic User Interface
in Unity, Assigning Properties & Methods for player, Build Simple
Artificial Intelligence for enemy character
 Game Deployment: Usage of appropriate APIs, Containers, and cloud
platforms for the deployment of developed games.

Self-Study:
The self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from self-study contents

Suggested Readings/ References:

1. Hocking, Joseph, Unity in action: multiplatform game development in C, Simon and
Schuster.
2. Aversa, Davide, Unity Artificial Intelligence Programming: Add powerful, believable,
and fun AI entities in your game with the power of Unity, Packt Publishing Ltd,
3. Tynan Sylvester Jaffal Y, Designing Games, A Guide to Engineering Experiences:
O’Reilly
4. Steve Rabin, Introduction to Game Development, Boston, MA, Charles River Media

Suggested List of Experiments:

Sr. No. Title Hours
1 Installation and Setting up Unity 3D & Creating Your First Project 02
2 With Unity: Creating – Sprites, Modifying Sprites, Transform and Object 02
Parenting. Unity: Understanding & Implementation of Collisions, Rigid
bodies & Custom collisions boundaries.
3 Introduction to Audio using Unity – Audio components & Playing a 04
Sound
4-5 Starting with Unity UI- User Interfaces 06
a. Screen Space Overlay
b. Screen Space – Camera
c. World Space
6-7 Unity Insertion of elements in UI 06
a. The Button
b. Text Element
c. The Slider
8-9 Creating AR Content with Vuforia. 06
10 Create a simple rolling ball game in Unity 04