MAHARANI LAKSHMI AMMANNI COLLEGE FOR WOMEN

AUTONOMOUS

Affiliated to Bengaluru City University (BCU)

CHOICE BASED CREDIT SYSTEM

(As per SEP 2024)

Syllabus for I & II Semester

B.Sc. Computer Science

(Academic Year 2024-25 Onwards)
 B.Sc. (Computer Science as an Optional)
AS PER STATE EDUCTION POLICY

COURSE MATRIX
Semes ter
Teach Inter
End Exa Tot al
ing nal
Course/ Paper m Ma Cre
Sem Title of the Paper Hours Asse
Code rks dits
/ week ssme
nt

1 24BSC-CS-1 Problem Solving Technique 4 80 20 100 3

24BSC-CS-1P Problem Solving Technique Lab 4 40 10 50 2
2 24BSC-CS-2 Data Structure 4 80 20 100 3
24BSC-CS-2P Data Structure Lab 4 40 10 50 2
3 24BSC-CS-3 Database Management System 4 80 20 100 3
24BSC-CS-3P Database Management System Lab 4 40 10 50 2
Python
4 24BSC-CS-4 4 80 20 100 3

Python Lab
24BSC-CS-4P 4 40 10 50 2

24BSC-CS-5 Computer Networks 4 80 20 100 4

5
24BSC-CS-6 Operating Systems 4 80 20 100 4
24BSC-CS-7 Artificial Intelligence 4 80 20 100 4
6
24BSC-CS-8 Project Work 8 80 20 100 4
Program Outcome

PO1 Acquire in-depth computational and mathematical

Computational
knowledge with an ability to abstract and conceptualise
Knowledge
from defined problems and requirements.
PO2 Identify, formulate, and exhibit strong analytical and
Dynamic Problem-
dynamic problem-solving skills to address evolving
Solving Skill
computational challenges.
PO3 Innovative System Design and evaluate solutions for complex problems in
Analysis and Design/ Data Science, AI & ML, and Full Stack Development,
Development considering societal, cultural, and environmental factors.
PO4 Conduct literature surveys, analyze information, and design
Investigate complex
experiments using appropriate research methods to derive
computing problem
valid conclusions in relevant domains.
PO5 Use of modern tools/ Select, adapt, and apply modern IT tools and programming
Adaptive programming languages effectively in Data Science, AI & ML, and Full
proficiency Stack Development to solve diverse computing challenges.
PO6 Modify algorithms or software systems to improve
Knowledge Optimization
efficiency or resource utilization.
PO7 Life Long Continuous Pursue lifelong learning to stay updated with emerging
learning and Technology technologies in Data Science, AI & ML, and Full Stack
Adaptability Development for sustained employability.
PO8 Communicate effectively, enhance interpersonal skills, and
Soft skills and
collaborate in multidisciplinary teams essential for success
collaborative teamwork
in professional environments.
PO9 Understand cyber threats, develop secure software, and
Cyber Security
protect sensitive data in Data Science, AI & ML, and Full
Proficiency
Stack Development applications.
PO10 Adhere to ethical standards and professional practices in
Ethical and Professional
Data Science, AI & ML, and Full Stack Development roles
Conduct
and responsibilities.
PO11 Identify market trends, upgrade skills accordingly, and
Employability enhance employability in Data Science, AI & ML, and Full
Stack Development careers.
PO12 Identify opportunities, innovate, and create value through
Innovation and
Data Science, AI & ML, and Full Stack Development
Entrepreneurship
projects for personal growth and societal impact.
 BSC-CS-1: PROBLEM SOLVING TECHNIQUE

Course Outcomes
Upon successful completion of the course, the student will be able:
CO1 To understand algorithmic strategies for enhancing problem-solving proficiency
CO2 Demonstrate problem solving tools and techniques using C.
CO3 To analyze the given problems and use appropriate algorithms.
CO4 To implement sorting and searching techniques to develop programs.

UNIT –1 11 Hours
Introduction: The Role of Algorithms in computing, Algorithms as a technology, analyzing
algorithms, Designing algorithms, Growth of Functions, Asymptotic notation, Standard
notations and common functions.

Fundamental Algorithms: Exchanging the values of two variables, Counting, Summation of a

set of numbers, Factorial Computation, Generating of Fibonacci sequence, Reversing the
digits of an integer, Character to number conversion.

UNIT-II 11 Hours

C Programming: Getting Started, Variables, Operators and Arithmetic expressions. Input and Output: Stand
ard input and output, formatted input and output. Selection statements: Statements and Blocks, If, If-else, if-
else-if ladder, nested if, switch. Control Structure: while loop, for loop, do-while loop, break and continue, goto
and labels.
Factoring Methods: Finding the square root of a number, the smallest Divisor of an integer, the greatest
common divisor of two integers, computing the prime factor of an integer, raising a number to a large power.
11 Hours
UNIT-III
Arrays and Functions: One Dimensional array, Two-Dimensional array, Multidimensional array.
Declaration, definition, calling. Functions with parameters- actual and formal parameters, categories
of functions, recursive functions.

Array Techniques: Array order reversal, Finding the maximum number in a set, removal of
duplicates from an ordered array, partitioning an array, finding the kth smallest element,
multiplication of two matrices.

String handling: Declaration, initialization, reading & writing, string

UNIT-IV [11 Hours]

Structures, Unions and Pointers: Structures: Declaration, initialization, accessing. Array of structures.
Union: Declaration, initialization, accessing, difference between structure and union.
Pointers and address, pointer arithmetic, pointers to functions, pointers to arrays.
Files: Sequential and random files, Text and binary files.

Textbook

1. R. G. Dromey, “How to Solve it by Computer”, Person Education India, 2008.

1
Brian M. Kernighan and Dennis M. Ritchie, “The C Programming Language”, 2nd edition,
Princeton Hall Software Series, 2012.
2
Thomas H Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2008.

Reference Books

1 E. Balaguruswamy, “Programming In ANSI C”, 4th edition, TMH Publications, 2007

2 Greg Perry and Dean Miller, “C programming Absolute Beginner’s Guide”, 3rd edition,
Pearson Education, Inc, 2014.
3 Donald E. Knuth, The Art of Computer Programming”, Volume 2: Seminumerical
Algorithms, 3rd Edition, Addison Wesley Longman, 1998.

Course Articulation Matrix: Mapping of Course Outcomes(COs) with Program Outcomes(POs1-12)

Course Outcome(COs) Program Outcomes(POs)

1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 1 1 1 1 2 1 1 1 2 1
CO2 3 3 3 2 1 1 1 1 1 1 2 1
CO3 3 3 1 1 1 1 1 1 1 1 2 1
CO4 3 3 2 2 1 1 1 1 1 1 2 1

Pedagogy: Lecture with the use of ICT/ Field Study / Assignment

Formative Assessment for Theory

Assessment Occasion Type Marks
C-1 Sessional Tests 5
C-1 Seminars/ Presentations 5
C-2 Sessional Tests 5
Case Study / Assignment / Project work etc. 5
Total 20 Marks
Formative Assessments as per SEP guidelines are compulsory
 I. QUESTIONS SECTION WISE

SEC/MAINS Total No. of Questions to be Marks for written Total Marks

Questions answered questions (excluding (including
Choice) Choice)
I 10 10 10 10

II 7 5 15 21

III 5 3 15 25

IV 4 2 20 20

TOTAL 26 20 60 86

BLUEPRINT FOR QUESTION PAPER

II. DISTRIBUTION OF CO, S FOR DSC QUESTION PAPER - END SEMESTER EXAMINATION

Section Total No. of CO’s Question Numbers

ESE

Section A 5 questions from CO1 1 TO 5

5 questions from CO2 6 TO 10

Section B 2 questions from CO1 11 TO 12

3 questions from CO3 13 TO 15

Section C 1 question from CO2 16

2 questions from CO3 17& 18

Section D 1 question from CO4 19

1 question from CO5+ 1 questions 22

from C05/ 2 questions from CO4
III. WIGHTAGE FOR CO’S IN END SEMESTER EXAMINATIONS

CO’S Total No. of CO’s Total Marks

CO1 07 20
CO2 06 25
CO3 05 45
CO4/CO5 01 10
TOTAL MARKS 100
 BSC-CS-1P: PROBLEM SOLVING
TECHNIQUE LAB

Write, and execute C Program for the following:

1. To read the radius of the circle and to find area and circumference.
2. To check if a given number is positive, negative or zero.

3. To find maximum number of days in any given month

4. Write a C program to generate all the prime numbers between 1 and n.
5. To read a number, find the sum of the digits, reverse the number, and check it for
palindrome.
6. To read the numbers from keyboard continuously till the user presses 999 and to find
the sum of only positive numbers.
7. To read percentage of marks and to display appropriate message. If a percentage is 70 and
above- Distinction, 60-69 – First Class, 50-59 – Second Class, 40-49 Pass, below 40 – Fail.
(Demonstration of if-else ladder)
8. To simulate a simple calculator with addition, subtraction, multiplication, division and it
should display the error message for division of zero using switch case.
9. To find largest and smallest of ‘N’ integers (Demonstration of single dimensional array)
10. To remove duplicate elements in a single dimensional array.
11. To generate Fibonacci series.
12. To design the following pattern using nested for loop:
A
A B
A B C
A B C D

13. To find the length of the string without using built-in function.
14. To demonstrate string functions.
15. To calculate NCR using function.
16. To read a string and to find the number of alphabets, digits, vowels, consonants,
space and special characters.
17. To swap two numbers using pointers.
18. To demonstrate student structure to read and display records of n students.
(From the above list 80% of the programs can be executed in a semester)
 BSC-CS-2: DATA STRUCTURE

Course Outcome
CO1: Understand basic concepts of data structures.
CO2: Analyzing and exploring various ways of storing data using Array and Linked list.
CO3: Demonstrate stack and queue data structures and their applications
CO4: Analyze and implement various nonlinear data structures.

UNIT I 11 Hours
Introduction and Overview: Definition, Elementary data organization, Data Structures, data
Structures operations, Abstract data types, control structures, Complexity of algorithms, asymptotic
notations for complexity of algorithms.

Arrays: Definition, Linear arrays, arrays as ADT, Representation of Linear Arrays in Memory,
Traversing Linear arrays, Inserting and deleting, multi-dimensional arrays, Matrices and Sparse
matrices. Sorting: Bubble sort, Sorting by selection, sorting by insertion.

Searching: Linear Search, Binary search, Hash search. Introduction to pattern matching algorithm.

UNIT II 11 Hours
Linked list: Definition, Representation of Singly Linked List in memory, Traversing a
Singly linked list, Searching in a Singly linked list, Memory allocation, Garbage collection,
Insertion into a singly linked list, Deletion from a singly linked list; Doubly linked list, Header
linked list, Circular linked list.

UNIT III 11 Hours

Stacks: Definition, Array representation of stacks, Linked representation of stacks, Stack as ADT,
Arithmetic Expressions: Polish Notation, Conversion of infix expression to postfix expression,
Evaluation of Post fix expression, Application of Stacks, Recursion, Towers of Hanoi,
Implementation of recursive procedures by stack.

Queues: Definition, Array representation of queue, Linked list representation of queues. Types of
queue: Simple queue, Circular queue, Double-ended queue, Priority queue, Operations on Queues,
Applications of queues.

UNIT IV 12 Hours
Binary Trees: Definitions, Tree Search, Traversal of Binary Tree, Tree Sort, Building a Binary
Search Tree, Height Balance: AVL Trees, Contiguous Representation of Binary Trees: Heaps, Red
Black Tree: Insertion and Deletion, External Searching: B-Trees, Applications of Trees.

Graphs: Mathematical Background, Computer Representation, Graph Traversal. Hashing: Hash

Table ADT, understanding Hashing, Components of Hashing, Hash Table, Hash Function, Hashing
Techniques, collisions, collision resolution techniques.
 Text Book

1 Seymour Lipschutz, “Data Structures with C”, Schaum’s outLines, Tata Mc Graw Hill,
2011.
2 Robert Kruse, C.L.Tondo, Bruce Leung,Shashi Mogalla,“Data Structures and Program
Design using C”, Pearson Education, 2009

Reference Books

1 Mark Allen Weiss,“ Data Structures and Algorithm Analysis in C”, Second Edition,
Pearson Education,2013
2 Forouzan,“A Structured Programming Approach using C”,2nd Edition,
Cengage LearningIndia,2008.

Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs12)

Course Outcome (COs) Program Outcomes (POs)

1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 4 3 4 4 4 3 2 3 1 4 4
CO2 5 5 4 4 4 4 3 2 3 1 4 4
CO3 5 5 4 4 4 4 3 2 3 1 4 5
CO4 5 5 4 4 4 4 3 2 2 1 4 4

Pedagogy: Lecture with the use of ICT/ Field Study / Assignment

Formative Assessment for Theory

Assessment Occasion Type Marks
C-1 Sessional Tests 5
C-1 Seminars/ Presentations 5
C-2 Sessional Tests 5
Case Study / Assignment / Project work etc. 5
Total 20 Marks
Formative Assessments as per SEP guidelines are compulsory
IV. QUESTIONS SECTION WISE

SEC/MAINS Total No. of Questions to be Marks for written Total Marks

Questions answered questions (excluding (including
Choice) Choice)
I 10 10 10 10

II 7 5 15 21

III 5 3 15 25

IV 4 2 20 20

TOTAL 26 20 60 86

BLUEPRINT FOR QUESTION PAPER

V. DISTRIBUTION OF CO, S FOR DSC QUESTION PAPER - END SEMESTER EXAMINATION

Section Total No. of CO’s Question Numbers

ESE

Section A 5 questions from CO1 1 TO 5

5 questions from CO2 6 TO 10

Section B 2 questions from CO1 11 TO 12

3 questions from CO3 13 TO 15

Section C 1 question from CO2 16

2 questions from CO3 17& 18

Section D 1 question from CO4 19

1 question from CO5+ 1 questions 22

from C05/ 2 questions from CO4
VI. WIGHTAGE FOR CO’S IN END SEMESTER EXAMINATIONS

CO’S Total No. of CO’s Total Marks

CO1 07 20
CO2 06 25
CO3 05 45
CO4/CO5 01 10
TOTAL MARKS 100
 BSC-CS-2P: DATA STRUCTURE LAB

1. Write a program to search for an element in an array linear search.

2. Write a program to search for an element in an array using binary search.

3. Write a program to sort list of n numbers using Bubble Sort algorithm.

4. Perform the Insertion Sort on the input {75,8,1,16,48,3,7,0} and display the output in
descending order.

5. Perform the Selection Sort on the input {75,8,1,16,48,3,7,0} and display the output in
descending order.
6. Write a program to insert the elements {61,16,8,27} into a singly linked list and delete
8,61,27 from the list. Display your list after each insertion and deletion.
7. Write a program to insert the elements {45, 34, 10, 63,3} into linear queue and delete three
elements from the list. Display your list after each insertion and deletion.
8. Write a program to insert the elements {61,16,8,27} into circular queue and delete 4 elements
from the list. Display your list after each insertion and deletion.

9. Write a program for Tower of Honoi problem using recursion.

10. Write recursive program to find GCD of 3 numbers.

11. Write a program to demonstrate the working of stack using linked list.

12. Write a program to convert an infix expression x^y/(5*z)+2 to its postfix expression

13. Write a program to evaluate a postfix expression 5 3+8 2 - *.

14. Write a program to create a binary tree with the elements {18,15,40,50,30,17,41} after
creation insert 45 and 19 into tree and delete 15,17 and 41 from tree. Display the tree on
each insertion and deletion operation.
15. Write a program to create binary search tree with the elements {2,5,1,3,9,0,6} and perform
inorder, preorder and post order traversal.
16. Write a program to Sort the following elements using heap sort {9.16,32,8,4,1,5,8,0}.

17. Write a program to push 5,9,34,17,32 into stack and pop 3 times from the stack, also display
the popped numbers.

18. Write a program to insert/retrieve an entry into hash/ from a hash table with open addressing
using linear probing.
(From the above list 80% of the programs can be executed in a semester)