Academic Council

Item No:

UNIVERSITY OF MUMBAI

Syllabus for S.Y.B.Sc.

Programme: B.Sc.
Course: Information Technology
Choice Based Credit and Semester System
with effect from the academic year
2023 – 2024

1
(This page is intentionally left blank)

2
 UNIVERSITY OF MUMBAI

Syllabus for Approval

Sr. No. Heading Particulars

Title of the Programme Bachelor of Science in Information Technology (Second

1
Year)

Ordinance no. O.5051

Eligibility for Admission
2 Circular no. UG/284 of 2007 dated 16th
June 2007
Passing Marks
3 40%

Ordinances / Regulations (if

4 As applicable for all B.Sc. Courses
any)

No. of Years / Semesters

5 Three years – Six Semesters

P.G. / U.G./ Diploma / Certificate

6 Level
( Strike out which is not applicable)

Yearly / Semester
7 Pattern
( Strike out which is not applicable)

Revised / New /Amended

8 Status
( Strike out which is not applicable)

To be implemented from
9 From Academic Year 2023-2024
Academic Year

3
(This page is intentionally left blank)

4
 Semester – 3
Course Code Course Type Course Title Credits
USIT301 Skill Enhancement Course Python Programming 2
USIT302 Core Subject Data Structures 2
USIT303 Core Subject Computer Networks 2
USIT304 Core Subject Operating Systems 2
USIT305 Core Subject Applied Mathematics 2
USIT3P1 Skill Enhancement Course Python Programming Practical 2
Practical
USIT3P2 Core Subject Practical Data Structures Practical 2
USIT3P3 Core Subject Practical Computer Networks Practical 2
USIT3P4 Core Subject Practical Operating Systems Practical 2
USIT3P5 Core Subject Practical Mobile Programming Practical 2
Total Credits 20

Semester – 4
Course Code Course Type Course Title Credits
USIT401 Skill Enhancement Course Core Java 2
USIT402 Core Subject Introduction to Embedded 2
Systems
USIT403 Core Subject Computer Oriented Statistical 2
Techniques
USIT404 Core Subject Software Engineering 2
USIT405 Core Subject Computer Graphics and 2
Animation
USIT4P1 Skill Enhancement Course Core Java Practical 2
Practical
USIT4P2 Core Subject Practical Introduction to Embedded 2
Systems Practical
USIT4P3 Core Subject Practical Computer Oriented Statistical 2
Techniques Practical
USIT4P4 Core Subject Practical Software Engineering Practical 2
USIT4P5 Core Subject Practical Computer Graphics and 2
Animation Practical
Total Credits 20

5
(This page is intentionally left blank)

6
Table of Contents
Python Programming ................................................................................................................................. 11
Data Structures ........................................................................................................................................... 14
Computer Networks .................................................................................................................................... 17
Operating Systems ...................................................................................................................................... 19
Applied Mathematics .................................................................................................................................. 21
Python Programming Practical ................................................................................................................... 24
Data Structures Practical............................................................................................................................. 27
Computer Network Practical ...................................................................................................................... 29
Operating System Practical ......................................................................................................................... 31
Mobile Programming Practical ................................................................................................................... 33
Java Programming ....................................................................................................................................... 37
Introduction to Embedded Systems ........................................................................................................... 39
Computer Oriented Statistical Techniques ................................................................................................. 41
Software Engineering .................................................................................................................................. 44
Computer Graphics and Animation ............................................................................................................ 47
Java Programming Practical ........................................................................................................................ 50
Introduction to Embedded Systems Practical ............................................................................................. 52
Software Engineering Practical ................................................................................................................... 54
Computer Graphics and Animation ............................................................................................................ 55

7
8
SEMESTER III

9
(This page is intentionally left blank)

10
 Python Programming
B. Sc. (Information Technology) Semester – III
Course Name: Python Programming Course Code: USIT301
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objective:
• Interpret the fundamental Python syntax and semantics and be fluent in the use of Python
control flow statements.
• Express proficiency in the handling of strings and functions.
• Determine the methods to create and manipulate Python programs by utilizing the data
structures like lists, dictionaries, tuples and sets.
• Identify the commonly used operations involving file systems and regular expressions.
• Articulate the Object-Oriented Programming concepts such as encapsulation, inheritance
and polymorphism as used in Python.

Unit Details Lectures

I Introduction: The Python Programming Language, History, features,
Installing Python, Running Python program, Debugging : Syntax
Errors, Runtime Errors, Semantic Errors, Experimental Debugging,
Formal and Natural Languages, The Difference Between Brackets,
Braces, and Parentheses,
Variables and Expressions Values and Types, Variables, Variable 12
Names and Keywords, Type conversion, Operators and Operands,
Expressions, Interactive Mode and Script Mode, Order of Operations.
Conditional Statements: if, if-else, nested if –else
Looping: for, while, nested loops
Control statements: Terminating loops, skipping specific conditions
II Functions: Function Calls, Type Conversion Functions, Math
Functions, Composition, Adding New Functions, Definitions and Uses,
Flow of Execution, Parameters and Arguments, Variables and
Parameters Are Local, Stack Diagrams, Fruitful Functions and Void
Functions, Why Functions? Importing with from, Return Values,
Incremental Development, Composition, Boolean Functions, More 12
Recursion, Leap of Faith, Checking Types
Strings: A String Is a Sequence, Traversal with a for Loop, String
Slices, Strings Are Immutable, Searching, Looping and Counting,
String Methods, The in Operator, String Comparison, String
Operations.
III Lists: Values and Accessing Elements, Lists are mutable, traversing a
12
List, Deleting elements from List, Built-in List Operators,

11
 Concatenation, Repetition, In Operator, Built-in List functions and
methods
Tuples and Dictionaries: Tuples, Accessing values in Tuples, Tuple
Assignment, Tuples as return values, Variable-length argument tuples,
Basic tuples operations, Concatenation, Repetition, in Operator,
Iteration, Built-in Tuple Functions
Creating a Dictionary, Accessing Values in a dictionary, Updating
Dictionary, Deleting Elements from Dictionary, Properties of
Dictionary keys, Operations in Dictionary, Built-In Dictionary
Functions, Built-in Dictionary Methods
Files: Text Files, The File Object Attributes, Directories
Exceptions: Built-in Exceptions, Handling Exceptions, Exception with
Arguments, User-defined Exceptions
IV Regular Expressions – Concept of regular expression, various types
of regular expressions, using match function.
Classes and Objects: Overview of OOP (Object Oriented
Programming), Class Definition, Creating Objects, Instances as
Arguments, Instances as return values, Built-in Class Attributes,
12
Inheritance, Method Overriding, Data Encapsulation, Data Hiding
Multithreaded Programming: Thread Module, creating a thread,
synchronizing threads, multithreaded priority queue
Modules: Importing module, Creating and exploring modules, Math
module, Random module, Time module
V Creating the GUI Form and Adding Widgets:
Widgets: Button, Canvas, Checkbutton, Entry, Frame, Label, Listbox,
Menubutton, Menu, Message, Radiobutton, Scale, Scrollbar, text,
Toplevel, Spinbox, PanedWindow, LabelFrame, tkMessagebox.
Handling Standard attributes and Properties of Widgets.
Layout Management: Designing GUI applications with proper Layout
Management features.
12
Look and Feel Customization: Enhancing Look and Feel of GUI using
different appearances of widgets.
Storing Data in Our MySQL Database via Our GUI : Connecting to
a MySQL database from Python, Configuring the MySQL connection,
Designing the Python GUI database, Using the INSERT command,
Using the UPDATE command, Using the DELETE command, Storing
and retrieving data from MySQL database.

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Think Python Allen Downey O’Reilly 1st 2012
st
2. An Introduction to Jason SPD 1 2014
Computer Science using Montojo, Jennifer
Python 3 Campbell, Paul Gries
3. Python GUI Burkhard A. Meier Packt 2015
Programming Cookbook

12
 4. Introduction to Problem E. Balagurusamy TMH 1st 2016
Solving with Python
5. Murach’s Python Joel Murach, Michael SPD 1st 2017
programming Urban
6. Object-oriented Michael H. Pearson 1st 2008
Programming in Python Goldwasser, David Prentice
Letscher Hall
7. Exploring Python Budd TMH 1st 2016

Course Outcome:
After completing the course, the learner will be able to:
CO1: Aware of the variables, expressions, looping and conditions used in Python
programming.
CO2: Implement functions, strings, lists, tuples and directories
CO3: Create GUI forms and add widgets.
CO4: Use MySQL to store data.
CO5: Apply the programming skillset learnt here into various domains by having advance
programming skillset of Python and usage of libraries.

13
 Data Structures
B. Sc. (Information Technology) Semester – III
Course Name: Data Structures Course Code: USIT302
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objective:
• Ability to analyze the performance of algorithms.
• Ability to choose appropriate algorithm design techniques for solving problems.
• Understand how the choice of data structures and the algorithm design methods impact
the performance of programs.

Unit Details Lectures

I Introduction: Data and Information, Data Structure, Classification of
Data Structures, Primitive Data Types, Abstract Data Types, Data
structure vs. File Organization, Operations on Data Structure,
Algorithm, Importance of Algorithm Analysis, Complexity of an
Algorithm, Asymptotic Analysis and Notations, Big O Notation, Big
Omega Notation, Big Theta Notation, Rate of Growth and Big O
Notation.
12
Array: Introduction, One Dimensional Array, Memory Representation
of One Dimensional Array, Traversing, Insertion, Deletion, Searching,
Sorting, Merging of Arrays, Multidimensional Arrays, Memory
Representation of Two Dimensional Arrays, General Multi-
Dimensional Arrays, Sparse Arrays, Sparse Matrix, Memory
Representation of Special kind of Matrices, Advantages and
Limitations of Arrays.
II Linked List: Linked List, One-way Linked List, Traversal of Linked
List, Searching, Memory Allocation and De-allocation, Insertion in
Linked List, Deletion from Linked List, Copying a List into Other List,
Merging Two Linked Lists, Splitting a List into Two Lists, Reversing
One way linked List, Circular Linked List, Applications of Circular
Linked List, Two way Linked List, Traversing a Two way Linked List, 12
Searching in a Two way linked List, Insertion of an element in Two
way Linked List, Deleting a node from Two way Linked List, Header
Linked List, Applications of the Linked list, Representation of
Polynomials, Storage of Sparse Arrays, Implementing other Data
Structures.
III Stack: Introduction, Operations on the Stack Memory Representation
12
of Stack, Array Representation of Stack, Applications of Stack,

14
 Evaluation of Arithmetic Expression, Matching Parenthesis, infix and
postfix operations, Recursion.
Queue: Introduction, Queue, Operations on the Queue, Memory
Representation of Queue, Array representation of queue, Linked List
Representation of Queue, Circular Queue, Some special kinds of
queues, Deque, Priority Queue, Application of Priority Queue,
Applications of Queues.
IV Sorting and Searching Techniques
Bubble, Selection, Insertion, Merge Sort.
Searching: Sequential, Binary, Indexed Sequential Searches.
Tree: Tree, Binary Tree, Properties of Binary Tree, Memory
Representation of Binary Tree, Operations Performed on Binary Tree,
Reconstruction of Binary Tree from its Traversals, Huffman Algorithm, 12
Binary Search Tree, Operations on Binary Search Tree, Heap, Memory
Representation of Heap, Operation on Heap, Heap Sort.
Advanced Tree Structures: Red Black Tree, Operations Performed on
Red Black Tree, AVL Tree, Operations performed on AVL Tree, 2-3
Tree, B-Tree.
V Hashing Techniques
Hash function, Address calculation techniques, Common hashing
functions Collision resolution, Linear probing, Quadratic, Double
hashing, Bucket hashing, Deletion and rehashing
Graph: Introduction, Graph, Graph Terminology, Memory 12
Representation of Graph, Adjacency Matrix Representation of Graph,
Adjacency List or Linked Representation of Graph, Operations
Performed on Graph, Graph Traversal, Applications of the Graph,
Reachability, Shortest Path Problems, Spanning Trees.

Books and References:

Sr. Title Author/s Publisher Edition Year
No.
1. A Simplified Approach Lalit Goyal, Vishal SPD 1st 2014
to Data Structures Goyal, Pawan Kumar
2. An Introduction to Data Jean – Paul Tremblay Tata 2nd 2007
Structure with and Paul Sorenson McGraw
Applications Hill
3. Data Structure and Maria Rukadikar SPD 1st 2017
Algorithm
4. Schaum’s Outlines Data Seymour Lipschutz Tata 2nd 2005
structure McGraw
Hill
5. Data structure – A AM Tanenbaum, Y Prentice 2nd 2006
Pseudocode Approach Langsam and MJ Hall India
with C Augustein
6. Data structure and Weiss, Mark Allen Addison 1st 2006
Algorithm Analysis in C Wesley

15
Course Outcome:
After completing the course, the learner will be able to:
CO1: Identify and distinguish data structure classification, data types, their complexities
CO2: Implement array, linked list, stack and queue.
CO3: Implement trees, various hashing techniques and graph for various applications
CO4: Compare various sorting and searching techniques

16
 Computer Networks
B. Sc. (Information Technology) Semester – III
Course Name: Computer Networks Course Code: USIT303
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objective:
• Knowledge of uses and services of Computer Network.
• Ability to identify types and topologies of network.
• Understanding of analog and digital transmission of data.
• Familiarization with the techniques of routing.
• Understand the functioning of networking application
Unit Details Lectures
I Introduction: Computer Network, Evolution of Computer Networks
Different types of Computer Network, Difference between LAN, MAN and
WAN, Hardware Devices used for Networking: Network Interface Card
(NIC), Modem, Hub, Switch L1 and L2 switches, Comparison between 12
switch and hub, Bridge, Router, Gateway.
Standards and administration. Network Models: Protocol layering, TCP/IP
protocol suite, The OSI model.
II Introduction to Physical layer: Data and signals, periodic analog signals,
digital signals, transmission impairment, data rate limits, performance.
Introduction to the Data Link Layer: Link layer addressing, Data Link
12
Layer Design Issues, Error detection and correction, block coding
Wireless LANs: Introduction, IEEE 802.11 project, Bluetooth, WiMAX,
Cellular telephony, Satellite networks.
III Network Layer: IPv4 Addresses, IPv4 Protocol, ARP, ICMP, IPv6
12
Routing: RIP, OSPF, BGP
IV Transport Layer: UDP, TCP 12
V Application Layer: WWW, HTTP, DNS, SMTP, POP3, MIME, IMAP,
12
DHCP, TELNET, SSH, FTP

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. TCP/IP Protocol Suite Behrouz A. Tata ----- -----
Forouzan McGraw
Hill 2010
2. Data Communication and Behrouz A. Tata ----- -----
Networking Forouzan McGraw
Hill
3. Computer Networks Andrew Pearson Fifth 2013
Tanenbaum

17
Online Resources:
• https://ekumbh.aicte-india.org/allbook.php
• https://free.aicte-india.org/

Course Outcomes:
After completing the course, the learner will be able to:
CO1: Identify various data communication standards, topologies and terminologies
CO2: Describe how signals are used to transfer data and communication aspects between
nodes
CO3: Configure IP addresses using TCP/IP protocol suite
CO4: Use different application layer protocols

18
 Operating Systems
B. Sc. (Information Technology) Semester – III
Course Name: Operating Systems Course Code: USIT304
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objective:
• Analyze the concepts of processes in operating system and illustration of the scheduling
of processor for a given problem instance.
• Identify the dead lock situation and provide appropriate solution so that protection and
security of the operating system is also maintained.
• Analyze memory management techniques, concepts of virtual memory and disk
scheduling.
• Understand the implementation of file systems and directories along with the interfacing
of IO devices with the operating system.
• Ability to apply CPU scheduling algorithms to manage tasks.
• Initiation into the process of applying memory management methods and allocation
policies.
• Knowledge of methods of prevention and recovery from a system deadlock.
Unit Details Lectures
I Operating System Overview: Objectives and Functions,
Evolution, Achievements, Modern Operating Systems, Fault
tolerance, OS design considerations for multiprocessor and 12
multicore, overview of different operating systems
Processes: Process Description and Control.
II Threads, Concurrency: Mutual Exclusion and Synchronization. 12
III Concurrency: Deadlock and Starvation,
12
Memory: Memory Management, Virtual Memory.
IV Scheduling: Uniprocessor Scheduling, Multiprocessor and
12
Real-Time Scheduling
V IO and File Management: I/O Management and Disk
12
Scheduling, File Management, Operating System Security.

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Operating Systems – Willaim Stallings Pearson 9th 2009
Internals and Design
Principles
2. Operating System Concepts Abraham Wiley 8th
Silberschatz,

19
 Peter B. Galvineg
Gagne
3. Operating Systems Godbole and McGraw 3rd
Kahate Hill

Online Resources:

• https://onlinecourses.nptel.ac.in/noc20_cs04/preview
• https://free.aicte-india.org/
• https://www.javatpoint.com/best-courses-for-the-operating-system

Course Outcomes:
After completing the course, the learner will be able to:
CO1: Role of Operating System Computer System.
CO2: Use the different types of Operating System and their services.
CO3: configure process scheduling algorithms and synchronization techniques to achieve better
performance of a computer system.
CO4: Apply virtual memory concepts.
CO5: Effectively use and manage secondary memory.

20
 Applied Mathematics
B. Sc. (Information Technology) Semester – III
Course Name: Applied Mathematics Course Code: USIT305
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objective:
The course is aimed to develop the basic Mathematical skills of IT students that are imperative
for effective understanding of IT subjects.
• Apply the knowledge of matrices to solve the problems.
• Know and to understand various types of numerical methods.
• Ability to interpret the mathematical results in physical or practical terms for complex
numbers.
• Inculcate the habit of Mathematical Thinking through Indeterminate forms and Taylor
series expansion
• Solve and analyze the Partial derivatives and its application in related field of engineering

Unit Details Lectures

I Matrices: Inverse of a matrix, Properties of matrices, Elementary
Transformation, Rank of Matrix, Echelon or Normal Matrix, Inverse of
matrix, Linear equations, Linear dependence and linear independence
of vectors, Linear transformation, Characteristics roots and
characteristics vectors, Properties of characteristic vectors, Caley-
Hamilton Theorem, Similarity of matrices, Reduction of matrix to a
diagonal matrix which has elements as characteristics values.
Complex Numbers: Complex number, Equality of complex numbers,
Graphical representation of complex number(Argand’s Diagram), Polar 12
form of complex numbers, Polar form of x+iy for different signs of x,y,
Exponential form of complex numbers, Mathematical operation with
complex numbers and their representation on Argand’s Diagram,
Circular functions of complex angles, Definition of hyperbolic
function, Relations between circular and hyperbolic functions, Inverse
hyperbolic functions, Differentiation and Integration, Graphs of the
hyperbolic functions, Logarithms of complex quality, j(=i)as an
operator(Electrical circuits)
II Equation of the first order and of the first degree: Separation of
variables, Equations homogeneous in x and y, Non-homogeneous linear
equations, Exact differential Equation, Integrating Factor, Linear
12
Equation and equation reducible to this form, Method of substitution.
Differential equation of the first order of a degree higher than the
first: Introduction, Solvable for p (or the method of factors), Solve for

21
 y, Solve for x, Clairaut’s form of the equation, Methods of Substitution,
Method of Substitution.
Linear Differential Equations with Constant Coefficients:
Introduction, The Differential Operator, Linear Differential Equation
f(D) y = 0, Different cases depending on the nature of the root of the
equation f(D) = 0, Linear differential equation f(D) y = X, The
complimentary Function, The inverse operator 1/f(D) and the symbolic
expiration for the particular integral 1/f(D) X; the general methods,
Particular integral : Short methods, Particular integral : Other methods,
Differential equations reducible to the linear differential equations with
constant coefficients.
III The Laplace Transform: Introduction, Definition of the Laplace
Transform, Table of Elementary Laplace Transforms, Theorems on
Important Properties of Laplace Transformation, First Shifting
Theorem, Second Shifting Theorem, The Convolution Theorem,
Laplace Transform of an Integral, Laplace Transform of Derivatives,
Inverse Laplace Transform: Shifting Theorem, Partial fraction 12
Methods, Use of Convolution Theorem, Solution of Ordinary Linear
Differential Equations with Constant Coefficients, Solution of
Simultaneous Ordinary Differential Equations, Laplace Transformation
of Special Function, Periodic Functions, Heaviside Unit Step Function,
Dirac-delta Function(Unit Impulse Function),
IV Multiple Integrals: Double Integral, Change of the order of the
integration, Double integral in polar co-ordinates, Triple integrals. 12
Applications of integration: Areas, Volumes of solids.
V Beta and Gamma Functions – Definitions, Properties and Problems.
Duplication formula.
12
Differentiation Under the Integral Sign
Error Functions

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. A text book of Applied P. N. Wartikar Pune
Mathematics Vol I and J. N. Vidyathi
Wartikar Graha
2. Applied Mathematics II P. N. Wartikar Pune
and J. N. Vidyathi
Wartikar Graha
3. Higher Engineering Dr. B. S. Grewal Khanna
Mathematics Publications

Course Outcomes:

Upon the successful completion of the course, students will be able to:
CO 1: Solve the matrix operations, identify the linear dependence and independence of a vectors.

22
CO 2: Familiar with the various forms and operations of a complex number.
CO 3: Find the Laplace transform of a function and Inverse Laplace transform of a function using
definition also solve ordinary differential equations using Laplace transform.
CO 4: Evaluate the multiple integrals in Cartesian, Polar coordinates, change the order of the
integral,
CO 5: Apply integration methods to calculate the areas and volumes of solids.
CO 6: Evaluate the Beta, Gamma, Differentiation Under integral sign and error functions

23
 Python Programming Practical
B. Sc. (Information Technology) Semester – III
Course Name: Python Programming Practical Course Code: USIT3P1
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal -- --

List of Practical
1. Write the program for the following:
a. Create a program that asks the user to enter their name and their age. Print out a
message addressed to them that tells them the year that they will turn 100 years
old.
b. Enter the number from the user and depending on whether the number is even or
odd, print out an appropriate message to the user.
c. Write a program to generate the Fibonacci series.
d. Write a function that reverses the user defined value.
e. Write a function to check the input value is Armstrong and also write the
function for Palindrome.
f. Write a recursive function to print the factorial for a given number.

2. Write the program for the following:

a. Write a function that takes a character (i.e. a string of length 1) and returns True
if it is a vowel, False otherwise.
b. Define a function that computes the length of a given list or string.
c. Define a procedure histogram() that takes a list of integers and prints a histogram
to the screen. For example, histogram([4, 9, 7]) should print the following:

****
*********
*******

3. Write the program for the following:

a. A pangram is a sentence that contains all the letters of the English alphabet at least
once, for example: The quick brown fox jumps over the lazy dog. Your task here
is to write a function to check a sentence to see if it is a pangram or not.
b. Take a list, say for example this one:

a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]

and write a program that prints out all the elements of the list that are less than 5.

4. Write the program for the following:

24
a. Write a program that takes two lists and returns True if they have at least one
common member.
b. Write a Python program to print a specified list after removing the 0th, 2nd, 4th
and 5th elements.
c. Write a Python program to clone or copy a list

5. Write the program for the following:

a. Write a Python script to sort (ascending and descending) a dictionary by value.
b. Write a Python script to concatenate following dictionaries to create a new one.
Sample Dictionary :
dic1={1:10, 2:20}
dic2={3:30, 4:40}
dic3={5:50,6:60}
Expected Result : {1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60}
c. Write a Python program to sum all the items in a dictionary.

6. Write the program for the following:

a. Write a Python program to read an entire text file.
b. Write a Python program to append text to a file and display the text.
c. Write a Python program to read last n lines of a file.

7. Write the program for the following:

a. Design a class that store the information of student and display the same
b. Implement the concept of inheritance using python
c. Create a class called Numbers, which has a single class attribute called
MULTIPLIER, and a constructor which takes the parameters x and y (these should
all be numbers).
i. Write a method called add which returns the sum of the attributes x and y.
ii. Write a class method called multiply, which takes a single number
parameter a and returns the product of a and MULTIPLIER.
iii. Write a static method called subtract, which takes two number parameters, b
and c, and returns b - c.
iv. Write a method called value which returns a tuple containing the values of x
and y. Make this method into a property, and write a setter and a deleter for
manipulating the values of x and y.

8. Write the program for the following:

a. Open a new file in IDLE (“New Window” in the “File” menu) and save it as
geometry.py in the directory where you keep the files you create for this course.
Then copy the functions you wrote for calculating volumes and areas in the
“Control Flow and Functions” exercise into this file and save it.
Now open a new file and save it in the same directory. You should now be able
to import your own module like this:
import geometry
Try and add print dir(geometry) to the file and run it.

25
 Now write a function pointyShapeVolume(x, y, squareBase) that calculates the
volume of a square pyramid if squareBase is True and of a right circular cone if
squareBase is False. x is the length of an edge on a square if squareBase is True
and the radius of a circle when squareBase is False. y is the height of the object.
First use squareBase to distinguish the cases. Use the circleArea and squareArea
from the geometry module to calculate the base areas.
b. Write a program to implement exception handling.

9. Write the program for the following:

a. Try to configure the widget with various options like: bg=”red”, family=”times”,
size=18
b. Try to change the widget type and configuration options to experiment with
other widget types like Message, Button, Entry, Checkbutton, Radiobutton, Scale
etc.

10. Design the database applications for the following:

a. Design a simple database application that stores the records and retrieve the
same.
b. Design a database application to search the specified record from the database.
c. Design a database application to that allows the user to add, delete and modify
the records.

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Think Python Allen Downey O’Reilly 1st 2012
2. An Introduction to Jason SPD 1st 2014
Computer Science using Montojo, Jennifer
Python 3 Campbell, Paul
Gries

26
 Data Structures Practical

B. Sc. (Information Technology) Semester – III

Course Name: Data Structures Practical Course Code: USIT3P2
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal -- --

List of Practical
1. Implement the following:
a. Write a program to store the elements in 1-D array and perform the operations like
searching, sorting and reversing the elements. [Menu Driven]
b. Read the two arrays from the user and merge them and display the elements in
sorted order. [Menu Driven]
c. Write a program to perform the Matrix addition, Multiplication and Transpose
Operation. [Menu Driven]

2. Implement the following for Linked List:

a. Write a program to create a single linked list and display the node elements in
reverse order.
b. Write a program to search the elements in the linked list and display the same
c. Write a program to create double linked list and sort the elements in the linked
list.

3. Implement the following for Stack:

a. Write a program to implement the concept of Stack with Push, Pop, Display and
Exit operations.
b. Write a program to convert an infix expression to postfix and prefix conversion.
c. Write a program to implement Tower of Hanoi problem.

4. Implement the following for Queue:

a. Write a program to implement the concept of Queue with Insert, Delete, Display
and Exit operations.
b. Write a program to implement the concept of Circular Queue
c. Write a program to implement the concept of Deque.

5. Implement the following sorting techniques:

a. Write a program to implement bubble sort.
b. Write a program to implement selection sort.
c. Write a program to implement insertion sort.

6. Implement the following data structure techniques:

a. Write a program to implement merge sort.

27
 b. Write a program to search the element using sequential search.
c. Write a program to search the element using binary search.

7. Implement the following data structure techniques:

a. Write a program to create the tree and display the elements.
b. Write a program to construct the binary tree.
c. Write a program for inorder, postorder and preorder traversal of tree

8. Implement the following data structure techniques:

a. Write a program to insert the element into maximum heap.
b. Write a program to insert the element into minimum heap.

9. Implement the following data structure techniques:

a. Write a program to implement the collision technique.
b. Write a program to implement the concept of linear probing.

10. Implement the following data structure techniques:

a. Write a program to generate the adjacency matrix.
b. Write a program for shortest path diagram.

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Data Structures and Rance Necaise Wiley First 2016
Algorithms Using Python

2. Data Structures Using C and Langsam , Pearson First 2015

C++ Augenstein,
Tanenbaum

28
 Computer Network Practical
B. Sc. (Information Technology) Semester – III
Course Name: Computer Network Practical Course Code: USIT3P3
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
1. Colour code for crimping LAN (Cat 5/6/7) cable
a. Study of Different color codes
b. Study of different connecting devices and their differences
c. Crimping LAN Cable

2. Configuring LAN setup

a. Planning and Setting IP networks
b. Configuring subnet
c. Study of basic network command and Network configuration commands.
ipconfig, netstat, ARP, ping, trace route etc.
d. Basic network troubleshooting.
e. Configuration of TCP/IP Protocols in Windows / Linux.
f. Implementation of Drive/file sharing and printer sharing.

3. IPv4 Addressing and Subnetting

a. Given an IP address and network mask, determine other information about the IP
address such as:
• Network address
• Network broadcast address
• Total number of host bits
• Number of hosts
b. Given an IP address and network mask, determine other information about the IP
address such as:
• The subnet address of this subnet
• The broadcast address of this subnet
• The range of host addresses for this subnet
• The maximum number of subnets for this subnet mask
• The number of hosts for each subnet
• The number of subnet bits
• The number of this subnet

4. Designing and configuring a network topology

a. Configure IP static routing

29
5. Configure IP routing using RIP.

6. Configuring Simple and multi-area OSPF.

7. Configuring server and client.

a. Configure DHCP
b. Configure DNS
c. Configure HTTP
d. Configure Telnet
e. Configure FTP

8. Configure basic security features for networks

9. Packet capture and header analysis by wire-shark (TCP, UDP, IP etc.)

10. Planning and Design a corporate network for a given scenario.

30
 Operating System Practical
B. Sc. (Information Technology) Semester – III
Course Name: Operating System Practical Course Code: USIT3P4
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
1. Installation and Configuration of virtual machine
d. Installation of virtual machine software.
e. Installation of Windows OS
f. Installation of Linux OS

2. Windows (DOS) Commands

g. Date, time, prompt, md, cd, rd, path.
h. Chkdsk, copy, xcopy, format, fidsk, cls, defrag, del, move.
i. Diskcomp, diskcopy, diskpart, doskey, echo
j. Edit, fc, find, rename, set, type, ver

3. Linux commands:
c. pwd, cd, absolute and relative paths, ls, mkdir, rmdir
d. file, touch, rm, cp. mv, rename, head, tail, cat, tac, more, less, strings, chmod
e. ps, top, kill, pkill, bg, fg
f. grep, locate, find, locate
g. date, cal, uptime, w, whoami, finger, uname, man, df, du, free, whereis, which
h. Compression: tar, gzip

4. Working with Linux Desktop and utilities

b. The vi editor
c. Graphics User Interface
d. Working with Terminal
e. Adjusting display resolution
f. Using the browsers
g. Configuring simple networking
h. Creating users and shares

5. Installing utility software on Linux and Windows

6. Running C/C++/Python programs in Linux

7. Introduction to Linux Shell Scripting

f. Basic operators

31
g. Decision Making
h. Looping
i. Regular Expression
j. Special variables and command Line arguments

8. Case study of Server OS: Windows Server 2022 operating System -

Architecture, Components, Services, Configuration

9. Case study of Android OS: Architecture, Components, Services, Configuration

10. Case study of Cloud OS: AWS, Azure, Google Cloud

32
 Mobile Programming Practical
B. Sc. (Information Technology) Semester – III
Course Name: Mobile Programming Practical Course Code: USIT3P5
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal -- --

The practical’s will be based on HTML5, CSS, Flutter. (Android will be introduced later
after they learn Java)
List of Practical
Setting up Flutter, PhoneGAP Project and environment.
1. Program to demonstrate the features of Dart language.

2. Designing the mobile app to implement different widgets.

3. Designing the mobile app to implement different Layouts.

4. Designing the mobile app to implement Gestures.

5. Designing the mobile app to implement the theming and styling.

6. Designing the mobile app to implement the routing.

7. Designing the mobile app to implement the animation.

8. Designing the mobile app to implement the state management.

9. Designing the mobile app working with SQLite Database.

10. Designing the mobile app working with Firebase.

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Flutter for Beginners Alessandro Packt 2019
Biessek Publishing
2. PhoneGap By Example Andrey PACKT 1st 2015
Kovalenko Publishing

33
(This page is intentionally left blank)

34
SEMESTER IV

35
(This page is intentionally left blank)

36
 Java Programming
B. Sc. (Information Technology) Semester – IV
Course Name: Java Programming Course Code: USIT401
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objectives:
Upon completion of this course, students will be able to:
• Understand the concept of OOP as well as the purpose and usage principles of
inheritance, polymorphism, encapsulation and method overloading.
• Identify classes, objects, members of a class and the relationships among them needed for
a specific problem.
• Create Java application programs using sound OOP practices (e.g., interfaces and APIs)
and proper program structuring (e.g., by using access control identifies, automatic
documentation through comments, error exception handling).
• Use testing and debugging tools to automatically discover errors of Java programs as well
as use versioning tools for collaborative programming/editing.
• Develop programs using the Java Collection API as well as the Java standard class
library.
• Apply object-oriented programming concepts in problem solving through JAVA.
Unit Details Lectures
I Introduction: History, Features of Java, Java Development Kit, Java
Application Programming Interface, Java Virtual Machine, Java Program
Structure.
Classes: The Class Object and Its Attributes, Class Methods, Accessing A 12
Method, Method Overloading, Instantiating Objects from A Class,
Constructors, this keyword, super keyword, Types of Classes, Scope Rules,
Access Modifier, constants, static members of a class, garbage collection.
II Inheritance: Derived Class Objects, Inheritance and Access Control, Default
Base Class Constructors, this and super keywords. Abstract Classes and
Interfaces, Abstract Classes, Abstract Methods,
12
Interfaces: What Is an Interface? How Is an Interface Different from An
Abstract Class? Multiple Inheritance, Defining an Interface, Implementing
Interfaces.
III Exceptions: Catching Java Exceptions, Catching Run-Time Exceptions,
Handling Multiple Exceptions, The finally Clause, The throws Clause, Built-
in Exceptions in java
Multithreading: Thread Creations, Thread Life Cycle, Life Cycle Methods, 12
Synchronization, wait() notify() notify all() methods
Packages: Introduction to predefined packages, User Defined Packages,
Access specifier, Java Built-in packages, Array Class, String Class

37
 IV Introduction to JFC and Swing- Features of the Java Foundation Classes,
Swing API Components, JComponent Class, Containers and Panels, Labels,
Buttons, RadioButton, Check Boxes, Text-Entry Components, Menus
12
Layouts: Flow Layout, Grid Layout, Border Layout
Event Handling: Delegation Event Model, Events, Event classes, Event
listener interfaces, Using delegation event model, adapter classes.
V Advanced Swing Controls: JScrollPane, Lists and Combo Boxes, Colors and
File Choosers, Tables and Trees, JTabbedPane.
12
JDBC: Introduction, JDBC Architecture, JDBC Drivers, java.sql package,
Using Statement, PreparedStatement, CallableStatement, ResultSet

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Core Java 8 for Vaishali Shah, Sharnam SPD 1st 2015
Beginners Shah
2. Java: The Complete Herbert Schildt McGraw 9th 2014
Reference Hill
3. Murach’s beginning Joel Murach , Michael SPD 1st 2016
Java with Net Beans Urban
4. Core Java, Volume I: Hortsman Pearson 9th 2013
Fundamentals
5. Core Java, Volume II: Gary Cornell and Pearson 8th 2008
Advanced Features Hortsman
6. Core Java: An R. Nageswara Rao DreamTech 1st 2008
Integrated Approach

Course Outcome:
After completing the course, the learner will be able to:
CO1: Learn the architecture of Java
CO2: Identify data types, control flow, classes, inheritance, exceptions and event handling
CO3: Use object-oriented concepts for problem solving real-life applications
CO4: Build GUI programs
CO5 : Create event driven programs using java.

38
 Introduction to Embedded Systems
B. Sc. (Information Technology) Semester – IV
Course Name: Introduction to Embedded Systems Course Code: USIT402
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25
Course Objectives:

• To introduce the Building Blocks of Embedded System

• To Educate in Various microcontrollers used in Embedded Development

• To Introduce Bus Communication in processors, Input/output interfacing.

• To impart knowledge in sensors and actuators.

• To familiar with the real world application development using embedded system.

Unit Details Lectures

I PIC MICROCONTROLLER: Architecture – memory organization
– addressing modes – instruction set – PIC programming in Assembly
& C –I/O port, Data Conversion, RAM & ROM Allocation, Timer
programming
12
Advanced ARM Controllers: Introduction to ARM and its Features,
Architecture – memory organization – addressing modes –The ARM
Programmer’s model -Registers – Pipeline - Interrupts – Coprocessors
– Interrupt Structure
II Communication Protocol & Implementation: Introduction to
Communication Protocol, I2C - Interfacing with micro controller using
bit-banking method, I2C devices – RTC, Memory, ADC-DAC, Port
Expander, SPI (Serial Peripheral Interface), Bluetooth, Wi-Fi and 12
RFID. Understanding Serial, Communication, Bluetooth
Communication, SPI Interface ZigBee, Wi-Fi, I2C, Infrared, RFID,
GSM, GPS, PDH/SDH/Ethernet
III Getting Started with Arduino: Introduction, Arduino Variants, Install
the Drivers, Arduino IDE
Basic Functions: Overview, Structure, Digital I/O Functions, Analog
12
I/O Functions, Advanced I/O Functions, Timer Functions,
Communication Functions, Interrupt Functions, Math Functions,
Programming Language Reference

39
 IV Using Sensors with the Arduino: Light Sensitive Sensors,
Temperature Sensors, Temperature and Humidity Sensor, Line-
Tracking Sensor, Ultrasonic Sensors, Digital Infrared Motion Sensor,
Joystick Module, Gas Sensor, Hall Sensor, Color Sensor, Digital Tilt
Sensor, Triple Axis Acceleration Sensor, Analog Sound Sensor, Voice 12
Recognition Module, Digital Vibration Sensor, Flame Sensor,
Capacitive Touch Sensor
Electromechanical Control Using the Arduino: DC Motor, Stepper
Motor, Servo Motor
V Wireless Control Using the Arduino: Infrared Transmitter and
Receiver, Wireless Radio Frequency, Bluetooth, GSM/GPRS, Wi-Fi
Case Studies:
12
• Air Quality Monitor Using Arduino
• A Fire-Fighting Robot Using Arduino
• Intelligent Lock System Using Arduino

Books and References:

Sr. Title Author/s Publisher Edition Year
No.
1. Programming Michael O'Reilly First 1999
Embedded Systems in Barr
C and C++
2. Introduction to Shibu K V Tata Mcgraw-Hill First 2012
embedded systems
3. The 8051 Muhammad Pearson Second 2011
Microcontroller and Ali Mazidi
Embedded Systems
4. Embedded Systems Rajkamal Tata Mcgraw-Hill

Course Outcome:

CO1: Differentiate between general purpose and embedded systems

CO2: Discuss the characteristics and quality attributes of embedded systems

CO3: Use different types of sensors for appropriately

CO4: Design and develop embedded systems

40
 Computer Oriented Statistical Techniques
B. Sc. (Information Technology) Semester – IV
Course Name: Computer Oriented Statistical Techniques Course Code: USIT403
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objectives:
1. To learn the different methods of calculating the central tendencies.
2. To introduce the moments, skewness and kurtosis.
3. To learn scientific view to conduct the survey in proper way to collect the data about specific
perspective.
4. To Learn variety of probability sampling methods for selecting a sample from a population.
5. To learn the sampling theory and testing of hypothesis and making inferences.
6. To introduce the students with understanding of the curve fitting, regression and correlation
techniques.

Unit Details Lectures

I The Mean, Median, Mode, and Other Measures of Central
Tendency: Index, or Subscript, Notation, Summation Notation,
Averages, or Measures of Central Tendency ,The Arithmetic Mean ,
The Weighted Arithmetic Mean ,Properties of the Arithmetic Mean
,The Arithmetic Mean Computed from Grouped Data ,The Median ,The
Mode, The Empirical Relation Between the Mean, Median, and Mode,
The Geometric Mean G, The Harmonic Mean H ,The Relation Between
the Arithmetic, Geometric, and Harmonic Means, The Root Mean
Square, Quartiles, Deciles, and Percentiles, Software and Measures of
Central Tendency.
The Standard Deviation and Other Measures of Dispersion: 12
Dispersion, or Variation, The Range, The Mean Deviation, The Semi-
Interquartile Range, The 10–90 Percentile Range, The Standard
Deviation, The Variance, Short Methods for Computing the Standard
Deviation, Properties of the Standard Deviation, Charlie’s Check,
Sheppard’s Correction for Variance, Empirical Relations Between
Measures of Dispersion, Absolute and Relative Dispersion; Coefficient
of Variation, Standardized Variable; Standard Scores, Software and
Measures of Dispersion.
Introduction to R: Basic syntax, data types, variables, operators,
control statements, R-functions, R –Vectors, R – lists, R Arrays.

41
II Moments, Skewness, and Kurtosis : Moments , Moments for Grouped
Data ,Relations Between Moments , Computation of Moments for
Grouped Data, Charlie’s Check and Sheppard’s Corrections, Moments
in Dimensionless Form, Skewness, Kurtosis, Population Moments,
Skewness, and Kurtosis, Software Computation of Skewness and
Kurtosis.
Elementary Probability Theory: Definitions of Probability,
Conditional Probability; Independent and Dependent Events, Mutually
Exclusive Events, Probability Distributions, Mathematical Expectation,
Relation Between Population, Sample Mean, and Variance, 12
Combinatorial Analysis, Combinations, Stirling’s Approximation to n!,
Relation of Probability to Point Set Theory, Euler or Venn Diagrams
and Probability.
Elementary Sampling Theory : Sampling Theory, Random Samples
and Random Numbers, Sampling With and Without Replacement,
Sampling Distributions, Sampling Distribution of Means, Sampling
Distribution of Proportions, Sampling Distributions of Differences and
Sums, Standard Errors, Software Demonstration of Elementary
Sampling Theory.
III Statistical Estimation Theory: Estimation of Parameters, Unbiased
Estimates, Efficient Estimates, Point Estimates and Interval Estimates;
Their Reliability, Confidence-Interval Estimates of Population
Parameters, Probable Error.
Statistical Decision Theory: Statistical Decisions, Statistical
Hypotheses, Tests of Hypotheses and Significance, or Decision Rules,
Type I and Type II Errors, Level of Significance, Tests Involving 12
Normal Distributions, Two-Tailed and One-Tailed Tests, Special Tests,
Operating-Characteristic Curves; the Power of a Test, p-Values for
Hypotheses Tests, Control Charts, Tests Involving Sample Differences,
Tests Involving Binomial Distributions.
Statistics in R: mean, median, mode, Normal Distribution , Binomial
Distribution, Frequency Distribution in R.
IV Small Sampling Theory: Small Samples, Student’s t Distribution,
Confidence Intervals, Tests of Hypotheses and Significance, The Chi-
Square Distribution, Confidence Intervals for Sigma , Degrees of
Freedom, The F Distribution.
The Chi-Square Test: Observed and Theoretical Frequencies,
12
Definition of chi-square, Significance Tests, The Chi-Square Test for
Goodness of Fit, Contingency Tables, Yates’ Correction for Continuity,
Simple Formulas for Computing chi-square, Coefficient of
Contingency, Correlation of Attributes, Additive Property of chi-
square.
V Curve Fitting and the Method of Least Squares: Relationship
Between Variables, Curve Fitting, Equations of Approximating Curves,
12
Freehand Method of Curve Fitting, The Straight Line, The Method of
Least Squares, The Least-Squares Line, Nonlinear Relationships, The

42
 Least-Squares Parabola, Regression, Applications to Time Series,
Problems Involving More Than Two Variables.
Correlation Theory: Correlation and Regression, Linear Correlation,
Measures of Correlation, The Least-Squares Regression Lines,
Standard Error of Estimate, Explained and Unexplained Variation,
Coefficient of Correlation, Remarks Concerning the Correlation
Coefficient, Product-Moment Formula for the Linear Correlation
Coefficient, Short Computational Formulas, Regression Lines and the
Linear Correlation Coefficient, Correlation of Time Series, Correlation
of Attributes, Sampling Theory of Correlation, Sampling Theory of
Regression.

Books and References:

Sr. Title Author/s Publisher Edition Year
No.
1. STATISTICS Murray R. McGRAW – FOURTH
Spiegel, Larry HILL
J. Stephens. ITERNATIONAL
2. A Practical Approach R.B. Patil, SPD 1st 2017
using R H.J. Dand and
R. Bhavsar
3. FUNDAMENTAL S.C. GUPTA SULTAN ELEVENTH 2011
OF and V.K. CHAND and REVISED
MATHEMATICAL KAPOOR SONS
STATISTICS
4. MATHEMATICAL J.N. KAPUR S. CHAND TWENTIETH 2005
STATISTICS and H.C. REVISED
SAXENA

Course Outcome: Upon the successful completion of the course, students will be able to:
CO 1: To calculate and apply measures of central tendencies and measures of dispersion --
grouped and ungrouped data cases.
CO 2: To calculate the moments, skewness and kurtosis by various methods.
CO 3: How to apply discrete and continuous probability distributions to various business
problems.
CO 4: Perform Test of Hypothesis as well as calculate confidence interval for a population
parameter for single sample and two sample cases. Understand the concept of p-values
CO 5: Apply simple linear regression and correlation model to real life examples.

43
 Software Engineering
B. Sc. (Information Technology) Semester – IV
Course Name: Software Engineering Course Code: USIT404
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objective:
• Develop the software projects or prototypes by understanding the requirements.
• Meet the project deadlines along with the number of resources and type of tasks to be carried out.
• Evaluate and analyze the SDLC and basic architecture SRS documents.
• Help to understand the software design and coding techniques.
• Understand the software testing principles.
• Understand the concept project management.
• Identify various concepts of Advanced UML techniques

Unit Details Lectures

I Introduction: What is software engineering? Software Development
Life Cycle, Requirements Analysis, Software Design, Coding, Testing,
Maintenance etc.
Software Requirements: Functional and Non-functional
requirements, User Requirements, System Requirements, Interface
Specification, Documentation of the software requirements.
Software Processes:
Process and Project, Component Software Processes.
Software Development Process Models.
• Waterfall Model. 12
• Prototyping.
• Iterative Development.
• Rational Unified Process.
• The RAD Model
• Time boxing Model.
Agile software development: Agile methods, Plan-driven and agile
development, Extreme programming, Agile project management,
Scaling agile methods.

II Socio-technical system: Essential characteristics of socio technical

systems, Emergent System Properties, Systems Engineering,
Components of system such as organization, people and computers,
Dealing Legacy Systems. 12
Critical system: Types of critical system, A simple safety critical
system, Dependability of a system, Availability and Reliability, Safety
and Security of Software systems.

44
 Requirements Engineering Processes: Feasibility study,
Requirements elicitation and analysis, Requirements Validations,
Requirements Management.
System Models: Models and its types, Context Models, Behavioural
Models, Data Models, Object Models, Structured Methods.
III Architectural Design: Architectural Design Decisions, System
Organisation, Modular Decomposition Styles, Control Styles,
Reference Architectures.
User Interface Design: Need of UI design, Design issues, The UI
design Process, User analysis, User Interface Prototyping, Interface
Evaluation.
12
Project Management
Software Project Management, Management activities, Project
Planning, Project Scheduling, Risk Management.
Quality Management: Process and Product Quality, Quality assurance
and Standards, Quality Planning, Quality Control, Software
Measurement and Metrics.
IV Verification and Validation: Planning Verification and Validation,
Software Inspections, Automated Static Analysis, Verification and
Formal Methods. Software Testing: System Testing, Component
Testing, Test Case Design, Test Automation.
Software Measurement: Size-Oriented Metrics, Function-Oriented 12
Metrics, Extended Function Point Metrics
Software Cost Estimation: Software Productivity, Estimation
Techniques, Algorithmic Cost Modelling, Project Duration and
Staffing
V Process Improvement: Process and product quality, Process
Classification, Process Measurement, Process Analysis and Modeling,
Process Change, The CMMI Process Improvement Framework.
Service Oriented Software Engineering: Services as reusable
components,
Service Engineering, Software Development with Services. 12
Software reuse: The reuse landscape, Application frameworks,
Software product lines, COTS product reuse.
Distributed software engineering: Distributed systems issues, Client–
server computing, Architectural patterns for distributed systems,
Software as a service

Books and References:

Sr. Title Author/s Publisher Edition Year
No.
1. Software Engineering, Ian Pearson Ninth
edition, Somerville Education.
2. Software Engineering Pankaj Narosa
Jalote Publication

45
 3. Software engineering, Roger Tata Mcgraw-hill Seventh
a practitioner’s Pressman
approach
4. Software Engineering WS Tata Mcgraw-hill
principles and practice Jawadekar
5. Software Engineering- S.A Kelkar PHI India.
A Concise Study
6. Software Engineering Subhajit Oxford Higher
Concept and Datta Education
Applications
7. Software Design D.Budgen Pearson education 2nd
8. Software Engineering KL James PHI EEE 2009

Course Outcome:
After completing the course, the learner will be able to:
CO1: Understand software engineering
CO2: Apply software engineering principles
CO3: Discuss various approaches to verification and validation of software including
testing, measurements and estimation of software products
CO4: Create software using different software development models

46
 Computer Graphics and Animation
B. Sc. (Information Technology) Semester – IV
Course Name: Computer Graphics and Animation Course Code: USIT405
Periods per week (1 Period is 50 minutes) 5
Credits 2
Hours Marks
Evaluation System Theory Examination 2½ 75
Internal -- 25

Course Objectives:
1. To train the students to acquire skills in generating marketable computer graphics and animated
pictures, especially in the area of advertisements.
2. To train the students to acquire skills and mastery in the use of different software producing
graphics and animation.
3. The course introduces the basic concepts of computer graphics.
4. It provides the necessary theoretical background and demonstrates the application of computer
science to graphics.
5. The course further allows students to develop programming skills in computer graphics
through programming assignments.
Unit Details Lectures
I Introduction to Computer Graphics:
Overview of Computer Graphics, Computer Graphics Application and
Software, Description of some graphics devices, Input Devices for
Operator Interaction, Active and Passive Graphics Devices, Display
Technologies, Storage Tube Graphics Displays, Calligraphic Refresh
Graphics Displays, Raster Refresh (Raster-Scan) Graphics Displays,
Cathode Ray Tube Basics, Color CRT Raster Scan Basics, Video
Basics, The Video Controller, Random-Scan Display Processor, LCD
12
displays.
Scan conversion – Digital Differential Analyzer (DDA) algorithm,
Bresenhams’ Line drawing algorithm. Bresenhams’ method of Circle
drawing, Midpoint Circle Algorithm, Midpoint Ellipse Algorithm,
Mid-point criteria, Problems of Aliasing, end-point ordering and
clipping lines, Scan Converting Circles, Clipping Lines algorithms–
Cyrus-Beck, Cohen-Sutherland and Liang-Barsky, Clipping Polygons,
problem with multiple components.
II Two-Dimensional Transformations:
Transformations and Matrices, Transformation Conventions, 2D
Transformations, Homogeneous Coordinates and Matrix
Representation of 2D Transformations, Translations and Homogeneous 12
Coordinates, Rotation, Reflection, Scaling, Combined Transformation,
Transformation of Points, Transformation of The Unit Square, Solid
Body Transformations, Rotation About an Arbitrary Point, Reflection

47
 through an Arbitrary Line, A Geometric Interpretation of
Homogeneous Coordinates, The Window-to-Viewport
Transformations.
Three-Dimensional Transformations:
Three-Dimensional Scaling, Three-Dimensional Shearing, Three-
Dimensional Rotation, Three-Dimensional Reflection, Three-
Dimensional Translation, Multiple Transformation, Rotation about an
Arbitrary Axis in Space, Reflection through an Arbitrary Plane, Matrix
Representation of 3D Transformations, Composition of 3D
Transformations, Affine and Perspective Geometry, Perspective
Transformations, Techniques for Generating Perspective Views,
Vanishing Points, the Perspective Geometry and camera models,
Orthographic Projections, Axonometric Projections, Oblique
Projections, View volumes for projections.
III Viewing in 3D
Stages in 3D viewing, Canonical View Volume (CVV), Specifying an
Arbitrary 3D View, Examples of 3D Viewing, The Mathematics of
Planar Geometric Projections, Combined transformation matrices for
projections and viewing, Coordinate Systems and matrices, camera 12
model and viewing pyramid.
Light: Radiometry, Transport, Equation, Photometry
Color: Colorimetry, Color Spaces, Chromatic Adaptation, Color
Appearance
IV Visible-Surface Determination:
Techniques for efficient Visible-Surface Algorithms, Categories of
algorithms, Back face removal, The z-Buffer Algorithm, Scan-line
method, Painter’s algorithms (depth sorting), Area sub-division
method, BSP trees, Visible-Surface Ray Tracing, comparison of the
methods.
Plane Curves and Surfaces:
12
Curve Representation, Nonparametric Curves, Parametric Curves,
Parametric Representation of a Circle, Parametric Representation of an
Ellipse, Parametric Representation of a Parabola, Parametric
Representation of a Hyperbola, Representation of Space Curves, Cubic
Splines, , Bezier Curves, B-spline Curves, B-spline Curve Fit, B-spline
Curve Subdivision, Parametric Cubic Curves, Quadric Surfaces. Bezier
Surfaces.
V Computer Animation:
Principles of Animation, Key framing, Deformations, Character
Animation, Physics-Based Animation, Procedural Techniques, Groups
of Objects.
Image Manipulation and Storage: 12
What is an Image? Digital image file formats, Image compression
standard – JPEG, Image Processing - Digital image enhancement,
contrast stretching, Histogram Equalization, smoothing and median
Filtering.

48
 Books and References:
Sr. No. Title Author/s Publisher Edition Year
1. Computer Graphics - J. D. Foley, A. Van Pearson
Principles and Dam, S. K. Feiner 2nd
Practice and J. F. Hughes
2. Steve Marschner, Fundamentals of CRC press 2016
4th
Peter Shirley Computer Graphics
3. Computer Graphics Hearn, Baker Pearson 2nd
4. Principles of William M. TMH
2nd
Interactive Computer Newman and Robert
Graphics F. Sproull
5. Mathematical D. F. Rogers, J. A. TMH
2nd
Elements for CG Adams

After completion of the course students are supposed to be able to:

CO 1. Understand the basics of computer graphics, different graphics systems and applications of
computer graphics
CO 2. Compare various algorithms for scan conversion and filling of basic objects
CO 3. Use of geometric transformations on graphics objects and their application in composite
form.
CO 4. Extract scene with different clipping methods and its transformation to graphics display
device.
CO 5. Explore projections and visible surface detection techniques for display of 3D scene on 2D
screen.
CO 6. Render projected objects to naturalize the scene in 2D view and use of illumination models
CO 7. Understand the core concepts and mathematical foundations of computer graphics
CO 8. Know the fundamental computer graphics algorithms and data structures
CO 9. Understand an overview of different modeling approaches and methods
CO 10. Apply basic shading and texture mapping techniques
CO 11. Understand light interaction with 3D scenes
CO 12. Explain the applications, areas, and graphic pipeline, display and hardcopy technologies.
CO 13. Apply and compare the algorithms for drawing 2D images also explain aliasing, anti-
aliasing and half toning techniques.
CO 14. Discuss OpenGL application programming Interface and apply it for 2D & 3D computer
graphics.
CO 15. Analyze and apply clipping algorithms and transformation on 2D images.
CO 16. Solve the problems on viewing transformations and explain the projection and hidden
surface removal algorithms.
CO 17. Apply basic ray tracing algorithm, shading, shadows, curves and surfaces and also solve
the problems of curves.

49
 Java Programming Practical
B. Sc. (Information Technology) Semester – III
Course Name: Java Programming Practical Course Code: USIT4P----
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal --

List of Practical:
1. OOPs concepts in Java – 1
a. Write a program to create a class and implement a default, overloaded and copy
Constructor.
b. Write a program to create a class and implement the concepts of Method
Overloading
c. Write a program to create a class and implement the concepts of Static methods

2. OOPs concepts in Java – 2

a. Write a program to implement the concepts of Inheritance and Method overriding
b. Write a program to implement the concepts of Abstract classes and methods
c. Write a program to implement the concept of interfaces

3. Exceptions
a. Write a program to raise built-in exceptions and raise them as per the requirements
b. Write a program to define user defined exceptions and raise them as per the
requirements

4. Multithreading: Write a java application to demonstrate 5 bouncing balls of

different colors using threads.

5. JDBC
a. Write a JDBC program that displays the data of a given table in a GUI Table.
b. Write a JDBC program to Show the details of a specified product from a given
table selected using Combobox.
c. Write a GUI application to Navigate forward and reverse result set data.

6. Swing
a. Create a swing application that randomly changes color on button click.
b. Create a Swing application to demonstrate use of TextArea using scrollpane to
show contest of text file in textarea selected using file chooser.
c. Create a Swing application to demonstrate use of scrollpane to change its color
selected using colour chooser.

7. Layouts: Write programs for the following layouts:

50
 a. Flow Layout
b. Grid Layout
c. Border Layout

8. Events: Write programs to demonstrate the following events:

a. ActionEvent
b. MouseEvent
c. KeyEvent
d. SelectionEvent
e. FocusEvent

9. Demonstrate the use of Adapter Class in Event Handling

10. Demonstrate the use of Anonymous Inner Class in Event Handling

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Core Java 8 for Vaishali Shah, SPD 1st 2015
Beginners Sharnam Shah
2. Java: The Complete Herbert Schildt McGraw 9th 2014
Reference Hill
3. Murach’s beginning Java Joel Murach , Michael SPD 1st 2016
with Net Beans Urban
4. Core Java, Volume I: Hortsman Pearson 9th 2013
Fundamentals
5. Core Java, Volume II: Gary Cornell and Pearson 8th 2008
Advanced Features Hortsman
6. Core Java: An Integrated R. Nageswara Rao DreamTech 1st 2008
Approach

51
 Introduction to Embedded Systems Practical
B. Sc. (Information Technology) Semester – IV
Course Name: Introduction to Embedded Systems Practical Course Code: USIT4P2
Periods per week Lectures per week 3
1 Period is 50 minutes
Hours Marks
Evaluation System Practical Examination 2½ 50

List of Practical: All practicals to be done online using TinkerCAD

1. Introduction to Arduino
Introduction to Arduino circuits and breadboarding
Blinking of LEDs

2. Program using Light Sensitive Sensors

3. Program using temperature sensors

4. Programs using humidity sensors

5. Programs using Line tracking sensors

6. Programs using Ultrasonic Sensors

7. Programs using digital infrared motion sensors

8. Programs using gas sensors

9. Programs using servo motors

10. Programs making Joystick with Arduino

52
 Computer Oriented Statistical Techniques Practical
B. Sc. (Information Technology) Semester – IV
Course Name: Computer Oriented Statistical Course Code: USIT4P3
Techniques Practical
Periods per week Lectures per week 3
1 Period is 50 minutes
Hours Marks
Evaluation System Practical Examination 2½ 50
List of Practical
1. Using R/Python execute the basic commands, array, list and frames.

2. Create a Matrix using R/Python and Perform the operations addition, inverse,
transpose and multiplication operations.

3. Using R/Python Execute the statistical functions: mean, median, mode, quartiles,
range, inter quartile range histogram

4. Using R/Python import the data from Excel / .CSV file and Perform the above
functions.

5. Using R/Python import the data from Excel / .CSV file and Calculate the standard
deviation, variance, co-variance.

6. Using R/Python import the data from Excel / .CSV file and draw the skewness.

7. Import the data from Excel / .CSV and perform the hypothesis testing.

8. Import the data from Excel / .CSV and perform the Chi-squared Test.

9. Using R/Python perform the binomial and normal distribution on the data.

10. a. Perform the Linear Regression using R/Python.

b. Compute the Least squares means using R/Python.

c. Compute the Linear Least Square Regression using R/Python

Books and References:

Sr. Title Author/s Publisher Edition Year
No.
1. A Practical Approach R.B. Patil, SPD First 2011
to R Tool H.J. Dand and
R. Dahake
2. STATISTICS Murray R. McGRAW –HILL FOURTH 2006
Spiegel, Larry J. INTERNATIONAL
Stephens.
53
 Software Engineering Practical
B. Sc. (Information Technology) Semester – IV
Course Name: Software Engineering Practical Course Code: USIT4P4
Periods per week Lectures per week 3
1 Period is 50 minutes
Hours Marks
Evaluation System Practical Examination 2½ 50

List of Practical (To be executed using Star UML or any similar software)
1. Study and implementation of class diagrams.

2. Study and implementation of Use Case Diagrams.

3. Study and implementation of Entity Relationship Diagrams.

4. Study and implementation of Sequence Diagrams.

5. Study and implementation of State Transition Diagrams.

6. Study and implementation of Data Flow Diagrams.

7. Study and implementation of Collaboration Diagrams.

8. Study and implementation of Activity Diagrams.

9. Study and implementation of Component Diagrams.

10. Study and implementation of Deployment Diagrams.

Books and References:

Sr. Title Author/s Publisher Edition Year
No.
3. Object - Oriented Michael Blaha, Pearson 2011
Modeling and Design James Rumbaugh
4. Learning UML 2. 0 Kim Hamilton, Russ O'Reilly 2006
Miles Media
5. The unified modeling Grady Booch, James Addison- 2005
language user guide Rumbaugh, Ivar Wesley
Jacobson
6. UML A Beginners Jason T. Roff McGraw Hill 2003
Guide Professional

54
 Computer Graphics and Animation
B. Sc. (Information Technology) Semester – IV
Course Name: Computer Graphics and Animation Course Code: USIT4P5
Periods per week Lectures per week 3
1 Period is 50 minutes
Hours Marks
Evaluation System Practical Examination 2½ 50

List of Practical
1. Solve the following:
a. Study and enlist the basic functions used for graphics in C / C++ / Python language.
Give an example for each of them.
b. Draw a co-ordinate axis at the center of the screen.

2. Solve the following:

a. Divide your screen into four region, draw circle, rectangle, ellipse and half ellipse
in each region with appropriate message.
b. Draw a simple hut on the screen.

3. Draw the following basic shapes in the center of the screen :

i. Circle ii. Rectangle iii. Square iv. Concentric Circles v. Ellipse vi. Line

4. Solve the following:

a. Develop the program for DDA Line drawing algorithm.
b. Develop the program for Bresenham’s Line drawing algorithm.

5. Solve the following:

a. Develop the program for the mid-point circle drawing algorithm.
b. Develop the program for the mid-point ellipse drawing algorithm.

6. Solve the following:

a. Write a program to implement 2D scaling.
b. Write a program to perform 2D translation

7. Solve the following:

a. Perform 2D Rotation on a given object.
b. Program to create a house like figure and perform the following operations.
i. Scaling about the origin followed by translation.
ii. Scaling with reference to an arbitrary point.
iii. Reflect about the line y = mx + c.

55
 8. Solve the following:
a. Write a program to implement Cohen-Sutherland clipping.
b. Write a program to implement Liang - Barsky Line Clipping Algorithm

9. Solve the following:

a. Write a program to fill a circle using Flood Fill Algorithm.
b. Write a program to fill a circle using Boundary Fill Algorithm.

10. Solve the following:

a. Develop a simple text screen saver using graphics functions.
b. Perform smiling face animation using graphic functions.
c. Draw the moving car on the screen.

Books and References:

Sr. No. Title Author/s Publisher Edition Year
1. Computer Graphics - J. D. Foley, A. Pearson Second
Principles and Practice Van Dam, S. K. Education Edition
Feiner and J. F.
Hughes
2. Steve Marschner, Peter Fundamentals of CRC press Fourth 2016
Shirley Computer Edition
Graphics
3. Computer Graphics Hearn, Baker Pearson Second
Education
4. Principles of Interactive William M. Tata Second
Computer Graphics Newman and McGraw
Robert F. Hill
Sproull

56
Evaluation Scheme:
1. Internal Evaluation (25 Marks).
i. Test: 1 Class test of 20 marks. (Can be taken online)
Q Attempt any four of the following: 20
a.
b.
c.
d.
e.
f.

ii. 5 marks: Active participation in the class, overall conduct, attendance.

2. External Examination: (75 marks)

All questions are compulsory
Q1 (Based on Unit 1) Attempt any three of the following: 15
a.
b.
c.
d.
e.
f.

Q2 (Based on Unit 2) Attempt any three of the following: 15

Q3 (Based on Unit 3) Attempt any three of the following: 15
Q4 (Based on Unit 4) Attempt any three of the following: 15
Q5 (Based on Unit 5) Attempt any three of the following: 15

3. Practical Exam: 50 marks

A Certified copy journal is essential to appear for the practical examination.

1. Practical Question 1 20
2. Practical Question 2 20
3. Journal 5
4. Viva Voce 5

OR

1. Practical Question 40
2. Journal 5
3. Viva Voce 5

57