B.Sc. (Information Technology) Major Practical 3 Syllabus - Mumbai University

This is the SY BSc IT syllabus under NEP 2020, in force from the academic year 2025-26. The University still sets the earlier Choice Based papers alongside it for ATKT candidates, so check which scheme your exam form names before you revise.

Loading syllabus...

Syllabus for Major Practical 3

Major · Semester 3 · SY BSc IT · 2 credits · 50 marks

Module I

1. Write programs for the following:
a Write 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 Write a program to accept a 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 accept the SGPI from the user and print corresponding grade based on the following:
d SGPI Grade
e 9.00 – 10.00 O
f 8.00 – 8.99 A+
g 7.00 – 7.99 A
h 6.00 – 6.99 B+
i 5.50 – 5.99 B
j 5.00 – 5.49 C
k 4.00 – 4.99 P
l Below 4 F 2. Write programs for the following:
a d. Write a program to generate the Fibonacci series.
b e. Write a program to accept a number from the user display sum of its digits. 3. Write programs for the following:
a Write a program to perform basic operations, indexing and slicing on arrays.
b Write a program to implement mathematical functions on arrays.
c Write a program to perform array aliasing and copying. 4. Write programs for the following:
a Write a program to perform slicing, basic and advanced indexing on
b NumPy arrays.
c e.Write a program to analyze dimensions and attributes of arrays 5. Write programs for the following:
a Write a function to check the input value is Armstrong and also write the function for Palindrome.
b Write a recursive function to print the factorial for a given number.
c Write a lambda function that checks whether a given string starts with a specific character. 6. Write programs for the following:
a Write a program to compute number of characters and words in a string.
b Create a file geometry.py to calculate base areas for shapes square and circle. In another file, 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. 7. Write programs for the following:
a Write a program that takes two lists and returns True if they have at least one common member.
b Write a Python script to sort (ascending and descending) a dictionary by value. 8. Write programs for the following:
a Write a program to accept and pass radius to a function that returns area and circumference (using tuple).
b Write a program to perform basic file operations on text files and binary files.
c Write a Python program to read last n lines of a file. 9. Write programs for the following:
a a.Write a program to count the occurrences of a specific word in a file using regular expressions.
b b.Write a program to extract all hyperlinks (<a href="...">) from an HTML file. 10. Write programs for the following:
a Write a program that compares two dates (in DD/MM/YYYY format) and prints which one is earlier.
b Write a program to measure program execution time.
c Write a program using the calendar module to print the weekday of the first day of a given month and year.

Module II

1. Array Operations: Write a program to implement basic array operations:
a Insert an element at a specific position in an array.
b Delete an element from a specific position in an array.
c Search for an element in an array (linear search). 2. Linked List Manipulation: Write a program to:
a Create a singly linked list.
b Insert a node at the beginning, end, and at a given position in a linked list.
c Delete a node from a given position in a linked list. 3. Stack Application: Write a program to:
a Implement a stack using an array.
b Convert an infix expression to postfix notation using a stack. 4. Queue Application: Write a program to:
a Implement a queue using an array.
b Simulate a simple queuing system (e.g., customer service queue). 5.Binary Search Tree: Write a program to:
a Create a binary search tree.
b Insert nodes into a binary search tree.
c Search for a node in a binary search tree. 6. Tree Traversal: Write a program to:
a Implement pre-order,
b in-order,
c Post-order traversal of a binary tree. 7.Hash Table: Write a program to:
a Implement a hash table with separate chaining for collision handling.
b Store and retrieve data from the hash table. 8.Sorting Algorithms: Write programs to implement and compare the following sorting algorithms:
a Bubble sort
b Insertion sort
c Selection sort 9.Searching Algorithms: Write programs to implement and compare:
a Linear search
b Binary search (on a sorted array) 10.Combined Application
a Design a simple program that uses multiple data structures .

Text Books

1 Learning Python, Fourth Edition by Mark Lutz Copyright © 2009 Mark Lutz. Published by O’Reilly Media, Inc.
2 Python Basics: A Practical Introduction to Python 3 Revised and Updated 4th Edition David Amos, Dan Bader, Joanna Jablonski, Fletcher Heisler
3 Data Structures and Algorithms made Easy: Data Structures and Algorithmic Puzzles, Narasimha Karumanchi ,5 th Edition 2017
1 Let Us Python, Yashwant. B. Kanetkar, BPB Publication, 2019
2 Python: The Complete Reference, Martin C. Brown, McGraw Hill, 2018
3 Beginning Python: From Novice to Professional, Magnus Lie Hetland, Apress, 2017
4 A Simplified Approach to Data Structures, Lalit Goyal, Vishal Goyal, Pawan Kumar SPD,1 st 2014
5 Problem Solving in Data Structures & Algorithms Using C by Hemant Jain ,1st Edition, BPB Publications, 2018
6 Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, 4 th Edition, MIT Press,2022

Reproduced from the University of Mumbai syllabus for B.Sc. (Information Technology) under NEP 2020, in force from the academic year 2025-26. Wording is as printed in that syllabus. Module numbering is as printed there too.

The complete syllabus

This subject is cut from the University circular for its year. Open a document here if you want the whole thing rather than a single subject.

PDF BSc IT SEM I & II (2024 25) NEP NEP 2020 syllabus, in force from 2024-25 Read full PDF Read

PDF BSc IT V & VI 2024 25 Earlier Choice Based syllabus, still set for ATKT candidates Read full PDF Read

PDF SY BSc IT 23 24 Earlier Choice Based syllabus, still set for ATKT candidates Read full PDF Read

BSc IT Syllabus Study Path

Start with the year folder.
Use FYBSc IT, SYBSc IT, or TYBSc IT first so your syllabus check matches the semester you are preparing for.

Check units before opening notes.
Use the syllabus to confirm topics, then open BSc IT notes for the same semester.

Practice after the syllabus check.
Move to BSc IT question papers after reviewing the module scope.

FYBSc IT Syllabus SYBSc IT Syllabus TYBSc IT Syllabus BSc IT Notes BSc IT Papers

Report or request