Computer Science

SEM	Core Subjects (DSCC)			SEC
	Paper Name	Practical Details
1	Computer Fundamentals & Digital Logic (4)	Logic Design using ICs (basic circuits, focus on combinational part)		Data Visualization using Spreadsheets (4)
2	Problem Solving Using C (4)	Problem solving using C Lab (using gcc compiler)		Web Development (4) (HTML, PHP)
3	Data Structures (4)	Upto BSTs (using C)		Mobile App Development (4) (using Android Studio)
	Computer Architecture & Organization (4)	Logic Design using ICs (building logic blocks, & sequential ckts)
4	Computational Mathematics (4)	Numerical Methods (using C)		N.A.
	Microprocessor (4)	8085 MPU Programming
	Operating System (4)	Shell Programming (including system calls)
	Object Oriented Programming (4)	Java Lab
5	Design & Analysis of Algorithms (4)	Graph algorithms (using C++)		N.A.
	Data Communication and Networking (4)	Tutorial
	Theory of Computation (4)	Tutorial
	Database Management System (DBMS) (4)	MySQL & JS
6	Software Engineering (4)	Tutorial (System Analysis & Design Lab)		N.A.
	Programming in Python (4)	Python Lab
	Linear Algebra & Statistical Methods (4)	Related to theory (using Python)
7	Compiler Design (4)	Tutorial		N.A.
	Machine Learning (4)	Related to theory (using Python)
	Computer Graphics (4)	Using Python
	IoT & Embedded Systems (4)	IoT & Embedded Systems (Python and IoT, Embedded Hardware)
	Big Data Analytics / Research Project (4)	Big Data Analytics (Hadoop, MongoDB, Java Spark)
8	Digital Image Processing (4)	Python with OpenCV		N.A.
	Cryptography (4)
	Data Warehousing (4)
	Mobile & Wireless Computing/Research Project (4)	Mobile & Wireless Computing (Network Simulation)
	Cloud Computing (4) / Project
		Cloud Computing (Using Cloud Simulator Learning Virtualisation and Developing Cloud Services)

University of Calcutta

B.Sc (Honours and Honours with Research)

4 – years degree program in Computer Science under credit framework.

(2023)

Semester – I & II

 

Semester – I
Paper	Paper type	Paper name	Credit	Contact hours
DSC/CC-1	Theory	Computer fundamentals and Digital Logic	3	45
	Practical	Computer fundamentals and Digital Logic lab	1	30
SEC – 1	Theory	Data visualization using spreadsheet	3	45
	Practical	Data visualization using spreadsheet Lab	1	30

 

 

 

Semester – II
Paper	Paper type	Paper name	Credit	Contact hours
DSC/CC-2	Theory	Problem Solving using C	3	45
	Practical	Problem Solving using C Lab	1	30
SEC – 2	Theory	Web Development	3	45
	Practical	Web Development Lab	1	30

 

Semester – I
Paper	Paper type	Paper name	Credit	Contact hours
DSC/CC-1	Theory	Computer fundamentals and Digital Logic	3	45
	Practical	Computer fundamentals and Digital Logic lab	1	30
SEC – 1	Theory	Data visualization using spreadsheet	3	45
	Practical	Data visualization using spreadsheet Lab	1	30

 

CMSA- Theory: Computer Fundamentals and Digital Logic

Core Course, Theory, Semester – 1, Credits – 03, Contact hours – 45.

Course description:

The course introduces the fundamental principles and concepts of digital logic, which form the foundation of digital systems and computer architecture. Students will learn about Boolean algebra, logic gates, combinational and sequential circuits, and the design and analysis of digital systems.

Course Objectives:

By the end of the course, students should be able to:

1. Understanding of Computer fundamentals, generations, classification of computers and brief understanding of languages used.
2. Understand the principles and terminology of digital
3. Analyze and simplify Boolean expressions using Boolean
4. Design and implement combinational logic circuits using logic
5. Design and analyze sequential logic circuits, including flip-flops and
6. Apply digital logic concepts to solve practical problems.
7. Utilizing discrete logic gates and integrated circuits on breadboards for the design of digital circuits to enhance hands-on experience and practical understanding.

 

Computer Fundamentals
Central Processing Unit (CPU), Primary memory and Secondary Storage devices, I/O devices, generation and classification of Computers: Super, Mainframe, Mini and Personal Computer, System and Application Software, basic concepts on machine, assembly and high level language.	2 hours
Number Systems
Weighted and Non – Weighted Codes, Positional, Binary, Octal, Hexadecimal, Binary Coded Decimal (BCD), Gray Codes, Alphanumeric codes, ASCII, EBCDIC, Conversion of bases, signed arithmetic, 1’s, 2’s complement representation, Parity bits. Single bit error detection and correcting codes: Hamming Code. Fixed and floating point Arithmetic.	3 hours
Boolean Algebra
Fundamentals of Boolean Expression: Definition of Switching Algebra, Basic properties of Switching Algebra, Huntington’s Postulates, Basic logic gates (AND, OR, NOT), De- Morgan’s Theorem, Universal Logic gates (NAND & NOR), XOR and others, Minterm, Maxterm, Minimization of Boolean Functions using Karnaugh-Map up to four (4)	4 hours

 

variables, two level and multilevel implementation using logic gates, simplification of logic expressions.
Combinational Circuits
Adder & Subtractor: Half adders (2-bit), half Subtractor (2-bit), Full Adder (3-bit), Full Subtractor (3-bit) realization using logic gates, Carry Look Ahead adders, BCD adder, 1’s and 2’s complement adders/subtractor unit using 4-bit parallel adders.	5 hours
Data Selector/Multiplexer: Realization of multiplexers (4 to 1 and 8 to 1) using logical gates, expansion (Cascading), realization of AND, OR and NOT using multiplexers, realization of different Boolean expressions (SOP) using multiplexers.	5 hours
Data Distributor: De-multiplexer, Cascading, realization of various functions.	2 hours
Encoders: Realization of simple and priority encoders using basic and universal logic gates.	2 hours
Chip Selector/Minterm Generator: Realization of decoders using logic gates, function realization, BCD Decoders, Seven Segment display and decoders, cascading.	3 hours
Parity bit, Code Converters and magnitude comparators: Parity bit generator/checker, Gray to binary code, binary to Gray code and Gray to Excess- 3 code converter, 2 & 3 bit magnitude comparators.	2 hours
Sequential Circuits
Latch & Flip-Flops: Basic Set/Reset (SR) Latch using NAND and NOR gates, Gated S-R latches, Gated D Latch, Gated J-K Latch, race around condition, Master-Slave J-K flip flop, negative and positive clock edge detector circuits, edge triggered SR, D, JK, and T flip flop, flip-flop Conversions.	5 hours
Registers: Serial Input Serial Output (SISO), Serial Input Parallel Output (SIPO), Parallel input Serial Output (PISO), Parallel Input Parallel Output (PIPO), Universal Shift Registers.	3 hours
Counters: Asynchronous Counter UP/DOWN Counters, Mod – N Counters, BCD Counter (Counter Construction using J-K and T Flip Flops).	4 hours
Synchronous Counter: UP/DOWN Counters, Mod-N Counters, Ring & Johnson Counters.	3 hours
Integrated Circuits (Qualitative Study): DTL, TTL: Concepts of Fan in & out, TTL NOT, TTL NAND & NOR, NMOS, PMOS, CMOS, IC fabrication (Concepts only): SSI, MSI, LSI, VLSI, ULSI.	2 hours

 

Core Course/DSE, CMSA- Practical: Computer Fundamentals and Digital Logic Lab, Semester – 1, Credits – 01, Contact hours – 30.

 Combinational Circuits

1. Study and prove De-Morgan’s
2. Realization of Universal functions using NAND and NOR
3. Implementation different functions (SOP, POS) using digital logic
4. Implementation of half (2-bit) and full adder (3-bit) using basic (AND, OR and NOT) and Universal logic gates (NAND & NOR).
5. Design 4 to 1 multiplexer using basic or Universal logic gates and implement half and full adder/subtractor.
6. Design and implement half and full adder/subtractor and other functions using multiplexers 74151/74153 and other necessary logic gates.
7. Cascading of
8. Design 2 to 4 decoder using basic or universal logic gates, study 74138 or 74139 and implement half and full Adder/Subtractor and other functions.
9. Design a display unit using Common anode or cathode seven segment display and decoders (7446/7447/7448)
10. Design and implement 4-input 3-output (one output as valid input indicator) priority encoder using basic (AND, OR & NOT) logic gates.
11. Design a parity generator and checker using basic logic

Sequential Circuits 

1. Realization of SR, D, JK Clocked/Gated, Level Triggered flip-flop using logic
2. Master Slave flip-flop using discrete digital logic
3. Conversion of flip-flops: D to JK, JK to D, JK to T, SR to JK, SR to D Flip-
4. Design asynchronous counters MOD-n (upto 4 bits) UP/
5. Construction Synchronous UP/Down Counter (maximum 4 bits).

 

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

 

Recommended Books

1. Digital Fundamentals, 11th Edition by Pearson Eleventh Edition, Thomas Floyd.
2. Digital Logic and Computer Design, M Morris Mano,
3. Digital Electronics, Principles, Devices and Applications, Anil Maini, John Wiley & sons.
4. Digital Principles and Applications, Leach, Malvino, Saha, Tata McGraw Hill
5. Digital Systems, Principal and Applications, Widmer, Moss and Tocci,

 

CMSA- Theory: Data visualization using spreadsheet

SEC-1, Theory, Semester – 1, Credits – 03, Contact hours – 45. Course Description

This Skill Enhancement Course (SEC) provides a comprehensive introduction to essential concepts and practical skills required for proficient utilization of spreadsheets. Students will gain proficiency in data management, visualization, analysis, and presentation using a widely-used open source spreadsheet software application such as Open Office, Libre Office, or Google Spreadsheets. Through this course, students will acquire the ability to proficiently create, format, manipulate, and analyze data within spreadsheets to meet a diverse range of needs.

Course Objectives

1. The purpose and potential applications of
2. Create, format, and modify
3. Use of formulas, functions, and calculations to perform data
4. Understanding and utilization of advanced spreadsheet features such as data validation, conditional formatting, and pivot tables.
5. Design visually appealing charts and graphs to represent
6. Collaborate and share spreadsheets with
7. Apply spreadsheet skills to real-world scenarios and problem-
8. Role of spreadsheets in data
9. Import, clean, and transform data for
10. Applicability of statistical and mathematical functions for data
11. Advanced features and tools for data
12. Perform exploratory data analysis and identify patterns and
13. Create informative reports and summaries based on data analysis.
14. Apply data analysis techniques to real-world

 

Description	Teaching hours
Introduction to Spreadsheets Spreadsheets and their applications, overview of spreadsheet software (e.g., Open office, Google Sheets, Excel), creating workbooks, modifying workbook, modifying workbook, zooming in on a worksheet, arranging multiple workbook windows, adding buttons to the quick access toolbar, customizing the ribbon, maximizing usable space in the program window navigating the spreadsheet interface, entering and editing data in cells saving, opening, and closing spreadsheet files.	2 hours
Working with Data and Tables Entering and revising data, moving data within a workbook, finding and replacing data, correcting and expanding upon worksheet data, defining tables.	2 hours
Performing Calculations on Data Naming groups of data, creating formulas to calculate values (e.g., SUM, AVERAGE, COUNT), summarizing data that meets specific conditions (e.g., AVERAGEIF, COUNTA, COUNTBLANK, COUNTIFS, SUMIF, IFERROR etc), finding and correcting errors in calculations.	2 hours

 

Changing Workbook Appearance Formatting Cells, defining styles, workbook themes and table styles, making numbers easier to read, changing the appearance of data based on its value, adding images to worksheets.	2 hours
Data Analysis and Manipulation Limiting data appearance on screen, working with text functions for data cleaning, Splitting and combining data, Data normalization and standardization, working with ranges and named ranges, conditional formatting, data validation and error checking, using logical functions (e.g., IF, AND, OR), sorting and filtering data.	4 hours
Advanced Spreadsheet Features Creating and managing tables, creating and modifying pivot tables, using lookup functions (e.g., VLOOKUP, HLOOKUP), working with charts and graphs, importing and exporting data.	4 hours
Statistical Functions and Analysis Descriptive statistics (mean, median, mode, variance, etc.), Calculating measures of central tendency and dispersion, Correlation and regression analysis, Hypothesis testing and confidence intervals, Analysis of variance (ANOVA).	5 hours
Pivot Tables and Data Aggregation Creating pivot tables for data summarization, grouping and aggregating data by categories, Applying filters and slicers to pivot tables, calculating calculated fields and items.	4 hours
Advanced Data Visualization Creating charts and graphs for data representation, Customizing chart elements (titles, axes, legends), Using sparklines and data bars for visual analysis, Creating interactive dashboards, Incorporating trendlines and forecasting in charts.	5 hours
Exploratory Data Analysis Identifying patterns and outliers in data, Creating histograms and box plots, Using conditional formatting for data visualization, Data segmentation and drill-down analysis, Applying data validation rules for data integrity.	4 hours
Advanced Analysis Techniques Using goal seek and solver for optimization problems, Performing “what-if” analysis with data tables, Simulating data using random number functions, Monte Carlo simulation for risk analysis, creating scenario analysis models.	4 hours
Reporting and Presentation of Results Designing informative reports and summaries, creating interactive dashboards for data presentation, data visualization best practices, documenting data analysis processes presenting findings to stakeholders.	3 hours
Collaboration and Sharing Protecting worksheets and workbooks, sharing spreadsheets with others, tracking changes and commenting, collaborating in real-time, using version history and revision control.	4 hours

 

CMSA- Practical – Data visualization using spreadsheet

SEC, Laboratory, Semester – 1, Credits – 01, Contact hours – 30.

1. Create a personal budget spreadsheet that tracks income, expenses, and savings over a specified Use formulas and functions to calculate totals, percentages, and remaining balances.

 

2. A dataset containing sales data for a company to be A spreadsheet to be created that calculates monthly sales totals, identifies top-selling products, and visualizes sales trends using line charts or bar graphs. Use conditional formatting to highlight exceptional sales performances.

 

3. Design a grade book spreadsheet that calculates students’ final grades based on assignments, exams, and participation. Incorporate weighted grading systems, formulas for calculating averages, and conditional formatting to indicate performance Generate reports to track individual student progress.

 

4. Create a spreadsheet that tracks inventory for a hypothetical business. Include columns for item names, quantities, prices, and total values. Use formulas to automatically update inventory totals, generate alerts for low stock, and create visualizations to represent inventory levels over time.

 

5. Loan parameters, such as principal amount, interest rate, and loan term to be Create a spreadsheet that calculates monthly loan payments, remaining balances, and interest paid over time using appropriate formulas. Create a chart to visualize the loan’s repayment schedule.

 

6. Dataset to be provided which will allow various data analysis tasks using spreadsheets. Calculation of summary statistics, sorting and filtering data, creating pivot tables for deeper insights, and generation of charts or graphs to visualize patterns or trends within the data.

 

7. A dataset to be selected (e.g., stock prices, weather data, population growth, etc) and create line charts or area charts to visualize trends over time. Students should choose appropriate chart types, label axes, and add titles and legends to make the visualization clear and informative.

 

8. A dataset containing information about different products or variables (e.g., sales data, customer satisfaction ratings) to be provided and following to be done; create bar charts or column charts to compare the performance or rankings of the Use color, data labels, and chart elements to enhance the visual comparison.

 

9. A dataset containing time-series data for multiple variables (e.g., monthly sales data for different products) to be provided and the following task to be performed; to create a combo chart with lines and columns to compare the trends of the variables and identify any relationships or patterns.

 

10. To create a unique visualization using advanced spreadsheet features and For example, an experiment with sparklines, radar charts, or treemaps to represent specific types of data or explore innovative ways to visualize information.

 

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

 

Recommended Text books

 

1. Data Analysis and Decision Making with Microsoft Excel” by Christian Albright.
2. Microsoft Excel 2019 Data Analysis and Business Modeling, Sixth Edition, Wayne L. Winston, Pearson education.
3. Excel 2019 Bible, Michael Alexander, 11^th edition,
4. Microsoft Office 2019 for Dummies, Wallace Wang,

 

Recommended Application Software 

1. Google Spreadsheets
2. Libre/Open Office
3. Excel sptreadsheets

 

Semester – II
Paper	Paper type	Paper name	Credit	Contact hours
DSC/CC-2	Theory	Problem Solving using C	3	45
	Practical	Problem Solving using C Lab	1	30
SEC – 2	Theory	Web Development	3	45
	Practical	Web Development Lab	1	30

 

CMSA- Theory: Problem Solving using C

DSC/CC-2, Theory, Semester – 2, Credits – 03, Contact hours – 45.

 

Objective of the Course

The objectives of this course are to make the student understand programming language, programming, concepts of Loops, reading a set of Data, stepwise refinement, Functions, Control structure, Arrays. After completion of this course the student is expected to analyze the real life problem and write a program in ‘C’ language to solve the problem. The main emphasis of the course will be on problem solving aspect i.e. developing proper algorithms.

After completion of the course the student will be able to;

1. Develop efficient algorithms for solving a problem.
2. Use the various constructs of a programming language conditional, iteration and recursion.
3. Implement the algorithms in “C”
4. Use simple data structures like arrays, stacks and linked list in solving
5. Handling File in “C”.

Outline of Course 

S. No.	Topic	Minimum number of hours
1	Introduction to Programming	03
2	Algorithm/ Flowchart for Problem Solving	06
3	Introduction to ‘C’ Language	02
4	Conditional Statements and Loops	05
5	Arrays	05
6	Functions	04
7	Storage Classes	02
8	Structures and Unions	05
9	Pointers	05
10	Self-Referential Structures and Linked Lists	04
11	File Processing	02
12	Organizing C Projects	02
Lectures = 45 Practical/tutorials = 30, Total = 75

Detailed Syllabus 

Description	Teaching hours
Introduction to Programming The Basic Model of Computation, Algorithms, Flow-charts, Programming Languages, Compiler, Interpreter, Assembler, Linker and Loader, Testing and Debugging, Documentation.	03 hours
Algorithms/ Flowchart for Problem Solving Exchanging values of two variables, summation of a set of numbers, decimal base to binary base conversion, reversing digits of an integer, GCD (Greatest Common Division) of two numbers, test whether a number is prime, organize numbers in ascending order using bubble sort, find integer square root of a number, factorial computation, Fibonacci sequence, evaluate ‘sin x’ as sum of a series, reverse order of elements of an array, find largest number in an array, print elements of upper triangular matrix, multiplication of two matrices, evaluate a Polynomial.	06 hours
Introduction to ‘C’ Language Character set, variables, identifiers and their nomenclature, built-in data types, variable declaration, arithmetic operators and expressions, constants and literals, simple assignment statement, basic input/output statement, simple ‘C’ programs.	02 hours
Conditional Statements and Loops Decision making within a program, conditions, relational operators, logical connectives, if statement, if-else statement, Loops: while loop, do while, for loop, nested structure, infinite loops, switch-case, break, continue statement, structured programming.	05 hours
Arrays One dimensional arrays: Array manipulation; Searching, Insertion, deletion of an element from an array; finding the largest/smallest element in an array; two dimensional arrays, addition/multiplication of two matrices, Transpose of a square matrix; null terminated strings as array of characters, standard library string functions.	05 hours
Functions Top-down approach of problem solving, modular programming and functions, standard library of C functions, Prototype of a function: Formal parameter list, return type, function call, block structure, passing arguments to a function: call by reference, call by value, Recursive functions, arrays as function arguments.	04 hours
Storage Classes Scope and extent, Storage Classes in a single source file: auto, extern and static, register, Storage Classes in a multiple source files: extern and static	02 hours
Structures and Unions Structure variables, initialization, structure assignment, nested structure, structures and functions, structures and arrays: arrays of structures, structures containing arrays, unions	05 hours
Pointers Address operators, pointer type declaration, pointer assignment, pointer initialization, pointer arithmetic, functions and pointers, Array of Pointers, pointer to an array, pointers and structures, dynamic memory allocation.	05 hours

 

Self-Referential Structures and Linked Lists Creation of a singly connected linked list, Traversing a linked list, Insertion into a linked list, Deletion from a linked list	04 hours
File Processing Concept of Files, File opening in various modes and closing of a file, Reading from a file, Writing onto a file, Appending to a file.	02 hours
Organizing C projects, working with multiple source directories, makefiles.	02 hours

 

Recommended books main reading

1. Byron S Gottfried “Programming with C” Second edition, Tata McGraw Hill, 2007 (Paperback)
2. G. Dromey, “How to solve it by Computer”, Pearson Education, 2008.
3. Kanetkar Y, “Let us C”, BPB Publications,
4. Hanly J R & Koffman B, “Problem Solving and Program design in C”, Pearson Education, 2009.
5. Kashi Nath Dey and Samir Bandyopadhayay “C Programming Essentials” Pearson India Education,

 

Supplementary reading.

1. Balagurusamy, “Programming with ANSI-C”, Fourth Edition,2008, Tata McGraw Hill.
2. Venugopal R and Prasad S. R, “Mastering ‘C’”, Third Edition, 2008, Tata McGraw Hill.
3. W. Kernighan & D. M. Ritchie, “The C Programming Language”, Second Edition, 2001, Pearson education.
4. ISRD Group, “Programming and Problem-Solving Using C”, Tata McGraw Hill,2008.
5. Pradip Dey, Manas Ghosh, “Programming in C”, Oxford University Press,

CMSA- Practical: Problem Solving using C

DSC/CC-2, Practical, Semester – 2, Credits – 01, Contact hours – 30.

 

Algorithms / Flowchart (Sample and simple assignments)

1. Design a flowchart/ Algorithm for a basic calculator that accepts two numbers and an operator (+, -, *, /) as input from the user and performs the corresponding operations, and displaying/print the result.
2. Create a flowchart/Algorithm that converts a temperature from Celsius to Fahrenheit or vice versa based on user input.
3. Design a flowchart/Algorithm that calculates the factorial of a given positive integer provided by the user.
4. Create a flowchart/Algorithm that finds and displays the largest number among three input numbers given by the user.
5. Design a flowchart/Algorithm to implement the linear search algorithm to find a specific element in an array of The array and the element to search for should be taken as user input.
6. Create a flowchart/Algorithm that calculates the area and perimeter/circumference of different shapes (e.g., circle, rectangle, triangle) based on user input for dimensions.
7. Design a flowchart/Algorithm that checks whether a given input string is a palindrome or

 

Introduction to ‘C’ Language (Assignments/examples related to simple C program.)

8. Write a program in C to read two numbers and produce the sum and product of those numbers and show the result separately.
9. Write a program in C to read two numbers and print the greater number, if both the numbers are same them print “EQUAL”.
10. Write a program in C multiple numbers say n and print the greatest and the third
11. Write a program in C to read n numbers and print the even/odd numbers up to
12. Write a program in C to read a number and print the sum of n natural
13. Write a program in C to read a number n and print factor of
14. Write a program in C to read a number n and print first 10 multiples of
15. Write a program in C to read a number n and print if n is “PRIME” or “COMPOSITE”.
16. Write a program in C to calculate the average of a set of N
17. Write a program in C convert the temperature given in Celsius to Fahrenheit or vice-
18. Write a program in C to determine and print the sum of the following harmonic series for a given value of n: 1+1/2+1/3+……………………………………. 1/n.
19. Write a program in C that reads a floating-point number and then displays the right most digits of integral part of the number.
20. Write a program in C to accept the length and breadth in meters and calculate the area and perimeter and also determine if it is a rectangle or a square based on the inputs given.
21. Write a program in C to accept an input and determine if the input entered is a number or alphabet or a special character.
22. Write a program in C to accept a word and then print the reverse case that is lower to upper or upper to lower case.
23. Write an     interactive     program     in     C     which     will      demonstrate     the     process     of division/multiplication, the user should be asked to enter two-digit numbers.

 

Conditional Statements and Loops (simple examples)

 

24. Write a program in C to read a number n and print n terms of the Fibonacci
25. Write a program in C to read a number n and print a single digit answer showing sum of the digits of (example – input 8626, expected output – 4, explanation 8+6+2+6 = 22, 2+2 = 4).
26. Write a program in C to read a number n and print all the prime numbers up to
27. Write a program in C to read a number n and print the following pattern (input = 5, expected output

1

12

123

1234

12345).

28. Write a program in C to check if the given number is the Armstrong number or not (e.g 153 = 13+53+33).
29. Write a program in C to check the type of the given triangle whether it is equilateral, isosceles or scalene.

 

Arrays (examples of few simple programs)

30. Write a program in C to read a string and store it into a character array. Check whether the string is a palindrome or not and display accordingly.

 

31. Write a program in C to read a list of numbers stored in an integer array and while saving them arrange in ascending order.
32. Write a program in C to read two matrices and perform
33. Write a program in C to read two matrix and check their compatibility for multiplication, if compatible then find product and print it.
34. Write a program in C to read a string and print the triangular pattern using the

Functions

 

35. Write a program in C to print all the Armstrong number from 1 to
36. Write a function convert () that returns a weight in Kg after being given a weight in
37. Write a function to find all perfect numbers from 1 to 100 (perfect numbers are positive integers where the sum of perfect divisor is the number itself, e.g., 6 = 1+2+3).
38. Write a function power () to find base raise to power [base^power].

39. Write a program in C to find solution of a quadratic equation [ 𝑥 = –b±√b2–4a ] where values

2a

a, b and c to be accepted from the user as input.

40. Accept inputs from the user and echo it on to the screen in normal as well as in reverse using void recursive function.
41. Accept any number from the user and calculate the factorial of the number using recursion
42. Accept numbers n and print the odd/even numbers up to n using recursive
43. Write a program in C in compute the cubes of all numbers from 10 to
44. Write a program in C to find the GCD of a
45. Write a program in C to generate all combinations of 1, 2, 3, 4 using recursion, e.g.,1234, 2341….. etc.

 

Storage Classes

46. Write a program in C to accept a number and find the factorial of the number demonstrating use of automatic variables.
47. Write a program in C to accept two numbers and find the sum of the number demonstrating use of external variables.
48. Write a program in C to accept two numbers and find the sum of the number demonstrating use of global variables.
49. Write a program in C to illustrate the use of static
50. Write a program in C to accept numbers till a negative number is entered and calculate the sum of a list of numbers read using static variable.
51. Write a program in C to sum integers and use static variable to store the cumulative

Pointers

52. Write a program in C to swap two numbers of n
53. Write a program in C for swapping numbers using
54. Write a program in C to illustrate the Call by Value and Call by reference a rule in C
55. Write a program in C to use a double dimensional array and print each cells value and
56. Write a program in C to show the use of Array, declared at compilation time (static manner) to read 10 numbers and display them.
57. Write a program in C to show the use of Array, declared dynamically to read 10 numbers and display them.
58. Write a program in C to read a string in a dynamic array and determine whether it is palindrome or not.

 

Structures and Unions

 

59. Write a program in C to read the data of a student, store it in a structure and display
60. Write a program in C to read the data of many students, store it in a structure and display the student’s data and average percentage of the class.
61. Write a program in C to accept two dates from the user, validate both of them and check if they are different dates.
62. Write a program in C to accept students’ data from the user. Check if the student stream is science, commerce or If the stream is arts, then print the class of students. If the stream is science, then print the grade and if the stream is commerce, then print the percentage.

 

Files

63. Write a program in C showing the technique of opening and closing a file say dat and writing a list of numbers and its square into the file.
64. Write some texts into a file, reopen the file in read mode and reproduce the text on the monitor (use of putc() and fputc()).
65. Write a few numbers in the file created Reopen it in Read mode, write odd numbers in one file and even number in another file (use the getw and putw functions).
66. Write programs to demonstrate the use of getc(), fgetc() and ungetc().
67. Write programs to demonstrate the use of String I/O, Formatted I/O and End of file eof() and feof().

Recommended assignment content/structure

• Objective
• Algorithm/Flowchart
• Code
• Result
• Conclusion

Platform/Compiler

• GCC

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

CMSA- Theory: Web development

SEC, Theory, Semester – 2, Credits – 03, Contact hours – 45. Course Description

This course provides an introduction to web development using HTML (Hypertext Markup Language) and CSS (Cascading Style Sheets). Students will learn the core concepts and practical skills needed to create and style web pages. The course covers the fundamentals of HTML structure, CSS styling properties, and responsive web design principles.

Course Objectives

1. Understanding the basics of web development and the role of HTML and
2. Create well-structured HTML documents using proper tags and

 

3. Apply CSS to style web pages, including layout, typography, colors, and
4. Implement responsive design techniques to ensure optimal display on different
5. Incorporate multimedia elements, such as images, videos, and audio, into web
6. Understand best practices for organizing and maintaining code in web development
7. Develop and deploy a basic website using HTML and

 

 

Description	Teaching hours
Introduction to Web development Overview of web technologies and the role of HTML and CSS, understanding the structure of a web page, introduction to web browsers and developer tools.	3 hours
HTML Fundamentals Introduction to HTML tags and elements, creating headings, paragraphs, lists, and links, working with images and multimedia content, creating forms for user input.	3 hours
CSS basics Introduction to CSS and its role in web page styling, selectors, properties, and values, applying inline, internal, and external style sheets, formatting text, backgrounds, and borders.	3 hours
CSS Layout and box model Understanding the box model and its impact on layout, working with margins, padding, and borders, positioning elements using floats, positioning properties, and flexbox, creating responsive layouts with media queries.	3 hours
Typography and colors Styling text with fonts, sizes, weights, and styles, formatting text using CSS properties, understanding color models and applying colors to elements.	4 hours
Images and multimedia Working with images: sizing, aligning, and optimizing, incorporating videos and audio into web pages, implementing responsive images and media.	4 hours
CSS Selectors and specificity Understanding CSS selectors and specificity, applying styles to specific elements and classes, using pseudo-classes and pseudo-elements.	5 hours
Responsive Web design Introduction to responsive design principles, creating fluid layouts using CSS media queries, adapting web pages for different screen sizes and devices.	4 hours
CSS Frameworks and libraries Overview of popular CSS frameworks (e.g., Bootstrap, Foundation), using pre-built CSS components and grids, customizing and integrating CSS frameworks into web projects.	5 hours
Web development best practices Organizing and structuring code files and directories, validating HTML and CSS code, optimizing web pages for performance, introduction to version control with Git.	3 hours
Building and deploying a website Planning and designing a basic website structure, Implementing HTML and CSS to create the website, testing and debugging the website across different browsers, deploying the website to a local host/web server	6 hours

 

CMSA- Web development

SEC, Laboratory, Semester – 2, Credits – 01, Contact hours – 30.

1. Creating a personal portfolio website using HTML and There should be sections for an about me, projects, skills, and contact information’s. Using CSS to style the layout, typography, and colors to create a visually appealing and professional-looking portfolio.

 

2. To design a responsive website that adapts to different screen sizes. They should create a layout that adjusts fluidly using CSS media queries and responsive design techniques.

 

3. To create a product landing page for a fictional product or an existing HTML to be used to structure the page and CSS to style the layout, typography, buttons, and images. Main focus to be on creating an engaging page that effectively showcases the chosen product.

 

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

 

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

 

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

 

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

 

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

 

Suggested Readings.

 

1. Mastering HTML, CSS & Java Script Web Publishing, Laura Lemay, Rafe Colburn, Jennifer Kyrnin, BPB Publication.
2. Web designing and development, Satish Jain, BPB
3. HTML & CSS: The complete reference, Thomas Powell, McGraw Hill
4. Web programming with HTML5, CSS and JavaScript, John Dean, Joneas and Bartlet
5. Sams Teach Yourself HTML, CSS, and JavaScript All in One, Julie C Meloni, Pearson
6. Learning Web App development, Semmy Purewal, O’Reilly.

 

 

INTERDISCIPLINARY COURSE

Fundamentals of Computer Science and its applications             45 hrs

Course Outcome:

• Demonstrate the basic concepts of Computer science, such as Computer Architecture, Data representation, Algorithms, and Data structures.
• Write basic programs in a high-level programming language, such as
• Explain how computers communicate with each other over a
• Explain how artificial intelligence is used in real-world
• Use ICT tools to create documents, spreadsheets, and

Detailed Syllabus

• Introduction to computers and computing 08

History of computing and the different types of computers that are available today, Generations of computers, Basic Building blocks (CPU, Memory, I/O Devices), types of computer (Mainframe, Desktop, Laptop, System on Chip). Classification of Software – System and Application Software, Basic Security Anti-Virus.

• Data representation and number systems 04 hr

Concept of binary code, ASCII and how it is used to represent data in computers, How different number systems work

• Algorithms and data structures 06 hr

Basic concepts of algorithms and data structures: Common algorithms and data structures, such as sorting algorithms and linked lists.

• Office suite 08 hr

Word processors, Spreadsheets, and Presentation

• Programming languages 08 hr

Basic concepts of programming languages: types of programming languages , machine language, assembly language, high level language, Introduction to writing basic programs in Python ( Finding prime numbers, finding GCD of two numbers etc,)

• Networking 05 hr

Basic concept of networking and how computers communicate with each other, LAN, WAN, Introduction to the concept of the internet and how it works. Mobile communication

• Artificial intelligence 05 hr

 

Basic concept of artificial intelligence and how it is used in computers. Introduction to Machine Learning, Preliminary concept of Big Data, Recommendation System, Conversation Agents like ChatGPT, Prompt Engineering

• Information and Communications (ICT) Tools 01 hr

Importance of ICT tools, different types of ICT tools and their uses

Recommended Books:

1. Computer Science:       An       Interdisciplinary       Approach,       Robert Sedgewick (Author), Kevin Wayne (Author)
2. Introduction To Computer Science, Anita Goel Pearson India

 

Structure of Core Courses in Computer Science for Three-year MDC

 

Semester	Course / Paper Code	Course Name
1	CMS- MD- CC1- 1- Th/ P	Computer Fundamentals and Digital Logic
2	CMS- MD- CC2- 2- Th / P	Problem Solving using C

 

Structure of Minor Courses in Computer Science for MDC

Semester	Course / Paper Code	Course Name
3	CMS- MD- MC1- 3- Th / P	Computer Fundamentals and Digital Logic
4	CMS- MD- MC2- 4- Th / P	Problem Solving using C

 

Structure of Skill Enhancement Courses in Computer Science for MDC

Semester	Course / Paper Code	Course Name
Semester 1/2/3	CMS- MD- SEC2- 2- Th / P	Web Development (HTML / PHP)

 

 

Structure of Skill Interdisciplinary Courses in Computer Science for MDC

Semester	Course / Paper Code	Course Name
Semester 1/2/3	CMS- MD- IDC2- 2- Th / P	Fundamentals of Computer Science and their Applications

 

Syllabus for B.Sc. (Honours) in Computer Science (CMSA) with Choice Based Credit System (CBCS) for Semesters– I-VI from the Academic Session 2018-19

SEMESTER – I

 

Semester	Courses	Topics	Credit
I	CMS-A-CC-1-1-TH (Core Course-1) Theory	Digital Logic	4
	CMS-A-CC-1-1-P (Core Course-1) Practical	Digital Circuits	2
	CMS-A-CC-1-2-TH (Core Course-2) Theory	Programming Fundamentals using C	4
	CMS-A-CC-1-2-P (Core Course-2) Practical	Programming in C	2

 

Computer Science (Honours) CMSA -CBCS Syllabus

SEMESTER – II

 

Semester	Courses	Topics	Credit
II	CMS-A-CC-2-3-TH (Core Course – 3) Theory	Computer Organization and Architecture	4
	CMS-A-CC-2-3-P (Core Course – 3) Practical	Computer Organization Lab.	2
	CMS-A-CC-2-4-TH (Core Course – 4) Theory	Basic Electronic Devices and Circuits	4
	CMS-A-CC-2-4-P (Core Course – 4) Practical	Basic Electronic Devices and Circuits Lab	2

 

Computer Science (Honours) CMSA – CBCS Syllabus

SEMESTER – III

 

Semester	Courses	Topics	Credit
III	CMS-A-CC-3-5-TH (Core Course-5) Theory	Data Structure	4
	CMS-A-CC-3-5-P (Core Course – 5) Practical	Data Structure using C	2
	CMS-A-CC-3-6-TH (Core Course – 6) Theory	Computational Mathematics	4
	CMS-A-CC-3-6-P (Core Course – 6) Practical	Computational Mathematics Lab	2
	CMS-A-CC-3-7-TH (Core Course – 7) Theory	Microprocessor and its Applications	4
	CMS-A-CC-3-7-P (Core Course – 7) Practical	Programming Microprocessor 8085	2
	Skill Enhancement Course, SEC-A (Candidate has to opt any one topic from the under mentioned courses)
	CMS-A-SEC-A-3-1-TH Skill Enhancement Course, SEC-A-1	Computer Graphics	2
	CMS-A-SEC-A-3-2-TH Skill Enhancement Course, SEC-A-2	Sensor Network and IoT	2

 

Computer Science (Honours) CMSA – CBCS Syllabus

SEMESTER – IV

 

Semester	Courses	Topics	Credit
IV	CMS-A-CC-4-8-TH (Core Course – 8) Theory	Data Communication, Networking and Internet Technology	4
	CMS-A-CC-4-8-P (Core Course – 8) Practical	Computer Networking and Web Design	2
	CMS-A-CC-4-9-TH (Core Course – 9) Theory	Introduction to Algorithms & its Applications	4
	CMS-A-CC-4-9-P (Core Course – 9) Practical	Algorithms Lab.	2
	CMS-A-CC-4-10-TH (Core Course – 10) Theory	Operating Systems	4
	CMS-A-CC-4-10-TH (Core Course – 10) Practical	Operating Systems Lab. (Shell Programming)	2
	Skill Enhancement Course, SEC-B (Candidate has to opt any one topic from the under mentioned courses)		2
	CMS-A-SEC-B-4-1-TH Skill Enhancement Course, SECB1	Information Security	2
	CMS-A-SEC-B-4-2-TH Skill Enhancement Course, SECB2	E-Commerce	2

 

Computer Science (Honours) CMSA – CBCS Syllabus

SEMESTER – V & VI

 

Semester	Courses	Topics	Credit
V	CMS-A-CC-5-11-TH (Core Course – 11) Theory	Data Base Management System (DBMS)	4
	CMS-A-CC-5-11-P (Core Course – 11) Practical	RDBMS Lab using My SQL & PHP	2
	CMS-A-CC-5-12-TH (Core Course – 12) Theory	Object Oriented Programming System (OOPs)	4
	CMS-A-CC-5-12-P (Core Course – 12) Practical	OOPs Lab using Java	2
VI	CMS-A-CC-6-13-TH (Core Course – 13) Theory	Software Engineering	4
	CMS-A-CC-6-13-P (Core Course – 13) Practical	Software Engineering Lab	2
	CMS-A-CC-6-14-TH (Core Course – 14) Theory	Theory of Computation	4
	CMS-A-CC-6-14-P (Core Course – 14) Practical	PROJECT	2
DSE-A	Discipline Specific Elective Courses- DSE-A Candidates have to opt any one topic either from DSE-A-1 or from DSE-A-2 in Semester-V & another topic either from DSE-A-3 or from DSE-A-4 in Semester-VI from the following courses
	CMS-A-DSE-A–1-TH Discipl.Sp.Elec.DSEA1,Theory	Digital Image Processing	4
	CMS-A-DSE-A–1-P Discipl.Sp.Elec.DSEA1, Practical.	Image Processing Lab.	2
	CMS-A-DSE-A–2-TH Discipl.Sp.Elec.DSEA2,Theory	Data Mining & its Applications	4
	CMS-A-DSE-A–2-P Discipl.Sp.Elec.DSEA2, Practical.	Data Mining Lab.	2
	CMS-A-DSE-A–3-TH Discipl.Sp.Elec.DSEA3,Theory	Embedded Systems	4
	CMS-A-DSE-A–3-P Discipl.Sp.Elec.DSEA3, Practical.	Embedded Systems Lab.	2
	CMS-A-DSE-A–4-TH Discipl.Sp.Elec.DSEA4,Theory	Multimedia and its Applications	4
	CMS-A-DSE-A–4-P Discipl.Sp.Elec.DSEA4, Practical.	Multimedia and its Applications Lab.	2
DSE-B	Discipline Specific Elective Courses- DSE-B Candidates have to opt any one topic either from DSE-B-1 or from DSE-B-2 in Semester-V & another topic either from DSE-B-3 or from DSE-B-4 in Semester-VI from the following courses
	CMS-A-DSE-B–1-TH Discipl.Sp.Elec.DSE-B-1,Theory	Operation Research (O.R.)	4
	CMS-A-DSE-B–1-P Discipl.Sp.Elec.DSE-B-1, Practical.	Operation Research (O.R.) Lab. using C/ Python	2
	CMS-A-DSE-B–2-TH Discipl.Sp.Elec.DSE-B-2,Theory	Programming using Python	4
	CMS-A-DSE-B–2-P Discipl.Sp.Elec.DSE-B-2, Practical.	Programming using Python	2
	CMS-A-DSE-B–3-TH Discipl.Sp.Elec.DSE-B-3,Theory	Introduction to Computational Intelligence	4
	CMS-A-DSE-B–3-P Discipl.Sp.Elec.DSE-B-3, Practical	Computational Intelligence Laboratory
	CMS-A-DSE-B–4-TH Discipl.Sp.Elec.DSE-B-4, Theory	Advanced Java	4
	CMS-A-DSE-B–4-P Discipl.Sp.Elec.DSE-B-4, Practical	Advanced Java Laboratory	2

 

 

UNIVERSITY OF CALCUTTA

 

SYLLABUS of Bachelor of Science (General) in Computer Science (CMSG) Choice Base Credit System (CBCS) 2018

Semester-wise courses for B.Sc. (General)

	Sem-1	Sem-2	Sem-3	Sem-4	Sem-5	Sem-6
Core Course (CC)	CC-1	CC-2	CC-3	CC-4
AECC	AECC-1	AECC-2
Skill Enhancement course (SEC)			SEC-A	SEC-B	SEC-A	SEC-B
Total No. of Courses & marks	4×100 =400	4×100 =400	4×100 =400	4×100 =400	4×100=400	4×100=400
Total Credits	20	20	20	20	20	20

Computer Science General (CMSG) Syllabus

 

Courses	Topics	Credit
CMS-G-CC-1-1-TH Sem-1-Core Course-1 Theory	Computer Fundamentals and Digital Logic Design	04
CMS-G-CC-1-1-P Sem-1-Core Course-1 Practical	Word Processing, Spreadsheet, Presentation and Web design by HTML/ PHP	02
CMS-G-CC-2-2-TH Sem-2- Core Course-2Theory	Algorithm and Data Structure	04
CMS-G-CC-2-2-P Sem-2-Core Course-2 Practical	Programming with C	02
CMS-G-CC-3-3-TH Sem-3- Core Course-3 Theory	Computer Organization	04
CMS-G-CC-3-3-P Sem-3-Core Course-3 Practical	Programming using PYTHON	02
CMS-G-CC-4-4-TH Sem-4- Core Course-4 Theory	Operating System	04
CMS-G-CC-4-4-P Sem-4-Core Course-4 Practical	Shell Programming (Unix/Linux)	02
Skill Enhancement Courses (SEC-A & B): Choices : Semesters-3 to 6
CMS-G-SEC-A-X-1-TH	Communication, Computer Network and Internet	02
CMS-G-SEC-A-X-2-TH	Software Engineering	02
CMS-G-SEC-B-X-1-TH	Multimedia and its Applications	02
CMS-G-SEC-B-X-2-TH	Information Security	02
Discipline Specific Elective- A (DSE- A): Candidate has to opt any one of the following topics
CMS-G-DSE-A-5-1-TH	Data base Management System (DBMS)	04
CMS-G-DSE-A-5-1-P	Database Design and Applications	02
CMS-G-DSE-A-5-2-TH	Object Oriented Programming	04
CMS-G-DSE-A-5-2-P	Object Oriented Programming by C++/ Java	02
CMS-G-DSE-A-5-3-TH	Sensor Network and IoT	04
CMS-G-DSE-A-5-3-P	Sensor Network and IoT Lab.	02
Discipline Specific Elective- B (DSE- B): Candidate has to opt any one of the following topics
CMS-G-DSE-B-6-1-TH	Embedded Systems	04
CMS-G-DSE-B-6-1-P	Embedded Systems Lab.	02
CMS-G-DSE-A-6-2-TH	Operation Research	04
CMS-G-DSE-A-6-2-P	Operation Research Lab.	02
CMS-G-DSE-A-6-3-TH	Computational Mathematics	04
CMS-G-DSE-A-6-3-P	Computational Mathematics Lab.	02

 

Semester –I

 

Courses	Topics	Periods	Credit
CMS-G-CC-1-1-TH Sem-1-Core Course-1 Theory	Computer     Fundamentals     and Digital Logic Design	60 hours	04
CMS-G-CC-1-P Sem-1-Core Course-1 Practical	Word Processing, Spreadsheet, Presentation and Web design by HTML/ PHP	40 hours	02

 

Semester –II

 

Courses	Topics	Periods	Credit
CMS-G-CC-2-2-TH Sem-2-Core Course-2 Theory	Algorithms and Data Structure	60 hours	04
CMS-G-CC-2-2-P Sem-2-Core Course-2 Practical	Programming with C	40 hours	02

 Semester –III 

Courses	Topics	Periods	Credit
CMS-G-CC-3-3-TH Sem-3-Core Course-3 Theory	Computer Organization	60 hours	04
CMS-G-CC-3-3-P Sem-3-Core Course-3 Practical	Programming using Python	40 hours	02

 Semester –IV 

Courses	Topics	Periods	Credit
CMS-G-CC-4-4-TH Sem-4-Core Course-4 Theory	Operating System	60 hours	04
CMS-G-CC-4-4-P Sem-4-Core Course-4 Practical	Shell Programming (Unix/ Linux)	40 hours	02

Semester –III to VI 

Skill Enhancement Courses (SEC-A & B): Candidate has to opt any one either in Semester-III or in Semester-V from SEC-A and any one either in Semester-IV or in Semester-VI from SEC-B
Courses	Topics	Credit
CMS-G-SEC-A-X-1-TH	Communication, Computer Network and Internet	02
CMS-G-SEC-A-X-2-TH	Software Engineering	02
CMS-G-SEC-B-X-1-TH	Multimedia and its Applications	02
CMS-G-SEC-B-X-2-TH	Information Security	02

Semester – V & VI

Discipline Specific Elective Courses (DSE-A & B): Choices: Semesters-5&6 

Semester-V: Discipline Specific Elective- A (DSE- A): Candidate has to opt any one from the following topics
CMS-G-DSE-A-5-1-TH	Data base Management System (DBMS)	04
CMS-G-DSE-A-5-1-P	Database Design and Applications	02
CMS-G-DSE-A-5-2-TH	Object Oriented Programming	04
CMS-G-DSE-A-5-2-P	Object Oriented Programming by C++/ Java	02
CMS-G-DSE-A-5-3-TH	Sensor Network and IoT	04
CMS-G-DSE-A-5-3-P	Sensor Network and IoT Lab.	02
Semester-VI: Discipline Specific Elective- B (DSE- B): Candidate has to opt any one from the following topics
CMS-G-DSE-B-6-1-TH	Embedded Systems	04
CMS-G-DSE-B-6-1-P	Embedded Systems Lab.	02
CMS-G-DSE-B-6-2-TH	Operation Research	04
CMS-G-DSE-B-6-2-P	Operation Research Lab.	02
CMS-G-DSE-B-6-3-TH	Computational Mathematics	04
CMS-G-DSE-B-6-3-P	Computational Mathematics Lab.	02

Course Outcome

Semester I

CMS-A-CC-1-1-TH:

Digital Logic

On completion of the course students will be able to

1. Realize basic gate operations and laws Boolean algebra
2. Understand basic structure of digital computer, stored program concept

and different arithmetic and control unit operations.

3. Introduce the concept of digital and binary systems
4. Be able to design and analyze combinational logic circuits.
5. Be able to design and analyze sequential logic circuits.
6. Understand the basic software tools for the design and implementation of digital

circuits and systems.

7. Reinforce theory and techniques taught in the classroom through experiments

and projects in the laboratory.

CMS-A-CC-1-1-P:

Practical

Digital Circuits

1. Learn the basics of gates.
2. Construct basic combinational circuits and verify their functionalities
3. Apply the design procedures to design basic sequential circuits
4. Learn about counters CO5 Learn about Shift registers CO6 To understand the basic digital circuits and to verify their operation

CMS-A-CC-1-2-TH:

Programming Fundamentals using C

The student will learn

1. To formulate simple algorithms for arithmetic and logical problems.
2. To translate the algorithms to programs (in C language).
3. To test and execute the programs and correct syntax and logical errors.
4. To implement conditional branching, iteration and recursion.
5. To decompose a problem into functions and synthesize a complete program using divide and conquer approach.
6. To use arrays, pointers and structures to formulate algorithms and programs.
7. To apply programming to solve matrix addition and multiplication problems and searching and sorting problems.
8. To apply programming to solve simple numerical method problems, namely rot finding of function, differentiation of function and simple integration

CMS-A-CC-1-2-P:

Practical

 Programming with C

After Completion of this course the student would be able to

1. Read, understand and trace the execution of programs written in C language.
2. Write the C code for a given algorithm.
3. Implement Programs with pointers and arrays, perform pointer arithmetic, and use the pre-processor.
4. Write programs that perform operations using derived data types.

Semester II

CMS-A-CC-2-3-TH:

Data Structure

On completion of the course students will be able to

1. Differentiate how the choices of data structure & algorithm methods

impact the performance of program.

2. Solve problems based upon different data structure & also write programs.
3. Identify appropriate data structure & algorithmic methods in solving problem.
4. Discuss the computational efficiency of the principal algorithms for sorting, searching,

and hashing

5. Compare and contrast the benefits of dynamic and static data structures

implementations.

CMS-A-CC-2-3-P:

Practical

 Data Structure Lab using C

At the end of this lab session, the student will

1. Be able to design and analyze the time and space efficiency of the data structure
2. Be capable to identity the appropriate data structure for given problem
3. Have practical knowledge on the applications of data structures

CMS-A-CC-2-4-TH:

 Basic Electronic Devices and Circuits

1:  Ability to analyze PN junctions in semiconductor devices under various conditions.

2: Ability to design and analyze simple rectifiers and voltage regulators using diodes.

3: Ability to describe the behavior of special purpose diodes.

4: Ability to design and analyze simple BJT and MOSFET circuits.

CMS-A-CC-2-4-P:

Practical

Basic Electronic Devices and Circuits Lab.

1. Learn the characteristics of basic electronic devices.
2. Learn the Characteristics of UJT
3. Learn the Characteristics of FET
4. Learn about Power amplifiers.
5. Learn about Differential amplifiers
6. To understand the concepts of simulation by using Spice tool

Semester III

           CMS-A-CC-3-5-TH:

           Computer Organization and Architecture

   On completion of the course students will be able to

1. Understand basic structure of digital computer, stored program concept and different arithmetic and control unit operations.
2. Understand basic structure of different combinational circuits multiplexer, decoder, encoder etc.
3. Perform different operations with sequential circuits.
4. Understand memory and I/O operations
5. Learn pipelining concepts with a prior knowledge of stored program methods
6. Learn about memory hierarchy and mapping techniques.
7. Study of parallel architecture and interconnection network

CMS-A-CC-3-5-P:

Practical

Computer Organization Lab.

1. Analyze the behavior of Logic Gates with the help of HDL/ VHDL.
2. Implement sequential circuits and verify the results through simulation by VHDL.
3. Design 8-bit ALU.
4. Design 24X8 RAM.
5. Design 24X8 STACK.
6. Design 8-bit processor

CMS-A-CC-3-6-TH:

Computational Mathematics

      On completion of the course students will be able to.

1. Express a logic sentence in terms of predicates, quantifiers, and logical connectives.
2. Derive the solution for a given problem using deductive logic and prove the solution based on logical inference
3. Classify its algebraic structure for a given a mathematical problem,
4. Evaluate Boolean functions and simplify expressions using the properties of Boolean algebra
5. Develop the given problem as graph networks and solve with techniques of graph theory
6. Understand numerical techniques to find the roots of nonlinear equations and solution of system of linear equations.
7. Understand the difference operators and the use of Interpolation.
8. .Understand numerical Differentiation and Integration and numericalsolutions of ordinary and partial differential equations.

 

 

           CMS-A-CC-3-6-P:

        Practical

Computational Mathematics Lab.

Upon successful completion of the course, students will be able to:

1. Write computer programs to solve engineering problems with C Language
2. Implement numerical methods in C Language.
3. Analyze the stability of algorithm.
4. Analyze and evaluate the accuracy of common numerical methods.
5. Ability to use approximation algorithm in real world problem.

CMS-A-CC-3-7-TH:

        Operating Systems     

On completion of the course students will be able to

1. Create processes and threads.
2. Develop algorithms for process scheduling for a given specification of CPU utilization, Throughput, Turnaround Time, Waiting Time, and Response Time.
3. For a given specification of memory organization develop the techniques for optimally allocating memory to processes by increasing memory utilization and for improving the access time. Design and implement file management system.
4. For a given I/O devices and OS (specify) develop the I/O management functions in OS as part of a uniform device abstraction by performing operations for synchronization between CPU and I/O controllers

CMS-A-CC-3-7-P:

       Practical

Operating Systems Lab.

1. Experiment with Unix commands and shell programming
2. Build ‘C’ program for process and file system management using system calls
3. Choose the best CPU scheduling algorithm for a given problem instance
4. Identify the performance of various page replacement algorithms
5. Develop algorithm for deadlock avoidance, detection and file allocation strategies

CMS-A-SEC-A-3-1-TH: Computer Graphics                                     

Skill Enhancement Course: SEC-A:

After completion of this course the student should be able to:

1: To list the basic concepts used in computer graphics.

2: To implement various algorithms to scan, convert the basic geometrical primitives, transformations, Area filling, clipping.

3: To describe the importance of viewing and projections.

4: To define the fundamentals of animation, virtual reality and its related technologies.

5: To understand a typical graphics pipeline

6: To design an application with the principles of virtual reality

Semester IV

Theory CMS-A-CC-4-8-TH

Data communication, Networking and   Internet technology.

After completion of the course, the students will be able to:

1. Student will be able to understand network communication using the layered concept, Open

System Interconnect (OSI) and the Internet Model.

2. Student will be able to understand various types of transmission media, network devices; andparameters of evaluation of performance for each media and device.
3. Student will be able to understand the concept of flow control, error control and LANprotocols; to explain the design of, and algorithms used in, the physical, data link layers.
4. Student will understand the working principles of LAN and the concepts behind physical and logical addressing, subnetting and supernetting.
5. Student shall understand the functions performed by a Network Management System and toanalyze connection establishment and congestion control with respect to TCP Protocol.
6. Student shall understand the principles and operations behind various applicationlayerprotocols like HTTP, SMTP, FTP.

Practical CMS-A-CC-4-8-P

Computer Networking and Web Design Lab.

After completing the course, students will be able to: ·

1.Understand the structure and organization of computer networks; including the division into network layers, role of each layer, and relationships between the layers.

2.Understand the basic concepts of application layer protocol design; including client/servermodels, peer to peer models, and network naming.

3. In depth understanding of transport layer concepts and protocol design; including connection oriented and connection-less models, techniques to provide reliable data delivery and algorithms for congestion control and flow control.

Theory CMS-A-CC-4-9-TH

 Introduction to Algorithms & its Application.

Students who complete the course will have demonstrated the ability to do the following:

1. Argue the correctness of algorithms using inductive proofs and invariants.
2. Analyze worst-case running times of algorithms using asymptotic analysis.
3. Describe the divide-and-conquer paradigm and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm. Synthesize divide-and-conquer algorithms.
4. Derive and solve recurrences describing the performance of divide-and-conquer algorithms.

5.Describe the dynamic-programming paradigm and explain when an algorithmic designsituation calls for it. Recite algorithms that employ this paradigm. Synthesize dynamic-programming algorithms, and analyze them.

6. Describe the greedy paradigm and explain when an algorithmic design situation calls for it. Synthesize greedy algorithms, and analyze them.

7.Explain the major graph algorithms and their analyses. Employ graphs to model engineering problems, when appropriate. Synthesize new graph algorithms and algorithms that employgraph computations as key components, and analyze them.

8.Compare between different data structures. Pick an appropriate data structure for a design situation.

9. Explain what an approximation algorithm is, and the benefit of using approximation algorithms.Be familiar with some approximation algorithms, including algorithms that are PTAS or FPTAS.Analyze the approximation factor of an algorithm.

 

Practical CMS-A-CC-4-9-P

Algorithms Lab.

At the end of this course student will solve the following problem using computer programming.

1. Understand the basic notation for analyzing the performance of the algorithms using Computer programming.
2. Use divide-and-conquer techniques for solving suitable problems.
3. Use greedy approach to solve an appropriate problem for optimal solution using programming.
4. Apply dynamic programming approach to solve suitable problems
5. Understand the limitations of algorithm power and study how to cope with the limitations of algorithm power for various problems

 

Theory CMS-A-CC-4-10-P

Microprocessor and its Applications.

Students who complete the course will have demonstrated the ability to do the following:

1.Understand the taxonomy of microprocessors and knowledge of contemporary microprocessors.

2.Describe the architecture, bus structure and memory organization of 8085 as well as higher order microprocessors.

3.Explore techniques for interfacing I/O devices to the microprocessor 8085 including several specific standard I/O devices such as 8251 and 8255.

4.Demonstrate programming using the various addressing modes and instruction set of 8085 microprocessor

5.Design structured, well commented, understandable assembly language programs to provide solutions to real world control problem.

Practical CMS-A-CC-4-10-P

Programming with Microprocessor 8085.

1. Solve basic binary math operations using the instructionsof microprocessor 8085.
2. Apply programming knowledge using the capabilities ofthe stack, the program counter
3. Design, code and debugs Assembly Language programsto implement simple programs
4. Execute a machine code program on the training boards.

 

Theory CMS-A-SEC-B-4-2-TH

E-Commerce

Upon completion of the course students should be able to:

1. Analyze the impact of E-commerce on business models and strategy.Describe the major types of E-commerce.
2. Explain the process that should be followed in building an E-commerce presence.
3. Identify the key security threats in the E-commerce environment.
4. Describe how procurement and supply chains relate to all types of e E-commerce.

 

Semester V

Theory CMS-A-CC-5-11-TH

Database Management system (DBMS):

At the end of this Database Management Systems course, students will be able to:

1. Model Entity-Relationship diagrams for enterprise level databases
2. Formulate Queries using SQL and Relational Formal Query Languages
3. Apply different normal forms to design the Database
4. Summarize concurrency control protocols and recovery algorithms
5. Identify suitable Indices and Hashing mechanisms for effective storage and retrieval of Data.

 

Practical CMS-A-CC-5-11-P

DBMS lab using My SQL & PHP

Upon successful completion of the course, participants should be able to:

1. List the major elements of the PHP & MySQL work and explain why PHP is good for web development
2. Learn how to take a static website and turn it into a dynamic website run from a database using PHP and MySQL.
3. Analyze the basic structure of a PHP web application and be able to install and maintain the web server, compile, and run a simple web application.
4. Learn how databases work and how to design one, as well as how to use phpMyAdmin to work with MySQL.
5. Learn different ways of connecting to MySQL through PHP, and how to create tables,enter data, select data, change data, and delete data. Connect to SQL Server and other

 

Theory CMS-A-CC-5-12-TH

Object Oriented Programming (OOPs)

1. Students will understand the need of object oriented programming, fundamental concepts and will be able to solve computational problems using basic constructs like if-else, control structures, array, and strings in Java environment.
2. Student will understand how to model the real world scenario usingclass diagram and be able to exhibit communication between objects using sequence diagram.
3. Students will be able to implement relationships between classes.
4. Students will be able todemonstrate various collection classes.
5. Students will be able to create and user interfaces andpackages.
6. The students will be able to demonstrate programs on exceptions, multithreading and applets.
7. Describe the procedural and object oriented paradigmwith concepts of streams, classes, functions, data and objects.
8. Understand dynamic memory management techniquesusing pointers, constructors, destructors, etc
9. Describe the concept of function overloading, operator overloading, virtual functions and polymorphism.
10. Classify inheritance with the understanding of early and late  binding,  usage  of  exception  handling,  generic programming. Demonstrate the use of various OOPs concepts with the help of programs.

 

Practical CMS-A-CC-5-12-P

OOPs Lab using JAVA

At the end of this course student will:

1. Understand the benefits of a well-structured program
2. Understand different computer programming paradigms
3. Understandunderlying principles of Object-Oriented Programming in Java
4. Develop problem-solving andprogramming skills using OOP concepts
5. Develop the ability to solve real-world problems throughsoftware development in high-level programming language like Java.

 

Theory CMS-A-DSE-A-1-TH

Digital Image Processing

At the end of this course student will:

1. Explain human visual perception.
2. Explain how images are acquired.
3. Explain the basic relationships between pixels.
4. Apply transformations on images.
5. Explain histograms and changes histograms of images.
6. Realize smoothing and sharpening in both spatial and frequency domains. Define image processing methods.
7. Explain image segmentation.
8. Express image compression methods.
9. Realize image recognition process.
10. Recognize morphological image processing techniques.
11. Process color images. Explains color models.
12. Construct color images. Extracts the gray-level components of a color image.
13. Apply image processing methods to color images.

 

Practical CMS-A-DSE-A-1-P

Image processing Lab

At the end of this course student will:

1. Describe digital image representation, manipulation and illustrate the use of histograms.
2. Apply various Geometric transformations on image and illustrate Two-dimensional Fourier transform.
3. Use and Compare, various Linear filtering methods.
4. Apply various Ideal filters in the frequency domain and understand the concept ofedge detection.
5. Compose various Morphological operations on binary images and generate their transformed images.

 

Theory CMS-A-DSE-B-2-TH

Programming using Python

At the end of this course student will:

1. Know the concept of functions in Python
2. Be capable of using basic functions like “if” and different types of loops
3. Be able to convert datatypes
4. Know how to work with lists
5. Know the difference between running Python programs on Mac and Windows
6. Be able to work with CSV files
7. Be able to use tuples and data dictionaries
8. Be able to build lists of various
9. Be able to sort lists -Be able to edit records and load them from CSV files

 

Practical CMS-A-DSE-B-2-P

Programming in Python Lab

At the end of this course student will:

1. Student should be able to understand the basic concepts of scripting and the contributions of scripting language Ability to explore python especially the object oriented concepts and the built in objects of Python.
2. Ability to create practical and contemporary applications such as TCP/IP network programming, Web applications, discrete event simulations.
3. Implement theory concept using Python Programming.

 

Semester VI

Theory CMS-A-CC-6-13-TH

Software Engineering

At the time of graduation, all Software Engineering students will have demonstrated:

1.How to apply the software engineering lifecycle by demonstrating competence in

communication, planning, analysis, design, construction, and deployment

2.An ability to work in one or more significant application domains

3.Work as an individual and as part of a multidisciplinary team to develop and deliver quality software

4.Demonstrate an understanding of and apply current theories, models, and techniques thatprovide a basis for the software lifecycle

5.Demonstrate an ability to use the techniques and tools necessary for engineering practice.

 

Theory CMS-A-CC-6-14-TH

Theory of Computation

Once the student has undergone the course of Theory of Computation will be:

1.Able to design Finite Automata machines for given problems;

2.Able to analyze a given Finite Automata machine and find out its Language;

3.Able to design Pushdown Automata machine for given CF language(s);

4.Able to generate the strings/sentences of a given context-free languages using its

grammar;

5.Able to design Turing machines for given any computational problem.

Practical CMS-A-CC-6-14-P

Project Work:

1. Students should be able to design and construct ahardware and software system, component, or process to meet desired needs.
2. Students are provided to work on multidisciplinary Problems.
3. Students should be able to work as professionals, with portfolio ranging from data management, network configuration, designing hardware, database and software design to management and administration of entire systems.

Theory CMS-A-DSE-A-4-TH

Multimedia and its Application:

At the end of this course student will:

1. Explain audio-based multimedia products.
2. Explainvisual-based multimedia products.
3. Explain animation-based multimedia products.
4. Explain steps of multimedia development.
5. Develop static anddynamic images, sounds and graphics.
6. Organize static and dynamic images, sounds andgraphics.

Practical CMS-A-DSE-A-4-P

Multimedia and its Application Lab

1.Integrate multimedia applications to instructional settings. a. Relate a developed multimedia application with instructional software.

2. Realize sample instructional activities using multimedia applications.
3. Develop multimedia applications.
4. Explain steps of multimedia development.
5. Develop static anddynamic images, sounds and graphics.
6. Organize static and dynamic images, sounds and graphics.
7. Prepare animations on audio-visual materials using animation software.

Theory CMS-A-DSE-B-3-TH

Introduction to Computational Intelligence

1. Gain a working knowledge of knowledge-based systems neural networks, fuzzy systems, andevolutionary computation;
2. Apply intelligent systems technologies in a variety of engineering applications;
3. Implement typical computational intelligence algorithms in MATLAB;
4. Presentideas and findings effectively;
5. Think critically and learn independently Computational Intelligence Lab:

Practical CMS-A-DSE-B-3-P

Computational Intelligence Lab

On concluding the course, candidates will be

1. Able to evaluate and contrast basictechniques and algorithms used in machine learning.
2. Able to formulate specific algorithmic requirements for a given problem and propose an appropriate solution.
3. Able to predict and judge the performance of a machine learning or a data mining method.
4. On concluding the course, candidates will be able to assess the nature of a problem at hand and determine whether a machine learning technique/algorithm can solve it efficiently enough.

COURSE TITLE:  Data Science

ORGANIZING DEPARTMENT:  Department of Computer Science

COURSE DURATION:  32 Hours

OFFERED TO: Students of 3^rd and 5^th semester of the Department of Computer Science

MODE: Offline

1^st November to 30^th November, 2022

COURSE OVERVIEW:

Data science is a multidisciplinary field that involves the use of scientific methods, processes, algorithms, and systems to extract insights and knowledge from structured and unstructured data. It combines expertise from various domains, including statistics, computer science, mathematics, and domain-specific knowledge. This Data Science course accelerates your career in Data Science and provides you training and skills required to become successful in this field. This certificate course on “Dara Science” provides learners with an understanding of the fundamentals and core concepts of data science, which are essential for working in any industry.

With this consideration in mind, the current Certificate course, focusing on “Data Science,” is tailored for students in the 3rd and 5th semesters within the Department of Computer Science. The course has been strategically developed so that upon its successful conclusion, students will possess a comprehensive understanding of Data Science techniques and tools.

OBJECTIVES:

The objectives of a Data Science course typically revolve around equipping participants with the knowledge, skills, and practical experience needed to excel in the field of data science. The course is outlined to fulfill the following objectives –

• Provide a solid understanding of the foundational concepts of data science, including statistics, mathematics, and computer science.
• Teach data manipulation and analysis techniques using tools like Pandas and visualization libraries like Matplotlib and Seaborn.
• Introduce database concepts and teach how to work with both relational and non-relational databases for effective data storage and retrieval.
• Develop problem-solving skills by applying data science techniques to real-world problems and projects.
• Cover the basics of machine learning, including supervised and unsupervised learning, model evaluation, and common algorithms.

COURSE CURRICULUM

(Duration: 32 hours)

UNIT	TOPIC	SUBTOPIC	Hours
			Theoretical	Practical
1	Introduction to Data Science	1.1   – Definition, scope, and applications 1.2   – Overview of the data science workflow	02	—-
2	Mathematics for Data Science	2.1 – Basic linear algebra and calculus concepts 2.2 –Probability and statistics	04	—-
3	Data Manipulation with Pandas	3.2 – Introduction to the Pandas library 3.2 –  Data cleaning and preprocessing	04	02
4	Data Visualization with Matplotlib and Seaborn	4.1 – Basic plotting techniques 4.2 – Exploratory data analysis (EDA)	02	04
5	Introduction to Databases	5.1 – Relational databases (e.g., SQL) 5.2 – NoSQL databases (e.g., MongoDB) 5.3 – Working with SQL	02	04
6	Introduction to Machine Learning and Model Evaluation and Validation	6.1 –  Supervised vs. unsupervised learning 6.2 – Overview of common algorithms 6.3 –  Cross-validation 6.4 –  Metrics for model evaluation	04	—-
7	Ethics in Data Science	7.1- Privacy concerns 7.2 – Bias and fairness in machine learning	02	—
8	Emerging Trends in Data Science	8.1-Introduction to NLP, computer vision, etc. 8.2-Recent advancements in the field	02	—-

 

COURSE OUTCOME:

Upon completion of the “Data Science” course, participants can expect to achieve the following outcomes:

1. Data Analysis Skills: Participants should be proficient in manipulating and analyzing data using tools like Pandas and be able to draw meaningful insights from datasets.
2. Programming Proficiency: Ability to write and understand code in languages such as Python or R, which are commonly used in data science.
3. Database Management Competence: Understanding of database concepts and the ability to work with both relational and non-relational databases for efficient data storage and retrieval.
4. Machine Learning Competency: Familiarity with fundamental machine learning concepts, algorithms, and the ability to build, train, and evaluate models.
5. Problem-Solving Skills: Capability to apply data science techniques to real-world problems, demonstrating a problem-solving mindset.

 

COURSE FEE: Nil

CERTIFICATE COURSE

Course Plan

COURSE TITLE:  Machine Learning

ORGANIZING DEPARTMENT:  Department of Computer Science

COURSE DURATION:  32 Hours

OFFERED TO: Students of 2^nd and 4^th semester of the Department of Computer Science

MODE: Offline

1^st April to 30^th April, 2022

COURSE OVERVIEW:

In today’s rapidly advancing technological landscape, the need for a comprehensive “Machine Learning” course is more pressing than ever. Machine learning, a subset of artificial intelligence, empowers systems to learn and improve from experience without explicit programming. As businesses and industries increasingly harness the power of data, machine learning plays a pivotal role in extracting meaningful insights, predicting trends, and automating decision-making processes. A dedicated course on machine learning is essential to equip individuals with the knowledge and skills to navigate this transformative field. Such a course not only demystifies complex algorithms and models but also provides practical, hands-on experience in working with real-world datasets. As machine learning applications become ubiquitous across sectors, from healthcare and finance to marketing and technology, a specialized course ensures that professionals are well-prepared to harness the potential of machine learning, contributing to innovation and staying competitive in a data-driven era.

With this consideration in mind, the current Certificate course, focusing on “Machine Learning,” is tailored for students in the 2nd and 4th semesters within the Department of Computer Science. The course has been strategically developed so that upon its successful conclusion, students will possess a comprehensive understanding of Machine Learning techniques and tools.

OBJECTIVES :

The course is outlined to fulfill the following objectives –

• Understanding popular ML algorithms with their associated mathematical foundations for appreciating these algorithms.
• Make aware of the role of data in the future of computing, and also in solving real-world problems using machine learning algorithms.
• Help connect real-world problems to appropriate ML algorithm(s) for solving them. Enable formulating real world problems as machine learning tasks.
• Appreciate the mathematical background behind popular ML algorithms.
• Ensure awareness about importance of core CS principles such as algorithmic thinking and systems design in ML

COURSE CURRICULUM

(Duration: 32 hours)

UNIT	TOPIC	SUBTOPIC	Hours
			Theoretical
1	Foundations for ML	1.1    – ML Techniques overview 1.2    – Reinforcement Learning 1.3    –Unsupervised Learning 1.4    – Supervised Learning 1.5    – Validation Techniques (Cross-Validations) 1.6    – Feature Reduction/Dimensionality reduction 1.7    Principal components analysis (Eigen values, Eigen vectors, Orthogonality)	04
2	Clustering	2.1 – Distance measures 2.2 – Different clustering methods (Distance, Density, Hierarchical) 2.3 – Iterative distance-based clustering; 2.4 – Dealing with continuous, categorical values in K-Means 2.5 – Constructing a hierarchical cluster 2.6 – K-Medoids, k-Mode and density-based clustering 2.8 – Measures of quality of clustering	06
3	Classification Naïve Bayes Classifier	3.2 – Model Assumptions, Probability estimation 3.2 –  Required data processing 3.3 – M-estimates, Feature selection: Mutual information 3.4 –  Classifier	06
4	K-Nearest Neighbors	4.1 – Computational geometry; Voronoi Diagrams; Delaunay Triangulations 4.2 – K-Nearest Neighbor algorithm; Wilson editing and triangulations 4.3 – Aspects to consider while designing K-Nearest Neighbor	06
5	Support Vector Machines	5.1 – Linear learning machines and Kernel space 5.2 – Making Kernels and working in feature space 5.3 – SVM for classification and regression problems	06
6	Neural Network Learning	6.1 –  Role of Loss Functions and Optimization, 6.2 – Gradient Descent and Perceptron/Delta Learning, 6.3 –  MLP, 6.4 –  Backpropagation	04

COURSE OUTCOME:

Upon completion of the “Machine Learning” course, participants can expect to achieve the following outcomes:

• Foundational Knowledge: Acquire a solid understanding of the fundamental concepts and principles of machine learning, including supervised and unsupervised learning, as well as reinforcement learning.
• Algorithm Implementation: Master the implementation of various machine learning algorithms, including regression, classification, clustering, and dimensionality reduction, using popular frameworks and tools.
• Model Evaluation and Selection: Learn to assess and compare the performance of machine learning models using appropriate evaluation metrics, enabling informed decision-making in model selection.
• Project Development: Undertake a comprehensive capstone project, integrating the knowledge and skills acquired throughout the course to solve a real-world problem, fostering creativity and critical thinking.
• Continuous Learning: Cultivate a mindset of continuous learning and stay informed about emerging trends and advancements in machine learning, positioning participants to adapt to the evolving landscape of this dynamic field.
• Certification: Receive a certification upon successful completion of the course, validating the participant’s mastery of machine learning concepts and practical application, enhancing their professional profile in the field.

COURSE FEE: Nil

—————————————–

The educational activities within the Computer Science Department focus on fostering effective teaching and learning methodologies. These efforts aim to enhance students’ understanding and proficiency in computer science concepts and applications. The department employs various pedagogical strategies, including hands-on practical sessions, interactive lectures, group discussions, and project-based learning. Additionally, modern teaching tools and technologies are integrated to facilitate a dynamic learning environment.

Faculty members in the Computer Science Department are committed to staying updated with the latest advancements in the field, ensuring that the curriculum remains relevant and aligned with industry standards. They employ innovative teaching techniques and leverage resources such as online platforms, simulation software, and coding environments to engage students and promote active learning.

Furthermore, the department emphasizes the development of critical thinking, problem-solving skills, and collaboration among students. Through assignments, projects, and laboratory exercises, students are encouraged to apply theoretical knowledge to real-world scenarios, fostering practical competency and preparing them for future challenges in the field of computer science.

Regular assessments, feedback mechanisms, and continuous improvement initiatives are integral parts of the teaching-learning process, ensuring that students receive a comprehensive and high-quality education in computer science. Overall, the Computer Science Department is dedicated to providing an enriching educational experience that equips students with the necessary skills and knowledge to excel in the rapidly evolving field of technology.

Teaching-Learning Process in the Department of Computer Science:

1. Interactive Lectures: Conducting engaging lectures that encourage student participation and interaction with the course material
2. Experiential Learning: Providing opportunities for students to apply theoretical concepts through practical exercises and laboratory sessions. The practical component of the syllabus focuses on enhancing both soft and technical skills. Students engage in solving mathematical problems using the C programming language in the department’s computer laboratory, guided by departmental faculty.
3. Group Projects: Assigning collaborative projects that require students to work together to solve problems and develop software solutions, fostering teamwork and communication skills.
4. Self Directed learning: The seminar method is regularly employed for 2nd and 3rd year students, wherein they are assigned assignments by teachers to prepare seminar lectures independently. Students then present their findings in class, fostering interactive discussions. Additionally, final year advanced learners are tasked with studying topics in advanced mathematics and undertaking research survey projects under the supervision of departmental instructors.
5. Continuous Assessment: Implementing regular assessments, quizzes, and assignments to evaluate student understanding and progress throughout the course.
6. Feedback Mechanisms: Soliciting feedback from students through surveys, discussions, and course evaluations to identify areas for improvement and enhance teaching effectiveness.

DEPARTMENT OF COMPUTER SCIENCE

RESULTS AND STUDENT PROGRESSION

ACADEMIC YEAR 2022-23

NAME	CGPA	YEAR OF PASSING	PRESENT STATUS	INSTITUTE
PARTHIB MITRA	8.968	2023	B.TECH CSE	C.U. TECHNOLOGY CAMPUS
DEBDAIPAYAN CHAKRABORTY	8.968	2023	B.TECH CSE	C.U. TECHNOLOGY CAMPUS
ANUPAM RANA	8.843	2023	B.TECH CSE	C.U. TECHNOLOGY CAMPUS
SUDIP NASKAR	8.763	2023	B.TECH CSE	C.U. TECHNOLOGY CAMPUS
RUPCHAND NAYA	8.571	2023	PREPARING FOR GOVERNMENT JOB
JAYATRI MUKHERJEE	8.533	2023	MCA	SISTER NIVEDITA UNIVERSITY
ALAPAN DAS	8.379	2023	B.TECH IT	C.U. TECHNOLOGY CAMPUS
PRAJNA GHOSH	8.377	2023	M.SC	C.U. TECHNOLOGY CAMPUS
ROHAN MONDAL	8.275	2023	MCA	FUTURE INSTITUTE OF ENGINEERING AND MANAGEMENT
RANA PURKAIT	8.1	2023	PREPARING FOR GOVERNMENT JOB
SUBHAYAN CHATTERJEE	8.038	2023	MCA	FUTURE INSTITUTE OF ENGINEERING AND MANAGEMENT
ASHISH MANDI	7.933	2023	B.TECH CSE	C.U. TECHNOLOGY CAMPUS
SATYAJIT MIRDDA	7.764	2023	PREPARATION FOR COMPETITIVE EXAM
SUPRAKASH PURKAIT	7.752	2023	PREPARATION FOR GOVT JOB
ARNAB MONDAL	7.624	2023	PROFESSIONAL COURSE ON MACHINE LEARNING
TASIR LASKAR AHMED	7.579	2023	MCA	NETAJI SUBHASH ENGINEERING COLLEGE
PINAKI NANDAN PARYA	7.573	2023	M.SC
SUKDEV NASKAR	6.3	2023	PREPARATION FOR GOVT JOB

 

ACADEMIC YEAR 2021-22

NAME	CGPA	YEAR OF PASSING	PRESENT STATUS	INSTITUTE
NISHA  MISHRA	8.915	2022	M.SC	C.U. TECHNOLOGY CAMPUS
OEYSHIK DAS	8.82	2022	MCA	V.I.T. (VELLORE)
SNEHASREE MISTRY	8.802	2022	M.SC	C.U. TECHNOLOGY CAMPUS
SUDIPTO  CHATTERJEE	8.720	2022	M.SC	C.U. TECHNOLOGY CAMPUS
SONIYA  SHIL	8.692	2022	M.SC	C.U. TECHNOLOGY CAMPUS
SAPTARSHI KUNDU	8.597	2022	JOB(INFORMATION SECURITY ANALYST)	ISOAH DATA  SECURITIES PVT. LTD.
SAPTATI DAS	8.569	2022	BTECH	C.U. TECHNOLOGY CAMPUS
SAYAN CHATTERJEE	8.552	2022	M.SC	C.U. TECHNOLOGY CAMPUS
ARPAN  GOSWAMI	8.519	2022	M.SC	C.U. TECHNOLOGY CAMPUS
SATYAJIT MAITY	8.437	2022	MCA	SISTER NIVEDITA INSTITUTE
DIPAN MONDAL	8.20	2022	M.SC	RAMKRISHNA MISSION
SUPRATEEK  DEY	8.195	2022	M.SC	SURENDRANATH COLLEGE
SUBHANDU GHOSH	8.108	2022	M.SC	C.U. TECHNOLOGY CAMPUS
MAINAK SARKAR	8.084	2022	MCA	FUTURE INSTITUTE
JAYITRA  GHOSH	8.066	2022	COMPETITIVE STUDY	NONE
RAJDIP HOTA	7.786	2022	MCA	SISTER NIVEDITA UNIVERSITY
PRASENJIT SARDAR	7.773	2022	M.SC	SURENDRANATH COLLEGE
JOYETREE KARAN	7.663	2022	M.SC	SURENDRANATH COLLEGE

 

 

ACADEMIC YEAR 2020-21

NAME	CGPA	YEAR OF PASSING	PRESENT STATUS
NABANITA SAHA	8.584	2021	M.SC, UNIVERSITY OF CALCUTTA
DEBJYOTI MUKHERJEE	8.592	2021	B.TECH CSE, UNIVERSITY OF CALCUTTA
RAIHAN LASKAR	8.482	2021	B.TECH CSE, UNIVERSITY OF CALCUTTA
SARMILA SABNAM	8.343	2021	B.TECH IT , UNIVERSITY OF CALCUTTA
SHOUNAK ROY CHOWDHURY	8.321	2021	B.TECH CSE,UNIVERSITY OF CALCUTTA
PURBA GHOSH	8.266	2021	SENIOR SYSTEM ENGINEER IN COGNIZANT
SWARUP DAS	8.104	2021	B.TECH CSE, UNIVERSITY OF CALCUTTA
PRIYA SARKAR	7.981	2021	M.SC IN SURENDRANATH COLLEGE
SUMAN DEBNATH	7.789	2021	B.TECH CSE, UNIVERSITY OF CALCUTTA
DEBOSMITA NANDY	7.763	2021	M.SC FROM SURENDRANATH COLLEGE (CALCUTTA UNIVERSITY)
PRODEEPTA BERA	7.62	2021	JOB – AT COGNIZANT TECHNOLOGY SOLUTIONS INDIA, AS SYSTEMS ENGINEER
SANDEEPAN MUKHERJEE	7.38	2021	MCA IN GURUNANAK INSTITUTE OF TECHNOLOGY, SODEPUR
RITODEEP GHOSH	7.14	2021	PREPARING FOR GOVT. EXAMS
SOUMYADIP JANA	6.902	2021	MCA IN SILIGURI INSTITUTE OF TECHNOLOGY
DEBABRATA BISWAS	6.768	2021	NONE
TANMAY MONDAL	6.3	2021	JOB IN HDFC BANK
MIJANUR SARDAR	6.295	2021	M.SC FROM WEST BENGAL STATE UNIVERSITY
ARDHENDU DAS	6.24	2021	MCA SILIGURI INSTITUTE OF TECHNOLOGY
AMIT DEY	6.2	2021	ASE IN ACCENTURE
SAYAN DUTTA	6.032	2021	PREPARING FOR GOVERNMENT EXAM
ARUNANGSHU MISHA		2021	MCA IN FUTURE INSTITUTE AND TECHNOLOGY, SONARPUR
AMAN SHAW		2021	MCA IN FUTURE INSTITUTE AND TECHNOLOGY, SONARPUR
ANIMESH MAITY		2021	MCA IN FUTURE INSTITUTE AND TECHNOLOGY, SONARPUR

 

 

ACADEMIC YEAR 2019-20

NAME	PERCENTAGE	YEAR OF PASSING	PRESENT STATUS
KRISHNA NANDAN MONDAL	81.5	2020	LOGISTICS OFFICER,INDIAN AIRFORCE
SUSHMITA CHAKRABARTY	75	2020	DIGITAL PROCESS ASSOCIATE TRAINEE AT CENTURY MEDIA360
SUPARNA PURKAIT	75	2020	SENIOR ASSOCIATE IN WIPRO
MUNSHI SARIFUL ISLAM	74	2020	PROGRAMMAR IN TCS
SUBHAJIT MAJUMDER	72.25	2020	PROGRAMMER ANALYST TRAINEE IN COGNIZANT
AKASH HALDER	71.63	2020	PROGRAMMER ANALYST TRAINEE IN COGNIZANT
TIASHA HALDER	69	2020	WORKING WITH MULTIPLIER BRAND SOLUTIONS PVT LTD FOR 1+ YEAR AS HR EXECUTIVE
SOUJIT DAS	68.62	2020	MCA,FROM MAKAUT
SUMAN GOLE	65.37	2020	RUNNING COURSE MCA
ANIRMLAN MONDAL	65.25	2020	CRS TRAINING IN TECH MAHINDRA
POULAMI DE	65.25	2020	PARTNER IN ELECTROCHEM
RAHUL ROY	65.19	2020	PROGRAMMER ANALYST TRAINEE IN COGNIZANT
RUPAM CHOWDHURY	62.25	2020	CONTRACTUAL TEACHER AT A COLLEGE
SUBHRADEEP PAL	52.25	2020	ABPM INDIA POST
RANOJOY NATH	47	2020	PROCESS ENGINEER AT GENPACT INDIA PVT LTD

 

 

ACADEMIC YEAR 2018-19

NAME	PERCENTAGE	YEAR OF PASSING	PRESENT STATUS
PALLABI ACHARYA	66.13	2019	SYSTEM ENGINEER, TATA CONSULTANCY SERVICES (TCS)
SURAJIT JANA	60.38	2019	QA ENGINEER, ALUMNUS SOFTWARE LIMITED

 

 

 

 

 

ACADEMIC YEAR 2017-18

NAME	PERCENTAGE	YEAR OF PASSING	PRESENT STATUS
ARINDAM ROY	66.25	2018	B.TECH CSE (FROM C.U. TECHNOLOGY CAMPUS) SENIOR FRONTEND DEVELOPER, DASHCLICKS INDIA PVT LTD
MANIK CHAKRABORTY	63	2018	B.TECH IT (FROM C.U. TECHNOLOGY CAMPUS) SOFTWARE ENGINEER, PERSISTENT SYSTEMS LTD.
SAMPAD BANERJEE	62	2018	MANAGEMENT TRAINEE, GENIUS CONSULTANT
SUPARNA DUTTA	61.37	2018	M.SC IN COMPUTER SCIENCE PART TIME COMPUTER SCIENCE TEACHER AT DUM DUM ROAD GOVT. SPOND. HIGH SCHOOL FOR GIRLS
SACHIN KUMAR PASWAN	54.1	2018	SOFTWARE ENGINEER, ACCENTURE
SANCHARI BASU SARBADHIKARY	51.5	2018	DATA ENTRY OPERATOR, WEST BENGAL STATE AND RURAL DEVELOPMENT AGENCY

Department of Computer Science

Achievements 

Academic year-2022-23

1.Our student, Parthib Mitra, ranked 6^th in the Merit List for admission to M.Sc/B.Tech in Computer Science at the University of Calcutta with a B.Sc. Hons. score of 91% in 2023.

2. Our student, Debdaipayan Chakraborty, ranked 8^th in the Merit List for admission to M.Sc/B.Tech in Computer Science at the University of Calcutta with a B.Sc. Hons. score of 90.5%in 2023.
3. Our student, Anupam Rana, ranked 12^th in the Merit List for admission to M.Sc/B.Tech in Computer Science at the University of Calcutta with a B.Sc. Hons. score of 89.55% in 2023.

Academic year-2021-22

1.Our student,Nisha Mishra, was Topper( Rank 1)in the Merit List for admission to M.Sc/B.Tech in Computer Science at the University of Calcutta with a B.Sc. Hons. score of 91.2% in 2022.

2. Our student, Sudipta Chatterjee,ranked 7^th in the Merit List for admission to M.Sc/B.Tech in Computer Science at the University of Calcutta with a B.Sc. Hons. score of 89.95%in 2022.
3. Our student,Soniya Shil, ranked 9^th in the Merit List for admission to M.Sc/B.Tech in Computer Science at the University of Calcutta with a B.Sc. Hons. score of 89.6%in 2022.
4. Our student,Snehasree Mistry, ranked 12^th in the Merit List for admission to M.Sc/B.Tech in Computer Science at the University of Calcutta with a B.Sc. Hons. score of 89.15%in 2022.

Serial No.	Name	Honours Percentage-	Year of Passing	Present Status
1	Saptarshi Kundu	8.597 (CGPA)	2022	Information Security Analyst, ISOAH DATA  SECURITIES Pvt. Ltd.
2	Purba Ghosh	8.266 (CGPA)	2021	Senior System Engineer, Cognizant Technology Solutions (CTS)
3	Prodeepta Bera	7.62 (CGPA)	2021	Systems Engineer , Cognizant Technology Solutions (CTS) India
4	Amit Dey	6.2 (CGPA)	2021	Assistant System Engineer, ACCENTURE
5	Krishna Nandan Mondal	81.5%	2020	College Topper Logistics officer, Indian Air Force
6	Suparna Purkait	75%	2020	Senior Associate, Wipro
7	Sushmita Chakrabarty	75%	2020	Digital Process Associate Trainee, Century Media360
8	Munshi Sariful Islam	74%	2020	Programmar, Tata Consultancy Services  (Tcs)
9	Subhajit Majumder	72.25%	2020	Programmer Analyst Trainee, Cognizant Technology Solutions (CTS)
10	Akash Halder	71.63%	2020	Programmer Analyst Trainee, Cognizant Technology Solutions (CTS)
11	Tiasha Halder	69%	2020	Working with Multiplier Brand Solutions Pvt Ltd for 1+ year as HR executive
12	Soujit Das	68.62%	2020	MCA
13	Suman Gole	65.37%	2020	MCA
14	Anirmlan Mondal	65.25%	2020	Crs training in Tech Mahindra
15	Poulami De	65.25%	2020	Partner in Electrochem
16	Rahul Roy	65.19%	2020	Programmer Analyst Trainee,  Cognizant Technology Solutions (CTS)
17	Rupam Chowdhury	62.25%	2020	Contractual College teacher
18	Subhradeep Pal	52.25%	2020	ABPM India Post
19	Ranojoy Nath	47%	2020	Process Engineer, Genpact India Pvt Ltd
20	Neha Sarkar	45.6%	2020	2D Animator, Lattle Media
21	Pallabi Acharya	66.125%	2019	System Engineer, Tata Consultancy Services (TCS)
22	Surajit Jana	60.375%	2019	QA Engineer, Alumnus Software Limited
23	Arindam Roy	66.25%	2018	B.Tech in CSE (from C.U. Technology Campus) Senior Frontend Developer, DashClicks India Pvt Ltd
24	Manik Chakraborty	63%	2018	B.Tech in IT (from C.U. Technology Campus) Software Engineer, Persistent Systems ltd.
25	Sampad Banerjee	62%	2018	Management Trainee, Genius Consultant
26	Suparna Dutta	61.37%	2018	M.Sc in Computer Science Part time Computer Science teacher at Dum Dum Road Govt. Spond. High School For Girls
27	Sachin Kumar Paswan	54.1%	2018	Software Engineer, Accenture
28	Sanchari Basu Sarbadhikary	51.5%	2018	Data Entry Operator, West Bengal State and Rural Development agency
29	Ritesh Seth	64%	2017	M.Sc in Computer Science (form Ramakrishna Mission Vivekananda Educational and Research Institute, Belur) PhD scholar, Computer Science, IIIT Delhi
30	Adarsha Sahoo	42%	2017	Founder CEO in TECHSCITE PVT. LTD
31	Aratrika Mukherjee	70.62%	2016	College Topper M.Sc in Computer Science (form St. Xavier’s College), then job as software developer, Certificate course on Mobile Application Development in Canada Full Stack developer, red.dev inc.
32	Debshikha Mondal	69%	2016	System Engineer, TCS
33	Shukla Chatterjee	68.88%	2016	Teachers’ Eligibility Test Qualoified
34	Sayanta Paul	68.75%	2016	M.Sc in Computer Science,(form Ramakrishna Mission Vivekananda Educational and Research Institute, Belur), 2018 M.Tech : IIT Patna,2020 Data Scientist I at OLA, Data Scientist II at redBus, Senior Data Scientist at Microsoft, Lead Data Scientist at JioCinema Google Scholar link:- https://scholar.google.co.in/citations?user=lV5oZ6gAAAAJ&hl=en
35	Krishnanjali Giri	62.25%	2016	Assistant Teacher at Panchasayar SikhaNiketan (H.S)
36	Shuvendu Mondal	43%	2016	Lower Division Clerk,State Water Investigation
37	Indrajit Chakraborty	68.25%	2015	MCA IT Analysist, TCS
38	Anupam Dutta	68.13%	2015	M.SC Software Developer, Mettletech pvt.ltd
39	Subhas Naskar	64.75%	2015	post graduate B.tech office Executive, WBSETCL
40	Akshay Kar	62.37%	2015	M.Sc Assistant Technician,UR’s Toothfully Digital Dental Lab
41	Astik Samanta Gayen	62.25%	2015	post graduate B.tech office Executive, WBPDCL
42	Spriha Dey	61%	2015	MBA Digital Marketing Manager,Syntax Pvt.Ltd
43	Tanushree Ghorui	60.25%	2015	M.SC Senior Commercial cum ticket clerk, Eastern Railways
44	Sabuj Das	59%	2015	Single Windows Operator(SWO), Bank of India
45	Hasnuhana Khatun	57.75%	2015	post graduate B.Tech, M.tech Assistant Professor, Future Institute of Technology
46	Shubhamay Kundu	55.13%	2015	MCA Software Developer, Experis IT pvt.ltd
47	Rajib Dutta	55.1%	2015	Sps Mentor,Amazon pvt.ltd
48	Mayukh Mandal	50.87%	2015	M.Sc, B.Ed Teacher of Computer Science, Ramkrishna Mission Vidyalaya Narendrapur
49	Abhirup Seal		2009	ASSISTANT SOFTWARE ENGINEER, DELL EMC
50	RATUL CHOWDHURY		2009	M.Tech, Ph.D ASSISTANT PROFESSOR, FUTURE INSTITUTE OF ENGINEERING AND MANAGEMENT
51	MALAY DAS		2009	OFFICE EXECUTIVE, WBSEDCL
52	DEBRANJAN PAL		2009	RESEARCH FELLOW, IITKGP
53	DOIPAYAN DEBNATH		2009	FREELANCER
54	RAHUL CHAKRABORTY		2009	HEAD OF IT MANAGED SERVICES, SIDERO
55	SAGARI RAY		2009	SENIOR SOFTWARE DEVELOPER ENGINEER, AMADEUS IT GROUP
56	DEBDUTTA KUNDU		2009	CLOUD MIGRATION ENGINEER, ACCENTURE
57	SUTAPA DUTTA		2009	SENIOR TEST ANALYST, CTS
58	SAMBUDDHA DAS		2009	M.Sc, M.Tech, B.Ed ASSISTANT PROFESSOR, CHANDERNAGORE COLLEGE
59	SUDIPTO DHAR		2009	ASSISTANT PROFESSOR, UEM

 

Sammilani Mahavidyalaya and Maheshtala College have established a collaborative agreement, facilitating faculty exchanges between their respective Computer Science departments. This memorandum of understanding (MOU) also entails organizing various activities such as seminars and lecture series featuring distinguished external speakers, conducted jointly by the two institutions’ Computer Science departments on a regular basis.

Name of the College	Date of Collaboration	Activities
MAHESHTALA COLLEGE	24-05-2022	With Computer Science Dept.

Our Achievers

1. Our student Nisha Mishra was University of Calcutta topper

( Rank 1) in B.Sc. Computer Science Honours with 91.2% in 2022.

2. Our student Sudipta Chatterjee stood 7^th in University of Calcutta in B.Sc. Computer Science Honours in 2022 with 89.95% in 2022.
3. Our student Sudipta Chatterjee stood 10^th in University of Calcutta in B.Sc. Computer Science Honours in 2022 with 89.6% in 2022.
4. Our student Snehasree Mistry stood 13^th in University of Calcutta in B.Sc. Computer Science Honours in 2022 with 89.15% in 2022.

Serial No.	Name	Honours Percentage-	Year of Passing	Present Status
1.	Pallabi Acharya	66.125%	2019	System Engineer in Tata Consultancy Services (TCS)
2.	Surajit Jana	60.375	2019	QA Engineer in Alumnus Software Limited
3.	Ritesh Seth	64%	2017	After graduation M.Sc in Computer Science (form Ramakrishna Mission Vivekananda Educational and Research Institute, Belur) Present Status – PhD candidate, Computer Science, IIIT Delhi
4.	Debshikha Mondal	69%	2016	System Engineer at TCS
5.	Prodeepta Bera	7.62	2021	Systems Engineer , Cognizant Technology Solutions (CTS) India
6.	Saptarshi Kundu	8.597	2022	Information Security Analyst in ISOAH DATA  SECURITIES Pvt. Ltd.
7.	Shukla Chatterjee	68.875%	2015	—
8.	Krishnanjali Giri	62.25%	2015	Assistant Teacher at Panchasayar SikhaNiketan (H.S)
9.	Amit Dey	6.2	2021	Assistant System Engineer in ACCENTURE
10.	Suparna purkait	75	2020	Senior Associate In Wipro
11.	Munshi Sariful Islam	74	2020	Programmar In Tata Consultancy Services  (Tcs)
12.	Subhajit Majumder	72.25	2020	Programmer Analyst Trainee In Cognizant Technology Solutions (CTS)
13.	Akash Halder	71.63	2020	Programmer Analyst Trainee In Cognizant Technology Solutions (CTS)
14.	Rahul Roy	65.19	2020	Programmer Analyst Trainee In Cognizant Technology Solutions (CTS)
15.	Ranojoy Nath	47	2020	Process Engineer At Genpact India Pvt Ltd
16.	PURBA GHOSH	8.266	2021	Senior System Engineer In Cognizant Technology Solutions (CTS)