PROPOSED SYLLABUS FOR THE ACADEMIC YEAR...
20
PROPOSED SYLLABUS FOR THE ACADEMIC YEAR 2019-2020 ONWARDS B.Sc. Computer Science
Transcript of PROPOSED SYLLABUS FOR THE ACADEMIC YEAR...
PROPOSED SYLLABUS
FOR THE
ACADEMIC YEAR
2019-2020 ONWARDS
B.Sc. Computer Science
CAUVERY COLLEGE FOR WOMEN(Autonomous)
TRICHY-18
B.Sc. Computer Science
PROGRAMME OUTCOMES
• To provide a solid foundation in the discipline of Computer Science and enable students
to formulate computational solutions to real life problems
• To identify, analyze, design an optimized solution using appropriate algorithms of
varying complexity using cutting edge technologies
• To develop skills in software and hardware so as to enable the students to establish a
productive career in industry, research and academia
• To equip the students to meet the industrial needs by utilizing tools and technologies with
the skills to communicate effectively among peers
Cauvery College for Women(Autonomous), Trichy-18
PG & Research Department of Computer Science
B.Sc Computer Science
(For the Candidates admitted from the Academic year 2019-2020 onwards)
Sem
este
r
Pa
rt
Course Title Course Code
Inst
.Hrs
/
wee
k
Cre
dit
s
Exam
To
tal
Hrs
.
Marks
Int. Ext.
I
I Language Course-I (LC)
Tamil/Other Languages
,f;fhy ,yf;fpak; 19ULT1
6 3 3 25 75 100
Story,Novel,Hindi
Literature-I &
Grammar-I
19ULH1
Communication in
French-I
19ULF1
History of Popular
Tales Literature and
Sanskrit Story
19ULS1
II English Language Course-
I(ELC)
Functional Grammar
for Effective
Communication-I
19UE1 6 3 3 25 75 100
III Core Course – I(CC) Programming in C 19UCS1CC1 6 6 3 25 75 100
Core Course - I (CP) Programming in C Lab 19UCS1CC1P 3 3 3 40 60 100
First Allied I Essential Mathematics 19UCS1AC1 4 4 3 25 75 100
First Allied II
Numerical Analysis
and Statistics
19UCS1AC2 3 - - - - -
IV Value Education Value Education 19UGVE 2 2 3 25 75 100
TOTAL 30 21 600
II
I Language Course-II(LC)
Tamil/Other Languages
,ilf;fhy ,yf;fpaKk;
GjpdKk;
19ULT2
6 3 3 25 75 100
Prose,Drama,Hindi
Literature-2 &
Grammar-II
19ULH2
Communication in
French-II
19ULF2
Poetry Textual
Grammar and Alakara
19ULS2
II English Language Course-
II(ELC)
Functional Grammar
for Effective
Communication-II
19UE2 6 3 3 25 75 100
III Core Course – II (CC) Java Programming 19UCS2CC2 6 6 3 25 75 100
Core Course - II (CP) Java Programming Lab 19UCS2CC2P 3 3 3 40 60 100
First Allied II
Numerical Analysis
and Statistics
19UCS1AC2 3 3 3 25 75 100
First Allied III Operations Research 19UCS2AC3 4 2 3 25 75 100
IV Environmental Studies Environmental Studies 19UGES 2 2 3 25 75 100
TOTAL 30 22 700
III
I
Language Course-III
(LC)-Tamil*/Other
Languages**#
fhg;gpaKk; ehlfKk; 19ULT3
6 3 3 25 75 100
Medieval,Modern
Poetry & History of
Hindi Literature-3
19ULH3
Communication in
French-III
19ULF3
Prose,Textual Grammar
and Vakyarachana
19ULS3
II English Language Course-
III(ELC)
Writing for General and
Specific Purposes-I
19UE3 6 3 3 25 75 100
III
Core Course– III(CC) Relational Database
Management Systems
19UCS3CC3 6 6 3 25 75 100
Core Course- III(CP) MYSQL Lab 19UCS3CC3P 3 3 3 40 60 100
Second Allied I
Digital Computer
Fundamentals
19UCS3AC4 4 3 3 25 75 100
Second Allied II
Digital &
Microprocessor Lab
19UCS3AC1P 3 - - - - -
IV Non Major Elective I
Office Automation Lab 19UCS3NME1P
2 2 3
40 60
100 Basic Tamil-I 19ULC3BT1 25 75
Special Tamil-I 19ULC3ST1
TOTAL 30 20 600
IV
I
Language Course - IV
(LC) - Tamil */Other
Language**#
gz;ila ,yf;fpak; 19ULT4
6 3 3 25 75 100
Letter writing, General
Essays, Technical
Terms, Proverbs,Idioms
&Phrases,Hindi
Literature-4
19ULH4
Communication in
French-IV 19ULF4
Drama,History of
Drama Literature 19ULS4
II English Language Course
- IV(ELC)
Writing for General and
Specific Purposes-II 19UE4 6 3 3 25 75 100
III
Core Course – IV(CC) Object Oriented
Programming In C#
And .Net Programming
19UCS4CC4 5 5 3 25 75 100
Core Course - IV (CP) C# And .Net
Programming Lab 19UCS4CC4P 3 3 3 40 60 100
Second Allied II Digital &
Microprocessor Lab 19UCS3AC1P 3 3 3 40 60 100
Second Allied III Microprocessor &
Microcontrollers 19UCS4AC5 3 3 3 25 75 100
IV Non Major Elective II Multimedia Lab 19UCS4NME2P
2 2 3
40 60
100 Basic Tamil-II 19ULC4BT2 25 75
Special Tamil-II 19ULC4ST2
V Skill Based Elective – I PC Packages &
Multimedia Lab
19UCS4SBE1AP
2 2 3 40 60 100 Computer Hardware
and Trouble Shooting
Lab
19UCS4SBE1BP
TOTAL 30 24 800
V
III
Core Course – V(CC) Python Programming 19UCS5CC5 5 4 3 25 75 100
Core Course – V(CP)
Python Programming
Lab
19UCS5CC5P 3 3 3 40 60 100
Core Course - VI(CC)
Data Structures &
Algorithms
19UCS5CC6 5 4 3 25 75 100
Core Course – VII(CC)
Data Communication
Networks
19UCS5CC7 6 5 3 25 75 100
Major Based Elective – I
Computer Architecture 19UCS5MBE1A
5 5 3 25 75 100
Computer Graphics 19UCS5MBE1B
Cyber Security 19UCS5MBE1C
IV
Skill Based Elective – II
Mobile Application
Development Lab
19UCS5SBE2AP
2 2 3 40 60 100 Computer Networks
Lab Using JAVA
19UCS5SBE2BP
Skill Based Elective – III
Software Testing Tool
– Selenium
19UCS5SBE3AP
2 2 3 40 60 100 Computer Graphics
Lab Using C
19UCS5SBE3BP
Soft Skills Soft Skills 19UGSD 2 2 3 25 75 100
TOTAL
30 27 800
VI
III
Core Course – VIII(CC) Operating System 19UCS6CC8 6 6 3 25 75 100
Core Course – IX(CC) PHP 19UCS6CC9 6 5 3 25 75 100
Core Course – VI(CP) Web Designing Lab 19UCS6CC6P 6 3 3 40 60 100
Major Based Elective – II Cloud Computing
19UCS6MBE2A
6 5 3 25 75 100 Fundamentals of
Bigdata & IoT
19UCS6MBE2B
Software Engineering 19UCS6MBE2C
Major Based Elective –
III
Data Structures Lab
using C
19UCS6MBE3AP
5 5 3 40 60 100
R Programming Lab 19UCS6MBE3BP
Mini Project 19UCS6MBE3CP
V
Gender Studies Gender Studies 19UGGS 1 1 3 25 75 100
Extension activity 19UGEA 0 1 0 - - -
TOTAL
30 26 600
180 140 4100
19UCS1CC1 PROGRAMMING IN
C
CATEGORY L T P CREDIT
CORE 90 6 - 6
Preamble
• To articulate the learning of C Language for beginners with all major features of C.
• This subject will also create foundation to learn other complex programming languages
like C++, Java, etc.,
Course Outcomes
On the successful completion of the course, students will be able to
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S S S S
CO2 S M S M
CO3 S M S M
CO4 S M S S
S – Strong; M – Medium; L - Low
Syllabus
UNIT I (20HOURS)
Overview of C – Introduction - character set - C tokens - keyword & identifiers –
constants – variables - data types – declarations of variables – arithmetic, relational, logical,
assignment, conditional, bit wise, special, increment and decrement operators - arithmetic
expressions - evaluation of expression - operator precedence & associativity - mathematical
functions - reading & writing a character - formatted input and output.
UNIT II (15 HOURS)
Decision Statements: If, if else, switch, break, continue - the ?: operator - the GOTO
statement. – Loop Control Statements: introduction – for, nested for loops – while, do while
statements – Arrays: one-dimensional - two dimensional - multidimensional arrays.
UNIT III (20 HOURS)
Character string handling - declaring and initialising string variables - reading strings
from terminal - writing strings to screen - string handling functions - User-defined functions:
need for user defined functions – types of functions - calling a function category of functions -
no arguments and no return values - arguments but no return values - arguments with return
values – recursion - functions with arrays - the scope and lifetime of variables in functions.
UNIT IV (20 HOURS)
Structure definition: structure initialisation - comparison of structure variables - arrays of
structures - arrays within structures - structures within structures – unions. Pointers:
understanding pointers - accessing the address of a variable - declaring and initialising pointers -
accessing a variable through its pointers - pointer expressions - pointers and arrays - pointers and
character strings - pointers and functions - pointers and structures.
CO Number CO Statement Knowledge Level
CO1 Acquire programming logic, use of program instructions,
syntax, program structure.
K1
CO2 Understand the concept of arrays and functions. K2
CO3 Classify the structure, union, pointers and files in the
program.
K3
CO4 Solve various problems using C features. K3
UNIT V (15 HOURS)
File management in C: defining and opening a file - closing file - I/O operations on files -
error handling during I/O operations - random access to files - command line arguments.
Text Book
S.No AUTHOR TITLE OF
THE BOOK
PUBLISHER/
EDITION
YEAR OF
PUBLICATION
1. E.Balagurusamy Programming In
ANSI C
Tata Mc Graw
Hill, 7th Edition
2017.
Reference Books
S.No AUTHOR TITLE OF
THE BOOK
PUBLISHER/
EDITION
YEAR OF
PUBLICATION
1. Byron Gottfried Programming
with C
Tata Mc Graw Hill,
3rd Edition
2013.
2. D.Ravichandran Programming in
C
NewAge
International(P)Ltd.,
1st Edition
2006.
Web References
1. http://www.tutorialspoint.com/cprogramming/index.htm 2. http://www.cprogramming.com/tutorial/c-tutorial.html 3. http://www.w3schools.in/c 4. http://fresh2refresh.com/c-tutorial-for-beginners
Pedagogy
Chalk and talk, PPT, Discussion, Assignment, Demo, Quiz, Seminar
Course Designers
1. Ms. S.Saranya
2. Ms. N.Agalya
19UCS1CC1P PROGRAMMING
IN C LAB
CATEGORY L T P CREDIT
CORE 45 - 3 3
Preamble
• To provide the hands on experience on C Programming and improve the practical skill
set.
• The learner will be able to develop the logic for the given problem, recognize and
Understand the syntax and construction of C code.
• To know the steps involved in compiling, linking and debugging C code, feel more
Confident about writing the C functions, write some complex programs.
Course Outcomes
On the successful completion of the course, students will be able to
CO
Number
CO Statement Knowledge Level
CO1 Identify the basic terminologies of C programming by
using different data types, decision structures, loops and
functions.
K1
CO2 Understand the dynamic memory allocation by the use of
pointers and files.
K2
CO3 Demonstrate practical experience in developing solutions
using C
K3
CO4 Apply, compile and debug programs in C language K3
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S S S M
CO2 S S S M
CO3 S S S S
CO4 S S S S
S – Strong; M – Medium; L - Low
Syllabus 1. Programs using various Datatypes
2.Programs using Different Operators
3. Decision Making Statements
4. Looping Statements
5. Programs using user defined functions and recursive functions
6. Programs using one dimensional and two dimensional arrays
7. String Manipulation using string functions
8. Programs using pointers
9. Programs using structures and unions
10.Creating and Manipulating file
Web References
1. http://www.tutorialspoint.com/cprogramming/index.htm
2. http://www.cprogramming.com/tutorial/c-tutorial.html
3. http://www.w3schools.in/c
4. http://fresh2refresh.com/c-tutorial-for-beginners Pedagogy
Power point Presentations, E-Content
Course Designers
1. Ms. S.Saranya
2. Ms. N.Agalya
19UCS1AC1 ESSENTIAL
MATHEMATICS
CATEGORY L T P CREDIT
ALLIED 60 4 - 4
Preamble
• To equip the students with mathematical methods formatted for their major concepts
and train them in basic Differentiations and Integrations. Course Outcomes
On the successful completion of the course, students will be able to
CO
Number CO Statement
Knowledge
Level
CO1 State the basic concepts of graph theory K1
CO2 Explain the concepts of Matrices and its types K2
CO3 Compute characteristic equation of a matrix and its inverse by
Cayley Hamilton theorem
K3
CO4 Apply Differentiation to find the solutions of Ordinary and
Partial Differentiation
K3
CO5 Classify the various types of integrals K3
CO6 Solve different types of ordinary differential equation K3
CO7 Classify the characteristics of graph theory K3
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S S S M
CO2 S S M M
CO3 S S S S
CO4 M M M M
CO5 S S M M
CO6 S M M M
CO7 S S S S
S – Strong; M – Medium; L - Low
Syllabus
UNIT I (12 HOURS)
Matrices
Singular matrices – Inverse of a non-singular matrix using adjoint method - Rank of a
Matrix – Consistency - Characteristic equation, Eigen values, Eigen vectors – Cayley Hamilton’s
Theorem (proof not needed) –Simple applications only
UNIT II (12 HOURS)
Differentiation
Maxima & Minima – Concavity, Convexity – Points of inflexion - Partial differentiation
– Euler’s Theorem - Total differential coefficients (proof not needed) –Simple problems only.
UNIT III (12 HOURS)
Integration
Evaluation of integrals of types
(1). ++
+
cbxax
qpx2
dx (2). ++
+
cbxax
qpx
2dx (3). + xba
dx
sin (4). + xba
dx
cos
Evaluation using Integration by parts – Properties of definite integrals.
UNIT IV (12 HOURS)
Differential Equations
Variables Separables – Linear equations – Second order of types ( a D 2 + b D + c ) y = F
( x ) where a,b,c are constants and F ( x ) is one of the following types ( i ) e kx ( ii ) sin ( kx ) and
cos ( kx ) ( iii ) x n , n being an integer (iv) e kx f (x )
UNIT V (12 HOURS)
Graph Theory
Basic concepts- Finite and infinite graphs-Incidence and degree ideas on vertices –
Isomorphism, Sub graphs, Walks – Paths and Circuits – Euler graphs.
Text Books
S.No AUTHORS TITLE PUBLISHE
RS
YEAR OF
PUBLICATION
1 T.K. Manichavasagam Pillai
and others
Algebra,
Volume II
S.
Viswanathan
Pvt Limited
1985
2 S. Narayanan, T.K.
Manichavasagam Pillai
Calculus,
Volume I. S. Viswanathan Pvt
Limited 2003
3 S. Narayanan, T.K.
Manichavasagam Pillai
Calculus,
Volume II.
S. Viswanathan Pvt
Limited 2003
4 S. Narayanan, T.K.
Manichavasagam Pillai
Calculus,
VolumeIII.
S. Viswanathan Pvt
Limited 2003
5 Narsingh Deo Graph
Theory
Hall of india
Pvt Ltd 1997
UNIT CHAPTER TEXT BOOK SECTION
I 2 1 1- 8, 10-16
II 5,8 2 1.1 - 1.5, 2
1.1 - 1.6
III 1 3 7.1 – 7.3,
8(Case II),9,11,12
IV 1,2 4 2.1 , 2.4
1 - 4
V 1,2 5 1.1 – 1.5
2.1 – 2.6
Reference Books
S.No AUTHORS TITLE PUBLISHERS YEAR OF PUBLICATION
1 A.Singaravelu Allied Mathematics A.R.Publications 2003
2 P.R.Vittal Allied Mathematics Margham Publications,
Chennai 2014
3 S.Arumugam and
S.Ramachandran
Invitation to Graph
Theory
SciTech
Publications(India)Pvt
Ltd.,Chennai
2006
Pedagogy
Assignment, Seminar, Lecture, Quiz, Group discussion, Brain storming, e-
content.
Course Designers
1. Dr.V.Geetha
2. Dr.S.Sasikala
19UCS1AC2
NUMERICAL
ANALYSIS
AND
STATISTICS
CATEGORY L T P CREDIT
ALLIED (45+45) 3+3 - 3
Preamble
• To train the students in numerical and statistical problems.
Course Outcomes
On the successful completion of the course, students will be able to
CO
Number CO Statement
Knowledge
Level
CO1 Explain the concept of measures of central tendency and
dispersion
K2
CO2 Apply numerical methods to solve Algebraic, Transcendental
equations and Interpolation
K3
CO3 Compute the numerical solution of ordinary differential equation
by various method
K3
CO4 Solve numerical integration and system of linear equation by
appropriate methods.
K3
CO5 Explain correlation and regression and solve the numerical
problems.
K3
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S S S S
CO2 S S M M
CO3 S S M M
CO4 S S M M
CO5 S S S S
S – Strong; M – Medium; L - Low
Syllabus
UNIT I (15 HOURS)
Solution of Algebraic & Transcendental equations
Introduction - Bisection Method, Method of False Position, Iteration method, Newton Raphson
Method (Problems Only)
Interpolation
Finite differences –Forward , Backward and Central differences – Newton’s formulae for
interpolation - Lagrange’s interpolation formula.
UNIT II (15 HOURS)
Numerical differentiation & Integration
Numerical Integration using Trapezoidal rule and Simpson’s (3
1 and
8
3 ) rules (proof not
needed )
Numerical Linear Algebra
Solutions to Linear Systems –Gauss Elimination and Gauss Jordon method –Iterative methods
(Problems Only)
UNIT III (15 HOURS)
Numerical solution of Ordinary Differential Equations
Introduction - Solution by Taylor Series Method ,Picard’s method of successive approximations,
Euler’s Method, Modified Euler’s Method - Runge - Kutta method- Predictor Corrector Method
-Adams –Moulton method and Milne’s Method.
UNIT IV (15 HOURS)
Measures of Central Tendency
Arithmetic Mean – Median - Mode - Geometric Mean – Harmonic Mean.
Measures of Dispersion
Range- Quartile Deviation - Mean Deviation, Standard Deviation.
UNIT V (15 HOURS)
Correlation
Introduction - Meaning of Correlation – Scattered Diagram – Karl Pearson’s co-efficient
Correlation – Rank Correlation
Linear Regression
Introduction – Linear Regression –Regression Coefficients and its equations (Problems Only)
Text Books
S.No AUTHORS TITLE PUBLISHERS YEAR OF
PUBLICATION
1 S.S.Sastry Introductory methods of
Numerical Analysis, fifth
Edition
PHI Learning
private limited
2013
2 Gupta.S.C &
Kapoor, V.K Fundamentals of
Mathematical Statistics
Sultan Chand
& sons, New Delhi
1994
Reference Books
S.No AUTHORS TITLE PUBLISHERS
YEAR OF PUBLICATIO
N
1 M.K. Jain, S.R.K. Iyengar
and R.K. Jain
Numerical Analysi
Numerical Methods for
Scientific and
Engineering Computations
New Age
International
Private
Limited
1999
2 C.E. Froberg Introduction to Numerical
Analysis, II Edn. Addison Wesley 1979
Pedagogy
Assignment, Seminar, Lecture, Quiz, Group discussion, Brain storming, e-content.
Course Designers1.Dr.V.Geetha 2.Dr.S.Sasikala
UNIT CHAPTER TEXT BOOK SECTION
I 2
3
1
2.1 – 2.5
3.3 (Omit 3.3.4), 3.6, 3.9.1
II 6
7
6.4.1 – 6.4.3
7.5.1 & 7.5.3 , 7.6
III 8 8.1 – 8.6 (Omit 8.4.1)
IV 2
2
2.5 – 2.9, 2.13
V 10
11
10.1 – 10.4, 10.7
11.1 & 11.2
19UCS2CC2
JAVA
PROGRAMMING
CATEGORY L T P CREDIT
CORE 90 6 - 6
Preamble
• To inculcate knowledge in Java programming concepts.
• To provide knowledge in Package and Applet concepts.
• To enrich the knowledge in Multithread and Graphics concept.
Course Outcomes On the successful completion of the course, students will be able to
CO Number CO Statement Knowledge Level
CO1 Identify the necessary attributes and methods of an object,
hierarchical classification of classes
K1
CO2 Execute inheritance codes ,packages & collection
interfaces
K2
CO3 Develop desktop application using multi-threading, IO
concepts, GUI to solve real-time problems. design
distributed applications
K3
CO4 Classify the multitasking application using exception
handling concepts
K3
CO5 Apply graphical programming K3
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S M S S
CO2 S S S S
CO3 S S S S
CO4 S S S S
CO5 S M S S
S – Strong; M – Medium; L - Low
Syllabus
Unit I (18 HOURS)
Java Evolution: Java Features – How Java differs from C and C++ – Java and Internet –
Java and World Wide Web – Web Browsers – Hardware and Software Requirements – Java
Environment. Overview of Java Language: Simple Java Program – Java Program Structure –
Java Tokens – Java Statements – Implementing a Java Program – Java Virtual Machine –
Command Line Arguments. Constants – Variables – Data types – Declaration of Variables –
Giving Values to variables – Scope of Variables – Symbolic Constants – Type Casting-Operators
and Expressions- Decision Making and Branching
Unit II (18 HOURS)
Class, Objects and Methods: Defining a Class – Fields Declaration – Methods
Declaration – Creating Objects – Accessing class members – Constructors – Methods
Overloading – Static Members – Nesting of Methods – Inheritance – Overriding Methods – Final
Variables and Methods – Final Classes – Finalizer Methods – Abstract Methods and Classes –
Visibility Control. Arrays, Strings and Vectors: One – dimensional Arrays – creating an Array –
Two dimensional Arrays – Strings – Vectors – Wrapper Classes– Enumerated Types. Interfaces:
Multiple Inheritance: Defining Interfaces – Extending Interfaces – Implementing Interfaces –
Accessing Interface Variables.
Unit III (18 HOURS)
Packages:Java API Packages – Using system Packages – Naming Conventions – Creating
Packages – Accessing a Package – Using a 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.
Unit IV (18 HOURS)
Managing Errors and Exceptions: Types of Errors – Exceptions – Syntax of Exception
Handling Code – Multiple Catch Statements – Using Finally Statement – Throwing our own
Exceptions – Using Exceptions for debugging. Applet Programming: How Applets differ from
Applications – Preparing to write Applets – Building Applet Code – Applet Life Cycle –
Creating an executable Applet – Designing a WebPage – Applet Tag – Adding Applet to HTML
file – Running the Applet.
Unit V (18 HOURS)
Graphics Programming: The Graphics Class – Lines and Rectangles – Circles and
Ellipses, Drawing Arcs – Drawing Polygons – Line Graphs – Using Control Loops in Applets –
Drawing Bar Charts. Managing Input/Output Files in Java: Concept of Streams – Stream Classes
– Byte Stream Classes– Character Stream Classes – Using Streams – Other Useful I/O Classes –
Using the file Class – I/O Exceptions – Creation of Files – Reading / Writing Characters –
Reading / Writing Bytes – Handling Primitive Data Types – Concatenating and Buffering Files –
Random Access Files – Interactive Input and Output.
Text Book
S.No AUTHOR TITLE OF THE
BOOK
PUBLISHER/
EDITION
YEAR OF
PUBLICATION
1. E.Balagurusamy Programming with
Java
A primer, Tata
McGraw Hill,
Fourth Edition
2008
Chapters
Unit I : 1, 2, 3, 4, 5, 6, 7.
Unit II : 8, 9, 10.
Unit III : 11, 12.
Unit IV : 13, 14
Unit V : 15, 16
Reference Books
S.No AUTHOR TITLE OF THE BOOK PUBLISHER/
EDITION
YEAR OF
PUBLICATION
1. Debasish Jana Java and Object-Oriented
Programming Paradigm
Prentice Hall of
India Private
Limited, New
Delhi
2008
2. Herbert Schildt The Complete Reference
Java2
Tata Mc Graw
Hill, Fifth Edition
2002
Web References
1. http://docs.oracle.com/javase/tutorial/java/
2. http://www.java2s.com/Tutorial/Java/CatalogJava.htm
3. http://www.javatpoint.com/java-swing
4. https://docs.oracle.com/javase/tutorial/collections/intro/
5. http://way2java.com/java-versions-2/jdk-1-8-features/
Pedagogy
Assignment, Seminar, Lecture, Quiz, Group discussion, Power point presentations,
Brain storming, e-content.
Course Designers
Ms. M. Gowri Sudha
19UCS2CC2P
JAVA
PROGRAMMING
LAB
CATEGORY L T P CREDIT
CORE 45 - 3 3
Preamble
• To demonstrate the programming concepts of Java
• Apply the object oriented concepts to create stand-alone applications
• Design and develop GUI applications using Abstract Window Toolkit (AWT) and Event
Handling
Course Outcomes
On the successful completion of the course, students will be able to
Syllabus
1. Class and Objects
2. Program using Control Statements
3. Program using different Inheritance
4. Interfaces
5. Packages
6. Program to implement Exception Handling
7. Illustrate Thread Priority
8. Program using Mouse Events
9. Program to implement font class method
10. Illustrate Multithreading Application
Web References
1. http://docs.oracle.com/javase/tutorial/java/
2. http://www.java2s.com/Tutorial/Java/CatalogJava.htm
3. http://www.javatpoint.com/java-swing
4. https://docs.oracle.com/javase/tutorial/collections/intro/
5. http://way2java.com/java-versions-2/jdk-1-8-features/ Pedagogy
Power point Presentations, e-content.
Course Designers1.Ms. M. Gowri Sudha
CO Number CO Statement Knowledge Level
CO1 Recall the fundamentals of Java programming
concepts
K1
CO2 Execute inheritance codes ,packages & collection
interfaces
K2
CO3 Predict the exception occurrence on the code and
handle it efficiently
K3
CO4 Build the user interface of the application and
handle the events by using AWT components
K3
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S M S S
CO2 S S S S
CO3 S S S S
CO4 S S S S
S – Strong; M – Medium; L – Low
19UCS1AC2
NUMERICAL
ANALYSIS
AND
STATISTICS
CATEGORY L T P CREDIT
ALLIED (45+45) 3+3 - 3
Preamble
• To train the students in numerical and statistical problems.
Course Outcomes
On the successful completion of the course, students will be able to
CO
Number CO Statement
Knowledge
Level
CO1 Explain the concept of measures of central tendency and
dispersion
K2
CO2 Apply numerical methods to solve Algebraic, Transcendental
equations and Interpolation
K3
CO3 Compute the numerical solution of ordinary differential
equation by various method
K3
CO4 Solve numerical integration and system of linear equation by
appropriate methods.
K3
CO5 Explain correlation and regression and solve the numerical
problems.
K3
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S S S S
CO2 S S M M
CO3 S S M M
CO4 S S M M
CO5 S S S S
S – Strong; M – Medium; L - Low
Syllabus
UNIT I (18 HOURS)
Solution of Algebraic & Transcendental equations
Introduction - Bisection Method, Method of False Position, Iteration method, Newton Raphson
Method (Problems Only)
Interpolation
Finite differences –Forward , Backward and Central differences – Newton’s formulae for
interpolation - Lagrange’s interpolation formula.
UNIT II (15 HOURS)
Numerical differentiation & Integration
Numerical Integration using Trapezoidal rule and Simpson’s (3
1 and
8
3 ) rules (proof not
needed )
Numerical Linear Algebra
Solutions to Linear Systems –Gauss Elimination and Gauss Jordon method –Iterative methods
(Problems Only)
UNIT III (15 HOURS)
Numerical solution of Ordinary Differential Equations
Introduction - Solution by Taylor Series Method ,Picard’s method of successive approximations,
Euler’s Method, Modified Euler’s Method - Runge - Kutta method- Predictor Corrector Method
-Adams –Moulton method and Milne’s Method.
UNIT IV (15 HOURS)
Measures of Central Tendency
Arithmetic Mean – Median - Mode - Geometric Mean – Harmonic Mean.
Measures of Dispersion
Range- Quartile Deviation - Mean Deviation, Standard Deviation.
UNIT V (12 HOURS)
Correlation
Introduction - Meaning of Correlation – Scattered Diagram – Karl Pearson’s co-efficient
Correlation – Rank Correlation
Linear Regression
Introduction – Linear Regression –Regression Coefficients and its equations (Problems Only)
Text Books
S.No AUTHORS TITLE PUBLISHER
S
YEAR OF
PUBLICATION
1 S.S.Sastry Introductory methods of
Numerical Analysis,
fifth Edition
PHI Learning
private limited
2013
2 Gupta.S.C &
Kapoor, V.K
Fundamentals of
Mathematical Statistics
Sultan Chand
& sons, New Delhi
1994
UNIT CHAPTER TEXT BOOK SECTION
I 2
3
1
2.1 – 2.5
3.3 (Omit 3.3.4), 3.6, 3.9.1
II 6
7
6.4.1 – 6.4.3
7.5.1 & 7.5.3 , 7.6
III 8 8.1 – 8.6 (Omit 8.4.1)
IV 2
2
2.5 – 2.9, 2.13
V 10
11
10.1 – 10.4, 10.7
11.1 & 11.2
Reference Books
S.No AUTHORS TITLE PUBLISHERS YEAR OF
PUBLICATION
1 M.K. Jain, S.R.K. Iyengar
and R.K. Jain
Numerical Analysi
Numerical Methods for
Scientific and
Engineering Computations
New Age
International
Private
Limited
1999
2 C.E. Froberg Introduction to Numerical
Analysis, II Edn. Addison Wesley 1979
Pedagogy
Assignment, Seminar, Lecture, Quiz, Group discussion, Brain storming, e-content.
Course Designers
1. Dr.V.Geetha
2.Dr.S.Sasikala
19UCS2AC3
OPERATIONS RESEARCH
CATEGORY L T P CREDIT
ALLIED 60 4 - 2
Preamble
• To inculcate the basic concepts of Operations Research.
• To practice the students for solving Operation Research Problems
Course Outcomes
On the successful completion of the course, students will be able to
CO
Number CO Statement
Knowledge
Level
CO1 Explain the applications of Operations research. K2
CO2 Solve Linear Programming Problem by graphical method K3
CO3 Classify the different types of Simplex methods K3
CO4 Describe the concepts of Transportation Problem and
Assignment Problem and compute the solution by various
methods
K3
CO5 Compute PERT and CPM in Network Analysis K3
CO6 Determine the solution of Sequencing Problem K4
Mapping with Programme Outcomes
Cos PO1 PO2 PO3 PO4
CO1 S S M M
CO2 S S S S
CO3 M S M M
CO4 S S S S
CO5 S S S S
CO6 S S S S
S – Strong; M – Medium; L - Low
Syllabus
UNIT I
Operations Research (10 HOURS)
Introduction - Basics of OR – OR & decision making –Role of Computers in OR
Linear Programming Problem
Linear programming formulations & graphical solution of two variables – Canonical &
standard forms of LPP
UNIT II (15 HOURS)
Linear Programming Problem
Introduction - Simplex Method for < , = , > constraints – Two phase Simplex method –
Big M Method.
UNIT III (15 HOURS)
Transportation problem
Introduction - Transportation algorithm –Degeneracy algorithm –Degeneracy in
Transportation Problem, Unbalanced transportation problem
Assignment Problem
Introduction - Assignment algorithm –Unbalanced Assignment problem- The Travelling
Salesman Problem.
UNIT IV (10 HOURS)
Sequencing problem
Introduction - Processing of n jobs through two machines – Processing of n jobs through
k machines – processing of two jobs through k machines.
UNIT V (10 HOURS)
Network Scheduling by PERT/CPM
Introduction - Network – Fulkerson’s rule - measure of activity – PERT computation– CPM
computation
Text Book
S.No AUTHORS TITLE PUBLISHERS YEAR OF
PUBLICATION
1
Kanti swarup
P.K.Gupta &
Man Mohan
Operations
Research
Sultan Chand
Publishers, New Delhi 2008
UNIT CHAPTER SECTION
I
1
2
3
1.1 - 1.10
2.1 – 2.4
3.1 – 3.5
II 4 4.1 – 4.4
III
10
11
10.1 -10.3,10.5,10.6 10.8-10.13
11.1 – 11.4,11.7
IV 12 12.1 – 12.6
V 25 25.1 – 25.8
Reference Books
S.NO AUTHORS TITLE PUBLISHERS
YEAR OF PUBLICATION
1 Prem Kumar Gupta
and D.S. Hira,
Operations
Research: An
Introduction
S. Chand and Co., Ltd.
New Delhi 1983
2 Hamdy A. Taha Operations
Research
McMillan Publishing
Company, New Delhi 1982
Pedagogy Assignment, Seminar, Lecture, Quiz, Group discussion, Power point
presentations, Brain storming, e-content.
Course Designers
1. Dr.V.Geetha
2. Dr.S.Sasikala
