SRI SARADA COLLEGE FOR WOMEN (AUTONOMOUS)

SALEM - 16
Reaccredited with ‘B++’ Grade by NAAC
(Affiliated to Periyar University)

PG & RESEARCH DEPARTMENT OF COMPUTER SCIENCE

OUTCOME BASED SYLLABUS

[Link]. Computer Science
(For the students admitted in 2021 - 22)
 B. Sc. COMPUTER SCIENCE

PROGRAMME OUTCOMES

PO1 To apply knowledge of computing appropriate to the discipline

To identify, formulate, and develop solutions to computational challenges

PO2
based on ethical principles.

To design, implement, and evaluate a computational system to meet desired

PO3
needs within realistic constraints.

To use appropriate techniques, skills and tools necessary for sustainable

PO4
development of societal and environmental contexts.

To apply programming skills with their enhanced creativity as an

PO5
individual or team.

To equip students with sufficient knowledge web based programming

PO6
languages for research project management.
 B. Sc. COMPUTER SCIENCE

PROGRAMME SPECIFIC OUTCOMES

PSO1 To apply problem-solving skills and the knowledge of computer

science to solve real world problem.

PSO2 To gain knowledge and skill set in applying core concepts.

PSO3 To develop global standard competencies.

PSO4 To function effectively on teams to accomplish shared computing

design, evaluation, or implementation goals.
 SRI SARADA COLLEGE FOR WOMEN (AUTONOMOUS), SALEM - 16.
DEPARTMENT OF COMPUTER SCIENCE
[Link]. Computer Science
PROGRAMME STRUCTURE UNDER CBCS
(For the students admitted in 2021-22)
Total Credits: 140 + Extra Credit (Maximum 28)
I SEMESTER
Hrs./
Part Course Course Title Code Credits
Week
21ULTC1/
I Language - I Tamil/Hindi/Sanskrit - I 21ULHC1/ 6 3
21ULSC1
II English - I Communicative English - I 21ULEC1 6 3
Core Course - I Problem Solving & 21UCSC1
III 5 4
Programming Techniques
III Core Practical - I ‘C’ Programming 21UCSQC1 5 3
III Allied - I Mathematics - I 21UCSAC1 5 5
Skill Based - I Graphics Design & Photo 21UCSSQC1 2 2
IV
Editing
Group Project based on 21UEXC1 1 1
V Extension Activity
Extension Activity
Total 30 21
Articulation and Idea Fixation Skills
Physical Fitness Practice - 35 hours per Semester
VI
Advanced Diploma in Computer Programming
Level - 1 : Certificate Course - 100 hours per year
II SEMESTER
Hrs./
Part Course Course Title Code Credits
Week
21ULTC2/
I Language - II Tamil/Hindi/Sanskrit - II 21ULHC2/ 6 3
21ULSC2
II English - II Communicative English - II 21ULEC2 6 3
Core Course - II Object Oriented Programming With 21UCSC2 4 4
III
Java
III Core Practical - II Java Programming 21UCSQC2 5 3
III Allied - I Mathematics - II 21UCSAC2 5 5
IV Skill Based - II HTML Programming 21UCSSQC2 2 2
Environmental Studies 21UEVSC 2 1
IV Environmental Studies Group Project Based 21UEVSPC 1
On Environmental Studies
Total 30 22
Articulation and Idea Fixation Skills - 1 Extra Credit
Physical Fitness Practice - 35 hours per Semester -- 1 Extra Credit
Certificate Course in Yoga - 30 hours -- 1 Extra Credit
VI
Advanced Diploma in Computer Programming
Level - 1 : Certificate Course - 100 hours per year - 2 Extra Credits
Extra credits are given for extra skills and courses qualified in MOOC/NPTEL
 III SEMESTER
Hrs./
Part Course Course Title Code Credits
Week
21ULTC3/ 6 3
I Language - III Tamil/Hindi/Sanskrit - III 21ULHC3/
21ULSC3
II English - III Communicative English - III 21ULEC3 6 3
III Core Course-III Data Structures and Algorithms 21UCSC3 5 5
III Core Practical-III Data Structures using ‘C’ 21UCSQC3 4 2
III Allied - II Statistical Methods - I 21UCSAC3 5 5
IV Skill Based - III Industry 4.0 21UCSSQC3 2 2
IV Non - Major Elective - I 2 2
Total 30 22
Group Project based on
Extension Activity
Extension Activity
Life Skill Courses Course I: Communication Skill 2 2 (Extra)
VI Articulation and Idea Fixation Skills
Physical Fitness Practice -- 35 hours per Semester
Advanced Diploma in Computer Programming
Level - 2 : Diploma Course - 100 hours per year
Extra credits are given for extra skills and courses qualified in MOOC/NPTEL

Non-Major Elective - I for Photo Editing 21UCSQNEC1

II B.A./[Link]./[Link].
Allied for II [Link]. Statistics “C” Programming - I 21USTAC3
IV SEMESTER
Hrs./
Part Course Course Title Code Credits
Week
21ULTC4/ 6 3
I Language - IV Tamil/Hindi/Sanskrit - IV 21ULHC4/
21ULSC4
II English - IV Communicative English - IV 21ULEC3 6 3
III Core Course - IV Relational Database 21UCSC4 5 5
Management Systems
III Core Practical - IV Database Lab 21UCSQC4 4 2
III Allied - II Statistical Methods - II 21UCSAC4 5 5
IV Skill Based - IV PHP with MySQL 21UCSSQC4 2 2
IV Non-Major Elective - II 2 2
Total 30 22
Group Project based on
Extension Activity 2(Extra)
Extension Activity
Life Skill Courses Course II: Professional Skills 2 2(Extra)
VI Articulation and Idea Fixation Skills -- 1 Extra Credit
Physical Fitness Practice - 35 hours per Semester -- 1 Extra Credit
Advanced Diploma in Computer Programming
Level - 2 : Diploma Course - 100 hours per year-- 2 Extra Credits
Extra credits are given for extra skills and courses qualified in MOOC/NPTEL and societal oriented
group projects
 Non-Major Elective - II for Animation 21UCSQNEC2
II B.A./[Link]./[Link].
Allied for II [Link]. Statistics “C” Programming - II 21USTAC4
V SEMESTER
Hrs./
Part Course Course Title Code Credits
Week
III Core Course - V .NET Programming 21UCSC5 5 5
Core Course - VI Computer Architecture and 21UCSC6
III
Organization 5 5
III Core Course - VII Operating Systems 21UCSC7 5 5
III Elective - I Software Engineering/ 21UCSEC1/ 4 4
Artificial Intelligence/ 21UCSEC1A/
Client Server Architecture/ 21UCSEC1B/
Microprocessor 21UCSEC1C
III Core Practical - V .NET Programming Lab 21UCSQC5 4 2
IV Core Practical - VI Microprocessor & OS Lab 21UCSQC6 4 2
IV Non-Major Skill Based -1 2 2
IV Value Education 21UVENC 1 -
Total 30 25
Group Project based on
Extension Activity
Extension Activity
Life Skill Courses Course III : Leadership Skills 2 2 (Extra)
Articulation and Idea Fixation Skills
VI Physical Fitness Practice -- 35 hours per Semester
Advanced Diploma in Computer Programming
Level - 3 : Advanced Diploma Course - 100 hours per year
Internship Training -- 1 Extra Credit
Extra credits are given for extra skills and courses qualified in MOOC/NPTEL

Non-Major Skill Based - I Desktop Publishing 21UCSQNSC1

for III B.A./[Link]./[Link].
VI SEMESTER
Hrs./
Part Course Course Title Code Credits
Week
III Core Course - VIII Computer Graphics 21UCSC8 5 5
III Core Course - IX Data Mining 21UCSC9 5 5
III Elective - II Python Programming/ 21UCSEC2/ 4 4
Compiler Design/ 21UCSEC2A/
Assembly Language
Programming/ 21UCSEC2B/
21UCSEC2C
Grid Computing
III Elective - III Computer Networks/ 21UCSEC3/ 4 4
Web Designing using Open 21UCSEC3A/
Source/
Mobile Communications/ 21UCSEC3B/
System Analysis and Design/ 21UCSEC3C
III Core Practical – VII Python Programming Lab 21UCSQC7 4 2
IV Core Practical – VIII Project 21UCSQC8 5 4
IV Non-Major Skill Based -2 2 2
IV Value Education 21UVENC 1 2
Total 30 28
 Group Project based on
Extension Activity 2 (Extra)
Extension Activity
Life Skill Courses Course IV : Universal Human
VI 2 2 (Extra)
Values
Articulation and Idea Fixation Skills -- 1 Extra Credit
Physical Fitness Practice - 35 hours per Semester -- 1 Extra Credit
Advanced Diploma in Computer Programming
Level - 3 : Advanced Diploma Course - 100 hours per year-- 2 Extra Credits
Extra credits are given for extra skills and courses qualified in MOOC/NPTEL

Non-Major Skill Based - II Web Designing 21UCSQNSC2

for III B.A./[Link]./[Link].
Programme Title : [Link]. Computer Science
Course Title : Core Course-I: Problem Solving & Programming Techniques
Course Code : 21UCSC1 Hours/Week: 5
Semester : I Credits: 4
Course Objectives:
1. Provide fundamental knowledge in “C”
2. Introduce structured programming
3. Familiarize various features of “C”
4. Acquaint different file processing methods in “C”

SYLLABUS
UNIT - I (Hours: 15)
Computer Fundamentals: Introduction to Computers: Characteristics of Computers -
History of Computers - Generations of Computers - Classification of Computers -
Applications of Computers Overview of C - Constants - Variables - Data types - Operators
and Expression - managing Input and Output operators.

UNIT - II (Hours: 15)

Decision making and Branching - If Statement , Switch and Goto Statement -
Decision Making and Looping - While Statement Do statement - For statement - Arrays -
One and Two Dimensional Arrays - Handling of Character String - Reading - Writing -
Arithmetic Operations.

UNIT - III (Hours: 15)

Introduction to Functions - The Form of C Functions - Category of Functions -
Nesting of Functions - Recursion - Functions with Arrays.
UNIT - IV (Hours: 15)
Structure and Unions - Definition - Initialization - Comparison - Arrays of Structures
- Structures within the Structures - Structure and Function - Union.
UNIT - V: (Hours: 15)
File Management in C - Introduction - Defining and Opening a File - Closing a File -
Input/Output Operations on Files - Error Handling during I/O Operations - Random Access to
Files - Command Line Arguments.
Books for Study:
1. R.K. Taxali, PC Software for Windows 98 Made Simple, Tata McGraw-Hill.
Chapters 1.1 to 1.6
2. E. Balagurusamy, Programming in ANSI C, Third edition, Tata McGraw-Hill.
Chapter 1-10& 12
Books for Reference:
1. P. K. Sinha&PritiSinha , “Computer Fundamentals”, BPB Publications, 2007.
2. Dr. Anita Goel, Computer Fundamentals, Pearson Education, 2010.
3. V. Raja Raman - Computer Programming in C - Prentice - Hall of India.
Web Resources:
• [Link]
• [Link]
• [Link]

Course Outcomes (CO): On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember the essential notions of C K1
Programming
CO2 Students will have the ability to understand the various concepts K2
of C Programming and problem solving skills.
CO3 Students will be able to apply different features of C Programming K3
to
Solve problems.
CO4 Students will have the ability to analyze diverse applications of C K4
Programming using pointers, structures and files

Mapping of Cos with Pos and PSOs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S M S L
CO4 S S S S L L S M S L
S – Strong, M – Medium, L – Light
 Programme Title : [Link]. Computer Science
Course Title : Core Practical-I: “C” Programming Language
Course Code : 21UCSQC1 Hours/Week: 5
Semester : I Credits: 3
Course Objectives:
1. Introduce “C” program execution
2. Familiarize the different decision making statements in “C”
3. Build programs using arrays and strings
4. Provide basic knowledge on working with files and user-defined
functions

SYLLABUS
1. Programs using simple variables, constants, expressions and operators.
2. Programs to read characters and to print them.
3. Programs using all decision making and looping statements.
4. Programs using one and multidimensional arrays.
5. Programs using character arrays and strings.
6. Programs with user-defined functions.
7. Programs using structures.
8. Programs using files.

Course Outcomes (CO): On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand basic concepts of K2
“C” programming
CO2 Students will be able to implement and apply structures K3
and user-defined functions
CO3 Students will have the ability to analyze different types K4
of files and operations on them

Mapping of COs with POs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S S M M M S M M S M
CO2 S S L L S S S M S M
CO3 S L S S S S M S S M
S – Strong, M – Medium, L – Light
Programme Title : [Link]. Computer Science
Course Title : Skill Based - I : Graphics Design & Photo Editing
Course Code : 21UCSSQC11 Hours/Week: 2
Semester : I Credits: 2
Course Objectives:
1. Familiarize with graphic designing
2. Provide techniques for image editing

SYLLABUS
List of Practicals:
GRAPHIC DESIGN
1. Using a path Fitting the Text and Blending the shape
2. Using effects create and Envelope
3. Creating concentric circle using the contour effect
4. Using the distortion effect for Zipper, Twister, Push and Pull
5. Stretching, Scaling, Reflecting and Mirroring an object
6. Applying brush strokes
7. Brushstroke Text Effect
8. Create frames
9. Cool Tricks with Paragraph text
10. Bouncing ball

IMAGE EDITING
1. Morphing using selection tool
2. Cloning using clone stamp tool
3. Join two images by using layers
4. Light effects
5. Text effects
6. Animation
7. Transparency effects
8. Creating multiple images
9. Clipping mask
10. Changing the figure from black and white to color

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 • Students will be able to recollect about digital images • K1
CO2 • Students will have the ability to understand the features of graphics • K2
CO3 Students will be able to apply the digital image editing to real time K3
applications
 Mapping of COs with POs :

PO/PSO PSO
PO
COs
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L

CO3 S M M M S S S S M L
S - Strong, M - Medium, L - Light
Programme Title : [Link]., Computer Science
Course Title : Core Course - II: Object Oriented Programming with Java
Course Code : 21UCSC2 Hours/Week: 4
Semester : II Credits: 4
Course Objectives:
1. Introduce Object Oriented Paradigm
2. Acquire programming knowledge in Java with its special features
3. Learn to solve the real time problems in Java environments
SYLLABUS
UNIT - I (Hours :15)
Fundamentals of Object Oriented Programming - Benefits of OOP - Applications of
OOP JAVA Evolution - Hardware and Software Requirements - Overview of Java language -
Simple Java Programs - More of Java Applications with Two Classes - Java Program
Structures - Java Tokens - Java Statements - Java Virtual Machine - Command Line
Arguments - Programming Style, Constants, Variables and data types - Giving Value to
Variables - Scope of Variables - Symbolic Constants - Type Casting - Getting Value of
Variables - Standard Default Values.

UNIT - II (Hours :10)

Operators and Expressions - Type Conversion in Expression - Operator precedence
and associativity - Mathematical Functions - Decision Making and Branching - Decision
Making with if Statement - Simple if Statement - The if … Else Statement - Nesting of If ..
else statement - the else if ladder - The Switch Statement - The ?: Operator - Decision
Making and Looping - The While Statement - The Do Statement - The For Statement - Jumps
in Loops - Labeled Loops.

UNIT - III (Hours :15)

Classes, Objects and Methods - Defining a Class - Fields Declaration - Methods
Declaration - Creating Objects - Accessing Class Members - Constructors - Methods
Overloading - Static Member - Nesting of Methods - Inheritance - Overriding Methods -
Final Variables and Methods - Final Classes - Finalizer Methods - Abstract Methods and
Classes - Methods with Varags - Visibility Control - Arrays, Strings and Vectors - One-
dimensional arrays - Creating an Array - Two-Dimensional Arrays - Strings - Vectors -
Wrapper Classes - Enumerated Types - Annotations - Interfaces, Multiple Inheritance :
Introduction - Defining Interfaces - Extending Interfaces - Implementing Interfaces -
Assessing Interface Variables.
UNIT - IV (Hours :10)
Packages - Java API Packages - Using System Packages - Naming Conventions -
Creating Packages - Accessing Package - Adding a Class to a Package - Hiding Classes -
Static Import - Multithreaded Programming - Creating Threads - Extending the Thread Class
- Stopping and Blocking a Thread - Life Cycle of a Thread - Using Thread Methods - Thread
Exceptions - Thread Priority - Synchronization - Implementing the Runnable Interface -
Inter-Thread Communication - Managing Errors and Exceptions - Types of Errors -
Exceptions - Syntax of Exception Handling Code - Multi Catch Statements - Using Finally
Statements - Throwing our Own Exceptions - Using Exceptions for Debugging.

Unit - V (Hours :10)

Applet Programming: Introduction - How Applets Differ from Applications -
Preparing to Write Applets - Building Applet Code - Applet Life Cycle - Creating and
Executing Applet - Designing a Web Page - Applet Tag - Adding Applet to HTML File -
Running the Applet - More About Applet Tag - Passing Parameters to Applets - Aligning the
Display - More about HTML Tags - Displaying Numerical Values - Getting Input from the
User - Concept of Streams - Stream Classes - Byte Stream Classes - Character Stream
Classes - Using Streams - Other Useful I/O Classes.

Books for Study:

1. E. Balagurusamy, “Programming with Java - A Primer”, TMH, Fourth Edition, 2010.
Chapters: 1 to 14 & 16 (Chapter 16 - Up to Page No. 287)
Books for Reference:
1. Herbert Schildt, “The Complete Reference JAVA 2”, TMH, Seventh Edition, 2006.
2. C. Xavier, “Programming with JAVA 2”, SCITECH, Third Reprint, June 2004.
3. C. Muthu, “Programming with JAVA”, Vijay Nicole Imprints (P) Ltd., 2004.
Web Resources :
1. [Link]
2. [Link]
3. [Link]
4. [Link]
 Course Outcomes (CO): On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Understand the Fundamentals of Object Oriented Programming K2
paradigm
CO2 Learn and Write simple java programs with Decision Making , K3
Branching and Looping constructs
CO3 Understand the concept on Classes, arrays, multiple inheritance K2 & K3
and interfaces and to develop Java programs
CO4 Execute the programs using the concept on Packages,
Multithreading and Exception Handling K3
CO5 Write and implement Applet Programming K3
CO6 Learn to manage Input/output Files in Java K2

Mapping of COs with POs and PSOs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
CO5 M S S L L S S M M M
CO6 M S S L L S S M M M
S – Strong, M – Medium, L – Light
 Programme Title : [Link]., Computer Science
Course Title : Core Practical - II : Java Programming
Course Code : 21UCSQC2 Hours/Week: 5
Semester : II Credits: 3
Course Objectives :
1. Introduce web designing with open source technologies
2. Acquire programming skill in Java
3. Develop and deploy websites in real time web environments

SYLLABUS
1. Programs using constructor and destructor.
2. Creation of classes and use of different types of functions.
3. Count the number of objects created for a class using static member function.
4. Write programs on interfaces.
5. Write programs on packages.
6. Write programs using function overloading.
7. Programs using inheritance
8. Programs using IO streams.
9. Programs using Applets.
10. Write a program using exception handling mechanism.
Course Outcomes (CO): On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand the OOPS concepts. K2
CO2 Students will have the ability to apply the knowledge in the K3
various types of looping statements.
CO3 Students will be able to analyze the concept of Exception K4
handling.
CO4 Students will be able to implement the concept of Applet K5
programming.

Mapping of COs with POs:

PO / PSO
PO PSO
COs
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
CO5 M S S L L S S M M M
S – Strong, M – Medium, L – Light
Programme Title : [Link]. Computer Science
Course Title : Skill Based Practical - II: HTML Programming
Course Code : 21UCSSQC2 Hours/Week : 2
Semester : II Credits : 2

Course Objectives:
1. Introduce “HTML” programming concepts
2. Familiarize with different tags in HTML.
3. Construct colourful web pages.
4. Provide basic knowledge on working with frames and links.

1. Create a HTML document with the following formatting options:

i. Bold
ii. Italics
iii. Underline
iv. Headings (Using H1 to H6 heading styles)
v. Font (Type, Size and Color)
vi. Background (Colored background/Image in background)
vii. Paragraph
viii. Line Break
ix. Horizontal Rule
2. Create a HTML document which consists of:
i. Ordered List
ii. Unordered List
iii. Nested List
iv. Image
3. Create a HTML document which implements Internal linking as well as external linking.
4. Create a table using HTML which consists of columns for Roll No., Student’s name and
grade.
5. Create a form using HTML which has the following types of controls.
Text Box
Option / Radio Button
Check Boxes
Reset and Submit Buttons
6. Create a HTML document having multiple frames.
7. Create HTML document with image as a background and Create link using image.
Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand thebasic concepts of HTML K2
programming
CO2 Students will be able to implement and apply different tags in HTML. K3
CO3 Students will have the ability to analyze different types of visual basic K4
applications.

Mapping of COs with POs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S S M M M S M M S L
CO2 S S L L S S S M S M
CO3 S L S S S S M S S L

S - Strong M - Medium L – Light

Programme Title : [Link]. Computer Science
Course Title : Core Course - III : Data Structures and Algorithms
Course Code : 21UCSC3 Hours / Week : 5
Semester : III Credits: 5
Course Objectives :
1. Introduce basic problem solving techniques and analysis of algorithms.
2. Impart knowledge on ADT such as List, Stack, Queue
3. Explore the concept of priority queues and circular queues
4. Learn about binary trees
5. Provide exposure in graph theory

SYLLABUS
UNIT - I (Hours: 15)
Introduction - Algorithms-Data Structures-Definition and Classification-Analysis of
Algorithms-Efficiency-Asymptotic Notation-Time Complexity of an Algorithm-Average,
Best and Worst Case Complexities-Recursive Programs -Arrays-Operations - Number of
Elements in an Array - Representations of Arrays - Applications.
Unit - II (Hours: 15)
Stacks – Introduction - Stack Operations – Application – Queues – Introduction -
Operations on Queues- Circular Queues - Other Types of Queues - Applications.
Unit - III(Hours: 15)
Linked Lists-Singly, Doubly, Circularly, Multiply Linked Lists -Applications.
Unit - IV(Hours: 15)
Trees and Binary Trees - Definition -Binary Trees Representation .-Binary Tree
Traversals - Threaded Binary Trees - Graphs - Definitions - Representations of Graphs -
Graph Traversals-Applications.
Unit - V (Hours: 15)
Greedy Algorithm - Dynamic Programming - Matrix Chain Multiplication - Hash
Tables and Graph Algorithm.
Book for Study:
1. “Data Structures and algorithms concepts, Techniques and Applications", G.A.
VijayalakshmiPai, Tata McGraw Hill 2008.
Chapters 1 – 9
Module 8,9,10,18,19 from
NOC:2016: Programming Data Structures and Algorithms
[Link]

Books for Reference:

1. “Data Structures and Algorithms”, Seymour Lipschutz, Schanum's Series, Tata
McGraw- Hill,
2. “Classic Data Structures”, DebasisSamanta, PHI, Second Edition
3. “Fundamentals of Data Structures”, Ellis Horowitz, SartajSahni, Galgotia Book Source
1976.
 Web Resources:
• [Link]
• [Link]
• [Link]
• [Link]
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Work with binary trees K2
CO2 Implement list, stack and queues with appropriate data structures K3
CO3 Ability to apply priority queues K3
CO4 Exploit graph algorithms K3
CO5 Analyze recursive and non-recursive algorithms for complexity K4

Mapping of COs with POs and PSOs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L

CO2 S S S S S L S M S L

CO3 S M M M S S S S M L

CO4 S S S S L L S M S L

CO5 M S S L L S S M M M

S - Strong M - Medium L – Light

 Programme Title : B. Sc. Computer Science (CBCS)
Course Title : Core Practical - III: Data Structures Using “C”
Course Code : 21UCSQC3 Hours / Week : 4
Semester : III Credits: 2
Course Objectives :
1. Provide hands on training in manipulating arrays
2. Perform operations in STACK & QUEUE
3. Perform binary tree traversal and searching
4. Implement conversion and evaluation of expressions
SYLLABUS
1. Matrix Addition and Subtraction.
2. Matrix Multiplication and Transpose.
3. Sparse Matrix Transformation.
4. Implementation of Push and Pop operations of a Stack usingArray.
5. Implementation of Add and Delete operations of a Queue using Pointer.
6. Write a Program to check the given String is Palindrome or not using stack
with pointers.
7. Write a Program to Create a Doubly Linked List.
8. Perform Tree Traversal for a Binary Tree Using Arrays and Recursion.
9. Binary Search
10. Depth first Search
11. Infix to Postfix Conversion
12. Evaluation of postfix expression
Course Outcomes (CO): On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Understand the efficiency of each data structures K2
CO2 Implement any data structure and perform operations in it K3
CO3 Able to select appropriate data structures K3,K4,K5

Mapping of COs with POs and PSOs: Mapping of COs with POs and PSOs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L M S S `M M L

CO2 M S S S S L S M S L

CO3 S M L M S S S S M L
S – Strong, M – Medium, L – Light
 Programme Title : B. Sc. Computer Science
Course Title : Skill Based - III: Industry 4.0
Course Code : 21UCSSQC3 Hours / Week : 2
Semester : III Credits: 2
Course Objectives:
1. Align the concepts with Industrial application
2. Introduce the concept of Mobile App.
3. Apply Internet of Things.
SYLLABUS
MOBILE APPLICATION
1. Buttons Event Handler.
2. Display Toast Messages using Toast.
3. Adding Background images for the apps.
4. Importing multimedia files to apps.
5. Developing a Calculator.
IOT LAB
To Develop an
1. IOT program to Switch ON/OFF LED light
2. IOT program for object detection using IR sensor
3. IOT program for Humidity and Temperature Monitoring
4. IOT program for Fire Detection
5. IOT program for Gas Leakage detection
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 • Understand the sensors and activators of Industry 4.0 K2
CO2 • Students will have the ability to apply knowledgeof sensors in the K3
industry application development
CO3 Students will be able to develop Mobile Applications K3

Mapping of COs with POs :

PO/PSO
PO PSO
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L

S – Strong, M – Medium, L – Light

Programme Title : B. Sc. Computer Science
Course Title : Non-Major Elective - I: Photo Editing
Course Code : 21UCSQNEC1 Hours/Week :2
Semester : III Credit : 2

Course Objectives:

1. Introduce number of tools and commands for working on digital images or

bitmaps
2. Familiarize the utilities for retouching color correcting and compositing.
3. Provide the most powerful range of features for designing images.
4. Provide powerful capacity to transform objects into
Both of the web compatible bitmap file format.

SYLLABUS

1. Simple Image Editing (Rotate, Resize, Crop, Zoom, Brightness, Contrast)

2. Colour Changing, Image Extraction and Merging of Images
3. Smoothening of Sharp Edges
4. Text on Images
5. Removal of Red Eyes
6. Working With Layers
7. Filters
8. Blending Image using Layer Mask
9. Clone a Image using Clone Stamp
10. Adding Shadow to the Image

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand the basic concepts of Photoshop. K1
CO2 Students will be able to implement and apply the tools in Photoshop. K2
CO3 Students will have the ability to analyze different types of K3
Applications.
Programme Title : B. Sc. Statistics
Course Title : Allied : 'C' Programming - I
Course Code : 21USTAC3 Hours / Week: 5
Semester : III Credit : 5
Course Objectives :
1. Gain knowledge on problem solving techniques.
2. Learn how to write modular and readable C programs.
3. Understand the usage of arrays.
4. Write simple programs in C

SYLLABUS
UNIT I (Hours: 10)
Overview of C - Constants - Variables - Data types - Operators and Expressions -
Managing Input and Output Operators.
UNIT II (Hours: 20)
Decision making and Branching -. Introduction - If Statement, simple if Statement,
The if. Else statement – Nesting of if…else statement - the else if ladder – The Switch
statement – the ?: operator - Go to Statement.
UNIT III (Hours: 20)
Decision Making and looping - Introduction - While Statement - Do Statement - For
Statement - Jumps in Loops
UNIT IV (Hours: 15)
Arrays - One Dimensional Arrays - Declaration and Initialization of one Dimensional
arrays - Handling of Character Strings - Two Dimensional Arrays- Initializing two
dimensional arrays.
UNIT V (Practical) (Hours: 10)
Biggest among three numbers - smallest number in an array – Arrange numbers in
ascending order.

Book for Study

1. [Link],"Programming in ANSI C" Third Edition. Tata McGraw
Hill. Chapter 1-7.

Book for Reference

1. [Link], "Computer Programming in C" -Prentice -Hall of India.

Web Resources
• [Link]
• [Link]
• [Link]
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Store and manipulate homogeneous data using arrays and K2, K3
strings
CO2 Use user defined data type for problem solving K3
CO3 Locate errors in simple programs K4
CO4 Develop modular C programs for a given problem K3
Programme Title : B. Sc. Computer Science
Course Title : Core Course - IV : Relational Database Management Systems
Course Code : 21UCSC4 Hours / Week : 5
Semester : IV Credit : 5
Course Objectives :
 Provide knowledge on database management system with different models
 Impart the methodologies involved in the design of a database system
 Identify the constraints that could be placed in a database
 Develop queries to analyze the database
 Understand the normalization process to prepare a well-organized database
SYLLABUS
UNIT - I (Hours: 10)
Introduction to Database Systems
Overview - Historical Perspective - File Systems versus a DBMS - Advantages of a
DBMS - Describing and Storing Data in a DBMS - Queries in a DBMS - Transaction
Management - Structure of a DBMS – People who Deal with Databases.

UNIT – II (Hours: 10)

The Entity-Relationship Model
Overview of Database Design - Entities, Attributes, and Entity Sets - Relationships
and Relationships Sets - Additional Features of ER Model - Conceptual Design with ER
Model – Conceptual Design for Large Enterprises.

UNIT – III (Hours: 10)

The Relational Model
Introduction to the Relational Model - Integrity Constraints over Relations -
Enforcing Integrity Constraints - Querying Relational Data - Logical Database Design: ER to
Relational - Introduction of Views - Destroying/Altering Tables and Views.
UNIT - IV(Hours: 28)
Relational Algebra and SQL
Preliminaries - Relational Algebra - SQL Overview - The Form of a Basic SQL Query -
UNION, INTERSECT, AND EXCEPT - Nested Queries - Aggregate Operators - Null
Values - Complex Integrity Constraints in SQL - Triggers and Active Databases - Designing
the Active Databases – Functional Dependencies - Normalization
UNIT - V (Hours: 07)
Application Program Development
Application programs and user interfaces - Rapid Application Development - Object
Relational Mapping - Mobile Apps - Library Information System
Books for Study:
1. Raghu Ramakrishnan and Johannes Gehrke,“Database Management Systems”,
MCGraw Hill, 2003.
Chapters: 1.1 - 4.2, 5.1 - 5.9
[Link]
Lecture 21,22,23
1. [Link], A. Kannan and S. Swamynathan, “An Introduction to Database Systems”,
Pearson, 2012 Chapters 11 and 12

Books for Reference:

1. Abraham Silberschatz,Henry F. Korth and S. Sudharshan,“Database System Concepts”,
McGraw Hill, 2006.
2. Rajesh Naran, “Database Management Systems”, Prentice Hall of India Private
Limited, 2004.
Web Resources:
1. [Link]
2. [Link]
3. [Link]
4. [Link]
5. [Link]
6. [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Ability to understand the different data models K2
CO2 Capacity to apply conceptual design in a relational database model K3
CO3 Expertise to create a normalized database K3
CO4 Skill to analyze the constraints to be enforced K4
CO5 Ability to evaluate the existing database for good design K5

Mapping of COs with POs and PSOs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L

CO2 S M S L S L S M S L

CO3 S M M M S S M M M L

CO4 S S S S L L S M S L

CO5 M S S L L S S M M M
S - Strong M - Medium L – Light
Programme Title : B. Sc. Computer Science
Course Title : Core Practical- IV: Database Lab
Course Code : 21UCSQC4 Hours / Week : 4
Semester : IV Credit : 2

Course Objectives :
1. Understand SQL to create, modify and insert values into a database
2. Create a PL/SQL program to manipulate the database in a flexible manner
3. Prepare a report

SYLLABUS
1. Data Definition Language Commands
2. Data Manipulation Language Commands
3. Data Control Language and Transaction Control Language Commands
4. Built-in Functions
5. Nested Queries and Join Queries
6. Views
7. Simple PL/SQL
8. PL/SQL with Control Structures
9. Functions
10. Report Generation
Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Understand SQL constructs for database creation K1
CO2 Analyze the problem and apply queries K3
CO3 Create a database for a given problem K3

Mapping of COs with POs and PSOs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L

CO2 M S S M S L S M S L

CO3 S M M M S S S S M L

S - Strong M - Medium L – Light

Programme Title : B. Sc. Computer Science
Course Title : Skill Based - IV: PHP with MySQL
Course Code : 21UCSSQC4 Hours / Week : 2
Semester : IV Credit : 2
Course Objectives :
1. Provide basic knowledge in creating a Table and familiarize with
Queries in MYSQL
2. Introduce PHP programming concepts
3. Provide basic knowledge on working with script

MY SQL
1. To create a table, alter and drop table.
2. To perform select, update, insert and delete operation in a table.
3. To make use of different clauses viz where, group by, having, order by, union and
To study different constraints.
PHP
1. Create a PHP page using functions for comparing three integers and print the
largest number.
2. Write a function to calculate the factorial of a number (non-negative integer). The
function accept the number as an argument.
3. Write a program to sort an array.
4. Write a PHP script that finds out the sum of first n odd numbers.
5. Create a webpage with the greeting and and date and time stamps in the footer
6. Create a webpage with the submit button and an event handling PHP Script.
7. Create a login page having user name and password. On clicking submit, a
welcome message should be displayed if the user is already registered (i.e. name
is present in the database) otherwise error message should be displayed.
8. Create a simple ‘birthday countdown’ script, the script will count the number of
number of days between current day and birthday.

Course Outcomes (CO): On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Ability to understandDatabase creation in MySQL K2
CO2 Able to apply PHP scripts in web designing. K3,K5
CO3 Analyze the existing scripts in PHP K4
Mapping of COs with POs and PSOs:
PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L

CO2 S S S S S L S M S L

CO3 S M S S L L S M S L

S - Strong M - Medium L – Light

Programme Title : [Link]. Computer Science
Course Title : Non-Major Elective-II : Animation
Course Code : 21UCSQNEC2 Hours/Week : 2
Semester : IV Credits : 2
Course Objectives:

 Introduce number of tools and commands for working on digital

images or bitmaps
 Familiarize the utilities for retouching, color correcting
and compositing.
 Provide the most powerful range of features for designing images.
 Introduce morphing effect, Time line effect using Flash8

SYLLABUS

1. Design your dream house with animation.

2. Animate the object using riffle effect.
3. Change the size of balloon from smaller to larger using shape tween.
4. Animate: pendulum motion.
5. Convert human face to tiger as look like morphing effect.
6. Change the color of graphic art using filters.
7. Animate the object using timeline effect.
8. Make a ball and show the shadow movement of the ball by using onion skinning
function.
9. Create different color balls to bounce on walls using geometric tools such as
rectangle, circle etc.
10. Animate the object using selection tool, sub selection tool and lasso tool.

Course Outcomes (CO): On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand thebasic concepts of Flash 8. K2
CO2 Students will be able to implement and apply the tools in Flash 8 K3
CO3 Students will have the ability to analyze different types of applications. K4
 Programme Title : B. Sc. Statistics
Course Title : 'C' Programming - II
Course Code : 21USTAC4 Hours / Week : 5
Semester : IV Credits : 5
Course Objectives :
1. Introduce String Manipulation
2. Familiarize with user defined functions
3. Build programs using structures
4. Gain knowledge in Statistical problem Solving using C
SYLLABUS
UNIT I (Hours: 10)
Character Arrays and strings – Introduction – Declaring and Initializing string
variables-Reading strings from terminal-Writing strings to screen-Arithmetic operations
onCharacters-putting strings together – Comparison of two strings –String handling
functions- Table of Strings - Other features of strings.
UNIT II (Hours: 20)
User defined functions – Introduction-Need for user – defined functions – Elements of
userDefined functions – Definition of functions – Return values and their types – Function
Calls - Function Declaration – Category of Functions.
UNIT III (Hours: 20)
Functions that return multiple values – Nesting of functions- Recursion - Passing
ArraysTo Functions – Passing strings to functions- The scope ,visibility and lifetime of
variables
UNIT IV (Hours: 15)
Structures and Unions – Introduction – Defining a structure- Declaring a structure
variable Accessing structure members-Structure initialization- Copying and comparing
structure Variables-Operations on individual members – Arrays of structures – Arrays within
Structures—Structures within structures- Structures and functions- Unions- Size of structures
UNIT V (Practical) (Hours: 10)
Mean - Median - Mode - Standard Deviation - Correlation Coefficient

Book for Study

1. [Link],"Programming in ANSI C" Third Edition. Tata McGraw
Hill. Chapter 8-10.

Book for Reference

1. [Link], "Computer Programming in C" -Prentice -Hall of India.
Web Resources
• [Link]
• [Link]
• [Link]
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
Students will be able to understandString Manipulation in
CO1 “C”programming K2
CO2 Students will be able to implement and apply user-defined K3
functions
CO3 Students will have the ability to design programs for statistical K4
problems
Programme Title : [Link]. Computer Science
Course Title : Core Course V: .NET PROGRAMMING
Course Code : 21UCSC5 Hours/Week :5
Semester : V Credit :5
Course Objectives:
1. Provide fundamental knowledge in‘[Link]’
2. Introduce Windows form & Web form withHTML
3. Familiarize various Tools in‘[Link]’
4. Acquaint with different Database Connectivity methods in‘[Link]

SYLLABUS
UNIT – I (Hours: 15)
Essential Visual Basic Net: Putting Visual Basic to work- New concept in [Link] -
Upgrading from Visual Basic 6.0 - The NET Framework and the Common Language
Runtime - Building [Link] Applications - The Visual Basic Integrated Development
Environment - Coding to get the most from Visual Basic.
UNIT – II (Hours: 15)
Windows Forms: All about Windows Forms - All about Windows MDI Forms Text
Boxes - Labels - Buttons - Check Boxes - Radio Buttons - List Boxes - Combo Boxes -
Timers - Menus -Menu Items - Context Menus, The build-in dialog boxes - Open file
dialogs, save file dialogs - Font dialogs - Colour dialogs.
UNIT – III (Hours: 15)
Object Oriented Programming: Classes And Objects – Fields, Properties, Methods
and Events - Classes vs. Object Members - Abstraction, Encapsulation, Inheritance,
Polymorphism Overloading, Overriding, and Shadowing - Constructor & Destructors - An
OOP Example -Structures AndModules.
UNIT – IV (Hours: 13)
Web Forms: Web Forms And HTML - Creating a Web Application - Adding
Controls to a Web Form - Running a Web Application - Creating a Multi Form Web Project
– Handling Client Events - The Control Class - The Web Control Class - Validation Controls
– Required Field Validators - Comparison Validators - Range Validators – Regular
Expression Validators - Custom Validators - Validation Summaries - Calendars -
AdRotators.
UNIT – V (Hours: 17)
Data Access With [Link]: Accessing Data With Data Adapters and Datasets
Working with [Link] - Overview of [Link] Objects - Simple Binding - Complex
Binding - Binding Data to Controls - Navigating in Data Sets - The OleDbConnection class -
The SqlConnection class - The OleDbCommand class - The SqlCommand class - The
OleDbDataAdapter class - The SqlDataAdapter class – The DataSet class - The
OleDbDataReader class - The SqlDataReader class.
Book For Study
1. “Visual [Link] Programming” , Steven Holzner, 2005 Edition
Books For Reference
1. Jeffrey R. Shapiro, “The Complete Reference Visual [Link]”, TMH2002.
Web resources:
● [Link]
● [Link]
● [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember the basic concepts of VB K1
and [Link] Programming
CO2 Students will have the ability to understand the various tools K2
of [Link] Programming
CO3 Students will be able to apply different features of OOP K3,K4
Concepts in [Link] Programming to real time applications
CO4 Students will have the ability to analyze diverse methods of K4
form creation using web with HTML in [Link]
Programming
CO5 Students will have the ability to evaluate different database K4,K5
connectivity methods.

Mapping of COs with POs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
CO5 S S M L S S S `S M L

S - Strong M - Medium L – Light

ProgrammeTitle : [Link]. Computer Science
Course Title : Core Course - VI: Computer Architecture and Organization
Course Code : 21UCSC6 Hours/Week : 5
Semester : V Credit : 5
Course Objectives:
1. Provide fundamental knowledge in Computer Architecture
2. Introduce peripheral devices
3. Familiarize interrupts and input output processor
4. Acquaint different types of memories

SYLLABUS
UNIT - I (Hours: 15)
Overview of Microprocessor - Architecture of 8 bit Microprocessor Intel 8085 -
Addressing modes - 8085 Instructions - Assembly Language Programming - Simple
Programs - Addition, Subtraction, Multiplication, Division – Ascending and descending
orders.
UNIT - II (Hours: 15)
Input - Output Organization - Peripheral Devices - Input - Output Interface -
Asynchronous Data Transfer - Modes of Transfer.
UNIT – III (Hours: 15)
Priority Interrupt - Direct Memory Access - DMA Controller -DMA Transfer - Input
Output Processer (IOP).
UNIT – IV (Hours: 15)
Memory Hierarchy - Auxiliary Memory -Cache Memory - Virtual Memory.
UNIT – V(Hours: 15)
Basic computer Organization and Design - Instruction Code - Computer Register -
Computer Instruction - Timing and Control - Instruction Cycle - Memory Reference
Instructions - Input Output and Interrupt - Complete Computer Description - Design of Basic
Computers - Design of Accumulator Logic.

Book for Study:

1. B. Ram, “Fundamentals of Microprocessors and Microcomputers”, DhanpatRai
Publications, Sixth Edition (Unit - I).
2. M. Morris Mano,“ Computer System Architecture”, Prentice Hall of India, Third
Edition 1993. (Unit - II, III, IV, V).

Books for Reference:

1. Lance a Levanthal, “Introduction to Microprocessors - Hardware and Programming”,
Prentice hall of India, 1978

Web Resources :
• [Link]
• [Link]
• [Link]
cture%208e%20by%20William%[Link]
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Students will be able to recollect about basic computer K1
organization
CO2 Students will have the ability to understand the concepts of input K2
and output organization
CO3 Students will be able to apply the different usage of interrupts K3
CO4 Students will have the ability to analyze the different applications K4
of memory management

Mapping of COs with POs :

PO / PSO PO PSO

CO PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L

S - Strong, M - Medium, L - Light

ProgrammeTitle :[Link]. Computer Science
Course Title : Core Course - VII: Operating Systems
Course Code : 21UCSC7 Hours/Week : 5
Semester :V Credits: 5
Course Objectives:
1. Explain the basic concepts of Operating system components, calls, programs
and structures.
2. Describe the basic concepts of CPU scheduling and Deadlock System Model.
3. Familiarize the various techniques of Memory management.
4. Describe the concepts of File system structure..

SYLLABUS
UNIT - I (Hours: 13)
System Components - Operating System Services - System Calls - System Programs -
System Structure - Virtual Machines - System Design and Implementation
UNIT - II (Hours: 18)
Process Concept - Process Scheduling - Operations on Processes - Cooperating
Processes - Inter Process Communication - Communication in Client-Server System - CPU
Scheduling Basic Concepts - Scheduling Criteria - Scheduling Algorithms –First –Come
,First – Served Scheduling – Shortest –Job – First Scheduling – Priority Scheduling.
UNIT - III (Hours: 18)
Process Synchronization - Background - The Critical-Section Problem -
Synchronization Hardware - Semaphores - Classic Problem of Synchronization - Critical
Regions -Monitors - Deadlocks System Model - Deadlock Characterization - Methods for
Handling - Deadlock Prevention - Deadlock Avoidance - Deadlock Detection.
UNIT - IV (Hours: 13)
Memory Management - Background - Swapping - Contiguous Memory Allocation -
Paging - Segmentation - Segmentation with Paging - Virtual Memory Background - Demand
Paging - Process Creation - Page Replacement –Basic Scheme- FIFO Page Replacement -
Optimal Page Replacement
UNIT - V(Hours: 13)
File System Implementation - File-System Structure - Implementation - Directory
Implementation – Allocation Methods – Free-space Managements – Efficiency and
Performance – Recovery – Log-Structured File System - NPS
Book For Study
1. Silberschatz, Galvin, Gagne, “Operating System Concepts”, Sixth Edition, Wiley,
Reprint 2012.
Chapters : 3, 4, 6.1-6.3.3, 7.1 – 7.7, 8.1-8.6, 9,10.1-10.4, 12
Books For Reference
1. William Stallings, “Operating Systems - Internals and Design Principles”, Sixth
Edition, Pearson, 2009
2. Deital H.M, “An Introduction to Operating System”, Addition Wesley Publishing
Company, Seventh Indian Reprint 2001.
 Web Resources :
• [Link]
• [Link]
• [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember the basic concepts of operating K1
systems.
CO2 Students will have the ability to understand the various concepts K2
of process Scheduling.
CO3 Students will be able tounderstand the various concepts of K2
memory management techniques.
CO4 Students will have the ability to remember and understand the K1&K2
File systems.

Mapping of COs with POs :

PO/PSO
CO PO PSO

CO PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
S – Strong, M – Medium, L – Light
Programme Title: [Link]. Computer Science
Course Title : ELECTIVE - I: Software Engineering
Course Code : 21UCSEC1 Hours / Week : 4
Semester : V Credit : 4

Course Objectives:
1. Provide the basic concepts of software engineering
2. Introduce about the software engineering requirements.
3. Elucidate the concepts of analysis model and reengineering.
4. To elaborate the essence of user Interface Design
SYLLABUS
UNIT –I (Hours: 8)
Introduction to Software Engineering
The Evolving Role of Software –Software-The Changing Nature of Software- Legacy
Software-Software Myths-Software Engineering-A Layered Technology-A Process Frame
Work-The Capability Maturity Model Integration(CMMI)-Process Patterns- Process
Assessment- Personal And Team Process Models – Process Technology- Product and
Process.
UNIT –II (Hours: 10)
Requirements Engineering
A Bridge to Design and Construction- Requirements Engineering Tasks-Initiating the
Requirements Engineering Process- Eliciting Requirements- Developing Use- Cases-
Building the Analysis Model- Negotiating Requirements- Validating Requirements.
UNIT- III (Hours: 15)
Building the Analysis Model
Requirements Analysis- Analysis Modeling Approaches-Data Modeling Concepts-
Object- Oriented Analysis- Scenario- Based Modelling- Flow- Oriented Modeling- Class-
Based Modeling-Creating a Behavioural Model.
UNIT-IV (Hours: 12)
Design Engineering and Performing User Interface Design
Design within the Context of Software Engineering- Design Process and Design
Quality- Design Concepts- The Design Model- Pattern- Based Software Design- The Golden
Rules- User Interface Analysis And Design- Interface Analysis- Interface Design Steps-
Design Evaluation.
UNIT-V (Hours: 15)
Metrics for Process and Projects and Reengineering
Metrics in the Process and Project Domains- Software Measurement- Metrics of
Software Quality- Integrating Metrics Within the Software Process- Metrics for Small
Organisations- Establishing a Software Metrics Program- Business Process Reengineering-
Software Reengineering- Reverse Engineering-Restructuring- Forward Engineering- The
Economics of Reengineering.
Book for study:
1. ”Software Engineering”-Roger S. Pressman McGraw- Hill International Sixth
Edition.
Book for reference:
1. “Fundamentals of Software Engineering.”-Rajib Mall

Web Resources :
• [Link]
• [Link]
• [Link]
classification-of-software

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember the essential concepts of software K1
engineering.
CO2 Students will have the ability to understand the various K2
requirements in software engineering.
CO3 Students will have the ability to apply the concepts of analysis K4
model.
CO4 Students will have the ability to understand andevaluate different K4,K5
types of software engineering models.
CO5 Students will be able to evaluate the software engineering concepts. K5

Mapping of COs with POs :

PO PSO
PO/PSO
PSO
CO PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3
4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
CO5 M S S L L S S M M M
S – Strong, M – Medium, L – Light
Programme Title: [Link]. Computer Science
Course Title : ELECTIVE - I : Artificial Intelligence
Course Code : 21UCSEC1A Hours / Week : 4
Semester : V Credits: 4
Course Objectives:
1. Provide fundamental knowledge in Artificial Intelligence
2. Introduce logic programming
3. Familiarize reasoning techniques
4. Acquaint different applications of Artificial Intelligence

SYLLABUS
UNIT – I (Hours: 10)
Introduction: Foundation and history of Al, Al problems and techniques - Al
programming - Introduction to :LISP and PROLOG - Problem spaces and searches - Blind
search strategies- Depth first - Heuristic search techniques Hill climbing - Best first - A*
algorithm AO*, trees -Minimax algorithm- Game playing and alpha beta pruning.
UNIT – II (Hours: 10)
Knowledge representation: Issues of Knowledge representation, Predicate logic - Logic
programming - Semantic inheritance - constraints propagation - Representing Knowledge
using rules.
UNIT – III (Hours: 10)
Reasoning under uncertainty: Uncertain Knowledge - Review of probability - Bye's
Probabilistic Inferences and Heuristic methods - symbolic reasoning under uncertainty
statistical reasoning - fuzzy logic - temporal reasoning- Non monotonic reasoning.
UNIT – IV(Hours: 10)
Planning in situational calculus -Representation for planning -Partial order algorithm-
Learning from examples - Discovery as learning - Learning by analogy explanation - Neural
nets and genetic algorithms.
UNIT – V(Hours: 20)
Applications, NLP - Rule based systems architecture - expert systems - Knowledge based
concepts - Al applications to robotics - Current trends in intelligent systems.

Book for Study:

1. Rich and Kevin Knight, "Artificial Intelligence", Tata McGraw Hill, Third
Edition,2009.
Books for Reference:
1. Russel and Peter Norvig, "Artificial Intelligence-A modem approach", Prentice Hall,
Third Edition, Dec 2009.
2. Patrick Henry Winston ,"Al" ,Addison Wesley, Third Edition, 1992.

Web Resources :
• [Link]
[Link]
• [Link]
• [Link]
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember the Artificial Intelligence K1
Techniques
CO2 Students will have the ability to understand the concepts of K2
logic programming and knowledge representation
CO3 Students will be able to apply different kinds of reasoning to K3
real time applications
CO4 Students will have the ability to analyze the different K4
applications of AI Programming

Mapping of COs with POs:

PO/PSO
CO PO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
S – Strong, M – Medium, L – Light
Programme Title : [Link]., Computer Science
Course Title : ELECTIVE - I: Client/Server Architecture
Course Code : 21UCSEC1B Hours/Week: 4
Semester : V Credits: 4

Course Objectives:
1. Introduce with Client/Server Concepts
2. Familiarise SQL Database Server Architecture
3. Acquaint with CORBA Distributed and Business Objects.

SYLLABUS
UNIT – I (Hours: 7)
Client/Server Concepts - File Servers - Database Servers - Transaction Servers -
Groupware Servers - Object Servers - Web Sever - Fat Servers or Fat Clients - 2-Tier Versus
3-Tier - Client Server Building Blocks - A One Size Fits All Model - Client/Server for Tiny
shops and Nomadic Tribes Client/Server for Small Shops And Departments - Client/Server
for Intergalactia Enterprises - Base Services - Extended Services - Server Scalability -- Client
Anatomy 101.
UNIT – II (Hours: 15)
NOS Middleware - Transparency - Extending the Local OS's Reach - Global
Directory Services - Distributed Time Services - Distributed Security Services - Peer-to-Peer
Communications- Sockets -Netware : IPX/SPX and TLI - NetBIOS and NetBEUI - Named
Pipes - Remote Procedure Call (RPC) - Messaging And Queuing– MOM versus RPC - The
Fundamentals Of SQL And Relational Databases - SQL Database Server Architecture -. -
Stored Procedures - Triggers And Rules.
UNIT – III (Hours: 10)
OLTP Concepts - Decision-Support Systems -Comparing Decision Support and
OLTP Systems-Production Versus Informational Databases - The Elements of Data
Warehousing - Warehousing hierarchies: The Datamarts - Replication versus Direct Access -
The Mechanics of Data Replication - OLAP and Multidimensional Data - client/server
Transaction processing -Transaction models- TP Monitors -Transaction Management
standards.
UNIT – IV (Hours: 13)
Is Groupware Different from SQL Database - Is Groupware Different from TP
Monitors - The Components of Groupware - Work Flow– Scheduling and Calendaring -
Conferencing - From Distributed Objects To Components–The Driving Force Behind
Components - Super Components - The Ultimate Components - CORBA Distributed Object -
CORBA Components - OMG'S Object Management Architecture - CORBA Object Services
- CORBA Business Objects.
UNIT – V (Hours: 15)
Client /Server Distributed System Management - Dealing With Chaos - The
Components of an OPEN DSM Platform - Management Applications - Distributed System
Management Standards - The Internet Management Protocols - The Internet's SNMP - OSI
 Management Framework - The Desktop Management lnterface(DMI) – X/Open
Management Standards - Client /Server Application Development Tools - Client/Server
Application design - From Prototype to Working System.

Book for Study:

1. [Link], Dan Harkey& Jeri Edwards, "The Essential Client/Server Survival
Guide", GalgotiaPublication,Second Edition, 2007.

Book for Reference:

1. Dawna Travis Dewire "Client/Server Computing", Tata McGraw-HiIl, 2003.

Web Resources:
1. [Link]
2. [Link]
3. [Link]

Course Outcomes (CO): On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Learn the basic concepts of client server technology K2
Study Middleware technologies and Fundamentals Of SQL And
CO2 K3
Relational Databases
CO3 Assimilate OLTP client/server Transaction processing K3
Apprehend Components of Groupware and CORBA
CO4 K2
Distributed Object
Learn and appreciate Client /Server Distributed System
CO5 K3
Management

Mapping of COs with POs :

PO/PSO
CO PSO
PO

PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
CO5 M S S L L S S M M M

S – Strong, M – Medium, L – Light

Programme Title : B. Sc. Computer Science
Course Title : ELECTIVE - I: Microprocessor
Course Code : 21UCSEC1C Hours / Week : 4
Semester : V Credits : 4
Course Objectives :
1. Give a complete understanding of the architecture of 8085 Microprocessor
2. Impart the knowledge of programming 8085
3. Make the students to solve real life problems using Microprocessor based systems
SYLLABUS

UNIT – I (Hours: 10)

Evolution of Microprocessors – Single-chip Microcomputer – Memory – Buses –
Memory Address Capacity of CPU – Microcomputers – Processing Architecture – Intel 8085
– Instruction Cycle – Timing Diagram.

UNIT – II (Hours: 10)

Instruction set of Intel 8085 – Instruction and Data Formats – Addressing Modes –
Status Flags – Intel 8085 Instructions – Programming of Microprocessors – Assemblers –
Stacks and Subroutines – Macros and Micro Programming.

UNIT – III (Hours: 10)

Assembly Language Programming – Simple Examples – Addition and Subtraction of
Binary and Decimal Numbers – Complements – Shift – Masking – Finding Max and Min
Number in an array – Arranging a series of numbers – Multiplication, Division – Multibyte
Addition and Subtraction.

UNIT – IV (Hours: 15)

Peripheral devices and interfacing – Address Space Partitioning – Memory and I/O
Interfacing – Data Transfer Schemes – Interrupts of Intel 8085 – Interfacing Devices and I/O
Devices – I/O Ports – Programmable Peripheral Interface.

UNIT – V (Hours: 15)

Microprocessor Applications – Delay Subroutines – Interfacing of 7 segment LED Displays –
Frequency measurement – Temperature Measurement and Control – Water Level Indicator –
Microprocessor Based Traffic Control.

Book for Study

1. Fundamentals of Microprocessors and Microcomputers – Badri Ram – Fifth revised
and enlarged edition – DhanpatRai publication – 2001.

Books for Reference

1. Microprocessor Architecture, programming and application with the 8085/8080A –
[Link] – Penram International Publishers India 1997.
 Web Resources
• [Link]
• [Link]
• [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Develop an ability to read and understand the architecture of K2
other processor
CO2 Develop Application on 8085 K3
CO3 Analyze the Architecture of 8085 K4
CO4 Design advanced processor system with realistic constraint K3

Mapping of COs with POs:

PO / PSO
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
S – Strong, M – Medium, L – Light
Programme Title : [Link]. Computer Science
Course Title : Core Practical – V: .NET PROGRAMMING LAB
Course Code : 21UCSQC5 Hours/Week: 4
Semester : V Credits: 2
Course Objectives :
1. Introduce “[Link]” programmingconcepts
2. Familiarize the different forms and controls of“[Link]”
3. Build programs using menus, OOPconcepts
4. Provide basic knowledge on working with web forms andhtml.
5. Analze and evaluate different methods of
databaseconnectivity in “[Link]”
SYLLABUS
1. Programs using windows forms andcontrols
2. Programs using menus and built-in dialogboxes
3. Programs using OOPconcepts
4. Programs using web forms andcontrols
5. Programs using validationcontrols
6. Programs usingdatabase
7. Program using animation & hyperlink
8. Program usingdata binding
9. Program usingdata grid
10. Program using consoleapplication

Course Outcomes (CO): On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand basic concepts of [Link] K2
Programming
CO2 Students will be able to apply and implement different forms K3
and controls
CO3 Students will have the ability to analyze and implement K4
OOPconcepts
CO4 Students will have the ability to analyze and implementdiverse web K4
forms and controls
CO5 Students will be able to implement different databaseconnectivity in K4, K5
forms and controls.

Mapping of COs with POs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S S M M M S M M S L
CO2 S S L L S S S M S M
CO3 S L S S S S M S S L
CO4 L L S S S S M S S L
CO5 L L S S M M M S S L
S - Strong M - Medium L – Light
 Programme Title : [Link]. Computer Science
Course Title : Core Practical – VI: Microprocessor & OS Lab
Course Code : 21UCSQC6 Hours/Week : 4
Semester : V Credit : 2
Course Objectives :
1. Introduce microprocessor programming concepts
2. Familiarize with Code Conversion
3. Understand Operating system commands
4. Acquire shell programming knowledge

SYLLABUS
MICROPROCESSOR:
1. 8-bit Addition
2. 8-bit Subtraction
3. 8-bit Multiplication
4. 8-bit Division
5. To find the largest number in a Data Array
6. To arrange a series of numbers in Ascending Order
7. To arrange a series of numbers in Descending Order

OS LAB :
1. Usage of following commands: ls, pwd, tty, cat, who, who am I, rm, mkdir, rmdir,
touch, cd.
2. Usage of following commands: cal, cat(append), cat(concatenate), mv, cp, man, date
3. Usage of following commands: chmod, grep, tput (clear, highlight), bc.
4. Write a shell script to check if the number entered at the command line is prime or
not.
5. Write a shell script to modify “cal” command to display calendar of the specified
month.
6. Write a shell script to modify “cal” command to display calendars of the specified
range of months.
7. Write a shell script to accept a login name. If not a valid login name display message-
“Entered login name is invalid.
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand thebasic concepts of assembly K2
Language Programming
CO2 Students will be able to applyoperating system commands. K3
CO3 Students will have the ability to analyze different types of shell scripts K4
Mapping of COs with POs :
PO / PSO
CO PO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
 Programme Title : B.A/[Link]./[Link], Non-Computer Science
Course Title : Non-Major Skill Based – I: Desktop Publishing (Practical)
Course Code : 21UCSQNSC1 Hours/Week: 2
Semester : V Credits: 2
Course Objectives :
1. Introduce word processing and image editing using photoshop and corel draw.
2. Acquaint with image editing features and picture drawing tools
3. Applying features for real time editing images
SYLLABUS
WORD
1. Text Preparation
2. Table Creation
3. Mail Merge
4. Add a Text Watermark to Document.

PHOTOSHOP
1. Duplicate an image
2. Change image Size and Resolution.
3. Marquee Tool
4. Rotating an image.
5. Clone a picture.
6. Editing images through Dodge tool, Sponge tool, Crop tool and blur tool.
7. Converting a color image into black and white and negative image.
8. Changing hair color using brush tool.
9. Creating multiple images.

COREL DRAW
1. Creating a Logo using coral draw.
2. Creation of Power clip.
3. Creation of menu card.
4. Creation of greeting card using coral draw.
5. Creation of Banner.
6. Creation of flow diagram.

Course Outcomes (CO): On the successful completion of the course, students will be able to
CO CO Statement Knowledge Level
Number
CO1 Practise to prepare Text and Tables K2
CO2 Apply various editing features in images and K3
photos
CO3 Designing of logos and cards. K3
ProgrammeTitle : [Link]. Computer Science
Course Title : Core Course – VIII: Computer Graphics
Course Code : 21UCSC8 Hours/Week: 5
Semester : VI Credits: 5

Course Objectives:
1. Explain the basic concepts of computer graphics and it’s applications..
2. Describe the different types of Line drawing and line Clipping
algorithms.
3. Familiarize the various techniques of 2-D and 3-D transformations.
Hidden surfaces and advanced modeling techniques.
4. Describe the concepts of multimedia and it’s applications.

SYLLABUS
UNIT - I (Hours: 15)
Computer Graphics Applications: Introduction to computer applications –
Applications of computer graphics. Graphics Devices: Introduction to Graphic Devices –
Display Systems – Hardware Components. Graphical User Interface: Graphical User
Interface – An Introduction – Types of GUIs – Designing a Graphical User Interface –
Principles for good GUI design – User Interface Engineering – Graphical User Interface
(GUI) Examples.
UNIT-II (Hours: 15)
Scan Conversion: Line Drawing Algorithms-DDA Algorithm -Bresenham’s Line
Drawing Algorithm-General Bresenham’s Algorithm- Bresenham’s Circle Generation
Algorithm-Polygon Filling –Windows and Clipping: Windows and Viewports-Window-to-
viewport Mapping-Clipping-Sutherland-Cohen Subdivision Line Clipping Algorithm-
Midpoint Subdivision Algorithm.
UNIT-III (Hours: 15)
2-D Transformation:2-Dtransformation-An Introduction- Representation of points in
Matrix Form-Representation of any 2-D Object in Matrix Form-Transformation of Points-
Transformation-Transformation between Coordinate Systems-Translation and Homogeneous
Coordinates-Translation - 2D-Rotation –Reflection- Scaling- General Fixed-Point Scaling-
Shearing- Combined Transformations- Rotation about an arbitrary point- Reflection through
an arbitrary Line- 3-D Transformation: 3-d Transformation- An Introduction- Representation
of points- Representation of a 3-D object in matrix form- Three dimensional Translation- 3-D
Rotation- 3-D Reflection -3-D Scaling- 3-D Shearing- Multiple Transformations- Rotation
about an axis parallel to a Coordinate Axis- Rotation about an arbitrary Axis in Space.
UNIT-IV (Hours: 15)
Hidden Surfaces: Hidden Surfaces and Lines-Back- Face Detection- Back- Face –
Removal- Z-Buffer Algorithm- A-Buffer Algorithm- The Painter’s Algorithm- Binary Space
Partition- Franklin Algorithm – Ray Tracing Algorithm- Advanced Modeling Techniques:
Procedural Modeling- Multi Particle Systems- Volume Rendering- Grammar Based System.
 UNIT-V (Hours: 15)
Multimedia and its Applications: Concepts Of Multimedia-Elements of a Multimedia
System-Multimedia Applications-Multimedia Hardware- Hardware Peripherals- Basic Tools
in Multimedia. Multimedia Building Blocks: Introduction- Text-Audio- Images-Animation-
Video.

Book for study:

1. ISRD Group, “computer Graphics”, Tata MCGraw-Hill Companies, ISBN No 0-07-
059376-0,2006.
Books for reference:
1. Schaum Series, “ Computer Graphics”, Tata MCGraw-Hill, Second Edition, sep 2000.
2. Donald Hearn,[Link] Baker “Computer Graphics”, Second Edition, May 1996.
3. Newman [Link], “Principles of Interactive Computer Graphics”, Tata
MCGrawHill Pub, Second Edition, July 1978.
Web Resources :
• [Link]
• [Link]
• [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember the basic concepts of computer K1
graphics.
CO2 Students will have the ability to understand the various concepts K2
of line drawing algorithms.
CO3 Students will be able tounderstand the various concepts of 2-D K2
and 3-D transformations.
CO4 Students will have the ability to remember and understand the K1&K2
multimedia and it’s applications.

Mapping of COs with POs:

PO/PSO PSO
PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L

S – Strong, M – Medium, L – Light

Programme Title : [Link]. Computer Science
Course Title : Core Course – IX : Data Mining
Course Code : 21UCSC9 Hours/Week : 5
Semester : VI Credits: 5
Course Objectives :
1. Introduce Data Mining concepts
2. Make them understand the classification task in data mining
3. Acquire knowledge in data clustering
4. Impart association rule mining
SYLLABUS
UNIT – I (Hours: 8)
Introduction: Basic Data Mining Tasks – Data Mining vs Knowledge Discovery in
Data base – Issues - Metrics – Social Implications – Data Mining from a Database
perspective – Related Concepts: Database/OLT systems – Fuzzy set and logic – Information
retrieval – Decision Support Systems – Dimensional Modeling – Data Warehousing – OLAP
– web Search Engines – Statistics – Machine Learning – Pattern Matching
UNIT – II (Hours: 12)
Data Mining Techniques: Introduction – A statistical perspective on Data Mining –
Similarity measure – Decision Tree – Neural Network – Genetic Algorithm.
UNIT – III (Hours: 15)
Classification: introduction – Statistical Based Algorithms – Distance Based
Algorithms – Decision Tree Based Algorithms – Neural Network Based Algorithm – Rule
Based Algorithm – Combining Techniques.
UNIT – IV (Hours: 20)
Clustering: Introduction – Similarity and Distance Measures – Outliers – Hierarchical
Algorithm – Partitional Algorithm – Clustering Large Database – Clustering with Categorical
attributes – Comparison.
UNIT – V (Hours: 20)
Association Rules: Introduction – Large Item sets – Basic Algorithms – Parallel and
Distributed algorithms – Comparing approaches – Incremental rules – Advanced Association
Rule Techniques – Measuring the quality of rules.

Book for Study:

1. Dunham, “Data Mining – Introduction and Advanced Topics”, Pearson Education,
New Delhi 2006.
Chapters: 1,2,3,4,5,6
Books for Reference:
1. Jiawei Han and MichelneKamber, “Data Mining Concepts and Techniques”, Morgan
Kaufmann Publications 2007
2. [Link], “Data Mining Techniques”, University Press India PvtLts., New Delho
2002.
Web Resources:
1. [Link]
2. [Link]
3. [Link]
dNoType=1&excerpt=true
 Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember and understand the Basic and K1& K2
Classifications of Networks.
CO2 Students will have the ability to understand the various types of K2
errors and algorithms.
CO3 Students will be able to understand the various type network and K2
their usage.
CO4 Students will remember and understand the different types of K1 & K2
Network Applications.

Mapping of COs with POs:

PO/PSO PSO
CO PO

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3
4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
S – Strong, M – Medium, L – Light
Programme Title : [Link]. Computer Science
Course Title : Elective-II : Python Programming Language
Course Code : 21UCSEC2 Hours/Week: 4
Semester : VI Credits: 4

Course objectives:
1. Describe the core syntax and semantics of Python programming language.
2. Discover the need for working with the strings and functions.
3. Illustrate the process of structuring the data using lists, dictionaries, tuples and sets.
4. Indicate the use of regular expressions and built-in functions to navigate the
file system.
5. Infer the Object-oriented Programming concepts in Python.

UNIT – I (Hours: 15)

Parts of Python Programming Language, Identifiers, Keywords, Statements and
Expressions, Variables, Operators, Precedence and Associativity, Data Types, Indentation,
Comments, Reading Input, Print Output, Type Conversions, The type() Function and Is
Operator, Dynamic and Strongly Typed Language, Control Flow Statements, The if
Decision Control Flow Statement, The if…else Decision Control Flow Statement, The
if…elif…else Decision Control Statement, Nested if Statement, The while Loop, The for
Loop, The continue and break Statements, Catching Exceptions Using try and except
Statement,
UNIT – II (Hours: 10)
Functions, Built-In Functions, Commonly Used Modules, Function Definition and
Calling the Function, The return Statement and void Function, Scope and Lifetime of
Variables, Default Parameters, Keyword Arguments, *args and **kwargs, Command Line
Arguments.
Strings, Creating and Storing Strings, Basic String Operations, Accessing Characters in
String by Index Number, String Slicing and Joining, String Methods, Formatting Strings.
UNIT –III (Hours: 10)
Lists, Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In
Functions Used on Lists, List Methods, The del Statement.
Dictionaries, Creating Dictionary, Accessing and Modifying key:value Pairs in Dictionaries,
Built-In Functions Used on Dictionaries, Dictionary Methods, The del Statement, Tuples and
Sets, Creating Tuples, Basic Tuple Operations, Indexing and Slicing in Tuples, Built-In
Functions Used on Tuples, Relation between Tuples and Lists, Relation between Tuples and
Dictionaries, Tuple Methods, Using zip() Function, Sets, Set Methods, Traversing of Sets,
Frozenset.
UNIT - IV (Hours: 10)
Files, Types of Files, Creating and Reading Text Data, File Methods to Read and
Write Data, Reading and Writing Binary Files, The Pickle Module, Reading and Writing
CSV Files, Python os and [Link] Modules, Regular Expression Operations, Using Special
Characters, Regular Expression Methods, Named Groups in Python Regular Expressions,
Regular Expression with glob Module.
UNIT –V (Hours: 15)
Object-Oriented Programming, Classes and Objects, Creating Classes in Python,
Creating Objects in Python, The Constructor Method, Classes with Multiple Objects, Class
Attributes versus Data Attributes, Encapsulation, Inheritance, The Polymorphism.
Text Book
1. Gowrishankar S, Veena A, “Introduction to Python Programming”, 1st Edition, CRC
Press/Taylor & Francis, 2018. ISBN-13: 978-0815394372
Reference books / weblinks:
1. Jake VanderPlas, “Python Data Science Handbook: Essential Tools for Working with
Data”, 1st Edition, O'Reilly Media, 2016. ISBN-13: 978-1491912058
2. AurelienGeron, “Hands-On Machine Learning with Scikit-Learn and TensorFlow:
Concepts, Tools, and Techniques to Build Intelligent Systems”, 2nd Edition, O’Reilly
Media, 2019. ISBN – 13: 978-9352139057.
3. Wesley J Chun, “Core Python Applications Programming”, 3rd Edition, Pearson
Education India, 2015. ISBN-13: 978-9332555365
4. Miguel Grinberg, “Flask Web Development: Developing Web Applications with
Python”, 2nd Edition, O'Reilly Media, 2018. ISBN-13: 978-1491991732.
Web Resources
1. Dictionaries
[Link]
2. Tuples and Set
[Link]

Course Outcomes (CO): On completion of the course, students should be able to

COs Statements Knowledge
Level
Interpret the fundamental Python syntax and semantics and be fluent in the
CO1 K2
use of Python control flow statements.
CO2 Express proficiency in the handling of strings and functions. K2
Determine the methods to create and manipulate Python programs by
CO3 K3
utilizing the data structures like lists, dictionaries, tuples and sets.
Identify the commonly used operations involving file systems and regular
CO4 K2
expressions.
Articulate the Object-Oriented Programming concepts such as
CO5 K3
encapsulation, inheritance and polymorphism as used in Python.
Mapping of COs with POs:

PO/PSO PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4
CO1 S M M L S S S `M M L
CO2 S S S S M L S M S L
CO3 S M M M S S S M S L
CO4 S S S S L L S M S L

S - Strong M - Medium L – Light

ProgrammeTitle : [Link]. Computer Science
Course Title : Elective-II : Compiler Design
Course Code : 21UCSEC2A Hours/Week : 4
Semester : VI Credit : 4
Course Objectives:
1. Provide fundamental knowledge on compilers
2. Introduce different types of parsers
3. Familiarize basic blocks and flow graphs
4. Acquaint with optimization

SYLLABUS
UNIT -I (Hours: 12)
Compilers - Analysis of the source program - Phases of a compiler - Cousins of the
Compiler - Grouping of Phases - Compiler construction tools - Lexical Analysis - Role of
Lexical Analyzer - input Buffering– Specification of Tokens
UNIT –II (Hours: 8)
Role of the parser, Writing Grammars - Context - Free Grammars - Top Down parsing -
Recursive Descent parsing - Predictive parsing - bottom --up parsing -- shift Reduce Parsing -
Operator Precedent Parsing - LR Parsers - SLR Parser - Canonical LR Parser - LALR Parser
UNIT -III (Hours: 17)
Intermediate Languages - Declarations - Assignment Statements - Boolean Expressions -
Case Statements - Back patching - procedure calls
UNIT -IV (Hours: 13)
Issues in the design of code generator - The target machine – Runtime Storage
management - Basic Blocks and Flow Graphs - Next use Information - A simple Code
generator -- DAG representation of Basic Blocks - Peephole optimization
UNIT – V (Hours: 10)
Introduction - Principal Sources of Optimization - Optimization of basic Blocks -
Introduction to Global Data Flow Analysis - Runtime Environments - Source Language
issues - Storage Organization - Storage Allocation strategies - Access to non-local names -
Parameter Passing
Book for Study:
Alfred Aho, Ravi Sethi, [Link], "Compilers - Principles, Techniques and Tools",
Pearson Education Asia, 2ndEdition, 2003

Books for Reference:

1. HenkAlblas and Albert Nymeyer, "Practice and Principles of Compiler Building
with C", PHI, 2001
2. Kenneth C. Louden, "Compiler Construction: Principles and Practices" Thompson
Learning,2003.
Web Resources :
• [Link]
• [Link]
• [Link]
Course Outcomes (CO) : On completion of the course, students should be able to
CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember the principles of compiler K1
design
CO2 Students will have the ability to understand the concepts of K2
parsers
CO3 Students will be able to apply different basic blocks and flow K3
graphs
CO4 Students will have the ability to analyze the different K4
applications of optimization

Mapping of COs with POs:

PO/PSO
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
S – Strong, M – Medium, L – Light
Programme Title : B. Sc. Computer Science
Course Title : Elective-II : Assembly Language Programming
Course Code : 21UCSEC2B Hours / Week : 4
Semester : VI Credit : 4
Course Objectives :
1. Facilitate the internal representation of numbers and operations
2. Provide knowledge of internal working principles of CPU
3. Afford different types of addressing
4. Empower with different types of assembly language instructions
5. Inculcate different forms of decimal notations

SYLLABUS
UNIT – I (Hours: 10)
Number system: Positional number system - Binary to Decimal conversion -
Hexadecimal to Decimal conversion - Decimal to Binary and Decimal to hexadecimal
conversions - Hexadecimal to binary and binary to hexadecimal conversion - addition of
binary and hexadecimal numbers - Subtraction of binary and hexadecimal numbers - Bits,
words and halfwords.
UNIT – II (Hours: 10)
Representation of negative binary numbers-Assembly language format Registers and
memory - Assembly language format -,Defining storage in memory - How the program
works - Literals- Arithmetic operations : the multiply (M) Instruction - the divide (D)
Instruction - RR Instructions - LPR ,LNR and LCR Instructions –Halfword instructions.
UNIT – III (Hours: 10)
Addressing: Machine language format for RR and RX Instruction - Effective
addresses -Effects of BALR and USING - Boundary requirements - Explicit notation - Load
address –Debugging programs - addressing long programs - Equivalence pseudo-instructions.
UNIT – IV (Hours: 15)
Compare and Branch Instructions: the condition code and branching - load and test
register - Compare Instructions. Arrays and Looping: The BCT and BCTR Instructions -
arrays - Address modification - the BXLE and BXH Instruction. Character string
manipulation: Representation of Character Strings - Declaration of character strings - Move
character (MEC) - Logical Comparison - Immediate instructions - Arrays of character strings.
UNIT – V (Hours: 15)
Packed decimal numbers: Packed decimal number format - Declaration (definition) of
packed decimal numbers - packed decimal operations and formats - Zero and Addpacked -
Multiplication and division, of packed numbers - Arrays of packed decimal numbers -
Advanced packed decimal concepts: Fractional packed decimal numbers - shift and round
packed - move zone and move numeric - move with offsets - number conversions - input /
output - edit and edit with mark.
 Book for Study:
1. David E. Goldberg, Jacqueline [Link], Pat H. Sterbenz "Theory and Problems of
Programming with Assembly Language", McGraw Hill International editions,
Schaum's Outline Series,Oct 1988
Books for Reference:
1. Lance a Levanthal, "8080A-8085 Assembly language programming", Mc-
GrawHill,International Editions, 4th printing, 1988.
2. Douglas V Hall,"Microprocessors and interfacing", TMH,Revised Second Edition,
Eleventh Reprint,201 0.
Web Resources:
• [Link]
• [Link]
• [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Identify the challenges in programming K1
CO2 Apply the knowledge in understanding system software K3
CO3 Able to debug assembly language program K2
CO4 Helps in designing system software K3

Mapping of COs with POs:

PO/PSO
PSO
PO
CO
PSO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3
4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
Programme Title : B. Sc. Computer Science
Course Title : Elective-II : Grid Computing
Course Code : 21UCSEC2C Hours / Week : 4
Semester : VI Credits: 4

Course Objectives :
1. Provide key concepts of Grid Computing
2. Facilitate with Grid Computing history, evolution and Challenges
3. Have exposure to Grid Computing standards
UNIT – I (Hours: 10)
Introduction: Grid Computing & Key Issues - Applications - Other Approaches - Grid
Computing Standards - Pragmatic course of investigation
UNIT – II (Hours: 15)
Grid Benefits & Status of Technology: Motivations - History of Computing,
Communications and Grid Computing - Grid Computing Prime Time - Suppliers and
Vendors - Economic Value - Challenges
UNIT – III (Hours: 10)
Components of Grid Computing Systems and Architectures: Basic Constituent
Elements – A Functional View – A Physical View – Service View
UNIT – IV (Hours: 15)
Grid Computing Standards - OGSI: Standardization - Architectural Constructs -
Practical View - OGSA/OGSI Service Elements and Layered Model - More Detailed View
UNIT-V (Hours: 10)
Standard Supporting Grid Computing - OGSA: Functionality Requirements - OGSA
Service Taxonomy - Service Relationships - OGSA Services - Security Considerations

Books For Study

1. A Networking Approach to Grid Computing, Daniel Minoli, Wiley Publication.
Books For Reference
1. Grid Computing - A Practical Guide to Technology and Applications. Ahmar Abbas
Charles River Media Publications
Web Resources:
• [Link]
• [Link]
• [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Know about the technology and tool kits for facilitating grid K1
computing
CO2 Understand the genesis of grid computing K2
CO3 Able to analyze where the grid computing could be K4
effectively used
CO4 Able to evaluate the system for supporting grid services K5
 Mapping of COs with POs:

PO/PSO PSO
PO
CO
PSO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3
4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L

S – Strong, M – Medium, L – Light

ProgrammeTitle : [Link]. Computer Science
Course Title : Elective-III : Computer Networks
Course Code : 21UCSEC3 Hours/Week : 4
Semester : VI Credit :4
Course Objectives:
1. Afford the basic and Classification of Networks.
2. Describe the types of errors and different Compression Algorithms.
3. Familiarize various protocols and topologies LAN, WAN and Wireless LAN.
4. Comprehend the different application of Networks.

SYLLABUS
UNIT - I (Hours: 8)
Introduction - Applications - Computer Networks - Categories of Networks -
Standards and Standards Organizations - Network Architecture - Open Systems and OSI
Model - TCP/IP Architecture - Communication Media and Data Transmission – Fourier
Analysis – Analog and Digital Data Transmission – Modulation and Demodulation –
Transmission Media – Wireless Communications – Data Transmission Basics –
Transmission Mode – Interfacing – Multiplexing.
UNIT – II (Hours: 12)
Error Detection and Correction – Types of Errors – Error Detection – Error
Correction – Data Compression – Lossless Compression Algorithms – Image Compression
(JPEG) – Video Compression (MPEG) – Audio Compression (MP3) – Data Link Control
and Protocol Concepts – Flow Control – Error Control – Asynchronous Protocols –
Synchronous Protocols – High – Level Data Link Control (HDLC).
UNIT – III (Hours: 15)
Local Area Networks – Types of Networks and Topology – LAN Transmission
equipment – LAN Installation and Performance – Ethernet: IEEE Standard 802.3 – Token
Bus: IEEE Standard 802.4 – Token Ring: IEEE Standard 802.5 – Fiber Distributed Data
Interface(FDDI) – Distributed Queue Dual Bus(DQDB): IEEE Standard 802.6 – LAN
Operating Systems and Protocols – Ethernet Technologies – Wide Area Networks – WAN
Transmission Methods – WAN Carrier Types – WAN Transmission Equipment – WAN
Design and Multicast Considerations – WAN Protocols – Integrated Services and Routing
Protocols – Integrating Services – ISDN Services – ISDN Topology – ISDN Protocols –
Broadband ISDN – Asynchronous Transfer Mode(ATM) – Principle Characteristics of
ATM – Frame Relay – Compression Of ISDN,ATM and Frame Relay.
UNIT - IV (Hours: 10)
Wireless LANs – WLAN Applications – Wireless LAN Requirements – Planning
for Wireless LANs – Wireless LAN Architecture – IEEE 802.11 Protocol Layer – IEEE
802.11 Physical Layer – Designing the Wireless LAN Layout – WAP Services –
Internetworking – Principles of internetworking – Routing Principles – Internet work
protocols(IP) – Shortcomings of IPv4 – IP Next Generation – TCP Reliable Transport
Service – Transport Protocols – The service TCP Provides to Applications – End – to –
End Service and Datagrams – Transmission Control Protocol – User Datagram Protocol.
 UNIT – V (Hours: 15)
Network Applications – Client – server Model – Domain Name System (DNS) –
Telnet – File Transfer and Remote File Access – Electronic Mail – World Wide
Web(WWW) – Network Management – Goal of Network Management – Network
Management Standards – Network Management Model – Infrastructure for Network
Management – Simple Network Management Protocols(SNMP) – Network Security –
Fundamental Concepts – Identification and Authentication – Access Control – A Model for
Network Security – Malicious Software – Security Services and Cryptography – Securing
Network Using Firewall – Web Security – Intrusion Detection.
Book for Study:
1. Brijendra Singh, “Data communications And Computer Networks”, Prentice Hall
of India, 2006.
Books for Reference:
1. Wayne Tomasi, “Introduction To Data Communication and Networks”, Pearson
Education 2007.
Web Resources :
• [Link]
• [Link]
• [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to remember and understand the Basic and K1& K2
Classifications of Networks.
CO2 Students will have the ability to understand the various types of K2
errors and algorithms.
CO3 Students will be able to understand the various type network and K2
their usage.
CO4 Students will remember and understand the different types of K1 & K2
Network Applications.

Mapping of COs with POs :

PO/PSO PSO
CO PO

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3
4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L

S – Strong, M – Medium, L – Light

ProgrammeTitle : [Link]., Computer Science
Course Title : ELECTIVE - III : Web Designing Using Open Source
Course Code : 21UCSEC3A Hours/Week: 4
Semester : VI Credits: 4
Course Objectives:
1. Introduce web designing with open source technologies
2. Acquaint programming knowledge in Php&MySql
3. Develop and deploy websites in real time web environments

SYLLABUS
UNIT – I (Hours: 12)
HTML tags – Creating Your HTML Document – Displaying the Document in a Web
Browser –Modifying an HTML document- HTML Document Headings- HTML Headings-
HTML Paragraph Breaks- HTML Style Tags- Embedding Including Pictures in Web Pages-
Linking to Local Files- Anchor Link a Graphic – Preformatted Text- Lists- Colorful and
Textured Backgrounds- Horizontal Rules- Text Alignment. Tables- Creation of Table- Cell
Padding ,Spacing, Column Specification- Framed Web Pages- Forms- Attributes- Text Input
Elements- Password Input Elements- Text Area Input Elements- Radio Buttons- Check
Boxes- Menu Select- Submit And Reset Buttons.

UNIT – II (Hours: 12)

Introduction to PHP: Basic Syntax- Sending data to a Web Browser- Writing
comments- Variables- Strings- Concatenating Strings- Numbers- Constants- Single Vs.
Double Quotation Marks- Programming with PHP- Creating And Handling an HTML Forms-
Conditional and Operators- Validating Form Data- Introducing Arrays- For and While
Loops- Creating Dynamic Websites: Including Multiple Files- Handling HTML Form,
Revisited- Making Sticky Forms- Creating Own Functions.

UNIT – III (Hours: 12)

Introduction to MYSQL: Naming Database Elements- Choosing Your Column Types-
Choosing Other Column Properties- Accessing MYSQL- Introduction to SQL: Creating
Databases and Tables- Inserting Rows – Selecting Data- Using Conditionals- Using LIKE
and NOTLIKE- Sorting Query Results- Limiting Query Results- Updating Data- Deleting
Data- Using Functions.

UNIT – IV (Hours: 12)

Advanced SQL and MYSQL: Database Design – Performing Joints- Grouping
Selected Results- Creating Indexes- Using Different Table Types- Performing Full Text
Searches- Performing Transactions.
 UNIT – V (Hours: 12)
Error Handling and Debugging: Error Types and Basic Debugging- Displaying PHP
Errors- Adjusting Error Reporting in PHP- Creating Custom Error Handlers- PHP Debugging
Techniques- SQL and MYSQL Debugging Techniques- Using PHP with MYSQL-
Modifying the Template- Connecting to MYSQL- Executing Simple Queries- Retrieving
Query Results- Ensuring Secure SQL – Counting Returned Records- Updating Records with
PHP.
Books for Study:
1. [Link],” world wide web design with HTML”, Tata McGraw Hill Publication, New
Delhi, Third reprint 2001.
2. Larry Ullman, “PHP 6 and MYSQL 5”, Pearson Education, First Impression, 2008.
Chapters 1-8.

Books for Reference:

1. Thomas [Link], “ The Complete Reference HTML & XHTML”, Tata McGraw
Hill Publication Company Limited Fourth Edition, Third Reprint 2000.
2. Andrew Curioso, Ronald Bradford, Patrick Galbraith,” Expert PHP and MYSQL “,
Wiley India [Link], reprint 2010.
3. Luke Welling, Laura Thomson, “PHP and MYSQL Web Development”, Pearson
Edition, Fourth Edition, First Impression 2010.
4. VikramVaswami, “MYSQL- The Complete Reference”, Tata McGraw Hill
Publication Company Limited. 8th reprint 2008.

Web Resources :
1. [Link]
2. [Link]
3. [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Learn the concepts on Html Programming for website creation K2
CO2 Design and implement web applications through PHP K3
CO3 Develop websites through PHP with MySql K3
CO4 Study advanced features of MySql K2
CO5 Learn and apply Error handling , debugging and Retrieving K3
query results in PHP

Mapping of COs with POs:

PO/PSO PSO
PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
CO5 M S S L L S S M M M
Programme Title : B. Sc. Computer Science
Course Title : ELECTIVE - III : Mobile Communications
Course Code : 21UCSEC3B Hours / Week : 4
Semester : VI Credit : 4

Course Objectives :
1. Impart the fundamental concepts of mobile communication systems
2. Provide understanding of medium access techniques
3. Study the wireless LAN architecture.
SYLLABUS
UNIT-I (Hours: 15)
Introduction: Applications - A Simplified Reference Model. Wireless Transaction:
Cellular Systems. Medium Access Control: Motivation For A Specialized MAC: Hidden and
exposed terminals - Near and far terminals - SDMA-FDMA-TDMA: Fixed TDM -Classical
Aloha - Slotted Aloha - Carrier Sense Multiple Access - Demand Sense Multiple Access -
PRMA Packet Reservation Multiple Access - Reservation TDMA - Multiple Access with
Collision Avoidance - Polling - Inhabit Sense Multiple Access. CDMA: Spread Aloha
Multiple Accesses.
UNIT-II (Hours: 10)
Telecommunication Systems: GSM: Mobile Services: System Architecture - Radio
Interface - Protocols - Localization and calling - Handover - Security - New Data Services-
DECT: System Architecture - Protocol Architecture-TETRA.
UNIT-III (Hours: 15)
UMTS and IMT 2000: UNITS Releases and Standardization - UMTS System
Architecture –UMTS Radio Interface - UTRAN - Core Network - Handover. Satellite
System: History - Applications - Basics: GEO 173 - LEO 175- MEO 175. Routing -
Localization - Handover. Broadcast Systems: Overview - Cyclical Repetition of Data -
Digital Audio Broadcasting - Digital Video Broadcasting - Convergence of Broadcasting and
Mobile Communications.
UNIT – IV (Hours: 10)
Wireless LAN: Infra Red versus Radio Transmission - Infrastructure and Ad-Hoc
Network - IEEE 802.11: System Architecture - Protocol Architecture - Physical Layer -
Medium Access Control Layer - MAC Management - HIPERLAN: HIPERLAN 1 - WATM -
BRAN - HyperLAN2. Bluetooth: User scenarios - Architecture - Radio layer - Base band
layer - Link manager Protocol.
UNIT-V (Hours: 10)
Mobile Network Layer: Mobile IP - Dynamic Host Configuration Protocol - Mobile
Ad - Hoc Networks, Mobile Transport Layer: Traditional TCP - Classical TCP improvements
- TCP Over 2.5/3G Wireless Networks - Performance Enhancing Proxies.

Books for Study:

1. Jochen Schiller, "Mobile Communications", Pearson Education, Second Edition,2003.
 Books for Reference:
1. ShivaniDuby,"Mobile Computing", A.B Publications, 2010.
2. SundaraRajan, Ramesh, RajaSekaran,"Mobile Computing", Sams
Publishers,FirstEdition,2008.
Web Resources:
• [Link]
• [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Recall the basic features of mobile communications K1
CO2 Understand the mobile system architecture K2
CO3 Analyze and select best device for mobile communication K4
CO4 Capable of evaluating the features of particular mobile K3
device

Mapping of COs with POs:

PO/PSO
PSO
PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
S – Strong, M – Medium, L – Light
Programme Title : [Link]., Computer Science
Course Title : ELECTIVE - III : System Analysis and Design
Course Code : 21UCSEC3C Hours/Week: 4
Semester : VI Credits: 4
Course Objectives :
1. Introduce the concept and characteristics of a System
2. Provide knowledge on requirement analysis
3. Develop skill in system design
4. Train in system implementation
5. Provide knowledge on Project Management

SYLLABUS
UNIT- I (Hours: 15)
Introduction- Systems Concepts and the Information Systems Environment - The
Systems Concepts: Definition - Characteristics of a System - Elements of a System - Types of
Systems - The System Development Life Cycle - Introduction-The System Development Life
Cycle - Considerations for Candidate Systems :Political Considerations- Planning and
Control for System Success - Prototyping.
UNIT-II (Hours: 15)
System Analysis - Systems Planning and the Initial Investigation - Bases for Planning in
Systems Analysis - Initial Investigation - Determining The User's information Requirements -
Problem Definition and Project Initiation - Background Analysis - Fact Finding -Fact
Analysis - Determination of Feasibility - Information Gathering - The Kind of Information
We Need - Information Origin - Information Gathering Tools - Types of Interviews And
Questionnaires.
UNIT- III (Hours: 10)
System Design-The Process and Stages of Systems Design - The Process of Design -
Design Methodologies - Major Development Activities - Audit Considerations –Input/
Output and Forms Design - input Design - Input Media and Devices - Output Design- Forms
Design - Types of Forms - Layout Considerations - Forms Control.
UNIT – IV (Hours: 10)
System implementation - System Testing and Quality Assurance - System Testing -
The Need To Test - The Test Plan - Quality Assurance - Trends in Testing - Role of the Data
Processing Auditor - Implementation and Software Maintenance - Activity Network For
Conversion - Combating Resistance to Change - Post Implementation Review - Software
Maintenance.
UNIT – V (Hours: 10)
Project Scheduling and Software- Cause of System Failure - Project Management -
Crisis Elimination through Planning - Project Organization - Security ,Disaster / Recovery,
and Ethics in Systems Development - System Security - Disaster / Recovery Planning -
Ethics in System Development.
 Book for Study
1. Elias M. Awad ,"Systems Analysis and Design", Galgotia Publications, Reprint 2005.
Books for Reference
1. James A Senn ,"Analysis and Design of Information Systems", McGraw Hill, Second
Edition,1989.
2. Igor Hawryszkiewycz," Introduction to system analysis and design", PHI New Delhi, 2000
Web Resources
1. [Link]
sign_tutorial.pdf
2. [Link]
3. [Link]
4. [Link]

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Able to recall the characteristics of a system K1
CO2 Understand the Existing System K2
CO3 Analyze the system requirements K4
CO4 Capable of evaluating the requirements and design a new K3
system

Mapping of COs with POs:

PO/PSO
CO PSO
PO

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3
4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L

S – Strong, M – Medium, L – Light

 Programme Title : [Link]., Computer Science
Course Title : Core Practical- VII: Python Programming Lab
Course Code : 21UCSQC7 Hours/Week: 4
Semester : VI Credits: 2

Course Objectives:
1. Introduce open source technologies in scientific programming
2. Acquaint programming knowledge in Python
3. Solve problem using python

SYLLABUS
1. Write a program to compute distance between two points taking input from the user.
2. Write a program [Link] that takes 2 numbers as command line arguments and prints its
sum.
3. Write a Program for checking whether the given number is an even number or not.
4. Write a Program to demonstrate list and tuple in python. Write a program using a for loop
that loops over a sequence.
5. Write a program using a while loop that asks the user for a number, and prints a
countdown from that number to zero.
6. Write a program to count the numbers of characters in the string and store them in a
dictionary data structure.
7. Write a program to use split and join methods in the string and trace a birthday of a
person with a dictionary data structure.
8. Write a program to count frequency of characters in a given file.
9. Write a program to print each line of a file in reverse order. Write a program to compute
the number of characters, words and lines in a file.
10. Write function to compute GCD, LCM of two numbers

Course Outcomes (CO) On the successful completion of the course, students will be able to
CO CO Statement Knowledge
Number Level
CO1 Recall programming features of python K1
CO2 Understand any program in python K2
CO3 Apply different mathematical functions K3
CO4 Identify the problem to be solved by python K4
CO5 Create a program of their own K6

Mapping with CourseOutcomes with Program outcomes:

PO/PSO PSO
PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
CO4 S S S S L L S M S L
CO5 M S S L L S S M M M
S – Strong, M – Medium, L – Light
 Programme Title : [Link]., Computer Science
Course Title : Core Practical- VIII : Project
Course Code : 21UCSQC8 Hours/Week: 5
Semester : VI Credits: 4
Course Objectives:
1. Introduce real time applications
2. Familiarize Modular programming
3. Enhance the creativity in applications
4. Establish top down approach in programming
5. Apply database connectivity to any front end

Course Outcomes (CO) : On completion of the course, students should be able to

CO CO Statement Knowledge
Number Level
CO1 Students will be able to understand the process of software K2
development
CO2 Students will be able to apply the programming concepts and tools K3
they learnt.
CO3 Students will have the ability to analyze the various requirements for K4
the project developed.

Mapping of COs with POs:

PO/PSO PSO
PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3 PSO4

CO1 S M M L S S S `M M L
CO2 S S S S S L S M S L
CO3 S M M M S S S S M L
S – Strong, M – Medium, L – Light
 Programme Title : B.A/[Link]./[Link], Non-Computer Science
Course Title : Non-Major Skill Based - II : Web Designing
Course Code : 21UCSQNSC2 Hours/Week: 4
Semester : VI Credits: 2
Course Objectives:
1. Introduce web designing using HTML
2. Acquaint programming knowledge in HTML
3. Develop and deploy static webpages

SYLLABUS
HTML:
At least two websites to be the developed using the following features in HTML.
1. Title, heading tags and formatting tags in HTML.
2. Alignment, Paragraph and formatting tags in HTML.
3. Ordered List and unordered list.
4. Hyperlink tags.
5. Web link tags.
6. Physical text element.
7. Center and division tags.
8. Tables
9. Frames
10. Forms

Course Outcomes (CO) On the successful completion of the course, students will be able to
CO CO Statement Knowledge
Number Level
CO1 To write Html Programs with basic and advanced formatting • K2
tags
CO2 • K3
To code webpages with different types of links and its attributes
and form as well
CO3 To design webpage using tables, frames and Forms K3