QUAID-E-MILLATH

GOVERNMENT COLLEGE FOR

WOMEN (AUTONOMOUS)
ANNA SALAI, CHENNAI 2

PG & RESEARCH DEPARTMENT

OF COMPUTER SCIENCE
B.Sc COMPUTER SCIENCE
SYLLABUS

AUGUST 2020

1
 QUAID-E-MILLATH GOVERNMENT COLLEGE FOR WOMEN
(AUTONOMOUS)
ANNA SALAI, CHENNAI 600 002

MINUTES OF THE BOARD OF STUDIES IN

PG & RESEARCH DEPARTMENT OF COMPUTER SCIENCE

The Board of studies in the PG & Research Department Of Computer Science to pass
syllabi for I to VI Semesters of Bachelor of Science - Computer Science, had a GMeet on 17th
August 2020 at 2.00 p.m. with the meeting id meet.google.com/tmp-rymu-vnt. It was resolved to
pass the syllabi for the B.Sc. Computer Science to be followed from 2020 – 21

S.No. Member Present Name & Designation Signature

Dr. (Mrs.) Ananthi
1 Chairman : Sheshasaayee, Associate Professor
Head of the Department & Head, PG & Research
Department of Computer Science
Dr. PL. Chithra M.Sc., Ph.D.,
Professor,
2 University Nominee Department of Computer Science,
University of Madras, Guindy
Campus,Kotturpuram, Chennai,
Tamil Nadu 600085
Mrs.Tamilselvi.K MCA. M.Phil
Assistant Professor,
3 Subject Expert I Department of Computer Science,
Bharathi Women’s College
(Autonomous)
Broadway, George Town
Chennai-600108.
Dr. (Mrs.) Hannah Vijayakumar
M.C.A., M.Phil., Ph.D.,
4 Subject Expert II Anna Adarsh College for Women,
Annanagar, Chennai 600040
Ms. S. Reenupriya,
M.Phil., Quaid-E-Millath
5 Alumnus Government College for Women
(Autonomous)
Representative from Mrs. Banumathi Palanichami
6 industry of Corporate Senior technical Lead,
sector/ relating to HCL Technologies Ltd.,
placement No. 64 & 66, Second Main Road,
Ambattur Industrial Est.,
Chennai – 600 058
Representative from the
7 present set of students Ms. R. Revathy, II MCA

2
S.No. Member Present Name & Designation Signature

Dr. (Mrs.) K. Nirmala

8 Faculty Member Associate Professor, PG & Research
Department of Computer Science
Dr. (Mrs.) Jasmine Samraj
Faculty Member Associate Professor, PG & Research
9
Department of Computer Science
Dr. (Mrs.)V. Vidyapriya
Faculty Member Associate Professor, PG & Research
10
Department of Computer Science
Dr. (Mrs.). Sumathy Kingslin
11 Faculty Member Associate Professor, PG & Research
Department of Computer Science
Dr. (Mrs.) M. Pushpa
12 Faculty Member Assistant Professor, PG & Research
Department of Computer Science
Dr. (Mrs.) G. Velmayil
13 Faculty Member Assistant Professor, PG & Research
Department of Computer Science
Dr. (Mrs.) R. Jayanthi
14 Faculty Member Assistant Professor, PG & Research
Department of Computer Science
Mrs. K. Vasantha Meena
15 Faculty Member Assistant Professor, PG & Research
Department of Computer Science
Dr.(Mrs) S. Sumitra
16 Faculty Member Guest Lecturer, PG & Research
Department of Computer Science
Mrs. D. Sujatha
17 Faculty Member Guest Lecturer , PG & Research
Department of Computer Science
Dr. (Mrs.)D. Jayaprabha
18 Faculty Member Guest Lecturer , PG & Research
Department of Computer Science
Mrs. M. Uma
19 Faculty Member Guest Lecturer , PG & Research
Department of Computer Science

3
 CONTENTS

Page No.

Rules and regulations for the Programme 5

Programme Outcomes 10

Programme Specific Outcomes 10

Programme Profile 11

Evaluation pattern for CA 13

Rubrics for CA Evaluation 14

Evaluation Pattern for End Semester 15

Course Profile-Semester I 16

Course Profile Semester II 16

Course profile Semester III 16

Course profile Semester IV 17

Course Profile Semester V 17

Course Profile Semester VI 17

4
 Quaid-E-Millath Government College for Women (Autonomous),
Chennai – 600 002.
Undergraduate Courses
Choice Based Credit System
Quaid-E-Millath Government College for Women (Autonomous), offers the Semester System
of Education with credits for UG courses. Credit simply means the weightage given to what is taught
and what is learnt. It is normally related to the number of hours a teacher teaches a particular subject
as well as to the number of hours a student spends learning a subject or carrying out an activity. In
the semester system of study, every academic year is divided into two semester sessions. Each
semester will have a minimum of 90 working days and each day will have 5 working hours.
Differential weightage is given according to the content and duration of the courses in the
curriculum design. Each course is designed variously under lectures / tutorials / laboratory work /
seminar / project work / practical training / viva voce etc to facilitate effective teaching and learning
and the credits are assigned accordingly, depending on the content and the specialization.
The minimum credit requirement for a three – year UG course shall be 140 inclusive of Part IV and
Part V.
REGULATIONS
1. Duration
a. There will be two semesters in each academic year. The first academic year shall comprise
of the first and second semester, the second academic year, the third and fourth semesters
and the third academic year, the fifth and sixth semester.
b. The odd semesters shall consist of the period from June to November of each year and the
even semesters from December to April of each year.

5
 2. Course of Study
The course of study for bachelor Degree Courses shall comprise of the following:
Foundation Courses:

Semester - I Semester - II Semester - III Semester - IV Semester - V Semester - VI

Subject

Subject

Subject

Subject

Subject

Subject
Credit

Credit

Credit

Credit

Credit

Credit
Hours

Hours

Hours

Hours

Hours

Hours
Paper

Paper

Paper

Paper

Paper

Paper
Lang Lang Lang Lang Major 4 Major 4
1 3 4 1 3 4 1 3 6 1 3 6 4 eac 24 3 eac 19
h h

Eng Eng Eng Eng Electiv Electiv 5

1 3 4 1 3 4 1 3 6 1 3 6 e 1 5 5 e 2 eac 10
h
4 4 4 4
Major Major Majo Majo VE VE
+ 1 + + +
2 2 12 r 2 9 r 2 10 1 - 1 1 2 1
4 2 4 4 4

Allied Allied Allie Allie

1 5 6 1 5 6 d 1 5 5 d 1 5 5

NME – NME Soft Soft

I –I Skill Skill
1 2 2 1 2 2 1 3 2 1 3 2
– III – IV

Soft Soft EVS EVS

Skill – Skill –
1 3 2 1 3 2 1 - 2 1 2 1
I II

EXT - 1 -

Total 2 3 Total Total Total Total Total

7 7 24 30 7 22 30 7 25 30 6 21 30 6 24 30
4 0

The courses shall comprise the study of:

i) Part - I Tamil - 6 Credits for B.A. and B.Sc.; 4 Credits for B.Com.
ii) Part – II English – 6 Credits for B.A and B.Sc.; 4 Credits for B.Com.

Part III:
a. Core Subjects (B.A.-79 Credits; B.Sc. - 79 Credits and 91 Credits– B.Com.)
b. Allied Subjects (20 Credits for B.A., B.Sc., and B.Com.)

Part IV:
c. Soft Skill (4 Papers) (8 Credits)
d. Non-Major Elective (2 Papers) (4 Credits)
e. Environmental Studies (2 Credits)
f. Value Education (2 Credits)

6
 Part V:
g. Extension Activities (1 Credit)

3. Compulsory Extension Service

A candidate shall be awarded a maximum of one credit for Compulsory Extension Service.
All students shall have to enroll for NSS/NCC/Sports and Games/Rotary/Youth Red Cross or any
other service organization in the College and shall have to put in compulsory attendance of 40 hours,
which shall be duly certified. If a student lacks 40 hours attendance in the First year, she shall have to
compensate the same during the subsequent years.

7
Distribution of Marks for Continuous Assessment
Part I, Part II and Part III
Best 2 Seminar /
Assign Model Reduced
Test out of Creative Attendance Total
ment Exam to
3 Presentation
20 20 20 40 10 15 25 10 100 25

Test (Best two out of three) : 40 Marks

Assignment/ Seminar /
Creative Presentation : 25 Marks
Model Examination : 25 Marks
Attendance : 10 Marks
Total (Internal) : 100 Marks reduced to 25
Calculation of Attendance Marks

90 – 100% - 10 Marks
80 – 89% - 9 Marks
75 – 79% - 8 Marks
65 – 74% - 7 Marks
55 – 64% - 5 Marks
Below 55% - 0 – Not Eligible

End Semester Examination : Question Paper Format

K1 : 10 x 2 = 20 Marks (10 out of 12)

K2,K3 : 5 x 5 = 25 Marks (5 out of 8)
K3 : 3 x 10 = 30 Marks (3 out of 5)
Total (External) : 75 Marks

8
Part IV:
Semester End Examination : 60 Marks
Continuous Internal Assessment : 40 Marks

Distribution of CA Marks:
Seminar / Assignment / Term
Written / Oral Test Total
Presentation Paper

20 10 10 40

End Semester Examination : Theory Paper – 60 Marks – Duration 2.30 hours.

Question Paper Pattern : 12 x 5 Marks = 60 Marks (12 out of 15)

PATTERN OF QUESTION PAPER

TIME : 3 Hrs MAX.MARKS : 75

SECTION A
Answer any TEN out of TWELVE questions: (10x2=20)
SECTION B
Answer any FIVE out of EIGHT questions: (5x5=25)
SECTION C
Answer any THREE out of FIVE questions: (3x10=30)

5. Passing Minimum
A candidate shall be declared to have passed in each paper/practical of the Main subject of
study wherever prescribed if she secures NOT LESS THAN 50% of the marks prescribed for the
examination.

6. Eligibility for the Award of Degree

Candidates must secure a minimum of 50% of marks in the End Semester examinations and a
minimum of 50% in the aggregate marks (Both End Semester and the Continuous Assessment taken
together).
A candidate must secure 8 credits in soft skills and 2 credit in the internship in addition to the
108 credits from Core and Elective courses to obtain the PG Degree of Master of Computer
Applications.

7. Ranking
Candidates who have passed all the examination prescribed for the course in the FIRST
APPEARANCE alone are eligible for Classification/Ranking/Distinction.

9
 PROGRAMME OUTCOMES (POs)

On completion of the Programme, the learner will be able to:

PO 1 Apply Practical and mathematical skill in all aspects

PO 2 Identify quality knowledge of the subject

PO 3 Utilize the subject knowledge and communication skills to appear for

competitive exams

PO 4 Acquire theoretical, practical and mathematical knowledge

PO 5 Analyse the basic computational skills

PROGRAMME SPECIFIC OUTCOME (PSOs)

PSO 1 Understand the structure and methodological aspects of the computer

system
PSO 2 Apply basic skills and principles in problem solving through various
hands on exercises
PSO 3 Provide advanced knowledge in of computer science to solve real world
problem.

PSO 4 Develop skills in software development

PSO 5 Exhibit proficiency through latest technologies by demonstrating the

programming skill and apply the same for various domain

10
 PROGRAMME PROFILE -B.SC., COMPUTER SCIENCE
SEM SUBJECTS COURSE TITLE OF THE PAPER CREDITS HOURS/ TOTAL CA SE TOTAL
CODE WK HOURS
LANGUAGE – TAMIL - 3 4 90 25 75 100
Language I PAPER - I
English I ENGLISH – PAPER - I 3 4 90 25 75 100
OBJECT ORIENTED 4 6 90 25 75 100
PROGRAMMING USING
Major I C++
I
C++ PROGRAMMING - 4 6 90 25 75 100
MajorII LAB
NUMERICAL AND 5 6 90 25 75 100
Allied I STATISTICAL METHODS
NME I NON MAJOR ELECTIVE 2 2 40 60 100
SS - I SOFTSKILL I 3 2 40 60 100
TOTAL CREDITS FOR SEMESTER I 24
LANGUAGE – TAMIL - 3 4 90 25 75 100
Language II PAPER - II
English II ENGLISH – PAPER - II 3 4 90 25 75 100
4 90 25 75 100
MajorIII DATA STRUCTURES 6
II DATA STRUCTURES 4 6 90 25 75 100
MajorIV USING C++ - LAB
5 6 90 25 75 100
Allied II OPERATIONS RESEARCH
NME II NON MAJOR ELECTIVE 2 2 40 60 100
SS - II SOFTSKILL II 3 2 40 60 100

TOTAL CREDITS FOR SEMESTER II 24

LANGUAGE – TAMIL - 3 6 90 25 75 100

LanguageIII PAPER - III
English III ENGLISH – PAPER – III 3 6 90 25 75 100
JAVA PROGRAMMING 90 25 75 100
III Major V CONCEPTS 4 5
JAVA PROGRAMMING – 4 4 90 25 75 100
Major VI LAB
AlliedIII MATHEMATICS I 5 5 90 25 75 100
SS – III SOFTSKILL III 3 2 40 60 100
ENVIRONMENTAL - 2
EVS I SCIENCE

TOTAL CREDITS FOR SEMESTER III 22

LANGUAGE – TAMIL - 3 6 90 25 75 100

Language IV PAPER – IV
English IV ENGLISH – PAPER – IV 3 6 90 25 75 100
4 90 25 75 100
Major VII PYTHON PROGRAMMING 5
PYTHON PROGRAMMING 4 5 90 25 75 100
Major VII –LAB
5 5 90 25 75 100
IV Allied IV MATHEMATICS II
SS I SOFTSKILL IV 3 2 40 60 100
ENVIRONMENTAL 2 1 40 60 100
EVS II STUDIES
EA EXTENSION ACTIVITIES 1
25
TOTAL CREDITS FOR SEMESTER IV

DIGITAL COMPUTER 4 6 90 25 75 100

Major VIII FUNDAMENTALS
DATABASE 4 6 90 25 75 100
MajorIX MANAGEMENT SYSTEM
V
Major X VISUAL PROGRAMMING 4 6 90 25 75 100
Elective I COMPUTER GRAPHICS 5 5 90 25 75 100
VISUAL PROGRAMMING 4 6 90 25 75 100
Major XI LAB
VE VALUE EDUCATION 1

TOTAL CREDITS FOR SEMESTER V 21

11
SEM PART COURSE TITLE OF THE PAPER CREDITS HOURS/ TOTAL CA SE TOTAL
CODE WK HOURS
Major XII OPERATING SYSTEMS 4 6 90 25 75 100
Major XIII DATA COMMUNICATION 4 7 90 25 75 100
AND NETWORKING
SOFTWARE 5 5 90 25 75 100
VI ENGINEERING AND
Elective II TESTING
Elective III ASP.NET 5 5 90 25 75 100
Major XIV MINI PROJECT 4 6 90 25 75 100
VALUE EDUCATION 2 1 40 60 100
TOTAL CREDITS FOR
SEMESTER VI 24

12
 EVALUATION PATTERN FOR CONTINIOUS ASSESSMENT-UG

INTERNAL VALUATION BY COURSE TEACHER/S

PART I, II AND III-THEORY PAPERS

COMPONENT TIME MAX.MARKS CAMARK

1.TEST I 1 HRS 20 MARKS(TO BE CONVERTED) 20

2. TEST II 1 HRS 20 MARKS (TO BE CONVERTED) 20

3.ASSIGNMENT/SEMINAR/FIELD VISIT 25

4. MODEL EXAMINATION 25

4.ATTENDANCE 10

TOTAL 100

PART III- PRACTICAL PAPERS

COMPONENT MARKS

1.TEST I 1 HRS 20 MARKS(TO BE CONVERTED) 20

2. TEST II 1 HRS 20 MARKS (TO BE CONVERTED) 20

3. RECORD/OBSERVATION 25

4. MODEL EXAMINATION 25

4.ATTENDANCE 10

TOTAL 100

CA QUESTION PAPER PATTERN-UG

Knowledge Section Word Marks Total

Level Limit
K1 A-2X2 marks 50 04
K1, K 2 B-1/1x6marks 200 06 20
K2, K 3 C-1/1x10 marks 500 10

13
 RUBRICS FOR CONTINIOUS ASSESSMENT

Assignment Content/originality/Presentation/Schematic
Representation and Diagram/Bibliography
Seminar Organisation/Subject Knowledge/Visual
Aids/Confidence level/presentation-
Communication and Language
Participation Answering Questions/Clearing
Doubts/Participating in Group
Discussions/Regular Attendance
Case Study Finding the
Problem/Analysis/Solution/Justification
Problem Solving Understanding Concepts/Formula and Variable
Identification/Logical Sequence/Answer
Group Discussion Preparation/Situation Analysis/Relationship
Management/Information Exchange/Delivery
Skills
Flipped/Blended Learning Preparation/Information Exchange/ Group
interaction/Clearing doubts

14
 END SEMESTER EVALUATION PATTERN-UG

THEORY PAPERS
PART I/II/III

SEMSTER I/II/III/IV/V/VI

SINGLE VALUATION BY EXTERNAL EXAMINER

MAXIMUM MARKS: 75

PASSING MARK: 30

PART IV

SINGLE VALUATION

ORAL TEST/WRITTEN TEST

MAXIMUM MARKS: 60

PASSING MARK:24

PRACTICAL PAPERS
PART III

SEMSTER I/II/III/IV/V/VI

DOUBLE VALUATION BY COURSE TEACHER AND EXTERNAL EXAMINER

MAXIMUM MARKS: 75

PASSING MARKS : 30

15
 SEMESTER I COURSE PROFILE - B.Sc., COMPUTER SCIENCE

COURSE TITLE OF THE PAPER CREDITS HOURS/W TOTAL L-T-P CA SA TOTAL

CODE K HOURS
LANGUAGE – TAMIL - 3 4 90 25 75 100
PAPER – I
ENGLISH – PAPER – I 3 4 90 25 75 100
OBJECT ORIENTED 4 90 6-0-0 25 75 100
PROGRAMMING USING 6
C++
C++ PROGRAMMING – 4 6 90 0-0-6 25 75 100
LAB
5 6 90 6-0-0 25 75 100
NUMERICAL AND
STATISTICAL METHODS
NON MAJOR ELECTIVE 2 2 90 40 60 100

SOFTSKILL I 3 2 90 2-0-0 40 60 100

SEMESTER II COURSE PROFILE - B.Sc., COMPUTER SCIENCE

COURSE TITLE OF THE PAPER CREDITS HOURS/WK TOTAL L-T-P CA SA TOTAL

CODE HOURS
LANGUAGE – TAMIL - 3 4 90 25 75 100
PAPER - II
ENGLISH – PAPER - II 3 4 90 25 75 100
4 90 6-0-0 25 75 100
DATA STRUCTURES 6
DATA STRUCTURES 4 6 90 0-0-6 25 75 100
USING C++ - LAB
5 6 90 6-0-0 25 75 100
OPERATIONS
RESEARCH
NON MAJOR ELECTIVE 2 2 90 40 60 100

SOFTSKILL II 3 2 90 2-0-0 40 60 100

SEMESTER III COURSE PROFILE - B.Sc., COMPUTER SCIENCE

COURSE TITLE OF THE PAPER CREDITS HOURS/W TOTAL HOURS L-T-P CA SA TOTAL
CODE K
LANGUAGE – TAMIL - 3 6 90 25 75 100
PAPER - III
ENGLISH – PAPER - III 3 6 90 25 75 100
JAVA PROGRAMMING 4 90 5-0-0 25 75 100
CONCEPTS 5
JAVA PROGRAMMING - 4 4 90 0-0-4 25 75 100
LAB
5 5 90 25 75 100

MATHEMATICS I
SOFTSKILL III 3 2 2-0-0 40 60 100
ENVIRONMENTAL - 2 2-0-0
STUDIES

16
 SEMESTER IV COURSE PROFILE - B.Sc., COMPUTER SCIENCE

COURSE TITLE OF THE PAPER CREDITS HOURS/W TOTAL L-T-P CA SA TOTAL

CODE K HOURS
LANGUAGE – TAMIL - 3 6 90 25 75 100
PAPER - IV
ENGLISH – PAPER - IV 3 6 90 25 75 100

PYTHON PROGRAMMING 4 5 90 5-0-0 25 75 100

PYTHON PROGRAMMING - 4 5 90 0-0-5 25 75 100
LAB
5 5 90 25 75 100

MATHEMATICS II
SOFTSKILL IV 3 2 2-0-0 40 60 100
ENVIRONMENTAL 2 1 1-0-0 40 60 100
STUDIES
EXTENSION ACTIVITIES 1

SEMESTER VCOURSE PROFILE - B.Sc., COMPUTER SCIENCE

COURSE TITLE OF THE PAPER CREDITS HOURS/WK TOTAL L-T-P CA SA TOTAL

CODE HOURS
DIGITAL COMPUTER 4 6 90 6-0-0 25 75 100
FUNDAMENTALS
DATABASE 4 6 90 6-0-0 25 75 100
MANAGEMENT SYSTEM
VISUAL PROGRAMMING 4 6 90 6-0-0 25 75 100

COMPUTER GRAPHICS 5 5 90 5-0-0 25 75 100

4 6 90 0-0-6 25 75 100
VISUAL PROGRAMMING
LAB
1 1-0-0

VALUE EDUCATION

SEMESTER VI COURSE PROFILE - B.Sc., COMPUTER SCIENCE

COURSE TITLE OF THE PAPER CREDITS HOURS TOTAL L-T-P CA SA TOTAL

CODE /WK HOURS
OPERATING SYSTEMS 4 6 90 6-0-0 25 75 100
DATA COMMUNICATION 4 7 90 7-0-0 25 75 100
AND NETWORKING
SOFTWARE ENGINEERING 5 5 90 5-0-0 25 75 100
AND TESTING
ASP.NET 5 5 90 5-0-0 25 75 100
4 6 90 0-0-6 25 75 100

MINI PROJECT
VALUE EDUCATION 2 1 1-0-0 40 60 100

17
 SEMESTER I

OBJECT ORIENTED PROGRAMMING USING C++

TOTAL HOURS: 90 hrs COURSE CODE:

CREDITS: 4 L-T-P: 6-0-0

COURSE OBJECTIVES:
1. To understand the object oriented concepts.
2. To learn the basic concepts like Object, Class and bottom-up approach.
3. To understand how to produce object-oriented software using C++
4. To understand and implement the principles like Abstraction, Data Hiding, Dynamic Binding,
Polymorphism and Inheritance.
5. To understand features of C++ specifically stream I/O, File I/O.

COURSE OUTLINE:
UNIT I 15 Hrs.
Principles of Object Oriented Programming (OOP): Software Evolution – OOP paradigm – Basic
concepts of OOP – Benefits of OOP – Object Oriented Languages – Applications of OOP.

UNIT II 15 Hrs.
Introduction to C++: Tokens- Keywords- Identifiers- Variables- Datatypes- Operators-Manipulators-
Expressions- Control Structures in C++- Functions in C++ - Main Function - Type conversions –
Function prototyping – Parameter Passing in Functions – Default Arguments – Values Return by
Functions – Inline Functions – Friend Function.

UNIT III 20 Hrs.

Classes and Objects - Constructors and Destructors - Operator Overloading - Function overloading.

UNIT IV 20 Hrs.
Inheritance: Single inheritance – Multilevel inheritance – Multiple inheritance- Hierarchical
inheritance – Hybrid inheritance- Virtual Base class- Abstract class-Pointers-Virtual functions and
Polymorphism- Managing console I/O Operations.

UNIT V 20 Hrs.
Working with files: Classes for file stream operations – opening and closing file - End of file
deduction – File pointers –Sequential input and output operations- Updating a file – Error handling
during file operations.
18
BOOKS FOR STUDY
1. E.Balaguruswamy, “Object Oriented Programming with C++”, Sixth Edition, TMH, 2013
2. Ananthi Sheshasaayee &Sheshasaayee, “C++ Programming”, Margham publications, 2006.

REFERENCE BOOKS
1. YashvantKanetkar, “Let us C++”, BPB Publishers, 2010.
2. H.Schildt, “C++: The complete Reference”, Fourth Edition, 2003
3. Johnston, C++ programming today, PHI, New Delhi, 2002.
4. J.P. Cohoon and J.W. Davidson, C++ Program Design – An Introduction to Programming and
Object-oriented Design, 2nd Edition, Tata McGraw-Hill, New Delhi,1999.
5. A. N Kanthane, Object Oriented Programming with ANSI & Turbo C++ , Pearson Education,
New Delhi,2005.

JOURNALS:
1. C/C++ Users Journal
2. Journal of Software Engineering and Applications

E-LEARNING RESOURCES:
1. https://hackr.io/tutorials/learn-c-plus-plus
2. http://www.cplusplus.com
3. http://www.informit.com/articles/index.aspxst=60233
4. http://www.doc.ic.ac.uk/wjk/C++Intro/
5. http://www.fredosaurus.com/notes-cpp/oop-classes/oop.html

COURSE OUTCOMES:
CO Number CO STATEMENT
Gain a clear understanding of the basic concepts of C++along
CO 1
with the applications..
Gain knowledge in developing secured object oriented
CO 2
application using functions
Acquirement of technical skills to elucidate the overloading
CO 3
mechanism.
Apply different types of inheritance to solve the given
CO 4
problems.
CO 5 Analyze file operations in C++ programming.

19
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
CO / PSO PSO 1 PSO 2 PSO 3 PSO4 PSO5
CO 1 3 2 3 2 2
CO 2 3 2 2 3 2
CO 3 3 3 3 3 3
CO 4 3 3 3 3 3
CO 5 3 3 3 2 3
AVERAGE 3 2.6 2.4 2.2 2.4
KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-
1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk
Problem Solving

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

20
 SEMESTER I

C++ PROGRAMMING - LAB

TOTAL HOURS: 90 HRS COURSE CODE:

CREDITS: 4 L-T-P: 0-0-6

COURSE OBJECTIVES:
1. To develop skills in design and implementation of classes and objects
2. To learn and implement looping structures and functions
3. To learn and implement inheritance concepts.
4. To learn and implement overloading functions
5. To learn and implement file concepts.

LIST OF PROGRAMS:
1. Simple program using C++ constructs.
2. Programs Implementing the looping structures
3. Working with control structures.
4. Working with functions
5. Working with inline functions
6. Working with Default arguments in functions
7. Simple program to create and implementing classes and objects
8. Working with constructors
9. Working with Simple Inheritance
10. Working with multilevel inheritance
11. Working with multiple inheritance
12. Working with virtual functions
13. Working with function overloading
14. Working with function overriding
15. Working with operator overloading
16. Program using pointers
17. Working with abstract class
18. Working with Sequential file input and output operations

E-LEARNING RESOURCES:
1.https://hackr.io/tutorials/learn-c-plus-plus
2.http://www.cplusplus.com
3.https://www.sanfoundry.com

21
 4.https://www.programiz.com
5.http://www.fredosaurus.com/notes-cpp/oop-classes/oop.html

COURSE OUTCOMES:
CO Statements
CO No.
CO 1 Writing applications using classes and objects
CO 2 Develop applications using functions
CO 3 Writing programs using inheritance.
CO 4 Apply overloading techniques for an application
CO4 Develop applications using files

MAPPING- CO with PSO

CO / PSO PSO 1 PSO 2 PSO 3 PSO4 PSO5
CO 1 3 3 2 2 2
CO 2 3 3 2 2 3
CO 3 3 3 3 3 2
CO 4 2 3 3 2 3
CO 5 3 2 3 2 3
Average 2.8 2.8 2.6 2.2 2.6
Key: Strongly Corelated-3, Moderately Corelated-2, Weakly Corelated-1, No Corelation-0

TEACHING METHODOLOGY:
Lecture (Chalk and Talk-OHP-LCD)
Problem Solving and Techniques

Practical question paper will be framed by the External Examiner from the practical question
bank kept in the Department.

22
 SEMESTER I

NUMERICAL AND STATISTICAL METHODS

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 5 L-T-P: 6-0-0

COURSE OBJECTIVES:

1. To study the different methods using algebraic and transcendental equation.

2. To study the correlation and rank correlation in statistical methods.
3. To understand a detailed concepts of sampling.
4. To study the Large samples and Chi-square
5. To study Analysis of Variance in One way and Two way classification methods.

COURSE OUTLINE

UNIT I 15 Hrs.
Solutions Of Algebraic And Transcendental Equations – Bisection Method, Iteration Method,
Regular Falsi Method, Newton–Raphson Method – Solution Of Simultaneous Linear Equations –
Gauss–Elimination Method, Gauss–Siedel Method - Numeric Integration using Trapezoidal,
Simpsons’s one–third, three–eighths formula

UNIT II 15 Hrs
Correlation coefficient – Rank Correlation coefficient of determination – Method of Least Squares –
Fitting of the curve of the form ax+b, ax2+bx+c, ax3+bx2+cx +d

UNIT III 20 Hrs.

Concept of sampling – Methods of sampling – Simple random sampling – Systematic sampling and
stratified random sampling (descriptions only) – concepts of sampling distributions and standard
error – point estimation (concepts only) – Interval estimation of mean and proportion – Tests of
Hypotheses – Critical region – Two types of Errors – Level of Significance – Power of the test.

UNIT IV 20 Hrs.
Large sample tests for mean and proportion – Exact tests based on Normal, T, F and Chi–square
distributions.

23
UNIT V 20 Hrs.
Basic principles of experimentation – Analysis of variance – One way and two way classifications.

BOOKS FOR STUDY

1. P Singaravelu, Numerical Methods, Meenakshi Agency, 2014
2. S P Gupta, Statistical Methods, Sulthan Chand and Sons Publishers, 2011

REFERENCE BOOKS
1. E. Balagurusamy, Numerical Methods, TMH, 2004
2. V. Rajaraman, Computers Oriented Numerical Methods, Second Edition, EEE, 2008
3. AK. S. Trivedi – Probability and Statistics with reliability Queuing and computer Science
Applications , Prentice Hall India, EEE, 2012
4. SantSharan Mishra, Computer Oriented Numerical and Statistical Methods, PHI
publication,2013
5. Kamlendrakumar and Rakesh Kumar, Computer Based Numerical and Statistical Techniques,
CBS publishers.

JOURNALS:
1. A New Approach of Newton’s Method using Simpson’s Rule
2. Using ANOVA to Examine the Relationship between Safety & Security and Human
Development.

E-LEARNING RESOURCES:
1. http://www.bspublications.net/downloads/0523a9f25106ff_M_III_ch_1.pdf
2. https://www.statisticssolutions.com/correlation-pearson-kendall-spearman/
3. https://statisticsbyjim.com/hypothesis-testing/types-errors-hypothesis-testing/
4. http://sphweb.bumc.bu.edu/otlt/MPH-Modules/BS/BS704_HypothesisTest-Means-
Proportions/BS704_HypothesisTest-Means-Proportions_print.html
5. http://cba.ualr.edu/smartstat/topics/anova/example.pdf

COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Understand and apply the basic concepts of Numerical analysis.
CO 2 Provides basic knowledge in statistics using correlation
CO 3 Develop the skills in logical using sampling methods
CO 4 Understand the different methods applied for different data
CO 5 Exhibit proficiency through demonstrating the statistical methods

24
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5

CO1 3 1 2 1 1
CO2 3 2 2 3 3
CO3 3 2 2 3 3
CO4 3 2 2 3 3
CO5 3 2 1 2 0
AVERAGE 3 1.8 1.8 1.8 2

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture (Chalk and Talk-LCD)

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1. K 2 B-5/7x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

25
 SEMESTER II

DATA STRUCTURES

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 6-0-0

COURSE OBJECTIVES:

1. To introduce the fundamental concepts of linear and non-linear data structures and emphasize its
importance in solving real world problems.
2. To formulate new solutions for programming problems and improve existing code using the
concepts of various linear and nonlinear data structures.
3. To impart skills in developing and implementing efficient data structure algorithm using C++
programming.
4. To choose and apply appropriate data structures for a specified application.
5. To understand the ADT including List, Stack, Queues.

COURSE OUTLINE:

UNIT I 15 Hrs.
Primary Data Structures – Secondary Data Structures - Abstract Data Types – List ADT – Arrays -
Representation of Arrays - Operations on Arrays - Polynomials - Multi-dimensional Arrays

UNIT II 15 Hrs.
Singly Linked Lists - Doubly Linked Lists - Circular Linked lists - Stacks – Representation of Stack -
Using Arrays – using Linked List - Queues – Representation of Queue - using Arrays – using Linked
List - Circular Queues – Using Arrays - Application of Stack and Queue.

UNIT III 20 Hrs.

Trees – Binary Trees - Binary tree Representations - Binary Tree traversals – Conversion of General
tree to Binary Tree - Binary Search Trees – Creating Binary Search Tree - Application of Trees -
Expression trees

UNIT IV 20 Hrs.
Introduction to Graphs - Representation of Graphs – Graph Traversals – Depth First – Breadth First -
Application of Graph – Bi – Connectivity in Graph - Minimum Spanning Tree - Kruskal’s Algorithm
– Prim’s Algorithm - Shortest Path Algorithm – Dijkstra’s Algorithm

UNIT V 20 Hrs.
Hashing – Truncation methods – Folding Methods – Mid-Square Methods – Division Methods –
Collision Resolution Technique – Open Addressing – Linear and Quadratic Probing - Sorting –

26
Bubble Sort – Selection Sort - Insertion sort – Heap Sort – Radix Sort - Searching Algorithms –
Linear Search – Binary Search

BOOK FOR STUDY

1. P. Sudharsan, J. John Manoj Kumar, “Data Structures &Algorithm”m RBA Publications,
2009
2. E.Horowitz, S.Sahni and Mehta- “Fundamentals of Data Structures in C++” -Galgotia-1999,
Reprint 2006

REFERENCE BOOK
1. Seymour Lipschutz, Data Structures with C,1st Edition, Schaum’s Outline Series in
Computers, Tata McGraw Hill.
2. E. Balagurusamy, Data structures using C, Tata McGraw Hill Reprint,2015.
3. A.K Sharma, Data structures using C,Pearson Education,2013.
4. Gregory L.Heileman,”Data Structures, Algorithms and Object Oriented
Programming”,McGraw Hill international Editions ,1996.
5. M. A. Weiss, Data Structures and Algorithm Analysis in C, Pearson Education,2013.

JOURNALS
1. International Journal of Data Structures
2. International Journal of Science and Research

E-LEARNING RESOURCES
1. https://www.hackerearth.com/practice/data-structures/queues/basics-of-queues
2. http://www.c4learn.com/data-structure/stack-operations
3. https://stacktips.com/tutorials/c/sorting-methods-in-data-structures
4. https://www.programiz.com/dsa/linked-list
5. http://btechsmartclass.com/data_structures/binary-tree-traversals.html

COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Discuss various array operations, sorting and searching techniques
in formulating new solutions to solve the real world problems.
CO 2 Analyze different types of linked list and its operations to meet the
user specified software needs.
CO 3 Demonstrate the application of stack operations, evaluation and
conversion of expression in designing software procedures based
on changing needs.
CO 4 Asses the ability to design, evaluate queue operations and its
implementation in multi domain applications.
CO 5 Exposure to development of problem solving applications utilizing
the learned concepts of tree and graph data structures.

27
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
PSO 1 PSO 2 PSO 3 PSO 4 PSO 5
CO/PSO
CO1 3 3 3 3 3
CO2 3 3 2 2 3
CO3 3 3 3 3 3
CO4 3 2 3 3 3
CO5 3 3 3 2 3
AVERAGE 3 2.8 2.8 2.6 3

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

28
 SEMESTER II

DATA STRUCTURES LAB using C++

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 0-0-6

COURSE OBJECTIVES:

1. To design and analyze suitable algorithm for the real world application based on time and space
efficiency of the data structure.
2. To design and develop real world application using appropriate data structures using C++.
3. To design data structure using Linear data structure. Determine and analyze the complexity of
given Algorithms.
4. To design data structure using Non-Linear data structure Determine and analyze the complexity
of given Algorithms.
5. To understand and design the searching and sorting algorithms.

LIST OF PROGRAMS
1. Program to Implementation basic operations on Stack using Arrays
2. Program to Implementation Recursion
3. Program to Implementation basic operations on Queue using Arrays.
4. Program to Implementation basic operations on Circular Queue using Arrays.
5. Program to convert the Infix Expression to Postfix.
6. Program to add Polynomial expression using Arrays.
7. Program to implement insertion and deletion operations on a Linked List
8. Program to Implementation of Stack using Linked list
9. Program to Implementation of Queue using Linked list
10. Program to implement insertion and deletion operations on a Doubly Linked List
11. Program to implement insertion and deletion operations on a Circularly Linked List
12. Program to create a binary search tree and traverse the tree using recursion.
13. Program to traverse a graph breadth first search
14. Program to traverse a graph depth first search
15. Program to implement linear search.
16. Program to implement binary search
17. Program to sort the set of data using selection sort
18. Program to sort the set of data using Bubble sort

29
E-LEARNING RESOURCES
1. https://www.includehelp.com/c-programming-data-structure-examples.aspx
2. https://cplusplus.happycodings.com/beginners-lab-assignments/

COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Using the concept of arrays in data structures
CO 2 Evaluate polynomial expression

CO 3 Learn the concept of tree traversal algorithms

CO 4 Learn the concept of graph traversal algorithms

CO 5 Learn the concept of searching and sorting algorithms

MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5

CO1 3 3 3 3 3
CO2 3 3 2 2 3
CO3 3 3 3 3 3
CO4 3 2 3 3 2
CO5 2 3 3 2 3
AVERAGE 2.8 2.8 2.8 2.6 2.8

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0
TEACHING METHODOLOGY:
Lecture (Chalk and Talk-OHP-LCD)
Problem Solving and Techniques
Practical question paper will be framed by the External Examiner from the practical question
bank kept in the Department.

30
 SEMESTER II
OPERATIONS RESEARCH
TOTAL HOURS: 90Hrs COURSE CODE:

CREDITS: 5 L-T-P: 6-0-0

COURSE OBJECTIVES:
1. To study andunderstand the basics of Operations Research and Linear Programming Problem
with their methods.
2. To understand, analyze and solve the various models in Transportation problem.
3. To understand, analyze and solve the various models in Assignment problem.
4. To understand, analyze and solve the various models in Sequencing problem.
5. To understand, analyze and solve the various models in Networking problem.

COURSE OUTLINE:

UNIT I 15 Hrs.
Linear Programming: Operations Research: Classification of Models – Phases – Linear
Programming Formulation and Graphical Method: Mathematical Formulation – Graphical Method –
Advantages and Limitations of LPP – General LPP: Simplex Method. (Simple problems)

UNIT II 15 Hrs.
Transportation Model:Definition – Formulation of transportation models – Methods for Initial
Basic Feasible Solution: North West Corner Rule, Least Cost Method, Vogel’s approximation
methods – Transportation Algorithm: MODI Method – Degeneracy – Unbalanced – Maximization
case in TP. (Simple problems)

UNIT III 20 Hrs.

Assignment Model: Definition – Mathematical formulation - comparison with transportation model
– Hungarian Method – Unbalanced – Maximization case in AP- Restrictions in Assignment –
Travelling Sales. (Simple problems)man Problem

UNIT IV 20 Hrs.
Sequencing Model: Sequencing problems: Definition - Processing each n jobs on 2 machines – n
jobs on 3 machines – n jobs on m machines. (Simple problems)

31
UNIT V 20 Hrs.
Scheduling: Scheduling by PERT and CPM: Introduction – Basic Terminologies – Rules for
constructing a project network - Network diagram – Network Computations - CPM – Floats – PERT
– Difference between PERT and CPM. (Simple problems)

BOOKS FOR STUDY

1. Sundaresan. V, Ganapathy Subramanian K S, Ganesan K, “Resource Management Techniques”,

A.R. Publications, Fourth Edition, 2009
2. Kalavathy S, “Operations Research”, VIKAS Publications, Second Edition, 2007
REFERENCE BOOKS
1. Anderson, “Quantitative methods for business”, Thomson learning, Eighth edition, 2002
2. Winston, “Operations research”, Thomson learning, 2003
3. H. A. Taha, “Operations Research”, PHI, 2002.
4. KantiSwarup , P.K. Gupta , Man Mohan , “ Operations Research “, Sultanchand ,2014.
5. Hamdy. A. Taha, "Operations Research- An Introduction", Pearson publications, Tenth Edition,
2017
JOURNALS:
1. International Journal of Operational Research
2. Journal of the Operational Research Society

E-LEARNING SOURCES
1. http://ir.library.oregonstate.edu/xmlui/bitstream/handle/1957/20086/em8720-e.pdf
2. http://www.slideshare.net/chandan9211/solving-transportation-problem-in-operations-research
3. https://www.zeepedia.com/read.php?assignment_problems_solution_of_an_assignment_problem
_operations_research&b=66&c=37
4. http://www.universalteacherpublications.com/univ/ebooks/or/Ch14/intro.htm
5. https://www.youtube.com/watch?v=vUMGvpsb8dc

COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Formulate and solve Linear Programming Problem in different situations
like production, distribution of goods and economics that needs decision.
CO 2 Interpret and apply various transportation methods to solve the issues
regarding transfer of goods to obtain the maximum profit.
CO 3 Explore the usage and applications of assignment problem to obtain
optimal solution for business decision problems.
CO 4 Determine the effectiveness of solving sequencing problem to synchronize
with the latest trends and demands from the industry.
CO 5 Construct network diagrams and implement PERT and CPM methods to
plan, schedule and control project activities to meet the needs of corporate
sector.
32
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
PSO 1 PSO 2 PSO 3 PSO 4 PSO 5
CO/PSO
CO1 2 2 2 2 3
CO2 2 2 3 2 3
CO3 2 2 3 3 3
CO4 2 2 3 3 3
CO5 2 2 1 1 1
AVERAGE 2 2 2.4 2.2 2.6

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk
Problem Solving

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special Instructions if
Level Limit any
K1 A-10X2 marks 50 20 75 Two questions from each
Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each unit

33
 SEMESTER III

JAVA PROGRAMMING CONCEPTS

TOTAL HOURS: 90Hrs COURSE CODE:

CREDITS: 4 L-T-P: 5-0-0

COURSE OBJECTIVES:
1. To Understand the concepts of OOP’s principles
2. To Understand Java application concepts to develop console applications
3. To Understand the basics of concurrent programming.
4. To Learn the applet programming and design GUI based applications
5. To Learn and implement the concepts of Applet .

COURSE OUTLINE

UNIT I 15 Hrs.
Introduction to Java-Features of Java - Object Oriented Concepts - Lexical Issues -Data types -
Variable – Arrays – Operators - Control statements - Looping structures.

UNIT II 15 Hrs.
Classes-objects-Constructors-Overloading method-Access control- Static and fixed Methods -Inner
classes- Inheritance-Overriding methods- abstract class.

UNIT III 15 Hrs.

Packages-Creating packages - Importing Packages - Interfaces – Creating and using interfaces -
String class – String Buffer Class - Exception Handling- Exception Type – Try Block and Catch
Block - Throw and Throws – Finally Block – User Defined Exception- Utility Packages.

UNIT IV 20 Hrs.
Concurrent programming - Java Threads – Life Cycle - Thread Synchronization – Messaging -
Runnable Interface - Inter Thread Communication – Deadlock – Suspending, Resuming and
stopping threads – Multithreading - I/O Streams - File streams.

34
UNIT V 20 Hrs.
Applets – Applet Life cycle – Drawing Images – Graphics - AWT and Event handling – Components
– AWT controls-Layout Managers - Frames - Menus.

BOOKS FOR STUDY

1. P.Naughton and H.Schildt, “Java 2 The Complete reference”, TMH, Fifth Edition, 2009
2. R.Krishnamoorthy and S. Prabhu –“ Internet and Java Programming”, New Age International
Publishers, 2013

REFERENCE BOOKS
1. C. Muthu, “Essentials of Java Programming”, Vijay Nicole, 2009
2. E. Balagurusamy, “Programming with Java”, TMH, Fifth Edition, 2014
3. K.Arnold and J.Gosling, The Java Programming Language, Second Edition.
4. Cay S.Horstmann, Gary Cornell, Core Java 2 Volume I – Fundamentals, Addison Wesley.
5. Deitel and Deitel, “Java – How to program”, Addison Wesley Press

JOURNALS:
1. International journal of Science and Engineering
2. Elsevier journal –Science of Computer Programming

E-LEARNING SOURCES:
1. https://beginnersbook.com › 2013/12 › java-strings
2. https://caveofprogramming.com › java-string-working-with-strings-in-java
3. https://www.javatpoint.com › exception-handling-in-java
4. https://www.sitesbay.com › java › java-applet
5. https://www.journaldev.com

35
COURSE OUTCOMES
CO No. CO Statement
Write, compile, and execute Java programs that may include basic
CO 1
data types and control flow constructs
CO 2 Learnt the concept of oops principles and its usage
To understand importance of Multi-threading & different exception
CO 3
handling mechanisms.
CO 4 To learn the concepts of handling String and StringBuffer functions
To learn experience of designing, implementing, testing, and
CO 5 debugging graphical user interfaces in Java using applet and AWT
that respond to different user events

MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME

CO / PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5
CO 1 3 3 3 1 2
CO 2 3 2 2 3 3
CO 3 3 3 3 3 3
CO 4 3 3 2 3 2
CO 5 3 2 3 2 3
Average 3 2.6 2.6 2.4 2.6
KEY:STRONGLY CORELATED-3 MODERATELY CORELATED-2WEAKLY CORELATED-1
NO CORELATION-0

TEACHING METHODOLOGY:
Lecture (Chalk and Talk-OHP-LCD)
Problem Solving and Techniques

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1. K 2 B-5/7x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

36
 SEMESTER III

JAVA PROGRAMMING-LAB

TOTAL HOURS: 90 Hrs COURSE CODE:

CREDITS: 4 L-T-P: 0-0-4

COURSE OBJECTIVES:

1.To understand the OOPS concept and how to apply in programming.

2.To realize and apply the fundamentals core java
3. To Implement the concepts of Packages using Java
4. To perform event handling for computing.
5.To develop Java based Web Application programs.

List of Programs:
1. Simple program using buffered Reader.
2. Implementing the looping structures
3. Working with control structures.
4. Working with arrays
5. Simple program to create and implement a class
6. Working with Inheritance
7. Working with Overloading
8. Working with Overriding
9. Create and Implement a package
10. Implementing an Interface
11. Working with Exception , Multiple Exception and User defined Exception
12. Creating a thread using Thread class
13. Creating a thread using Runnable Interface
14. Working with Thread Synchronization
15. Implementing with string and string Buffer
16. Working with a I/O package
17. Working with Utility package
18. Simple Applet Programming
19. Simple Event Handling
20. Plotting images
37
 21. Working with Frames
22. Working with Swings
BOOKS FOR STUDY:
1. E. Balagurusamy, “Programming with Java”, TMH, Fifth Edition, 2014
2. R.Krishnamoorthy and S. Prabhu –“ Internet and Java Programming”, New Age International
Publishers, 2013

REFERENCE BOOKS
1. P.Naughton and H.Schildt, “Java 2 The Complete reference”, TMH, Fifth Edition, 2009
2. C. Muthu, “Essentials of Java Programming”, Vijay Nicole, 2009
3. Deitel and Deitel, “Java – How to program”, Addison Wesley Press
4. YashavantKanetkar, “Let Us Java”, BPB Publication, 2017
5. Daniel Liang Y, “ Introduction to Java Programming”, Pearson Publications

JOURNALS:
1. International journal of Science and Engineering
2. Elsevier journal –Science of Computer Programming

E-LEARNING SOURCES:
1. https://mindmajix.com/control-statements-in-java
2. http://www.javatechblog.com/java/method-overloading-and-overriding-in-java-example/
3. https://www.geeksforgeeks.org/output-java-program-set-12exception-handling/
4. https://www.java-examples.com/applet
5. http://www.toves.org/books/java/ch24-swing/index.html
COURSE OUTCOMES
CO No. CO Statement
Understand Java programs that may include basic data types and control
CO 1
flow constructs
Learn the concept of oops principles and implement in real world
CO 2
applications
CO 3 Develop applications using exception, thread concepts
CO 4 Learnt application development using String and StringBuffer functions
Able to design, implement, test, and debug graphical user interfaces in
CO 5
Java using applet and AWT that respond to different user events

38
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
CO / PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5
CO 1 3 1 3 1 2
CO 2 3 3 2 3 3
CO 3 3 3 3 3 3
CO 4 3 3 2 3 2
CO 5 3 2 3 2 3
Average 3 2.4 2.6 2.4 2.6
KEY:STRONGLY CORELATED-3 MODERATELY CORELATED-2WEAKLY CORELATED-1
NO CORELATION-0

TEACHING METHODOLOGY:
Lecture (Chalk and Talk-OHP-LCD)
Problem Solving and Techniques

Practical question paper will be framed by the External Examiner from the practical question
bank kept in the Department

39
 SEMESTER IV

PYTHON PROGRAMMING

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 5-0-0

COURSE OBJECTIVES:

1.Understand why Python is a useful scripting language for developers.

2.Learn how to design and program Python applications.
3.Learn how to use lists, tuples, and dictionaries in Python programs.
4.Learn how to use conditional statements and looping in Python
5.Learn how to create program using functions and procedures in Python.

COURSE OUTLINE

UNIT I 15 Hrs.
Welcome to Python: What is Python? – Origins – Features.Getting Started:Program Output
statement – Program Input function – Comments – Operators – Variables and assignments – code
blocks use indentation. Python Basics: Statements and syntax – Variable Assignment –
Identifiers.Numbers: Introduction – Integers – Double Precision Floating Point Numbers – Complex
Numbers – Operators – Built-in functions for all numeric types.

UNITII 15 Hrs.
Sequences: Strings, Lists and Tuples: Sequences – Strings – Strings and Operators – String-Only
Operators – Built-in Functions – String Built-in Methods – Lists – Operators - Built-in Functions –
List Type Built-in Methods – Tuples – Tuple Operators and Built-in Functions.

UNIT III 20 Hrs.

Mapping and Set Types: Dictionaries – Mapping Type Operators – Mapping Type Built-in
Functions and Built-in Methods – Dictionary Keys – Set Types - Set Type Operators – Set Type
Built-in Functions and Built-in Methods.

UNIT IV 20 Hrs.
Conditionals and Loops: If statement – else statement – elif statement – Conditional expressions –
while statement – for statement – break statement – continue statement – pass statement.

40
UNIT V 20 Hrs.
Functions and Functional Programming: What are functions? – Calling Functions – Creating
Functions – Passing Functions – Formal Arguments – Variable-Length Arguments–Variable Scope -
Recursion.

BOOKS FOR STUDY

1. Wesley J. Chun (2007), “Core Python Programming”, 2nd Edition, Pearson Education LPE, New
Delhi.
2. Mark Summerfield, “Programming in Python 3- A Complete Introduction to the Python
Language”, 2nd Edition, Addison-Wesley Professional, 2010

REFERENCE BOOKS
1. Ashok NamdevKamthane and Amit Ashok Kamthane, Programming and Problem Solving with
Python,McGraw Hill, 2017
2.ShethalThaneja, Naveen Kumar,Python Programming a Modular Approach,Pearson, 1st Edition.
3.Lutz Mark, Programming Python, O’Relly
4. Harsh Bhasin, Python for Beginners,New Age International Publication,2019
5. StefMaruch, AahzMaruch, Python for Dummies, 1st Edition.

JOURNALS
1.https://iopscience.iop.org/article
2.https://journals.indexcopernicus.com
E-LEARNING SOURCES:
1. https://www.tutorialspoint.com/python/python_gui_programming.htm
2. https://docs.python.org/2/tutorial/
3. https://wiki.python.org/moin/IntroductoryBooks
4. https://www.learnpython.org/
5. https://my.safaribooksonline.com/book/programming/9781933988498
COURSE OUTCOMES
CO No. CO Statement
CO 1 Understood the basic programming techniques of python
CO 2 Able to write programs using python functions and procedures
CO 3 Understood the concept of strings, string functions of python
CO 4 Learnt about using conditional and looping statements in python
CO 5 Able to write python programs using recursion

41
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
CO / PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5
CO 1 3 3 3 1 2
CO 2 3 2 2 3 3
CO 3 3 3 3 3 3
CO 4 3 3 2 3 2
CO 5 3 2 3 2 3
Average 3 2.6 2.6 2.4 2.6
KEY:STRONGLY CORELATED-3 MODERATELY CORELATED-2WEAKLY CORELATED-1
NO CORELATION-0

TEACHING METHODOLOGY:
Lecture (Chalk and Talk-OHP-LCD)
Problem Solving and Techniques

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1. K 2 B-5/7x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

42
 SEMESTER IV
PYTHON PROGRAMMING LAB

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 0-0-5

COURSE OBJECTIVES:

1.To learn how to implement mathematical and array operations in python.

2.Learn how to design and program using strings..
3.Learn how to use lists, tuples, and dictionaries in Python programs.
4.Learn how to use conditional statements and looping in Python
5.Learn how to create functions and procedures in Python.
List of programs

1. Develop a Python program to implement mathematical operations.

2. Develop a Python program to implement Array operations.
3. Develop a Python program to implement String functions.
4. Develop a Python program to implement List operations.
5. Develop a Python program to implement Tuple operations.
6. Develop a Python program to implement Dictionary operations
7. Develop a Python program to implement Set operations
8. Develop a Python program to implement Conditional Statements.
9. Develop a Python program to implement Control structures
10. Develop a Python program using functions.
BOOKS FOR STUDY
1. Wesley J. Chun (2007), “Core Python Programming”, 2nd Edition, Pearson Education LPE,
New Delhi.
2. Mark Summerfield, “Programming in Python 3- A Complete Introduction to the Python
Language”, 2nd Edition, Addison-Wesley Professional, 2010

REFERENCE BOOKS
1. Ashok NamdevKamthane and Amit Ashok Kamthane, Programming and Problem Solving with
Python,McGraw Hill, 2017
2. ShethalThaneja, Naveen Kumar,Python Programming a Modular Approach,Pearson, 1st Edition.
3. Lutz Mark, Programming Python, O’Relly
43
4. Harsh Bhasin, Python for Beginners,New Age International Publication,2019
5. StefMaruch, AahzMaruch, Python for Dummies, 1st Edition.

JOURNALS
1.https://iopscience.iop.org/article
2.https://journals.indexcopernicus.com

E-LEARNING SOURCES:
1. https://www.tutorialspoint.com/python/python_gui_programming.htm
2. https://www.learnpython.org/
3. https://my.safaribooksonline.com/book/programming/9781933988498
4. https://www.geeksforgeeks.org/python-programming-examples/
5. https://www.programiz.com/python-programming/examples

COURSE OUTCOMES
CO No. CO Statement
CO 1 Understood the basic programming techniques of python
CO 2 Able to write programs using python functions and procedures
CO 3 Understood the concept of strings, string functions of python
CO 4 Learnt about using conditional and looping statements in python
CO 5 Able to write python programs using recursion

MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME

CO / PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5
CO 1 3 3 3 1 2
CO 2 3 2 2 3 3
CO 3 3 3 3 3 3
CO 4 3 3 2 3 2
CO 5 3 2 3 2 3
Average 3 2.6 2.6 2.4 2.6
KEY:STRONGLY CORELATED-3 MODERATELY CORELATED-2WEAKLY CORELATED-1
NO CORELATION-0

44
TEACHING METHODOLOGY:
Lecture (Chalk and Talk-OHP-LCD)
Problem Solving and Techniques

Practical question paper will be framed by the External Examiner from the practical question
bank kept in the Department

45
 SEMESTER V
DIGITAL COMPUTER FUNDAMENTALS

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P:6-0-0

COURSE OBJECTIVES:
1. To teach students the theory of digital computer fundamentals, the logic and the
implementation of modules required for digital systems.
2. To analyze digital circuits such as combinational logic circuits, clocking and timing circuits
3. To studyand analyze the analog-to digital and digital-to-analog devices
4. To learn how the digital fundamentals are implemented in Information technology.
5. To acquire an introduction to Nano Technology

COURSE OUTLINE:

UNIT I 15 Hrs
Number Systems & Codes: Number System – Base Conversion – Binary Codes – Code
Conversion. Digital Logic Gates – Truth Tables –Universal Gates.

UNIT II 15 Hrs
Boolean Algebra: Laws & Theorems – SOS, POS methods – Simplification of Boolean Functions –
Using Theorems, K-Map, Prime–Implicant’s Method – Implementation using Universal Gates.
Binary Arithmetic: Binary Addition – Subtraction – Various Representations of Binary Numbers –
Arithmetic Building Blocks – Adders – Subtractors.

UNIT III 20 Hrs

Combinational Logic: Multiplexers –Demultiplexers – Decoders – Encoders – Code Converters–
Parity Generators & Checkers –PLA.

UNIT IV 20 Hrs
Sequential Logic: RS, JK, D and T Flip-Flops – Edge-Triggered – Master – Slave Flip- Flops.
Registers: Shift Registers – Types of Shift Registers.

46
UNIT V 20 Hrs
Counters: Asynchronous Counters – Ripple, Mod, Up-Down Counters - Synchronous Counters –
Ring, Decade, Shift Counters. Memory: Basic Terms & Ideas – Magnetic Memories – Memory
Addressing– Types of RAMs – Types of ROMs. Introduction to Nanotechnology – Applications.

BOOK FOR STUDY

1. Morris Mano, ”Digital Logic and Computer Design”, PHI, 2001.
2. T.C. Bartee, “Digital Computer Fundamentals”, 6th Edition, Tata McGraw Hill, 1991, McGraw
Hill,2002
REFERENCE BOOKS
1. D.P. Leach & A.P. Malvino, “Digital Principles and Application”, THM Fifth Edition – 2002
2. T.C. Bartee, “Digital Computer Fundamentals”, 6th Edition, Tata McGraw Hill, 1991,
McGraw Hill,2002
3. Givone, Digital Principles Design, Tata McGraw Hill, New Delhi. 2002
4. C. H. Roth ,Jr, 2005, Fundamentals of Logic Design ,5 th Edition, Thomson Learning, Singapore.
5. Manvino&Leach,Digital Principal and Application –TMH, 2011
E-LEARNING RESOURCES
1. https://www.coursera.org/learn/logic-introduction
2. https://www.wiziq.com/tutorials/digital-logic-design
3. http://www.understandingnano.com/introduction.html
4. http://www.understandingnano.com/nanotech-applications.html

JOURNALS:
1.Electronics — Open Access Journal
2.Journal of Electrical & Electronic Systems

COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Teach students the theory of digital computer fundamentals, the
logic and the implementation of modules required for digital
systems.
CO 2 Analyze digital circuits such as combinational logic circuits,
clocking and timing circuits
CO 3 Study and analyze the analog-to digital and digital-to-analog
devices
CO 4 Learn how the digital fundamentals are implemented in
Information technology.
CO 5 Acquire an introduction to Nano Technology

47
MAPPING : COURSE OUTCOME WITH PROGRAM SPECIFIC OUTCOME
CO/PSO PSO1 PSO2 PSO3 PSO4 PSO5 PSO6
CO1 2 3 3 2 3 2
CO2 2 3 3 2 1 3
CO3 3 2 3 2 2 2
CO4 2 3 3 2 3 2
CO5 2 3 3 2 3 2

AVERAGE 2.2 2.8 3 2 2.4 2.2

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY :
 Lecture (Chalk and Talk)
 Quiz
 Peer Learning

QUESTION PAPER PATTERN-UG

Knowledge Section Word Marks Total Special Instructions
Level Limit if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

48
 SEMESTER V

RELATIONAL DATABASE MANAGEMENT SYSTEMS

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 6-0-0

COURSE OBJECTIVES:
1. To acquire the basics of databases and relational database management systems concepts.
2. To learn Structured Query language.
3. To design simple database models using Entity-Relationship Model and normalize it.
4. To understand Storage and File structures and the way it is organized.
5. To Understand the Database System Architecture and Distributed Databases

COURSE OUTLINE:

UNIT I 15 Hrs.
Introduction: Database-System Applications - Purpose of Database Systems - View of Data -
Database Languages - Relational Databases - Database Design - Data Storage and Querying -
Transaction Management - Data Mining and Analysis - Database Architecture - Database Users and
Administrators - History of Database Systems. Relational Model: Structure of Relational Databases
- Fundamental Relational Algebra Operations - Additional Relational-Algebra Operations - Extended
Relational-Algebra Operations - Null Values - Modification of the Database.

UNIT II 15 Hrs.
SQL: Background - Data Definition - Basic Structure of SQL Queries - Set Operations - Aggregate
Functions - Null Values - Nested Subqueries - Views - Modification of the Database. Advanced
SQL: SQL Data Types and Schemas - Integrity Constraints - Authorization - Embedded SQL –
Dynamic SQL.

UNIT III 20 Hrs.

Database Design and E-R Model: Overview of the Design Process - The Entity Relationship Model
– Constraints – Entity-Relationship Diagrams - Weak Entity Sets. Relational Database Design:
Features of Good Relational Designs - Atomic Domains and First Normal Form - Decomposition
Using Functional Dependencies - Functional-Dependency Theory - Decomposition Using
Multivalued Dependencies.

49
UNIT IV 20 Hrs.
Storage and File Structure: Overview of Physical Storage Media – Magnetic Disks – RAID –
Tertiary Storage – Storage Access. Transactions: Transaction Concept - Transaction State -
Implementation of Atomicity and Durability - Concurrent Executions – Serializability –
Recoverability.

UNIT V 20 Hrs.
Data Analysis and Mining: Decision-Support Systems - Data Analysis and OLAP –
DataWarehousing - Data Mining. Database System Architectures: Centralized and Client-Server
Architectures - Server System Architectures - Parallel Systems -Distributed

BOOK FOR STUDY

1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database System Concepts”, Fifth edition,
and McGraw-Hill-2010.
2. Database Systems(concepts,Design and Application)S.K.Singh,Pearson Edition, 2009.

REFERENCE BOOKS
1. Database Management System,Gerald. V.Post III Edition, 2001.
2. Raghu Ramakrishnan, Database Management Systems, WCB/McGraw Hill, 1998.
3. Introduction to Database Management, M.L.Gilenson, Wiley Student Edition, 2012.
4. RamezElmasri, “Database Systems: Models, Languages, Design and Application”, Pearson
Education, 2014.
5.Simplified Approach to DBMS, Kalyani Publishers, 10th.edition,2015

JOURNALS:
1.International Journal of Database Management Systems(IJDMS)
2.Journal of Database Management(JDM)

E-LEARNING RESOURCES:
1.http://www.db-book.com
2.http://www.computerweekly.com>tutorial>Database Normalization
3.http://www.mysql.com
4.https://www.tutorialspoint.com/dbms
5. http://www.ddegjust.ac.in/studymaterial/mca-3/ms-11.p

50
COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Develop the terminology, features, classifications, and
characteristics of database systems
CO 2 Applying create, populate, maintain, and query statements in the
database
CO 3 Developing the normalization theory and apply such knowledge to
the normalization of a database
CO 4 Understand Storage and File structures and the way it is organized

CO 5 Understanding the procedures of client server and distributed

databases

MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5
CO1 3 2 - - -
CO2 3 - 2 - 1
CO3 3 1 3 3 -
CO4 3 3 2 1 2
CO5 3 2 2 2 2
AVERAGE 3 1.6 1.8 1 1

Key: Strongly Corelated-3, Moderately Corelated-2, Weakly Corelated-1, No Corelation-0

TEACHING METHODOLOGY:
Lecture by Chalk and Talk

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

51
 SEMESTER V
VISUAL PROGRAMMING
TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 6-0-0

COURSE OBJECTIVES:

1. To understand the basic programming concepts of Visual Basic 6.0 for Windows as an
application tool.
2. Learn the fundamentals of designing, implementing, and distributing a Visual Basic
application.
3. To implement graphics program in visual basic
4. To gain a basic understanding of database access and management using databound controls.
5. To learn file handling methods using visual basic

COURSE OUTLINE

UNIT I 20 Hrs.

Customizing a Form - Writing Simple Programs - Toolbox - Creating Controls - Name Property -
Command Button - Access Keys - Image Controls - Text Boxes - Labels - Message Boxes - Grid -
Editing Tools - Variables - Data Types - String - Numbers.

UNIT II 20 Hrs.

Displaying Information - Determinate Loops - Indeterminate Loops - Conditionals - Built-in

Functions - Functions and Procedures.

UNIT III 20 Hrs.

Lists - Arrays - Sorting and Searching - Records - Control Arrays - Combo Boxes - Grid Control -
Projects with Multiple forms - Do Events and Sub Main - Error Trapping.

UNIT IV 15 Hrs.

VB Objects - Dialog Boxes - Common Controls - Menus - MDI Forms - Testing, Debugging and
Optimization - Working with Graphics.

52
UNIT V 15 Hrs.

Monitoring Mouse activity .- File Handling - File System Controls - File System Objects -
COM/OLE - automation - DLL Servers - OLE Drag and Drop.

BOOKS FOR STUDY

1. Gary Cornell, “Visual Basic 6 from the Ground up”, Tata McGraw Hill - 1999.
2. Dr.A.Murugan, Dr.K.Shyamala, “Visual Basic Programming”, Margham Publications, 2nd
Editions, 2012.

REFERENCE BOOKS

1. Noel Jerke, “ Visual Basic 6, The Complete Reference”, Tata McGraw Hill -1999
2. Byron S Gottfried, “Schaum's Outline of Visual Basic”, McGraw-Hill Education, 2001.
3. Wallace Wang, “Visual Basic 6 For Dummies” ,IDB Books WorldWide,Inc-1998
4. Peter Wright, “ Beginning Visual Basic 6 Objects”, WROX Press Ltd -1998
5. Steven Holzner, “Visual Basic 6 Programming Black Book”, Paraglyph Press -2000

JOURNALS:
1. International Journal of Innovative Research in Computer and Communication Engineering
(IJIRCCE)
2. Information System Education Journals(ISEDJ)

E-LEARNING RESOURCES:
1. https://docs.microsoft.com/en-us/office/vba/language/reference/user-interface-help/toolbox
2. https://www.scribd.com/doc/51767557/Visual-Basic-The-Repetition-Process
3. http://www.johnsmiley.com/cis18/Smiley013.pdf
4. https://stackoverflow.com/questions/34860913/vb6-common-controls-on-windows-10
5. http://zetcode.com/gui/vbwinforms/dragdrop/

COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Creation of modern IDE programs with GUI intrinsic controls
CO 2 Problem Solving using Looping structure and Functions

CO 3 Implementation of modular, reusable and event driven programs

CO 4 Developing SDI and MDI applications

CO 5 Connecting to database using DAO, ADO and RDO controls

53
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5

CO1 3 2 2 2 1
CO2 2 3 3 3 3
CO3 3 2 2 3 3
CO4 3 3 2 2 2
CO5 3 2 1 2 3
AVERAGE 2.8 2.4 2 2.4 2.4

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk
Problem Solving Techniques
Seminar

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1. K 2 B-5/7x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

54
 SEMESTER V

COMPUTER GRAPHICS

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 5 L-T-P: 5-0-0

COURSE OBJECTIVES:

1. To provide comprehensive introduction about computer graphics system, design algorithms.

2. To Learn the concepts of two dimensional transformations.
3. To make the students familiar with techniques of clipping, three dimensional graphics and
three dimensional transformations.
4. The computer graphics course prepares students for activities involving in design,
development.
5. To Understand the process of testing of modeling, rendering, shading and Animation.

COURSE OUTLINE:

UNIT I 20 Hrs.
A survey of computer graphics – Overview of Graphics Systems: Video display devices: Refresh
Cathode Ray tubes, Raster-scan displays, Random-scan displays, Color CRT Monitors, Direct-View
Storage tubes, Flat-Panel Displays – Raster scan systems- Random scan systems - Input Devices.

UNIT II 20 Hrs.
Output Primitives: Points and lines - Line Drawing Algorithms: DDA, Bresenham’s line drawing
algorithm- Attributes of Output Primitives: Line Attributes-Curve Attributes- Color and Grayscale
levels – Area Fill Attributes-Character Attributes.

UNIT III 20 Hrs.

Two-dimensional Geometric Transformations: Basic Transformations – Matrix Representations and
Homogeneous coordinates – Composite Transformations – Other Transformations – Transformation
between coordinate systems. Two-Dimensional Viewing: Viewing Pipeline – Window-to-viewport
coordinate transformation – Clipping Operations –Point Clipping – Line Clipping: Cohen-Sutherland
line clipping.

UNIT IV 15 Hrs
Graphical User Interfaces and Interactive Input Methods: The User dialogue - Input of graphical data
– Interactive Picture construction techniques. Three-dimensional concepts: Three-Dimensional

55
Display methods – Three-Dimensional Geometric and Modeling Transformations: Translation,
Rotation, Scaling, and Other Transformations.

UNIT V 15 Hrs

Color Models and Color Applications: Properties of light – Intuitive Color Concepts – RGB color
model – YIQ color model – Computer Animation: Design of Animation Sequences – Motion
Specifications.

BOOK FOR STUDY

1. Donald Hearn, M.Pauline Baker (2004), “Computer Graphics - C Version” - Second Edition,
PHI.

2. Edward Angel, “Interactive Computer Graphics: A Top-Down Approach Using OpenGL”

REFERENCE BOOKS:

1. W.M.Newmann and R.F.Sproull (1979), “Principles of Interactive Computer Graphics”,

McGraw Hill.
2. Foley, Van Dan, Feiner, Hughes (2000), “Computer Graphics” - Addison Wesley
3. John F. Hughes Andries Van Dam Morgan Mcguire David F. Sklar James D. Foley Steven K.
Feiner Kurt Akeley, “Computer Graphics Principles and Practice”, Third Edition, Addison
Wesley.

4. A. P. Godse, “Computer Graphics”,Technical Publications, 2011.

5. V.K.Pachghare, “Computer Graphics”, University Science Press.

JOURNALS:

1. https://www.tutorialspoint.com/computer_graphics/computer_graphics_tutorial.pdf

2. http://www.dgp.toronto.edu/~hertzman/418notes.pdf

E-LEARNING RESOURCES:

1. https://www.coursera.org/courses?query=operating%20system
2. https://www.udacity.com/course/introduction-to-operating-systems--ud923#
3. https://www.coursera.org/lecture/technical-support-fundamentals/memory-management-
CKcxg
4. https://www.coursera.org/lecture/technical-support-fundamentals/files-and-file-systems-5n8dt
56
 COURSE OUTCOMES:
CO Statements
CO No.
CO 1 Have a basic understanding of the core concepts of computer graphics.
CO 2 Be capable of using OpenGL to create interactive computer graphics.
General critical analysis, evaluation and synthesis of ideas for the design of
CO 3
the applications on graphics.
To comprehend and analyze the fundamentals of animation, virtual reality,
CO 4 underlying technologies, principles, and concepts used in computer
graphics.
To implement various algorithms to scan, convert the basic geometrical
CO 5
primitives, transformations, Area filling, clipping.

MAPPING- CO with PSO

CO / PSO PSO 1 PSO 2 PSO 3 PSO4 PSO5
CO 1 3 2 2 2 3
CO 2 3 3 2 2 2
CO 3 2 2 3 2 2
CO 4 2 3 3 3 2
CO 5 3 2 2 3 3
Average 2.6 2.4 2.4 2.4 2.4

Key: Strongly Corelated-3, Moderately Corelated-2, Weakly Corelated-1, No Corelation-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk
Problem Solving
Seminar

QUESTION PAPER PATTERN-UG

Knowledge Section Word Marks Total Special Instructions
Level Limit if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1. K 2 B-5/7 X 5 marks 200 25 At least one question
from each unit
K2, K 3 C-3/5 X 10 marks 500 30 Compulsory One
question from each
unit

57
 SEMESTER V

VISUAL PROGRAMMING LAB

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 0-0-6

COURSE OBJECTIVES:

1. To Understand the programming concepts of Visual Basic 6.0

2. To develop application programs using VB Tools.
3. To learn window based applications using VB Database Controls.
4. To implement mouse event and keyboard event
5. To work with graphics application in visual basic

List of Programs:
1. Simple application programs
2. Programs using controls
3. Working with variables
4. Programs using Input and Dialog boxes
5. Working with Loops
6. Working with conditional statements
7. Functions and Procedures
8. Searching and sorting using Arrays
9. Working with Common Controls
10. Implementation using Menu Editor
11. Working with MDI forms
12. Working with Lines and Shape controls
13. Graphical programs
14. Mouse Events
15. Keyboard Events
16. Working with Grids
17. File Handling
18. Database programs using DAO control
19. Database programs using RDO control
20. Database programs using ADO control

58
BOOKS FOR STUDY

1. Dr.A.Murugan, Dr.K.Shyamala, “Visual Basic Programming”, Margham Publications, 2nd

Editions, 2012.

2. Soma Das Gupta, “ Visual Basic Projects”, BPB Publications-Reprint 2017

REFERENCE BOOKS

1. Noel Jerke, “ Visual Basic 6, The Complete Reference”, Tata McGraw Hill -1999
2. Gary Cornell, “ Visual Basic 6 from the Ground up”, Tata McGraw Hill -1999
3. Bruce McKinney, “Hardcore Visual Basic 5.0”, Microsoft Press-1997
4. Steven Holzner, “Visual Basic 6 Programming Black Book”, Paraglyph Press -2000
5. Mohammed Azam, “Programming with Visual Basic 6.0”, Vikas Publication, 2001

JOURNALS:

1. Journals of Information Systems Educations (JISE)

2. Journals of Object Oriented Programming (JOOP)

E-LEARNING RESOURCES:
1. https://example-code.com/vb6/default.asp
2. https://docs.microsoft.com/en-us/dotnet/visual-basic/programming-guide/language-
features/procedures/function-procedures
3. https://www.freetutes.com/learn-vb6-advanced/lesson5/p2.html
4. http://forums.codeguru.com/showthread.php?441166-How-to-use-FlexGrid-Grid-Control-in-
VB6
5. https://www.developerfusion.com/code/3205/ado-utility-class/

COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Application development using VB controls
CO 2 Development of GUI applications based on problem description

CO 3 Advanced knowledge in visual programming to solve real world problem

CO 4 Evaluate programs using error handling techniques

CO 5 Develop Database applications through VB Database Controls

59
MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME
CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5

CO1 3 2 2 2 1
CO2 3 3 3 3 3
CO3 3 2 2 3 3
CO4 3 3 2 3 2
CO5 3 2 1 2 3
AVERAGE 3 2.4 2 2.6 2.4

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk ,
Problem Solving Techniques

Practical question paper will be framed by the External Examiner from the practical question
bank kept in the Department.

60
 SEMESTER VI

OPERATING SYSTEMS

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 6-0-0

COURSE OBJECTIVES:

1. To know the objectives and functions of modern operating systems.

2. To learn about Processes and Scheduling algorithmssuch as short-term, medium-term, and
long-term.
3. To understand the principle of Deadlock.
4. To study computer security issues.
5. To know the features and limitations of operating system to provide protection.

COURSE OUTLINE

UNIT I 15 Hrs.
Introduction - Types of Operating Systems - OS Structures - System Components – Services -
Design and Implementation.

UNIT II 15 Hrs.
Design and implementation. Process management: Process-Process Scheduling-Cooperating Process-
Threads-Inter-process communication.CPU Scheduling: CPU schedulers-Scheduling Criteria-
Scheduling Algorithms.

UNIT III 20 Hrs

Process Synchronization: Critical-Section Problem-Synchronization hardware-Semaphores-Classical
Problems of Synchronization-Critical Region-Monitors. Deadlocks: Characterization-Methods of
handling deadlocks-Deadlock Prevention –Avoidance Detection-Recovery.

UNIT IV 20 Hrs
Memory Management: Address Binding-Dynamic Loading and Linking-Overlays-Logical and
physical Address space-Contiguous Allocation-Internal & External Fragmentation. Non-Contiguous
Allocation: Paging and segmentation Schemes-Implementation-Hardware-Protection - Sharing -
Fragmentation.
61
UNIT V 20 Hrs
Virtual Memory - Demand Paging - Page Replacement - Page Replacement Algorithms - Thrashing.
File Concepts-Access methods-Directory Structures-Protection Consistency semantics-File System
structures-Allocation Methods-Free space management

BOOK FOR STUDY

1. Silberschatz, P.B.Galvin, Gange, Operating system Concepts, John Wiley & Sons, Sixth
Edition, 2002
2. H.M.Deitel, An Introduction to Operating system, Addison Wesley, Second Edition, 2003.

REFERENCE BOOK
1. Andrew S. Tanenbaum, Modern Operating systems, Prentice Hall India, Fourth Reprint,
2004.
2. William Stallings, Operating Systems, PHI, Fourthe Edition, 2003
3. Charles Crowley, Operating systems : A design oriented Approach, Tata McGraw Hill,
Ninth Reprint, 2002.
4. Dhananjay M Dhamdhere ,Operating systems A concept based approach, 3 rdedition, TATA
McGraw HILL, 2012.
5. MukeshSinghal&NiranjanShivratri,Advanced concepts in operating systems, 1St Edition,
TATA McGraw HILL, 2001.

JOURNALS:
1. International journal of Trend in scientific research and development (IJTSRD)–Operating
systems a case study.
2. Journal of Information Systems

E-LEARNING RESOURCES:
1. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/1_Introduction.html
2. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/7_Deadlocks.html
3. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/8_MainMemory.html
4. https://study.com/academy/lesson/page-replacement-definition-algorithms.html
5. https://study.com/academy/lesson/preemptive-vs-non-preemptive-process-scheduling.html

62
COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Outline the structure and functionalities of an OS & the concepts of process.

CO 2 Explain different problems related to process synchronization and deadlock.

CO 3 Categorize the concept of paging and segmentation for memory management.

CO 4 Apply different Authentication procedures.

CO 5 Analyze different aspects of Unix.

MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5

CO1 2 2 2 2 2
CO2 3 3 2 3 3
CO3 3 3 3 3 3
CO4 3 2 3 1 3
CO5 3 2 2 2 3
AVERAGE 2.8 2.4 2.4 2.2 2.8

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk
Problem Solving

QUESTION PAPER PATTERN-UG*

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

63
 SEMESTER VI

DATA COMMUNICATION AND NETWORKING

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 4 L-T-P: 7-0-0

COURSE OBJECTIVES :

1. To study about the physical arrangement of networks, types of networks, data conversions
and transmission medium.
2. To understand the functions and working of different layers of network.
3. To know about the inter-connection and types of devices and network security.
4. To understand the functionality of different layers.
5. To Learn the basic concepts TCP/IP protocol suite.

COURSE OUTLINE :

UNIT I 20 Hrs.
Introduction: Data Communication – Networks – Protocols and Standards – Standard Organizations -
Basic Concepts: - Line Configurations - Topologies - Transmission Modes- Categories of Networks–
Internetworks. The OSI Model: The Model – Functions of the Layers

UNIT II 20 Hrs.
Transmission of Digital Data: Interfaces and Modems:Digital Data Transmission, DTE-DCE
Interface –Modems – 56k Modems – Cable Modem. Transmission Media: Guided and Unguided
Media, Transmission Impairment, Performance. Multiplexing – Many-to-One/One-to-Many – FDM
– WDM – TDM.

UNIT III 20 Hrs.

Error Detection and Correction: Types of Errors – Detection -VRC – LRC – CRC – Checksum -
Error Correction. Switching: Circuit Switching – Packet Switching – Message Switching.
Networking and Internetworking Devices: – Repeaters – Bridges – Routers – Gateways –Routing
Algorithms: Distance vector routing - Link state routing

64
UNIT IV 15 Hrs.
Transport Layer: Duties – Connection – The OSI Transport Protocol. Upper OSI Layers: Session
Layer – Presentation Layer – Applications Layer.

UNIT V 15 Hrs.
TCP/IP Protocol Suite - I: Overview of TCP/IP - Network layer – Addressing – Subnetting -
Transport layer.TCP/IP Protocol Suite - II Application layer: Domain Name System –FTP – SMTP –
HTTP-WWW.
BOOKS FOR STUDY
1.Behrouz A. Forouzan, “Data Communication and Networking”, TMH, Second Edition, 2003
2. Williams Stallings, “Data and Computer Communication”, PHI, Sixth Edition, 2003

REFERENCE BOOKS
1. Andrew S Tanenbaum, “Computer Networks”, PHI, Fourth Edition, 2005.
2.William Stallings, Data and Computer Communications, Eighth Edition, Pearson Education.
3.Larry Peterson, Bruce Davie, Computer Networks, 5th Edition, Morgan Kaufmann Series
4. Sarika Gupta, Gaurav Gupta, Computer Networks, First Edition, Khanna Book Publishing.
5. Forouzan,Data Communication and Networking, 5th Edition, Tata McGraw Hill

JOURNALS :
1. Journal of Network Communications and Emerging Technology (JNCET)
2. International Journal of Networking and Computing

E-LEARNING RESOURCES :
1. http://www.eecs.umich.edu/courses/eecs373.w05/lecture/errorcode.html
2. http://ecomputernotes.com/computernetworkingnotes/routing/routing-algorithms
3. https://www.sciencedirect.com/topics/computer-science/transport-layer-protocol
4. https://www.tutorialspoint.com/data_communication_computer_network/

5. https://www.udacity.com/course/computer-networking

65
COURSE OUTCOMES :
CO Number CO STATEMENT
CO1 Impart knowledge in basics of data networking and the layers of OSI
model
CO2 Introduce different types of transmission media to connect the
computers in various departments to and concepts of switching used
for data communication
CO3 Understand the functions of data link layer to ensure that the data has
been transmitted across the layers error free.
CO4 Analyse various routing protocols to determine optimal network data
transfer paths between network nodes with good quality of service.
CO5 Build an understanding about functions of transport layer and the
concept on how information is transmitted fast and secure across
various systems.

MAPPING : COURSE OUTCOME WITH PROGRAM SPECIFIC OUTCOME

CO/PSO PSO1 PSO2 PSO3 PSO4 PSO5 PSO6
CO1 2 3 3 2 3 2
CO2 2 3 3 2 1 3
CO3 3 2 3 2 2 2
CO4 2 3 3 2 3 2
CO5 2 3 3 2 3 2

AVERAGE 2.2 2.8 3 2 2.4 2.2

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY :
 Lecture (Chalk and Talk)
 Quiz
 Peer Learning

QUESTION PAPER PATTERN-UG

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

66
 SEMESTER VI

SOFTWARE ENGINEERING AND TESTING

TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 5 L-T-P: 5-0-0

COURSE OBJECTIVES:
1. To acquaint the basic concepts of structure and planning in software engineering
2. To Understand the Software Engineering Practice & Process Models.
3. To Understand the designing concepts used in project development
4. To Understand Design Engineering, Testing and Software Maintenance.
5. To Understand the maintenance process in handling the software process.

COURSE OUTLINE:
UNIT I 15 Hrs.
Introduction of Software Engineering: Definitions – Size Factors – Quality And Productivity Factors
– Managerial Issues – Planning A Software Project: Defining the Problem – Developing a Solution
Strategy – Planning the Development Process – Planning an Organization Structure – Other Planning
Activities.

UNIT II 15 Hrs.
Software Cost Estimation – Software Cost Factors – Software Cost Estimation Techniques – Staffing
Level Estimation – Estimating Software Maintenance Costs – The Software Requirements
Specifications – Formal Specification Techniques – Languages and Processors For Requirements
Specification.

UNIT III 20 Hrs.

Software Design: Fundamental Design Concepts – Modules And Modularization Criteria – Design
Notations – Design Techniques – Detailed Design Considerations – Real-Time And Distributed
System Design – Test Plans – Milestones, Walkthroughs And Inspections.

UNIT IV 20 Hrs.
Implementation Issues: Structured Coding Techniques – Coding Style – Standards And Guidelines –
Documentation Guidelines – Verification and Validation Techniques - Quality Assurance –

67
Walkthroughs and Inspections – Unit testing and Debugging – System Testing – Integration Testing
and Acceptance Testing.

UNIT V 20 Hrs.
Software Maintenance- Enhancing Maintainability during development –Managerial aspects of
software maintenance – Configuration Management – Other maintenance tools and techniques.

BOOK FOR STUDY

1.R. Fairley, “Software Engineering Concepts”, TMH Edition 1997 Reprint 2007.

2.R.S.Pressman, “Software Engineering – A Practioner’s Approach”, Tata McGraw Hill, 6thEdition,

2001

REFERENCE BOOKS:

1. Ian Sommerville, “Software Engineering”,Addison Wesley, 9th Edition, 2001.

2. Rajib Mal, “Fundamental of Software Engineering”, 2nd Edition, PHI, New Delhi, 2005.
3. ElayWhitesman, “Software Engineering – Concepts and Principles”, McGraw Hill – 2009.
4. Software Enginering :ACocise study by Kelkar S.A, Prentice hall India learning Private
Limited,(2007).
5. Software Enginering: Concepts and Application by Subhajitdatta ,OUP India (2010).

JOURNALS:
1. International Journal of Computer and Software Engineering.
2. Indian Journal of Computer science and Engineering.

E-LEARNING RESOURCES:
1. http://www.researchgate.net/
2.https://www.tutorialspoint.com/software_engineering/case_tools_overview.htm
3.http://www.literateprogramming.com/sdtypes.pdf
4.http://www.softwaretestinghelp.cpm/web-application-testing
5.http://softwareengineeringdaily.com

68
COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Able to prepare good software requirements and panning for development.
CO 2 Able to produce software estimation cost of the design meant for the
business using techniques.
CO 3 Able todesign a model and representation of a new system.

CO 4 Able to guide the implementation tasks, including detailed design, coding,

integration and Testing.
CO 5 Able to know the Software Maintenancewith defects finding approach and
configuration

MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6
CO1 3 3 - 3 3 3
CO2 3 2 2 3 2 3
CO3 3 3 - 3 3 3
CO4 3 3 2 3 3 3
CO5 2 3 2 2 3 3
AVERAGE 2.8 2.8 1.2 2.8 2.8 3

Key: Strongly Corelated-3, Moderately Corelated-2, Weakly Corelated-1, No Corelation-0

TEACHING METHODOLOGY :
 Lecture (Chalk and Talk)
 Quiz
 Peer Learning

QUESTION PAPER PATTERN-UG

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

69
 SEMESTER VI

ASP .NET
TOTAL HOURS: 90hrs COURSE CODE:

CREDITS: 5 L-T-P: 5-0-0

COURSE OBJECTIVES:

1. To gain the knowledge of implementing problem solving techniques using programming

languages
2. To understand the concepts of syntax of Programming Language
3. To study the fundamentals of developing modular application by using Object Oriented
Methodologies.
4. To setup and configure programming environment
5. To create Asp.Net applications using standard .net controls and develop a data driven web
applications

COURSE OUTLINE
UNIT I 15 Hrs.
ASP.NET Language Structure: Page Structure – Defining Procedures – Page – Compiler Directives
- Sample Page. HTML Server Controls: HTMLAnchor Control – HTMLTable, HTMLRow, and
HTMLTableCell Controls – HTMLForm and Form Input Controls – HTMLInputFile Control.

UNIT II 15 Hrs.
Basic Web Server Controls – Data List Web Server Controls

UNIT III 20 Hrs.

Other Web Server Controls: Calender Control – AdRotator Control – Validation Controls. Request
and Response Objects.

UNIT IV 20 Hrs.
System.Data and System.Data.OLEDB Namespace: OLEDBConnection Class – OLEDBCommand
Class – OLEDBTransaction Class – OLEDBDataAdapter Class – DataSet Class.
System.Data.SQLClient Namespace: Connection – Manipulating data – Retrieving Data from a SQL
Server Database.

70
UNIT V 20 Hrs
Working with IIS and Page Directives: WWW Service Properties – Web Sites within IIS – Adding a
Web Site – Web Site Properties – ASP.NET Applications.Error Handling: No Error Handling –
Resume Next – On Error Goto Handler – Resume from Handler – Try/Catch Code Block – Err
Object.

BOOKS FOR STUDY

1.GregBuczek, ASP.NET developer’s guide, Tata McGraw Hill, First Edition, 2002.
2.Dietel, Dietel&Nietc, Internet and World Wide Web – How to program, Pearson
Education Publishers, Fourth Edition, 2007

REFERENCE BOOKS
1. Jesse Liberty & Dan Hurwitz, “Programming ASP.NET”, O’Reilly Second Edition, 2005.
2. ANNE BOEHM, “ASP.NET 4 Web Programming with VB 2010”, SPD Publishers, Fourth
Edition.
3. Matthew MacDonald “ASP.NET: The Complete Reference 1st Edition”
4.Dietel, Dietel&Nietc, Internet and World Wide Web – How to program, Pearson Education
Publishers, Fourth Edition, 2013
5. T.A. Powell, Complete Reference HTML, TMH Publications, 2010

JOURNALS:

1.International Journal of Computer Science and Mobile Application in Asp.Net

2. International Journal of Emerging Technologies in Learning

E-LEARNING RESOURCES:
1.https://msdn.microsoft.com/en-us/library/4w3ex9c2.aspx
2.onlinevideolecture.com/ebooks/?subject=ASP.NET
3. https://www.udemy.com/course/pythoncv/
4.https://www.homeandlearn.co.uk/csharp/csharp.html.

5.https://www.geeksforgeeks.org/introduction-to-net-framework/

71
COURSE OUTCOMES:
CO Number CO STATEMENT
CO 1 Review the features of programming language
CO 2 Able to apply the design web applications using .Net

CO 3 Evaluate the outcome of web applications for debug and deploy

CO 4 Categorize and apply various web application techniques.

CO 5 Create a database driven applications using Asp.Net

MAPPING-COURSE OUTCOME WITH PROGRAMME SPECIFIC OUTCOME

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5

CO1 3 2 2 2 2
CO2 3 2 2 3 3
CO3 3 2 2 3 3
CO4 3 2 2 3 3
CO5 3 3 3 3 3
AVERAGE 3 2.2 2.2 2.8 2.8

KEY: STRONGLY CORELATED-3 MODERATELY CORELATED-2 WEAKLY CORELATED-

1 NO CORELATION-0

TEACHING METHODOLOGY:
Lecture - Chalk and Talk
Compute Laboratory

QUESTION PAPER PATTERN-UG

Knowledge Section Word Marks Total Special
Level Limit Instructions if any
K1 A-10X2 marks 50 20 75 Two questions from
each Unit
K1, K 2 B-5/8x5 marks 200 25 Atleast one question
from each unit
K2, K 3 C-3/5x10 marks 500 30 Compulsory One
question from each
unit

72
 SEMESTER VI

MINI PROJECT

TOTAL HOURS: 90Hrs COURSE CODE:

CREDITS: 4 L-T-P: 0-0-6

LAB WORK:

The student is expected to develop a mini project in any of the topics including the software, chosen
by her. The topic should reflect the current trends in the field of IT and Computer science,
resembling a real time project .An internal guide (staff member) will be appointed by the department,
to assist the candidate in the completion of the mini project.

Internal marks would be allotted depending upon the intermediate reviews conducted by the internal
guide.

End-semester examinations include a viva-voce based on the final review (demo of the mini project)
and the report submitted by the candidate on the mini project.

73