Holy Cross College (Autonomous), Nagercoil

Nationally Re-Accredited with A+ (CGPA 3.35) by NAAC (IV Cycle)

Kanyakumari District, Tamilnadu, India.
Affiliated to
Manonmaniam Sundaranar University, Tirunelveli

Department of Computer Science

Semester III & IV (UG)

(With effect from the academic year 2020-2021)
 DEPARTMENT OF COMPUTER SCIENCE
Vision
1. To demonstrate proficiency in problem-solving techniques using the computer.
2. To demonstrate proficiency in at least two high-level programming languages and two
operating systems
3. To show the ability to analyze a problem, and identify and define the computing
requirements appropriate to its solution.
4. To show the ability to function effectively on teams to accomplish a common goal.
5. To sensitize the students to the social realities around them with the vision of making
them responsible citizen.
Mission
To provide a high-quality undergraduate education in computer science that prepares
students for productive careers and lifelong learning.

Programme Educational Objectives (PEOs)

PEO - 1 The graduates will apply appropriate theory and scientific knowledge to participate
in activities that support humanity and economic development nationally and
globally, developing as leaders in their fields of expertise.
PEO - 2 The graduates pursue lifelong learning and continuous improvement of the
knowledge and skills with the highest professional and ethical standards.
PEO - 3 The graduates are trained to be employed in IT industries by providing domain
knowledge, career and entrepreneurial skills.

Programme Outcomes (POs)

Upon completion of B.Sc. Computer Science programme, the graduates will be
POs
able to:
PO - 1 utilize scientific knowledge to pursue higher studies in the relevant field.
create innovative ideas to enhance entrepreneurial skills for economic
PO - 2
independence.
PO – 3 face challenging competitive examinations that offer rewarding careers.
reflect upon green initiatives and take responsible steps to build a sustainable
PO – 4
environment.
PO – 5 handle ethical issues with social responsibility.
communicate effectively and collaborate successfully with peers to become
PO – 6
competent professionals.
 Programme Specific Outcomes (PSOs)

PSOs Upon completion of the B.Sc. Degree Programme, the graduateswill

be able to:
PSO – 1 acquire the domain knowledge with critical thinking to serve the technical
society as software engineer, data analyst and designing professional.
PSO - 2 enrich the managerial skills through team building and social
responsibility.
PSO – 3 enhance the communication skills with lifelong learning.
PSO - 4 apply modern techniques to sustain the ever changing era with values.

Eligibility Norms for Admission

Those who seek admission to B.Sc. Computer Science must have passed the Higher
Secondary Examinations conducted by the Board of Higher Secondary Examination, Tamil
Nadu with Computer Science or Mathematics as one of the subjects or any other examination
recognized and approved by the Syndicate of the Manonmaniam Sundaranar University,
Tirunelveli.
Duration of the Programme: 3 years
Medium of Instruction: English
Passing Minimum
A minimum of 40% in the external examination and an aggregate of 40% is required.
There is no minimum pass mark for the Continuous Internal Assessment.

Components of the B.Sc. Computer Science Programme

Part III (Major and Allied)

Core – Theory papers 12 x 100 1200

Major Practicals (Core applied) 9 x 100 900

Elective - Theory papers 3 x 100 300

Project 100

Total marks 2500

Theory 4 x 100 400

Allied (I & II) Total marks 400

Part III - Total marks 2900

 Course Structure
Distribution of Hours and Credits

Course Sem. I Sem.II Sem.III Sem.IV Sem.V Sem.VI Total

Hours Credits
Part I –Language 6 (4) 6 (4) - - - - 12 8
Part II-English 6 (4) 6 (4) - - - - 12 8
Part-III
5(4) + 5(5) + 6(5) + 5(5) + 59 55
Major Core - Theory
4(4) 4(4) 5(4) + 5(5) 5(5) 5(5) +
5(4) 5(5)
Major Core - Practical 4(2) 4(2) 4(2) 4(2) 6(3) 4(2) 38 19
4(2) 4(2) 4(2)
Elective - - - 5(4) 5(4) 5(4) 15 12
Project - - - - 6(6) 6 6
Allied- Theory 4(3) 4(3) 5(3) 5(3) - - 18 12
Part IV
Add on Course 2(2) 2(2) 2 (2) 2 (2) - - 8 8
(Professional English)
Non-Major Elective 2 (2) 2 (2) - - - - 4 4
SEC(Skill 2 (2) 2 (2) - - 2 (2) 6 6
Enhancement Course)
AEC(Ability 2(2) 2 2
Enhancement Course)
Total 30(23) 30(23) 30(21) 30(23) 30(25) 30(25) 180 140
Non Academic Courses
Part V
FC –I(Values for - (1) - - - - - 1
Life)
FC– II(Personality - - - - - - 1
(1)
Development)
FC–III (Human - - - - (1) - - 1
Rights Education)
FC –IV (Gender - - - - - (1) - 1
Equity Studies)
SLP-Community - - (2) - - - - 2
Engagement Course
SLP-Extension - 2
activity (RUN) (2)
STP - Clubs & - - - (2) - - - 2
Committees / NSS
Total number of hours = 180
Total number of credits = 140+10

Non Academic Courses are Mandatory and conducted outside the regular working hours
Skill Development Programme (Mandatory Certificate Course- 60 hours) will be offered in
the first year for all the students.
 Courses Offered

Course Hours
Title of the Course Credits
Semester Course Code / Week
Part I TL2011/ Language: Tamil/French 6 4
FL2011
Part II GE2013 General English 6 4
SC2011 Major Core I: Programming Concepts in C 4 4
Part III SC20P1 Major Practical I: C Programming 4 2
SA2011 Allied I: Theory: Digital Principles and Applications 4 3
I APS201 Add on Course: Professional English 2 2
SNM201 Non Major Elective (NME): Internet and Web 2 2
Part IV Designing with HTML
SEC201/ Skill Enhancement Course (SEC): Yoga / Computer 2 2
SEC202 Literacy
VEC202 Foundation Course I: Values for Life - -
Part V STP204 Student Training Programme (STP): - -
Clubs & Committees / NSS
Part I TL2021/ Language: Tamil/French 6 4
FL2021
Part II GE2023 General English 6 4
SC2021 Major Core II: Object Oriented Programming Using 4 4
Part III C++
SC20P2 Major Practical II: C++ Programming 4 2
SA2021 Allied II: Theory: Computer Organization and 4 3
II Architecture
APS202 Add on Course: Professional English 2 2
SNM202 Non Major Elective (NME): Desktop 2 2
Part IV Publishing using Scribus
SEC201/ Skill Enhancement Course (SEC): Yoga / Computer 2 2
SEC202 Literacy
VEC202 Foundation Course I: Values for Life - 1
Part V SLP Service Learning Programme
UBA Community Engagement Course
STP204 Student Training Programme (STP): Clubs & - -
Committees / NSS
SC2031 Major Core III: Programming in Java 5 4
SC2032 Major Core IV: Data Structures and Algorithms 5 4
SC2033 Major Core V: Computer Networks 5 4
Part III SC20P3 Major Practical III: Java Programming 4 2
SC20P4 Major Practical IV: Data Structure Using C++ 4 2
SA2031 Allied III: Theory: Numerical and Statistical Methods 5 3
Part IV APS203 Add on Course: Professional English 2 2
III
VEC204 Foundation Course II: Personality Development - -
 STP204 Student Training Programme (STP): Clubs & - -
Part V Committees / NSS
SLP201 Service Learning Programme (SLP): Community - 2
Engagement Course
SLP202 Service Learning Programme (SLP): Extension - -
Activity (RUN)
SC2041 Major Core VI: UNIX and Shell Programming 5 5
Major Core VII: Relational Database Management
SC2042 5 5
Systems
Elective I:
SC2043 (a) Software Engineering
Part III SC2044 (b) System Administration and Maintenance
5 4
SC2045 (c) Software Testing
SC20P5 Major Practical V: Shell Programming 4 2
IV SC20P6 Major Practical VI: SQL and PLSQL 4 2
SA2041 Allied IV: Theory: Discrete Mathematics 5 3
Part IV APS204 Add on Course: Professional English
2 2
VEC204 Foundation Course II: Personality Development - 1
Part V
Service Learning Programme (SLP) Community
Engagement Course(UBA)
Service Learning Programme (SLP) Extension
SLP202
Activity
(RUN)
Student Training Programme (STP): Clubs &
STP204 - 2
Committees / NSS
SC2051 Major Core VIII: Web Technology 6 5
SC2052 Major Core IX: Mobile Computing 5 5
Elective II:
SC2053 (a) Multimedia Systems
Part III SC2054 (b) Microprocessor & Assembly Language 5 4
V SC2055 Programming
(c) Open Source Technology
SC20P7 Major Practical VII: Web Technology Lab 6 3
SC20PR Project 6 6
Part IV Ability Enhancement Course (AEC):
AEC201 2 2
Environmental Studies
Part V Foundation Course III:
HRE205 - 1
Human Rights Education
SC2061 Major Core X: Programming in Python 5 5
SC2062 Major Core XI: Computer Graphics 5 5
SC2063 Major Core XII: Operating System 5 5
 Elective III
SC2064 (a) IOT
Part III SC2065 (b) Network Security 5 4
SC2066 (c) E-Commerce Technologies
SC20P8 Major Practical VIII: Python Programming 4 2
VI SC20P9 Major Practical IX: Computer Graphics 4 2
SSK206 Skill Enhancement Course (*SEC): PHP 2 2
Part IV Programming
Part V GES206 Foundation Course IV: Gender Equity Studies (GES) - 1
TOTAL 180 140+
10

*SBC for the VI semester is offered by the departments for their students
SBC - We offer PHP Programming during VI semester. The objective of this SBC is to
develop webpage.
NMEC – We offer Internet and Web Designing with HTML and Desktop Publishing
using Scribus during I and II semester. The objective of Internet and Web Designing with HTML
is to design webpage and browse in internet and Desktop Publishing using Scribus to design and
create magazines, newsletter, brouchers etc and to easily produce stylised documents.
Project – We offer project in V semester. The aim is to equip the students to develop real
time projects.
Self-Learning – Extra Credit Courses

Semester Course Code Title of the Course Hours / Credits

Week
III SC20S1 Web Designing with HTML - 2
IV SC20S2 Maya - 2

Value Added Courses

Semester Course Code Title of the course Total hours
I VASC201 DCA-I 30
II VASC202 DCA-II 30
 Instruction for Course Transaction
Distribution of total hours for Theory (Major Core)
Components Sem I Sem II Sem III Sem IV Sem V Sem
VI
Lecture Hours 45 45 60 60 75/60 60
Continuous Internal 5 5 5 5 5 5
Assesment(2)
Quiz(2) 1 1 1 1 1 1
Class test(3) 3 3 3 3 3 3
* Class assignment/Group
discussion/ Problem 6 6 6 6 6 6
Solving(any other)
Total Hours 60 60 75 75 90/75 75

Distribution of total hours for Theory (Elective / Allied)

Components Elective Allied
Sem IV Sem V Sem VI Sem I Sem II Sem III Sem IV
Lecture Hours 60 60 60 45 45 60 60
Continuous Internal 5 5 5 5 5 5 5
Assesment(2)
Quiz(2) 1 1 1 1 1 5 1
Class test(3) 3 3 3 3 3 3
* Class assignment/Group
discussion/ Problem
Solving(any other) 6 6 6 6 6 6 6
Total Hours 75 75 75 60 60 75 75

Distribution of total hours for Practical

Semester Hours / Week Total Hours /

Semester
I / II 4 60
Major
III / IV 8 120
V 6 90
VI 8 120
Examination Pattern
i) Part III (Major/ Elective/ Allied)
Ratio of Internal and External= 30:70
Internal Components and Distribution of Marks
Components Marks
Continuous Internal Assessment (2) 15
Quiz (2 quizzes) 4
Class Test (3) 6
Class assignment/ Home assignment/ Field assignment/ 5
Article review/ Group discussion/ Problem solving
Total 30
Question Pattern – External Examination
Internal Test Marks External Exam Marks
Part A 4 x 1 4 Part A 10 x 1 (No choice) 10
Part B 3 x 4 12 Part B 5 x 4 (Internal choice) 20
Part C 3 x 8 24 Part C 5 x 8 (Internal choice) 40
Total 40 Total 70

Practical Examination Pattern

Major papers
Internal : 40 marks
External : 60 marks
Total : 100 marks

Internal Components and Distribution of Marks

Internal Components Marks
Performance of the experiments 10
Regularity in attending practical and 10
submission of records
Record 5
Model exam 15
Total 40

Question pattern forExternal Examination

External Exam Marks
For writing programme 25
Knowledge (oral questions) 10
Debugging and Execution 15

For input and output 10

Total 60
 ii) Part IV
Ratio of Internal and External = 50: 50
a) Add-on Course
Internal Components and Distribution of Marks
Internal Components Marks
Listening 25
Speaking and Reading 25
Total 50
Question pattern forExternal Examination
External Exam Marks
Part A 5 x 1 (No Choice) 5
Part B 5 x 3 (Internal Choice) 15
Part C 5 x 6 (Internal Choice) 30
Total 50

b) Non – Major Elective (NMEC

Internal Components and Distribution of Marks
Internal Components Marks
Continuous Internal Assessment (2) 20
Quiz (2 quizzes) 15
Class assignment/ Home 15
assignment/ Project report
Total 50
Question Pattern for Internal & External Examination
Internal Test Marks External Exam Marks
Part A 4 x 1 (No Choice) 4 Part A 5 x 1 (No Choice) 5
Part B 3 x 4 (Internal Choice) 12 Part B 5 x 3 (Internal Choice) 15
Part C 3 x 8 (Internal Choice) 24 Part C 5 x 6 (Internal Choice) 30
Total 40 Total 50

c) Skill Enhancement Course (SEC)

Computer Literacy

Internal Component
Component Marks
Objective type questions (30x1) 30
Exercise (Book) compulsory (2x10) 20
Total 50
 External Component
Component Marks
Exercise 1 20
Exercise 2 10
Procedures for both Exercises 20
Total 50

Meditation and Exercise

Internal Component
Component Marks
Objective type questions (20x1) 20
Exercise (2x10) 20
Assignment 10
Total 50

External Component
Component Marks
Oral assessment 20
Written assessment (Questions are of open choice 15 30
questions 3 marks each – answer any 10 (10x3)
Total 50

d) Ability Enhancement Course (AEC)

Environmental Studies

Internal Component
Component Marks
Project Report 30
Viva voce 20
Total 50

External Component
Component Marks
Oral assessment 20
Written Test (Questions are of open choice 15 30
questions 3 marks each – answer any 10 (10x3)
Total 50
ii) Part V
Ratio of Internal and External = 50: 50
a) Value Education I
Internal Component
Component Marks
Song, Mime, Skit 20
Book Activities 20
A Kind Action 10
Total 50

External Component
Component Marks
Oral assessment 20
Written Test 30
Part A 5x2 = 10
Part B 5x4 = 20
Total 50

b) Value Education II
Internal Component
Component Marks
Exercise from book 20
Skit 10
Group Album 20
Total 50

External Component
Component Marks
Oral assessment 20
Written Test 30
Part A 5x2 = 10
Part B 5x4 = 20
Total 50

c) Human Rights Education / Gender Equity Studies

Internal Component
Component Marks
Album on current issues 20
Group Song, Mime, Skit 10
Open book test 20
Total 50
 External Component

Component Marks
Oral assessment 20
Written Test (Questions are of open 30
choice 15 questions 3 marks each –
answer any 10 (10x3)
Total 50

d) SLP -Community Engagement Course (CEC) /UnnathBharathAbhiyan(UBA)

Field Work – 15 hrs; Class Hours – 15 hrs

Internal Component

Component Marks
Assignment 10
Group Discussion 10
Attendance 30
Total 50
External Component

Component Marks
Project Report / Case Study(10-15 50
pages in print)
Total 50

e) SLP – Service Learning Programme: Reaching the unreached Neighbourhood

• 60 Hours programme – Reaching the unreached Neighbourhood (RUN)
Programme with one credit - included in the curriculum.
• If a student fails, she is not eligible to get the degree.

f) STP – Student’s Training Programme

• Compulsory for all I & II year students.
• Clubs and Committees – Eco Club, YRC, Rotaract Club, NSS/ RRC,
AICUF, Consumer Club, Legal Literacy and Women’s Cell.
• Each student can opt for one of the clubs/ committees.
 Semester III
Major Core III: Programming in Java
Course Code: SC2031
Hours / Week Credits Total Hours Marks
5 4 75 100

Objectives:
1. To understand the basic programming constructs of Java Language.

2. To explore the features of Java by coding.

Course Outcome

PSO CL
CO Upon completion of this course the students addressed
will be able to :
PSO – 1
CO - 1 Define the Concept of OOP and Arrays U
PSO – 2
CO - 2 Analyze the Structure of the Java programming AN
Language and Classes
PSO – 3
CO - 3 Implement various Errors handling technique U
using Exception Handling to solve complicated
problem.
PSO – 3
CO -4 Create Java program to understand the Applet C
program to display window based Activities.
PSO – 4
CO - 5 Design a java program by using AWT Classes C

Unit I
Genesis of Java: Creation of Java – why java is important to internet – An overview of
Java Object Oriented Programming. Data types – Variables – Type conversion and casting –
Automatic type promotion in Expressions – Strings. Arrays: One Dimensional Array – Multi
Dimensional Array – Operators – Control statements.
Unit II
Class Fundamentals:– Declaring objects – Assigning object Reference variables –
Introducing Methods – Constructors – Garbage collection – Finalize () Method. A Closer Look
at Methods and classes: Overloading Methods –Inheritance Basics & Types - Method
overriding – Dynamic Method Dispatch – Using Abstract class – Using final with inheritance.
Unit III
Packages & Interface - Exception Handling - Creating your own Exception subclasses.
Multithreaded Programming: Java Thread Model – Main Thread – Creating a Thread -
Creating Multiple Threads–Using is Alive () and join () – Thread priorities.
Unit IV
I/O & Applets : I/O Basics Reading console Input – writing console output – The Print
Writer class – Reading and Writing Files. The Applet class: - Applet Architecture – Applet
Skeleton – Applet Display method – Requesting Repainting – HTML APPLET tag- Passing
Parameters to Applet – Audio Clip Interface. Event Handling Mechanisms – Delegation Event
Model – Event classes – Sources of Events – Event Listener Interface Unit V
AWT Classes – Window fundamentals – working with Frame Windows - working with
Graphic Using AWT controls: Controls fundamentals – Labels – using Buttons – Applying
check Boxes – Check Box group – Choice controls – Using a Text field – Using a Text Area –
Understanding Layout Managers (Flow Layout only) – Menu Bars and Menus.
Text Book:
Herbert Schildt, “Java - The Complete Reference”, Ninth Edition, McGraw-Hill
Education, 2014
Reference Books:
1. E. Balagurusamy, “Programming with Java”, Tata McGraw-Hill Education India, 2014
2. Sachin Malhotra & Saurabh Choudhary, “Programming in JAVA”, 2nd Ed, Oxford Press
3. Sagayaraj, Sagayaraj, Denis, Karthik and Gajalakshmi, “JAVA Programming for Core
and Advanced Learners”, 2018
 Semester III
Major Core IV: Data Structures and Algorithms
Course Code: SC2032
Hours / Week Credits Total Hours Marks
5 4 75 100

Objectives:
1. To introduce the various data structures and their implementations.
2. Study various sorting algorithms

Course Outcome

CO Upon completion of this course the students will PSO CL

be able to : addressed
CO -1 Summarize different categories of data Structures PSO – 1 U
CO -2 Identify different parameters to analyze the PSO – 2 AP
performance of an algorithm.
CO -3 Explain the significance of dynamic memory PSO - 3 U
management Techniques
CO -4 Design algorithms to perform operations with Linear PSO – 4 AP
and Nonlinear datastructures
CO -5 Illustrate various technique to for searching, Sorting PSO –2 U
and hashing
CO -6 Choose appropriate data structures to solve real world PSO –4 AP
problems efficiently.

Unit I
Introduction: Analyzing algorithms, Arrays: Representation ofArrays, Implementation
of Stacks and queues, Application of Stack: Evaluationof Expression - Infix to postfix
Conversion - Multiple stacks and Queues,Sparse Matrices.
Unit II
Linked list : Singly Linked list - Linked stacks and queues – polynomialaddition - More
on linked Lists - Doubly linked List and Dynamic StorageManagement - Garbage collection and
compaction.
Unit III
Trees: Basic Terminology - Binary Trees - Binary Tree representations –
BinarytreesTraversal - More on Binary Trees. Graphs: Terminology and Representations -
Traversals, connectedcomponents and spanning Trees, Single Source Shortest path problem.

Unit IV
Graphs: Terminology and Representations – Traversals, Connected Components and
Spanning Trees – Shortest Paths and Transitive Closure. External sorting: Storage Devices -
sorting with Disks : K-way merging - sorting with tapes: Balanced Merge sorts.

Unit V
Internal sorting: Insertion sort - Quick sort - 2 way Merge sort - Heap sort - sorting on
keys. Files: Files, Queries and sequential organizations -Index Techniques: Cylinder Surface
Indexing-Hashed Indexes - File organization: Sequential organizations-Randomorganizations-
Linked organizations.
Text Book:
Ellis Horowitz, Sartaj Shani, Data Structures, Galgotia publication.
Reference Books:
1. Data structures Using C Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J.Augenstein,
Kindersley (India) Pvt. Ltd.
2. Data structure and Algorithms, Alfred V. Aho, John E. Hopcroft, Jeffrey D.Ullman,
Pearson Education Pvt. Ltd.,
 Semester III
Major Core V: Computer Networks
Course Code: SC2033

Hours / Week Credits Total Hours Marks

5 4 75 100

Objectives:
1. To understand the concept of Computer network

2. To impart knowledge about networking and inter networking devices.

Course Outcome
CO Upon completion of this course the students will PSO CL
be able to : addressed
CO -1 Independently understand basic computer network PSO – 1 U
technology.
CO -2 Understand and explain Data Communications PSO – 2 U
System and its components.
CO -3 Identify the different types of network topologies and PSO - 3 U
protocols
CO -4 Enumerate the layers of the OSI model and TCP/IP. PSO – 3 U
Explain the function(s) of each layer.
CO -5 Apply the different types of network devices and PSO – 3 AP
their functions within a network
CO -6 Familiarity with the basic protocols of computer PSO –4 AP
networks, and how they can be used to assist in
network design and implementation.

Unit I
Introduction – Network Hardware – Software – Reference Models – OSI and TCP/IP
Models – Example Networks: Internet, ATM, Ethernet and Wireless LANs - Physical Layer –
Theoretical Basis for Data Communication - Guided Transmission Media

Unit II
Wireless Transmission - Communication Satellites – Telephone System: Structure, Local
Loop, Trunks and Multiplexing and Switching. Data Link Layer: Design Issues – Error
Detection and Correction.
Unit III
Elementary Data Link Protocols - Sliding Window Protocols – Data Link Layer in the
Internet - Medium Access Layer – Channel Allocation Problem – Multiple Access Protocols.

Unit IV
Network Layer - Design Issues - Routing Algorithms - Congestion Control Algorithms –
IP Protocol – IP Addresses – Internet Control Protocols.

Unit V
Transport Layer - Services - Connection Management - Addressing, Establishing and
Releasing a Connection – Simple Transport Protocol – Internet Transport Protocols (ITP) -
Network Security: Cryptography.
Text Book:
A. S. Tanenbaum, “Computer Networks”, 4th Edition, Prentice-Hall of India, 2008.
Reference Books:
1. B. A. Forouzan, “Data Communications and Networking”, Tata McGraw Hill, 4th
Edition, 2007.
2. F. Halsall, “Data Communications, Computer Networks and Open Systems”, Pearson
Education, 2008.
3. D. Bertsekas and R. Gallagher, “Data Networks”, 2nd Edition, PHI, 2008.
4. Lamarca, “Communication Networks”, Tata McGraw- Hill, 2002
 Semester III
Major Practical III: Java Programming
Course Code: SC20P3
Hours / Week Credits Total Hours Marks

4 2 60 100
Objectives:
1. To be knowledgeable enough about basic Java language syntax and semantics to be able
to successfully read and write Java computer programs.

2. To implement interfaces, inheritance, and polymorphism as programming techniques and

apply exceptions handling.

Learning Outcome
LO Upon completion of this course the students will PSO CL
be able to : addressed
LO -1 Create a java program to calculate simple PSO – 1 C
mathematical problems.
LO -2 Create a java program using Error handling technique PSO – 2 C
LO -3 Create Applet program to implement window based PSO - 3 C
Activities

Programs:

1. Define a class called Student with the attributes name, reg_number and marks obtained in
four subjects(m1,m2,m3,m4).Write a suitable constructor and methods to find the total
mark obtained by the student and display the details of the student.
2. Write a Java program to find the area of a square, rectangle and triangle by
(i) Overloading Constructor (ii) Overloading Method.
3. Write a java program to add two complex numbers. [Use passing object as argument and
return object].
4. Define a class called Student_super with data members name, roll number and age. Write
a suitable constructor and a method output () to display the details.
5. Derive another class Student from Student_super with data members height and weight.
Write a constructor and a method output () to display the details which overrides the
super class method output().[Apply method Overriding concept].
6. Write a java program to create an interface called Demo, which contains a double type
constant, and a method called area () with one double type argument. Implement the
interface to find the area of a circle.
7. Write a java program to create a thread using Thread class.
8. Demonstrate Java inheritance using extends keyword.
9. Create an applet with four Checkboxes with labels MARUTI-800, ZEN, ALTO and
ESTEEM and a Text area object. The program must display the details of the car while
clicking a particular Checkbox.
10. Write a Java program to throw the following exception,
1) Negative Array Size 2) Array Index out of Bounds
11. Write a java program to create a file menu with option New, Save and Close, Edit menu
with option cut, copy, and paste

12. Write a java programming to illustrate Mouse Event Handling

 Semester III
Major Practical IV: Data Structures Using C++
Course Code: SC20P4

Hours / Week Credits Total Hours Marks

4 2 60 100
Objectives:
1. To understand importance of data structures in context of writing efficient programs.
2. To develop skills to apply appropriate data structures in problem solving.
Learning Outcome
LO Upon completion of this course the students will PSO CL
be able to : addressed
LO - 1 Learn the basic types for data structure, PSO - 2 AP
implementation and application.
LO - 2 Know the strength and weakness of different data PSO - 1 U
structures.
LO - 3 Use the appropriate data structure in context of PSO - 3 AP
solution of given problem.
LO - 4 Develop programming skills which require to solve PSO - 4 C
given problem
Programs:
1. Write a C++ program to create two array list of integers. Sort and store the elements of
both of them in third list.
2. Write a C++ program to multiply two matrices A and B and store the resultant matrix in
C using arrays.
3. Write a C++ program to experiment the operation of STACK using array.
4. Write a C++ program to create menu driven options to implement QUEUE to perform the
following
(i) Insertion (ii) Deletion (iii) Modification (iv) Listing of elements
5. Write a C++ program to create Linked list representations of employee records and do
the following operations using pointers.
a. To add a new record. b. To delete an existing record.
c. To print the details about an employee. d. To find the number of employees
in the structure.
6. Write a C++ Program to count the total nodes of the linked list.
7. Write a C++ program to insert an element at the end of the linked list.
8. Write a C++ program to insert an element at the beginning of a doubly linked list.
9. Write a C++ program to display the hash table, using the mid square method.
10. Write a program to demonstrate Binary Search.
11. Write a C++ program to insert nodes into a Binary tree and to traverse in pre order.
12. Write a C++ program to traverse the given binary tree using all traversal methods.
13. Write a C++ program to arrange a set of numbers in ascending order using
QUICK SORT.
 Semester III
Allied III: Numerical and Statistical Methods
Course Code: SA2031
Hours / Week Credits Total Hours Marks
5 3 75 100

Objectives:
1. To equip the students with statistical tools and concepts that help in decision making.
2. To apply the knowledge of computing and mathematical methods appropriate to various
discipline.
Course Outcome

CO Upon completion of this course the students will PSO addressed CL

be able to :

CO -1 Solve an algebraic and Transcendental Equations PSO – 1 C

using an appropriate numerical methods

CO -2 Find an error analysis for a given PSO – 4 R

numerical method

CO -3 Solve a simultaneous equation using an appropriate PSO – 4 C

numerical method

CO -4 Find inverse of a matrix using Back Substitution PSO – 3 R

method

CO -5 Find a polynomial using interpolation methods PSO – 2 R

CO -6 Determine correlation and rank correlation PSO – 2 E

coefficient between two variables

CO -7 Find a regression equations using the given data PSO – 3 R

CO -8 Acquire problem solving techniques and Baye’s PSO – 4 AP

Theorem to solve real world problems
Unit I
Algebraic and Transcendental Equations: Introduction – Errors in Numerical
Computation – Iteration Method – Bisection Method.
Unit II
Simultaneous Equations: Introduction – Simultaneous Equations – Back Substitution –
Gauss Elimination Method – Gauss-Jordan Elimination Method – Calculation of Inverse of a
Matrix.
Unit III
Interpolation: Introduction – Newton’s Interpolation Formulae – Lagrange’s
Interpolation Formulae – Divided Differences – Newton’s Divided Differences Formulae
Unit IV
Measures of central tendency: mean, median, mode (with frequency). Measures of
dispersion: Range, Standard deviation, variance, quartile deviation
Unit V
Correlation and Regression: Introduction – Correlation – Rank correlation – Regression
[Expect Correlation coefficient for a bivariate frequency distribution].
Text Books:
1. Arumugam, S., Thangapandi Issac, S., Soma Sundaram, A. (2013). Numerical
Analysis with Programming in C. (4th edition). Bombay: New Gamma Publishing
House.
2. Arumugam, S., Thangapandi Issac, S. (2013). Statistics. (1st edition). Andra: New
Gamma Publishing House.
Reference Books:
1. Sastry, S.S. (2003). Introduction Methods of Numerical Analysis. (3rd edition). India:
Prentice Hall Publication.
2. Sear Borough, J. N. (1966). Numerical Mathematical Analysis. (6th edition). New Delhi:
Oxford and IBH Publishing Co.
3. Gupta, P.P., Malik, G. S., Sanjay Gupta, (1992). Calculus of Finite Differences and
Numerical Analysis. (16th edition). Bombay: Krishna Prakashan Mandir.
4. Kapur, J. N., Saxena, (1986). Mathematical Statistic. (12th edition). NewDelhi: Chand
and Company.
5. Mangaladoss, (1994). Statistics and its Applications. (11th edition). New Delhi: Suja
Publishing House.
 Semester IV
Major Core VI: UNIX and Shell Programming
Course Code: SC2041
Hours / Week Credits Total Hours Marks
5 5 75 100
Objectives:
1. To familiarize students with the UNIX environment and shell scripting/programming.
2. To inculculate the knowledge of working process of UNIX operating systems.

Course Outcome

CO Upon completion of this course the students will PSO addressed CL

be able to :

CO -1 identify set of commands in UNIX PSO – 1 R

CO -2 describe the features & functions of an operating PSO - 1 U

system.
Customize environment settings using a text editor
CO -3 PSO – 1 U
demonstrate UNIX commands for file handling and
CO -4 PSO - 1 AP
process control

• combine several simple commands in order to

CO -5 PSO -1 AP
produce more powerful operations.

CO -6• utilize system utilities to perform administrative tasks PSO - 1 AP

analyze the working of the user defined commands
CO -7 PSO - 3 AN
and will be able to change the permissions
associated with files.
create and manage simple file processing
CO -8 PSO - 3 C
operations, organize directory structures with
appropriate security
• create, delete, move and rename files and
CO -9 PSO – 1 C
directories
Unit I
Getting Started: The Operating System – The UNIX Operating System - A Brief
Session. The UNIX Architecture and Command Usage: The UNIX Architecture - Features of
UNIX - Locating Command - Internal and External Commands – Command Structure -
Flexibility of Command Usage – Man Browsing the Manual Pages On-line. General Purpose
Utilities: cal - date - echo - printf - bc - script – passwd - who – uname – tty - stty.
Unit II
The File System: The File – File Name – The HOME Variable – pwd – cd – mkdir –
rmdir - Absolute and Relative Pathnames – ls: Listing Directory Content - The UNIX File
System. Handling Ordinary Files: cat – cp – rm – mv – more - lp – file – wc – od – cmp –
comm – diff – gzip – gunzip. Basic File Attributes: ls -l: Listing File Attributes - File
Ownership - File Permissions – chmod - Directory Permissions - Changing File Ownership.
Unit III
The VI Editor: vi Basics - Input Mode—Entering and Replacing Text – Saving Text and
Quitting—The ex Mode - Navigation - Editing Text - Undoing Last Editing Instructions -
Repeating the Last command – Searching for a Pattern - Substitution—Search and Replace. The
Shell: Shell Offerings - Pattern Matching - Escaping and Quoting – Redirection – Pipes – tee -
Shell Variables.
Unit IV
The Process: ps: Process Status – Mechanism of Process Creation - Running Jobs in
Background – nice: Job Execution with Low Priority – Killing Processes with Signals - at and
batch: Execute Later – cron: Running Jobs Periodically. Customizing the Environment:
Environment Variables – The Common Environment Variables – Command History. More
File Attributes: File Systems and Inodes – The Directory - umask: Default File and Directory
Permissions – find: Locating Files.
Unit V
Simple Filters: The Sample Database - pr – head – tail – cut – paste – sort. Filters Using
Regular Expressions: grep. Essential Shell Programming: Shell Scripts – read: Making
Scripts Interactive – Using Command Line Arguments – exit and Exit Status of Command – The
Logical Operators && and || -- Conditional Execution – The if Conditional – The case
Conditional – while: Looping – for: Looping with a List – Debugging Shell Scripts with set –x.
Text Book:
Sumitabha Das, (2013). UNIX Concepts and Applications. (3rd edition). New Delhi:
Tata McGraw Hill Publications.
Reference Books:
1. S.Prata, (2008). Advanced UNIX: A Programming’s Guide. (2nd edition). New Delhi:
BPB Publications.
2. W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, (2014). Unix Network
Programming, The sockets Networking API, Vol. 1. (3rd edition). New York: Addison
Wesley.
3. Graham Glass, King Ables, (2009). Unix for programmers and users. (3rd edition). New
Delhi: Pearson Education.
4. N.B Venkateswarlu, (2010). Advanced Unix programming. (2nd edition). New Delhi: BS
Publications.
5. Yashwanth Kanitkar, (2010). Unix Shell programming. (1st edition). New Delhi: BPB
Publisher.
 Semester IV
Major Core VII: Relational Database Management System
Course Code: SC2042
Hours / Week Credits Total Hours Marks
5 5 75 100
Objectives:
1. To describe a sound introduction to the discipline of database management systems.
2. To give a good formal foundation on the relational model of data and study the SQL in
detail.
Course Outcome

CO Upon completion of this course the students will PSO addressed CL

be able to :
Describe basic concepts of data base System and
CO -1 Architecture PSO – 1 R
Define the logical design of database including E-R
CO -2 Model and Normalization approach PSO - 1 U

Understand and apply the basic of SQL and

CO -3 Authorization methods PSO – 3 U

Analyze Normal forms and RDBMS methods

CO -4 PSO - 3 AN
Apply Timestamp and Transaction management
CO -5 PSO -4 AP

Unit I
Introduction: Database System Applications-DBMS Vs. File System - View of Data-
Data Model Database Languages - Database users and Administrators - Transaction
Management - Database System Structure - Application Architecture. Data Models: Basic
Concepts - Constraint- Keys- ER Diagram - Weak Entity - Extended ER Features - UML;
Relational Model: - Views.
Unit II
SQL: Background-Basic Structure-Set Operation-Aggregate Function-Null Values-
Nested Sub Queries - Views - Modification of the Database - Data Definition Language -
Embedded SQL - Dynamic SQL.
Unit III
Advance SQL : Integrity and Security: Domain - Constraint - Referential Integrity -
assertions - Triggers - Security and Authorization - Authorization in SQL - Encryption and
Authentication.
Unit IV
Relational Database Design: First Normal Form - Pitfalls in Relational Database
Design-Functional Dependencies (Second Normal Form) - Boyce-Codd Normal Form - Third
Normal Form - Fourth Normal Form - Overall Database Design Process.
Unit V
Transaction Management: Transaction concepts - States - Serializability. Lock based
concurrency control: Locks - Granting - Timestamps - Timestamp ordering protocol - Dead lock
handling.
Text Book:
A Silberschatz, H Korth, S Sudarshan, "Database System and Concepts", 5th Edition
McGraw-Hill, 2005. Tamilnadu State Council for Higher Education
Reference Books:
1. Alexix Leon & Mathews Leon, "Essential of DBMS", 2nd reprint, Vijay Nicole
Publications, 2009.

2. Alexix Leon & Mathews Leon, "Fundamentals of DBMS", 2nd Edition, Vijay Nicole
Publications, 2014.
 Semester IV
Elective I: (a) Software Engineering
Course Code: SC2043
Hours / Week Credits Total Hours Marks
5 4 75 100

Objectives:
1. To understand the software engineering concepts.
2. Understand the coding, testing and user interface design
3. Design, develop the software projects and software reliability and quality management

Course Outcome

CO Upon completion of this course the students PSO CL

will be able to : addressed
CO -1 Apply software engineering principles and PSO – 1
techniques AP
CO -2 Develop, maintain and evaluate large-scale software PSO – 4
systems. C
CO -3 Produce efficient, reliable, robust and cost-effective PSO - 4
software solutions. C
CO -4 Ability to work as an effective member or leader of PSO – 2
software engineering teams. AP

CO -5 Ability to manage time, processes and resources PSO – 2

effectively by prioritising competing demands to U
achieve personal and team goals

Unit I
Introduction - Software Engineering Discipline - Evolution and Impact - Programs Vs
Software Products. Software Life Cycle Models: Classical Waterfall Model -Iterative Waterfall
Model - Prototyping Model - Evolutionary Model - Spiral Model. Software Project
Management: Responsibilities of a Software Project Manager - Project Planning - Risk
Management.
Unit II
Requirements Analysis and Specification: Requirements Gathering and Analysis -
Software Requirements Specification (SRS): Users of SRS Document, Characteristics of a
 Good SRS Document, Attributes of Bad SRS Documents – Formal System Development
Techniques. Software Design: Characteristics of a Good Software Design - Cohesion and
Coupling -Layered Arrangement.
Unit III
Function-Oriented Software Design: Overview of SA/SD Methodology - Structured
Analysis - Data Flow Diagrams (DFDs).Object Modeling Using UML: Overview of Object-
Oriented Concepts - UML Diagrams - Use Case Model: Representation of Use Cases. Why
Develop Use Case Diagram, How to identify the Use Cases of a system - Class Diagrams -
Interaction Diagrams - State Chart Diagram.
Unit IV
User Interface Design: Characteristics of a Good User Interface - Basic Concepts -
Types of User Interfaces - Coding and Testing: Coding – Testing: Basic Concepts and
Terminologies, Testing Activities - UNIT Testing - Black-Box Testing - White-Box Testing -
Debugging -Integration Testing - System Testing.
Unit V
Software Reliability and Quality Management: Software Reliability - Statistical
Testing -Software Quality - Software Quality Management System - ISO 9000: What is ISO
9000 Certification, ISO 9000 for Software Industry-Computer Aided Software Engineering:
CASE Environment - CASE support in Software Life Cycle - Characteristics of CASE Tools -
Software Maintenance: Characteristics of Software Maintenance - Software Reverse
Engineering - Software Maintenance Process Models
Text Book:
Rajib Mall, "Fundamentals of Software Engineering",3rd Edition, Prentice Hall of India
Private Limited, 2008.
Reference Books:
1. Rajib Mall, "Fundamentals of Software Engineering", 4thEdition, Prentice Hall of India
Private Limited, 2014.
2. Richard Fairley, "Software Engineering Concepts", TMGH Publications, 2004.
 Semester IV
Elective I: (b) System Administration and Maintenance
Course Code: SC2044
Hours / Week Credits Total Hours Marks
5 4 75 100

Objectives:
1. To study the basic concepts of computer system and operating system
2. To configure the system installation, maintenance and trouble shooting
3. To understand the basic concepts laptop, portable device and preventive maintenance
techniques
Course Outcome

CO Upon completion of this course the PSO CL

students will be able to : addressed
CO -1 Know some basic security measures to take in PSO – 1
system administration U
CO -2 Understand concepts and acquire skills that are PSO – 4
essential to the administration of operating U
systems, networks, software
CO -3 Apply the skills in the administration of an PSO - 4
actual computer system with actual users AP
CO -4 Implement security measures into the network PSO – 2
administration. AP

Unit I
Introduction to Personal Computer: Computer System – Purposes & Characteristics of Cases -
Power Supplies - Internal Components - Ports - Cables - Input devices - Output devices. Safe
Lab Procedures and Tool Use: Safe Working Conditions and Procedures - Tools and Software
used with PC components.
Unit II
Computer Assembly: Open Case - Install Power Supply - Attach Components to
Motherboard - Installation: Motherboard - Internal Drives - Drives in External Bayes -Adapter
Cards. Internal cables connections -Reattach side panels - Connection of external cables - Boot
the Computer. Preventive Maintenance and Troubleshooting: Purpose of Preventing
Maintenance - Steps of Troubleshooting Process.
Unit III
Fundamental Operating System: Purposes - Characteristics of Modern Operating
Systems – Concepts Comparisons, Limitations, and Compatibilities - Determination of Operating
System based on Customer Needs - Installation of Operating System -Navigate a GUI
(Windows) - Common Preventive Maintenance Techniques- Troubleshoot.
Unit IV
Fundamental Laptops and Portable Devices: Common Uses - Components of Laptop -
Comparison of the components of Desktop and Laptops - Configure Laptops - Mobile Phone
Standards - Preventive Maintenance Techniques - Troubleshoot Laptop and Portable Devices.
Fundamental Printers and Scanners: Types of Printers and Scanners - Installation and
Configuration Process of Printers and Scanners - Preventive Maintenance Techniques -
Troubleshoot.
Unit V
Fundamental Networks: Principles - Types - Concepts and Technologies - Physical
Components - LAN Topologies and Architectures- Standard Organizations - Ethernet Standards
- OSI and TCP/IP Models - Configuration of NIC and Modem - Establishing Connectivity -
Preventive Maintenance Techniques - Troubleshoot. Fundamental Security: Security Threats -
Security Procedures - Preventive Maintenance Techniques - Troubleshoot Security.
Text Book:
David Anfinson & Ken Quamme, "IT Essentials: PC Hardware and Software Companion
Guide", 3rd Edition, Pearson Publications, 2008.
Reference Books:
1. Quentin Docter, Emmett Dulaneyand Toby Skandier, "CompTIA A+ Complete Review
Guide: Exam 220-901, Exam 220 - 902", 3rd Edition, Wiley Publications, 2015.
2. To understand the software engineering concepts.
3. Understand the coding, testing and user interface design
4. Design, develop the software projects and software reliability and quality management
 Semester IV
Elective I: (c) Software Testing
Course Code: SC2045
Hours / Week Credits Total Hours Marks
5 4 75 100

Objectives:
1. To study various Software techniques
2. To study fundamental concepts in software testing
Course Outcome

CO Upon completion of this course the students PSO CL

will be able to : addressed
CO -1 Apply software testing knowledge and engineering PSO – 1
AP
methods to design and conduct a software test process
for a software testing project
CO -2 Identify and select appropriate testing technique to test a PSO – 4
C
software.
CO -3 Identify various software testing problems and solve PSO - 4
C
these problems by various software testing methods.
CO -4 Understand the contemporary issues in software testing, PSO – 2
AP
such as buddy, agile, extreme, adhoc software testing
problems etc
CO -5 To use software testing methods and modern software PSO – 2
U
testing tools for their testing projects and employ correct
testing terminology throughout the testing process.

Unit I
Introduction: Purpose – Productivity and Quality in Software – Testing Vs Debugging –
Model for Testing – Bugs – Types of Bugs – Testing and Design Style.
Unit II
Flow / Graphs and Path Testing – Achievable paths – Path instrumentation – Application
– Transaction Flow Testing Techniques.
Unit III
Data Flow Testing Strategies - Domain Testing: Domains and Paths – Domains and
Interface Testing.
Unit IV
Linguistic –Metrics – Structural Metric – Path Products and Path Expressions. Syntax
Testing – Formats – Test Cases.
Unit V
Logic Based Testing – Decision Tables – Transition Testing – States, State Graph, State
Testing.
Text Book:
1. B. Beizer, “Software Testing Techniques”, II Edn., DreamTech India, New Delhi, 2003.
2. K.V.K. Prasad , “Software Testing Tools”, DreamTech. India, New Delhi, 2005.
Reference Books:
1. I. Burnstein, 2003, “Practical Software Testing”, Springer International Edn.
2. E. Kit, 1995, “Software Testing in the Real World: Improving the Process”, Pearson
Education, Delhi.
3. R.Rajani, and P.P.Oak, 2004, “Software Testing”, Tata Mcgraw Hill, New Delhi.
 Semester IV
Major Practical V: Shell Programming
Course Code: SC20P5
Hours / Week Credits Total Hours Marks

4 2 60 100
Objectives:
1. Simulate the file commands
2. Write simple shell programming
Learning Outcome
LO Upon completion of this course the PSO CL
students will be able to : addressed
LO -1 Run various UNIX commands on a standard PSO – 1 AP
UNIX Operating system
LO -2 Run C / C++ programs on UNIX. PSO – 3 AP
LO -3 Do shell programming on UNIX OS PSO - 4 C

LO -4 Employ decision making and looping construct to PSO – 2 AP

write a shell script
Programs:
1. Write a shell script to stimulate the file commands: rm, cp, cat, mv, cmp, wc, split, diff.
2. Write a shell script to show the following system configuration:
a. currently logged user and his log name.
b. current shell, home directory, Operating System type, current Path setting, current
working directory.
c. show currently logged number of users, show all available shells
d. show CPU information like processor type, speed
e. show memory information.
3. Write a Shell Script to implement the following: pipes, Redirection and tee commands.
4. Write a shell script for displaying current date, user name, file listing and directories by getting
user choice.
5. Write a shell script to implement the filter commands.
6. Write a shell script to remove the files which has file size as zero bytes.
7. Write a shell script to find the sum of the individual digits of a given number.
8. Write a shell script to find the greatest among the given set of numbers using command line
arguments.
9. Write a shell script for palindrome checking.
10. Write a shell script to print the multiplication table of the given argument using for-loop.
 Semester IV
Major Practical VI: SQL and PL/SQL
Course Code: SC20P6

Hours / Week Credits Total Hours Marks

4 2 60 100

Objectives:
1. Study the various DDL, DML commands.
2. Write queries in SQL to retrieve any type of information from a data base.
Learning Outcome

LO Upon completion of this course the students PSO CL

will be able to : addressed
LO -1 Understand the logical structure of the RDBMS PSO – 1
U
LO -2 Understand How the data will be stored and PSO – 4
U
retrieved

LO -3 Understand the PL/SQL to do such things as PSO - 4

U
modify your business rule.

Programs:
Demonstrate the following SQL commands and can take any back end RDBMS system for
implementation purpose.
1. Data Definition of Base Tables.
2. DDL with Primary key constraints
3. DDL with constraints and verification by insert command
4. Data Manipulation of Base Tables and Views
5. Demonstrate the Query commands
6. Write a PL/SQL code block that will accept an account number from the user and debit an
amount of Rs. 2000 from the account if the account has a minimum balance of 500after the
amount is debited. The Process is to fired on the Accounts table.
7. Write a PL/SQL code block to calculate the area of the circle for a value of radius varying
from 3 to 7. Store the radius and the corresponding values of calculated area in a table Areas.
Areas – radius, area.
8. Write a PL/SQL block of code for reversing a number. (Example : 1234 as 4321).
9. Create a transparent audit system for a table Client_master (client_no, name, address,
Bal_due). The system must keep track of the records that are being deleted or updated. The
functionality being when a record is deleted or modified the original record details and the date
of operation are stored in the auditclient(client_no, name, bal_due, operation, userid, opdate)
table, then the delete or update is allowed to go through.
 Semester IV
Allied IV: Discrete Mathematics
Course Code: SA2041
Hours / Week Credits Total Hours Marks
5 3 75 100

Objectives:
1. To understand the logic, functions and reasoning.
2. To learn relations and probability
Course Outcome

CO Upon completion of this course the PSO CL

students will be able to : addressed
CO -1 Learn the basic concepts of sets, permutations, PSO – 1
U
relations, graphs, trees and finite state machines.
CO -2 Represent discrete objects and relationships using PSO – 4
AN
abstract mathematical structures.
CO -3 Apply basic counting techniques to solve PSO - 4
AP
combinatorial problems
CO -4 Understand the basic principles of sets and PSO – 2
U
operations in sets
CO -5 Apply counting principles to determine PSO – 2
AP
probabilities.

Unit I
Logic: propositional logic, logical equivalence, predicates & quantifiers, and logical
reasoning. Sets: basics, set operations
Unit II
Functions: one-to-one, onto, inverse, composition, graphs Integers: greatest common
divisor, Euclidean algorithm.
Unit III
Sequences and Summations: Mathematical reasoning and induction, Proof strategies,
Mathematical Induction, Recursive definitions, Structural Induction.
Unit IV
Counting: basic rules, Pigeonhole principle, Permutations and Combinations, Binomial
coefficients and Pascal triangle. Probability: Discrete probability. Expected values and variance.
Unit V
Relations: Properties, Combining relations, Closures, Equivalence, Partial ordering,
Graphs: directed, undirected graphs.
Text Book:
Kenneth H. Rosen. Discrete Mathematics and Its Applications, 7th Edition, McGraw
Hill, 2012
Reference Books:
1. Elements of Discrete Mathematics” by C L Liu
2. Discrete Mathematics” by Norman L Biggs
3. Discrete Mathematics for Computer Science” by Kenneth Bogart and Robert L Drysdale
4. Discrete Mathematics with Applications” by Thomas Koshy