Program and Course

Structure B.Tech CSE

1. Standard Structure of the Program at University Level

1.1 Vision, Mission and Core Values of the University

Vision of the University

To serve the society by being a global University of higher learning in pursuit of

academic excellence, innovation and nurturing entrepreneurship.

Mission of the University

1. Transformative educational experience

2. Enrichment by educational initiatives that encourage global outlook
3. Develop research, support disruptive innovations and accelerate
entrepreneurship
4. Seeking beyond boundaries

Creative Campaign Can be TEDs: This is guiding principle for promotion and wide
circulation among various stakeholder.
Guidelines: Similar Mnemonics can be designed by schools.

Core Values
 Integrity
 Leadership
 Diversity
 Community

Note: Detailed Mission Statements of University can be used for developing Mission
Statements of Schools/ Departments.

Prepared by: Department of Computer Science and Engineering Page 2

1.2 Vision and Mission of the School

Vision of the School

To become a globally acclaimed institution of higher learning in engineering and

technology promoting excellence in research, innovation and entrepreneurship

Mission of the School

1. To impart quality education with strong industry & academic connectivity

in the expanding fields of Engineering and Technology in a conductive
and enriching learning environment.
2. To product technocrats equipped with technical & soft skills and
experiential learning required to stay current with the modern tools in
emerging technologies to fulfill professional responsibilities and uphold
ethical values.
3. To inculcate a culture of interdisciplinary research, innovation and
entrepreneurship to provide sustainable solutions to meet the growing
challenges and societal needs.
4. To foster collaborative learning and to play adaptive leadership role in
professional career and pursuit of higher education through effective
mentoring and counselling

Prepared by: Department of Computer Science and Engineering Page 3

1.2.1Vision and Mission of the Department

Vision of the Department

To be known and recognized as the fountainhead of excellence in technical knowledge and

research in computer science and engineering, and draw to it the students and scholars
across nations.

Mission of the Department

1. To facilitate and foster the academia industry collaboration to enhance

entrepreneurship skills and acquaintance with corporate culture.
2. To strengthen core competences of students to be successful, ethical ,
effective problem solver in Computer Science & Engineering through
analytical learning
3. To promote research based activities in emerging areas of technology
convergence.
4. To induce moral values and spirit of social commitment.

Prepared by: Department of Computer Science and Engineering Page 4

1.3 Programme Educational Objectives (PEO)

1.3.1 Writing Programme Educational Objectives (PEO)

The Educational Objectives of UG Program in Computer Science Engineering are:

PEO1 : The Graduate will ensconce himself/herself as effective professionals by solving

real life problems using exploratory and analytical skills along with the knowledge
acquired in the field of Computer Science and Engineering.

PEO2 :The Graduate will demonstrate his/her ability to accustom to rapidly changing
environment in advanced areas of Computer Science and scale new height in their
profession through lifelong learning.

PEO3 : The Graduate will have the ability to work and communicate effectively as a
team member or leader to complete the task with minimal resources, meeting deadlines.

PEO4 : The Graduate will embrace professional code of ethics in the profession while
deliberately being part of projects which contributes to the society at large without
disturbing the ecological balance.

Methods of Forming PEO’s

STEP 1: The needs of the Nation and society are identified through scientific
publications, industry interaction and media.
STEP 2. Taking the above into consideration, the PEOs are established by the
coordination Committee of the department.
STEP 3. The PEOs are communicated to the alumni and their suggestions are
obtained.
STEP 4. The PEOs are communicated to all the faculty members of the department
and their feedback is obtained.
STEP 5. The PEOs are then put to the Board of Studies of the department for final
approval.

[Note: Prepare a file for the same, how you arrive for PEO’s]

Prepared by: Department of Computer Science and Engineering Page 5

1.3.2 Map PEOs with School Mission Statements:

PEO School School School School

Statements
Mission 1 Mission 2 Mission 3 Mission 4

PEO1: 3 3 2 2

PEO2: 2 3 2 1

PEO3: 2 2 2 3

PEO4: 2 1 3 1

Enter correlation levels 1, 2, or 3 as defined below:

1. Slight (Low) 2. Moderate (Medium) 3. Substantial (High)

If there is no correlation, put “-“

Prepared by: Department of Computer Science and Engineering Page 6

Prepared by: Department of Computer Science and Engineering Page 7
1.3.2.1 Map PEOs with Department Mission Statements:

PEO Department Department Department Department

Statements Mission 2 Mission 3 Mission 4

Mission 1

PEO1: 2 3 2 1

PEO2: 1 3 3 1

PEO3: 3 2 1 1

PEO4: 1 2 2 3

PEO5: 2 3 2 1

Enter correlation levels 1, 2, or 3 as defined below:

1. Slight (Low) 2. Moderate (Medium) 3. Substantial (High)

If there is no correlation, put “-“

Prepared by: Department of Computer Science and Engineering Page 8

1.3.3 Program Outcomes (PO’s)

PO1: Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.

PO2: Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.

PO3: Design/development of solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.

PO4: Conduct investigations of complex problems: Use research-based knowledge

and research methods including design of experiments, analysis and
interpretation of data, and synthesis of the information to provide valid
conclusions.

PO5: Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modelling to
complex engineering activities with an understanding of the limitations.

PO6: The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.

PO7: Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate
the knowledge of, and need for sustainable development.

PO8: Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.

PO9: Individual and team work: Function effectively as an individual, and as a member

Prepared by: Department of Computer Science and Engineering Page 9

 or leader in diverse teams, and in multidisciplinary settings.

PO10: Communication: Communicate effectively on complex engineering activities with

the engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.

PO11: Project management and finance: Demonstrate knowledge and understanding

of the engineering and management principles and apply these to one’s own
work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.

PO12: Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of
technological change.

PSO1: Familiarity and practical proficiency with a broad area of programming

concepts and provide new ideas and innovations towards research and societal
issues.
PSO2: Understand, analyze and develop computer programs in the areas related
to algorithms, system software, multimedia, web design, big data analytics and
networking for efficient design of computer-based systems of varying complexity.
PSO3: Apply standard Software Engineering practices and strategies in software
project development using open-source programming environment to deliver a
quality product for business success.
PSO4: Be acquainted with the contemporary issues, latest trends in technological
development and thereby innovate new ideas and solutions to existing
environmental and societal problems.
PSO5: To prepare graduates to apply their skills in creating innovative computing
solutions by employing effective communication, teamwork, leadership, ethical
practices and professionalism.

Prepared by: Department of Computer Science and Engineering Page 10

1.3.4 Mapping of Program Outcome Vs Program Educational Objectives

Mapping PEO1 PEO2 PEO3 PEO4

PO1 3 3 2 1
PO2 3 3 3 1
PO3 2 2 3 3
PO4 2 2 3 2
PO5 2 3 2 2
PO6 1 2 2 3
PO7 1 1 2 3
PO8 1 1 2 3
PO9 1 2 3 1
PO10 1 1 3 2
PO11 3 2 3 1
PO12 2 3 1 1
PSO1 2 3 1 3
PSO2 3 3 2 2
PSO3 3 3 2 2
PSO4 2 2 1 3
PSO5 3 2 3 1

1. Slight (Low) 2. Moderate (Medium) 3. Substantial (High)

Prepared by: Department of Computer Science and Engineering Page 11

 School of Engineering and Technology
B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: I
Teaching
S. Course Load
Course Credits Pre-Requisite/Co Requisite
No. Code
L T P
THEORY SUBJECTS
1. CSE113 Programming for Problem Solving 3 0 0 3
2.
MTH 142 Calculus and Abstract Algebra 3 1 0 4
3.
PHY117 Semiconductor Physics 2 1 0 3
4. Principles of Electrical and Electronics
EEE112 2 1 0 3
Engineering
5.
EVS103 Environmental Science 2 0 0 2

Practical/Viva-Voce/Jury
6.
CSP113 Programming for Problem Solving Lab 0 0 2 1
7.
CSP101 Introduction to Computer Science and Engineering 0 0 2 1
8.
MEP106 Computer Aided Design & Drafting 0 0 3 1.5
9. Principles of Electrical and Electronics
EEP112
Engineering
0 0 2 1
10.
PHY161/162 Physics Lab –I / Physics Lab-II 0 0 2 1
11. 0 0 2 1
FEN101 Functional English Beginners-I

Prepared by :iGAPPage 12
 12.
FEN103 Functional English Intermediate-I
13.
ENP102 Functional English-I 0 0 2 1

TOTAL CREDITS 22.5

Prepared by :iGAPPage 13
 School of Engineering and Technology
B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: II
Teaching
S. No. Course Code Course Load Credits Pre-Requisite/Co Requisite
L T P
THEORY SUBJECTS
1. CSE114 Application based Programming in Python 3 0 0 3
2. MTH 145 Probability and Statistics 3 1 0 4
3.
PHY116 Engineering Physics 2 1 0 3
4.
CHY111 Engineering Chemistry 3 0 2 4
5.
HMM111 Human Value & Ethics 2 0 0 2

Practical/Viva-Voce/Jury
6.
CSP114 Application based Programming in Python 0 0 2 1
7.
MEP105 Mechanical Workshop 0 0 3 1.5
8.
CSP103 Multimedia Application Lab 0 0 2 1
9.
PHY161/162 Physics Lab –I / Physics Lab-II 0 0 2 1
10.
FEN102 Functional English Beginners-II
0 0 2 1
11.
FEN104 Functional English Intermediate-II

12. ENP103 Functional English-II 0 0 2 1

Prepared by :iGAPPage 14
 TOTAL CREDITS 22.5

Prepared by :iGAPPage 15
 School of Engineering and Technology
B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: III
Teaching
S. Course Load Pre-Requisite/Co
Course Credits
No. Code Requisite
L T P
THEORY SUBJECTS
1. BTY223 Introduction to Biology for Engineers 2 0 0 2
2.
MTH201 Discrete Structures 3 1 0 4
3.
CSE247 Computer Organization and Architecture 3 0 0 3
4.
CSE242 Data Structures 3 0 0 3
5.
CSE243 Object Oriented Programming Using Java 3 0 0 3

Practical/Viva-Voce/Jury
6 CSP242 Data Structures Lab 0 0 2 1
7.
CSP243 Object Oriented Programming Using Java 0 0 2 1
8. Aptitude Reasoning and Business Communication
ARP203
Skills-Basic
0 0 4 2

9. CSP297 Project Based Learning (PBL) -1 0 0 2 1

10.
CSP299 Industrial Internship-I - - - 1

TOTAL CREDITS 21

Prepared by :iGAPPage 16
 School of Engineering and Technology
B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: IV
Teaching
S. Course Load Pre-Requisite/Co
Course Credits
No. Code Requisite
L T P
THEORY SUBJECTS
1. CSE244 Principles of Operating System 3 0 0 3
2. CSE245 Computer Networks 3 0 0 3
3. CSE246 Data Base Management System 3 0 0 3 Discrete Structures
4. CSE248 Theory of Computation 3 1 0 4
5 Program Elective-1 3 0 0 3
6. OE1 Open Elective – 1 2 0 0 2
Practical/Viva-Voce/Jury
Aptitude Reasoning and Business Communication Skills-
7. ARP204
Intermediate
0 0 4 2 ARP201

8. CSP244 Principles of Operating System Lab 0 0 2 1

9. CSP245 Computer Networks Lab 0 0 2 1
10. CSP246 Data Base Management System Lab 0 0 2 1
11. CSP298 Project Based Learning (PBL) -2 0 0 2 1 PBL-I
TOTAL CREDITS 24

Prepared by :iGAPPage 17
 School of Engineering and Technology
B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: V
Teaching
S. Course Load
Course Credits Pre-Requisite/Co Requisite
No. Code
L T P
THEORY SUBJECTS
1. CSE341 Design and Analysis of Algorithm 3 1 0 4 Data Structure
Software Engineering and Testing
2 CSE343
Methodologies
3 0 0 3

3 Program Elective-2 3 0 0 3
4. Program Elective-3 3 0 0 3
5. OE-2 Open Elective – 2 3 0 0 3
Practical/Viva-Voce/Jury
6. Community Connect - - - 2
Quantitative Aptitude Behavioral and
7. ARP301
Interpersonal Skills
0 0 4 2 ARP204
8. CSP341 Design and Analysis of Algorithm Lab 0 0 2 1 Data Structure Lab
Technical Skill Enhancement Course-1 Operating system, Database
CSP302 0 0 2 1
9 Simulation Lab Management system
10. CSP397 Project Based Learning (PBL) -3 0 0 2 1 PBL-2
11. CSP399 Industrial Internship-II - - - 1 Industrial Internship-I
TOTAL CREDITS 24

School of Engineering and Technology

Prepared by :iGAPPage 18
 B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: VI
Teaching
S. Course Load Pre-Requisite/Co
Course Credits
No. Code Requisite
L T P
THEORY SUBJECTS
1. HMM305 Management for Engineers 3 0 0 3
2. CSE458 Web Technologies 3 0 0 3 Java
3 CSE344 Compiler Design 3 0 0 3 Theory of Computation
4 PE4 Program Elective-4 3 0 0 3
5. OE-3 Open Elective – 3 3 0 0 3
Practical/Viva-Voce/Jury
6. ARP302 Higher Order Mathematics and Advanced People Skills 0 0 4 2 ARP301
7. CSP458 Web Technologies Lab 0 0 2 1 Java
Principles of Operating
8. CSP344 Compiler Design Lab 0 0 2 1
system Lab
9. Technical Skill Enhancement Course-2(Application
CSP301 0 0 2 1
Development Lab)
10 CSP398 Project Based Learning (PBL) -4 0 0 2 1 PBL-3
TOTAL CREDITS 21

Prepared by :iGAPPage 19
 School of Engineering and Technology
B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: VII
Teaching
S. No. Course Code Course Load Credits Pre-Requisite/Co Requisite
L T P
THEORY SUBJECTS
1. CSE346 Artificial Intelligence 3 0 0 3
2. PE5 Program Elective-5 3 0 0 3
3. PE6 Program Elective-6 3 0 0 3
4. Comprehensive Examination 0 0 0 0 Audit
5 OE4 Open Elective - 4 3 0 0 3
Practical/Viva-Voce/Jury
6 CSP346 Artificial Intelligence Lab 0 0 2 1
7. CSP497 Major Project- 1 - - - 3 PBL-4
8. CSP499 Industrial Internship-III - - - 1 Industrial Internship-II
TOTAL CREDITS 17

Prepared by :iGAPPage 20
 School of Engineering and Technology
B.Tech-Computer Science Engineering
Batch: 2018 Onwards TERM: VIII
Teaching
S. No. Course Code Course Load Credits Pre-Requisite/Co Requisite
L T P
THEORY SUBJECTS
Practical/Viva-Voce/Jury
1. CSP498 Major Project - 2 - - - 8 Major Project - 1
TOTAL CREDITS 8

Prepared by :iGAPPage 21
Prepared by :iGAPPage 22
 Program Elective

Introduction to
Distributed
Mathematical & Android
Web Mobile Wireless System
Statistical Application
Designing Computing Networks Concepts &
Techniques in Development
CSE352 CSE460 CSE454 Design
Computer CSE350
CSE456
Science
CSE348
Introduction to Introduction Software Digital Introduction
Software
Graph Theory and to Cloud Project Image to Internet of
Testing
its Applications Computing Management Processing Things
CSE459
CSE349 CSE351 CSE353 CSA403 CSI201

Minor in Program
S. L T P C Category Prerequisite
No Course Code Course Name

1 Object Oriented
CSE243/CSP243 Programming Using 3 0 2 4 Engineering
Java
2 Data Base
CSE246/CSP246 Management 3 0 2 4 Engineering
System
3 Software
Engineering and
CSE343 3 0 0 3 Engineering
Testing
Methodologies
4 CSE346 Artificial
3 0 0 3 Engineering
Intelligence
5 CSE458 Web Technologies 3 0 0 3 Engineering
6 CSA301 Introduction to
3 0 0 3 Engineering
Machine Learning
Total Credits to be
20
taken

Prepared by :iGAPPage 23
 Honours in Computer Science and Engineering
Honours in Program Cyber Security
S. L T P C Category Prerequisite
No Course Code Course Name

1 Introduction to Cyber
CSC201 3 0 0 3 Engineering
Laws
2 Web and Mobile
CSC202 3 0 0 3 Engineering
Application security
3
CSC301/CCL301 Digital Forencics 3 0 2 4 Engineering
4
CSC302/CCL302 Ethical Hacking 3 0 2 4 Engineering
5 CSC401 Security Architecture 3 0 0 3 Engineering
6 CSC402 Risk Management 3 0 0 3 Engineering
Total Credits to be
20
taken

Honors in Program Data Sciences

S. L T P C Category Prerequisite
No Course Code Course Name

1 Applied Stsistical
CSD201 3 0 0 3 Engineering
Analysis
2 CSD202 Data Aquasition 3 0 0 3 Engineering
3 CSD301 Data Warehouse 3 0 0 3 Engineering
4 CSD302 Data Mining 3 0 2 4 Engineering
5 CSD401 Business Intelligence 3 0 0 3 Engineering
6 CSD402 Big Data Analytics 3 0 2 4 Engineering
Total Credits to be
20
taken

Honors in Program Artificial Intelligence and Machine Learning

Prepared by :iGAPPage 24
 S. L T P C Category Prerequisite
No Course Code Course Name

1 CSA201 Soft computing 3 0 0 3 Engineering

2 CSA202 Pattern Recognition 3 0 2 4 Engineering
3 Introduction to Machine
CSA301/CAL301 3 0 2 4 Engineering
Learning
4 CSA302 Neural Networks 3 0 0 3 Engineering
5 Introduction to Deep
CSA401 3 0 0 3 Engineering
Leaning
6 Robotics and Intelligent
CSA402 3 0 0 3 Engineering
Systems
Total Credits to be
20
taken

Syllabus: CSP 101:Introduction to Computer Science and Engineering

School: SET Batch : 2018

Program:B.Tech Current Academic Year:
Branch: CSE Semester:I
1 Course CSP101 Course Name
Code
2 Course Title Introduction to Computer Science and Engineering
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course UG
Status
5 Course 1. To familiarize the students about the importance of
Objective Undergraduate course on Computer Science & Engineering.
2. To discuss recent developments in hardware and software
environments.
3. To focus future application areas of Computer Science and
Engineering.
4. To discuss various research and development options in
Computer Science and Engineering.
6 Course The student should be able to:
Outcomes CO1: Understand the technical aspects of Computer Science &
Engineering Course.
CO2: Perceive some knowledge about programming in various
applications.
CO3: Acquire basic understanding about computer networking
and related technology.
CO4: Enhance some fundamental knowledge of DBMS including
application areas.

Prepared by :iGAPPage 25
 CO5: Understand the current trends in computing in discovering
wisdom/knowledge and future prediction.
7 Course This course focuses application areas of Computer Science and
Description Engineering for students admitted in undergraduate program. The
purpose of B. Tech. in Computer Science & Engineering is to be
given through this course to students.
8 Outline syllabus CO Mapping
Unit 1 Hardware aspect of Computer Science &
Engineering
A History of Computing Systems, Computer
Basics and Computer Organization.
B Computer Architecture, Introduction to CO1
various connecting devices.
C Recent additions – IoT, Robotics and new
alternate architectures.
Unit 2 Programming Aspects
A Basics of Programming, Programming
Paradigms, System Software versus
Application Software.
B Hard Computing versus Soft Computing, CO2
Data Structures and Algorithms.
C Computer Graphics, Multimedia, Computer
Vision.
Unit 3 Computer Networking
A Introduction to Networking, Various
terminologies, Client Server Technology,
Web Technology.
B Introduction to data/network security and CO3
current trends.
C Concept of Cloud Computing and
Virtualization, Real life applications.
Unit 4 Database Management Systems
A Introduction to DBMS, DBMS versus File
System, Relational DBMS.
CO4
B Information Processing and Retrieval
C Big Data Analytics & Scientific Computing
Unit 5 Artificial Intelligence
A Basics of Artificial Intelligence
B Basics of Pattern Recognition CO5
C Basics of Machine Learning
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 60% NIL 40%
Text book/s* 1. Introduction to Computer, Peter Norton, 7/e, 2017, Tata
McGraw Hill Publishing.

Prepared by :iGAPPage 26
 Other
2. Foundations of Computer Science, B A Forouzan& F Mosha
References
Learning.

CO and PO Mapping
S. No. Course Outcome Program Outcomes
(PO) & Program
Specific Outcomes
(PSO)
1. CO1: Understand the technical aspects of Computer Science PO1, PO2, PO12,
&Engineering Course. PSO4
2. CO2:Perceive some knowledge about programming in PO1, PO12, PSO1,
various applications. PSO4
3. CO3: Acquire basic understanding about computer PO1, PO2, PO12,
networking and related technology. PSO2, PSO4
4. CO4:Enhance some fundamental knowledge of DBMS PO1, PO12, PSO2,
including application areas. PSO4
5. CO5: Understand the current trends in computing in PO1, PO6, PO8, PO12,
discovering wisdom/knowledge and future prediction. PSO2, PSO4

PO and PSO mapping with level of strength for Introduction to Computer Science
&Engineering(Course Code :CSP 101)
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)
Cos PO PO PO PO PO PO PO PO PO PO PO1 PO PS PS PS PSO PS
1 2 3 4 5 6 7 8 9 10 1 12 O1 O2 O3 4 O5
CO1 3 2 - - - - - - - - - 3 3 - - 3 -

CO2 3 2 - - - - - - - - - 3 - 3 - 2 -

CO3 3 2 - - - - - - - - - 3 - 2 - 3 -

CO4 3 - - - - - - - - - - 3 - 3 - 2 -

CO5 3 - - - - 2 - 2 - - - 3 - 3 - 3 -

Syllabus: CSE 113:Programming for problem solving

School: SET Batch :2018-22

Program: B.Tech Current Academic Year:
Branch: ALL Semester:1
1 Course Code CSE113 Course Name: Programming for problem solving
2 Course Title Programming for problem solving

Prepared by :iGAPPage 27
 3 Credits 4
4 Contact Hours 3-0-2
(L-T-P)
Course Status Core
5 Course Objective 1. Learn basic programming constructs –data
types, decision structures, control structures in
C
2. learning logic aptitude programming in c
language
3. Developing software in c programming
6 Course Outcomes Students will be able to:
CO1: Create flowchart , algorithm and Pseudo-code
CO2: Understanding basic C concept
CO3: Implement Array and Functions
CO4: Understand and implement Pointers
CO5: Apply user-defined data types
7 Course Description Programming for problem solving gives the
Understanding of C programming and implement code
from flowchart or algorithm
8 Outline syllabus CO
Mapping
Unit 1 Logic Building
A Flowchart: Elements, Identifying and CO1,
understanding input/ output, Branching and
iteration in flowchart
B Algorithm design: Problem solving CO1
approach(top down/bottom up approach)
C Pseudo Code : Representation of different CO1
construct, writing pseudo-code from
algorithm and flowchart
Unit 2 Introduction to C Programming
A Introduction to C programming language, CO2
Data types, Variables, Constants, Identifiers
and keywords, Storage classes
B Operators and expressions, Types of CO2
Statements: Assignment, Control, jumping.
C Control statements: Decisions, Loops, break, CO2
continue
Unit 3 Arrays and Functions
A Arrays: One dimensional and multi CO3
dimensional arrays: Declaration, Initialization
and array manipulation (sorting, searching).
B Functions: Definition, CO3
Declaration/Prototyping and Calling, Types
of functions, Parameter passing: Call by
value, Call by reference.

Prepared by :iGAPPage 28
 C Passing and Returning Arrays from CO3
Functions, Recursive Functions.
Unit 4 Pre-processors and Pointers
A Pre-processors: Types, Directives, Pre- CO4
processors Operators (#,##,\) , Macros:
Types, Use, predefined Macros
B Pointer: Introduction, declaration of pointer CO4
variables, Operations on pointers: Pointer
arithmetic, Arrays and pointers, Dynamic
memory allocation.
C String: Introduction, predefined string CO4
functions, Manipulation of text data,
Command Line Arguments.
Unit 5 User Defined Data Types and File Handling
A Structure and Unions: Introduction, CO5
Declaration, Difference, Application, Nested
structure, self-referential structure, Array of
structures, Passing structure in function.
B Files: Introduction, concept of record, I/O CO5
Streaming and Buffering, Types of Files:
Indexed file, sequential file and random file,
C Creating a data file, Opening and closing a CO5
data file, Various I/O operations on data
files: Storing data or records in file, adding
records, Retrieving, and updating Sequential
file/random file.
Mode of examination Theory
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* Kernighan, Brian, and Dennis Ritchie. The C
Programming Language
Other References 1. B.S. Gottfried - Programming With C -
Schaum's Outline Series - Tata McGraw Hill
2nd Edition - 2004.

2. E. Balagurusamy - Programming in ANSI C -

Second Edition - Tata McGraw Hill- 1999

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) &
No. Program Specific Outcomes
(PSO)
1. CO1: Create flowchart , algorithm and PO1,PO2,PO3,PO11,PO12

Prepared by :iGAPPage 29
 Pseudo-code PSO1,PSO2,PSO3,PSO4,SPO5
2. CO2: Understanding basic C concept PO1,PO2,PO3,PO11,PO12
PSO1,PSO2,PSO3,PSO4,SPO5
3. CO3: Implement Array and Functions PO1,PO2,PO3,PO11,PO12
PSO1,PSO2,PSO3,PSO4,SPO5
4. CO4: Understand and implement Pointers PO1,PO2,PO3,PO11,PO12
PSO1,PSO2,PSO3,PSO4,SPO5
5. CO5: Apply user-defined data types PO1,PO2,PO3,PO11,PO12
PSO1,PSO2,PSO3,PSO4,SPO5

PO and PSO mapping with level of strength for Course Name Programming for
problem solving(Course Code CSE 113)
Cos PO1 PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO PSO
C 2 O6 0 O1 2 O1 4 5
S 1
E 3 2 3 - - - - - - - 2 1 3 2 2 1 2
1 CO1
1 3 2 3 - - - - - - - 2 1 3 2 2 1 2
3 CO2
3 2 3 - - - - - - - 1 1 2 3 2 1 2
CO3
CO4 3 2 3 - - - - - - - 3 2 3 2 1 1 1

CO5 3 2 3 - - - - - - - 3 1 2 2 2 1 3

Syllabus: CSP 113: Programming for problem solving Lab

School: SET Batch: 2018

Program: B.Tech. Current Academic Year: 2018-19
Branch: CSE Semester: I
1 Course Code CSP113
2 Course Title Programming for problem solving Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course 1. Learn basic programming constructs –data types,
Objective decision structures, control structures in C
2. learning logic aptitude programming in c language
3. Developing software in c programming
6 Course Students will be able to:
Outcomes CO1: Understand core concept of c Programming
CO2: Implement Array and String
CO3: Implement Functions
CO4: Use Union and Structure
CO5: Understand and implement Pointers

Prepared by :iGAPPage 30
 7 Course Programming for problem solving gives the Understanding of C
Description programming and implement code from flowchart or algorithm
8 Outline syllabus CO
Mapping
Unit 1 Logic Building CO1
Draw flowchart for finding leap year
Write a c Program to Add Two Integers
Write a program to create a calculator
Unit 2 Introduction to C Programming CO2
Write a c program to convert length meter to cm
Write a c program to convert temp
Write a c program to swap two numbers
Unit 3 Arrays and Functions CO3
Write a c program to calculate the average using
arrays
Write a c program to find the largest element of the
array
Unit 4 Pre-processors and Pointers CO4
Write a c program to swap two values using pointers
Write a c program to find largest number from array
using pointers
Unit 5 User Defined Data Types and File Handling CO5
Write a c program to store information of a student
using structure
Write a c program to store information of a student
using union
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* Kernighan, Brian, and Dennis Ritchie. The C Programming
Language
Other 4. B.S. Gottfried - Programming With C - Schaum's
References Outline Series - Tata McGraw Hill 2nd Edition -
2004.

5. E. Balagurusamy - Programming in ANSI C -

Second Edition - Tata McGraw Hill- 1999

Course outline
This course implements array and pointer and Recursive applications. The course
talks primarily about Array, string, functions, structure & union and Pointers etc.
Course Evaluation
Prepared by :iGAPPage 31
 Attendance None
Any other CA judged on the practicals conducted in the lab , weightage may be
specified
References
Text book Kernighan, Brian, and Dennis Ritchie. The C Programming Language
Other References 1. B.S. Gottfried - Programming With C - Schaum's Outline Series - Tata
McGraw Hill 2nd Edition - 2004.

2. E. Balagurusamy - Programming in ANSI C - Second Edition - Tata

McGraw Hill- 1999

Softwares Turbo C

Syllabus: MTH 142:Calculus And abstract Algebra

School: SET Batch :2018- 2022

Program: Current Academic Year: 2018-19
B.Tech.
Branch: CSE Semester: 1
1 Course MTH 142
Code
2 Course Calculus and Abstract Algebra
Title
3 Credits 4
4 Contact 3-1-0
Hours
(L-T-P)
Course Compulsory
Status

Prepared by :iGAPPage 32
 5 Course The objective of this course is to familiarize the prospective
Objective engineers with techniques in basic calculus and linear algebra. It
aims to equip the students with standard concepts and tools at an
intermediate to advanced level that will serve them well towards
tackling more advanced level of mathematics and applications
that they would find useful in their disciplines.
6 Course CO1: Explain the concept of differential calculus, illustrate
Outcomes thecurvature and Maxima, minima and saddle point. (K2, K3, K4)
CO2: Explain the basic concepts matrices and determinate,
evaluate system of linear equation by using rank and inverse
method. (K2, K3, K5)
CO3: Explain the basic concept of sets, relation, functions, groups
Rings and Field. (K2, K4)
CO4: Discuss the basic of Vector spaces. (K1, K3)
CO5: Describe and use the linear transformation and evaluate
nullity and kernel. (K1, K2, K3, K5)
CO6:Explain the concept of Eigen values and Eigen vectors;
evaluate the diagonalization of matrices, explain the basic
introduction of Inner product spaces.(K2, K3, K4, K5)
7 Course This course is an introduction to the fundamental of Mathematics.
Description The primary objective of the course is to develop the basic
understanding of differential and integral calculus, linear Algebra
and Abstract Algebra.
8 Outline syllabus: Calculus and Abstract Algebra CO
Mapping
Unit 1 Calculus
A Differentiation, Taylor’s and Maclaurin theorems CO1
with remainders; indeterminate forms, L' Hospital's
rule.

Maxima and minima, Partial derivatives, Euler’s CO1

B theorem.
C Total derivative. Evaluation of double integration. CO1
Applications of double integral (to calculate area).
Unit 2 Matrices
A Matrices, vectors: addition and scalar multiplication, CO2
matrix multiplication.
B Linear systems of equations, linear Independence, CO2
rank of a matrix, determinants, Cramer’s Rule
C Inverse of a matrix, Gauss elimination and Gauss- CO2
Jordan elimination.
Unit 3 Basic Algebra
A Sets, relations and functions. CO3
Prepared by :iGAPPage 33
 B Basics of groups, cyclic groups. CO3
C Subgroups, basics of Rings and Field. CO3
Unit 4 Vector spaces
A Vector Space, linear dependence of vectors, basis, CO4, CO5
dimension.
B Linear transformations (maps), range and kernel of CO4, CO5
a linear map, rank and nullity.
C Inverse of a linear transformation, Matrix associated CO4, CO5
with a linear map.
Unit 5 Vector spaces (Prerequisite Module 2 –Matrices &
Module-4 Vector spaces)
A Eigenvalues, Eigenvectors CO6
B Symmetric, skew-symmetric, and orthogonal CO6
Matrices, Diagonalization
C Basic introduction of Inner product spaces, Gram- CO6
Schmidt orthogonalization.
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 1. G.B. Thomas and R.L. Finney, Calculus and
book/s* Analytic geometry, 9th Edition, Pearson, Reprint,
2002.
2. Erwin Kreyszig, Advanced Engineering
Mathematics, 9th Edition, John Wiley & Sons, 2006.
Other 1. D. Poole, Linear Algebra: A Modern Introduction,
References 2nd Edition, Brooks/Cole, 2005.
2. Veerarajan T., Engineering Mathematics for first
year, Tata McGraw-Hill, New Delhi, 2008.
3. Ramana B.V., Higher Engineering Mathematics,
Tata McGraw Hill New Delhi, 11th Reprint, 2010.
4. V. Krishnamurthy, V.P. Mainra and J.L. Arora, An
introduction to Linear Algebra, Affiliated East–West
press, Reprint 2005.

COURSE OUTCOMES – PROGRAMME OUTCOMES MAPPING TABLE

PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO
C142.1 3 3 2 2 3 1 - - - 1 1 1
C142.2 3 3 3 2 2 2 - - - 1 1 2

Prepared by :iGAPPage 34
C142.3 3 3 2 2 2 1 - - - 1 1 1
C142.4 3 3 2 2 2 1 - - - 1 1 1
C142.5 3 3 2 2 2 1 - - - 1 1 2
C142.6 3 3 2 3 2 2 - - - 1 1 2
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: PHY 117, Semiconductor Physics

School: School of Batch:2018-2022

Basic Sciences and
Research
Program: B.TECH . Current Academic Year: 2018-2019
Branch: Semester: II
CSE/EC/EEE
1 Course Code PHY 117
2 Course Title Semiconductor Physics
3 Credits 4
4 Contact Hours 3-1-0
(L-T-P)
Course Status Compulsory
5 Course To make students proverbial with the fundamental concepts of
Objective Semiconductors materials and their real life applications for configuring
various electronics devices.
6 Course After the completion of this course,
Outcomes
CO1: Students will learn the various fundamental theory of materials
and concept of solid classification.
CO2: Students will learn the fundamental concepts of mobility,
conductivity, electrons and holes in an intrinsic semiconductors, Donor
and Acceptor impurities (n-type and p-type semiconductor), Fermi
levels etc.
CO3: Students will gain knowledge about the formation of depletion
region, barrier potential, Zener diode, Characteristics of Zener diode etc.

CO4: Students will have a clear understanding of Coherent sources,

interaction of radiation with matter (spontaneous and stimulated
emission), Einstein’s relation, population inversion and pumping, etc.

CO5: Students will learn the concept of optical sources: Light emitting
diode (construction, basic working principle), semiconductor laser
(construction, basic working principle), and optical detectors.

Prepared by :iGAPPage 35
 CO6: Student will be familiar with the essential concepts of
Semiconductors materials technology and their applications in
industries.

7 Course
Description This course provides the basic foundation for understanding
electronic semiconductor devices and their applications and
limitations. It has introductory elements of various concept of
material science. This course is essential for students who desire
to specialize their engineering in Computer Sciences, Electronics,
and Electronics and Electrical engineering.

8 Outline Syllabus CO
Mapping
Unit 1 Physics ofSemiconductor
A Introduction, classical free electron theory (Lorentz-Drude CO1, CO6
theory and limitations), Quantum theory of free electron
B (Fermi energy, effect of temperature on Fermi-Dirac CO1
distribution) (qualitative analysis)
C Energy bands, Classification of Solids on the basis of energy CO1
band.
Unit 2 Transport phenomena in semiconductors
A Mobility, conductivity, electrons and holes in an intrinsic CO2, CO6
semiconductors, Donor and Acceptor impurities (n-type and p
-type semiconductor)
B Fermi levels , carrier densities in semiconductor CO2
C Concentration of electrons in conduction band and holes in CO2
valence band, Drift and diffusion current, Hall effect.
Unit 3 p-n Junction
A p-n junction, types of p-n junction (step-graded and Linearly- CO3
graded junction)
B formation of depletion region, barrier potential, Zener diode, CO3
Characteristics of Zener diode
C Avalanche and Zener breakdown, comparison of Zener diode CO3, CO6
and pn junction diode, concept of tunneling, I-V
characteristics of tunnel diode.
Unit 4 Laser Physics
A Coherent sources, interaction of radiation with matter CO4
(spontaneous and stimulated emission), Einstein’s relation
B population inversion and pumping, active components of CO4
laser, optical amplification or gain
C threshold condition for laser action, three and four level CO4
lasers, Ruby and He-Ne lasers.
Unit 5 Optoelectronic Devices
A optical sources: Light emitting diode (construction, basic CO5

Prepared by :iGAPPage 36
 working principle), semiconductor laser (construction, basic
working principle)

B optical detectors: photodiode (working principle), p-i-n CO5, CO6

photodiode (working principle),
C Photovoltaic effect, p-n junction solar cell (basic working CO5, CO6
idea).

Mode of Theory
Examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text books Integrated Electronics- Millman - Halkias, Tata Mc
Graw Hill
Other 1. Semiconductor Devices Physics and Technology- S M
References Sze, John Wiley & Sons
2. Semiconductor Device Fundamentals- Robert F.
Pierret Addison Wesley Longman.
3. Semiconductor Devices- Kanaan Kano, Pearson
Education.
4. Basic Electronics by B.L Thareja
5. Principles of Electronics by V.K Mehta

Syllabus: CSE 114:Application based programming in Python

School: SET Batch :2018-2022

Program: B.Tech Current Academic Year: 2018-19
Branch: CSE Semester: II
1 Course CSE114 Course Name
Code
2 Course Application Based Programming in Python
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course Emphasis is placed on procedural programming, algorithm design, and
Objective language constructs common to most high-level languages through
Python Programming.
6 Course Upon successful completion of this course, the student will be able to:
Outcomes CO1. Select decision-making and looping structures in programming.
CO2. Apply Modular programming approach using methods and

Prepared by :iGAPPage 37
 functions.
CO3. Show the use of Python lists, tuples and dictionary.
CO4. Incorporate object-oriented programming concept in
programming.
CO5: Use of python packages in different applications.
7 Course Python is a language with a simple syntax, and a powerful set of
Description libraries. It is widely used in many scientific areas for data exploration.
This course is an introduction to the Python programming language for
students without prior programming experience. We cover data types,
control flow, object-oriented programming.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A History, Python Environment, Variables, Data CO5
Types, Operators.
B Conditional Statements: If, If- else, Nested if-else. CO1,CO5
Looping: For, While, Nested loops.
C Control Statements: Break, Continue, And Pass. CO1,CO5
Comments
Unit 2 List, Tuple and Dictionaries
A Lists and Nested List: Introduction, Accessing list, CO3
Operations, Working with lists, Library Functionand
Methods with Lists.
B Tuple: Introduction, Accessing tuples, Operations, CO3
Working, Library Functions and Methods with
Tuples.
C Dictionaries :Introduction, Accessing values in CO3
dictionaries, Working with dictionaries, Library
Functions
Unit 3 Functions and Exception Handling
A Functions: Defining a function, Calling a function, C02,CO5
Types of functions, Function Arguments

B Anonymous functions, Global and local variables C02,CO5

C Exception Handling: Definition Exception, CO2,CO5
Exception handling
Except clause, Try? finally clause
Unit 4 OOP and File Handling
A OOPs concept : Class and object, Attributes, C04
Abstraction, Encapsulation, Polymorphism and
Inheritance
B Static and Final Keyword, Access Modifiers and CO4
specifiers, scope of a class
C User Defined Exceptions CO4
Unit 5 Module and Applications
A Modules: Importing module, Math module, C02,CO5
Random module

Prepared by :iGAPPage 38
 B Matplotlib, Packages C02,CO5
C Applications: Searching Linear Search, Binary Search. C02,CO5
Sorting: Bubble Sort
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 3. The Complete Reference Python, Martin C. Brown,
book/s* McGraw Hill
Other 1. Introduction to computing in problem solving using
References Python, E Balahurusamy, McGraw Hill

2. Introduction to programming using Python, Y. Daniel

Liang, Pearson

3. Mastering Python, Rick Van Hatten, Packet

Publishing House

4. Starting out with Python, Tony Gaddis, Pearson

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) & Program
No. Specific Outcomes (PSO)
1. CO1. Apply decision and repetition PO1,PO5,PO9,PO11,PSO3
structures in program design.
2. CO2. Implement methods and PO1,PO2,PO3,PO4,PO5,PO9,PO11,PSO1,
functions to improve readability of PSO2,PSO3,PSO4,PSO5
programs.
3. CO3. Demonstrate the use of Python PO1,PO2,PO3,PO4,PO5,PO9,PO11,PSO1,
lists, tuples and dictionaries PSO2,PSO3,PSO4,PSO5
4. CO4. Describe and apply object- PO1,PO2,PO3,PO4,PO5,PO9,PO11,PSO1,
oriented programming methodology. PSO2,PSO3,PSO4,PSO5

5. CO5. Apply top-down concepts in PO1PO3,PO4,PO5,PO9,PO11,PSO1,

algorithm design. PSO2,PSO3,PSO4,PSO5
6. CO6. Write Python programs to PO1,PO4,PO5,PO9,PO11,PSO1,
illustrate concise and efficient PSO2,PSO3,PSO4,PSO5
algorithms

PO and PSO mapping with level of strength for Course Name Application Based
Programming in Python (Course Code CSE 114)

Prepared by :iGAPPage 39
 1-
COs PO1 P PO PO PO PO PO PO8 PO9 PO PO1 PO PS PS PSO PS PS
O 3 4 5 6 7 10 1 12 O1 O2 3 O4 O5
2
CO1 1 3 2 2 1 - - - 1 - 1 - 2 2 1 2 3
CO2 3 3 3 3 3 - - - 3 - 3 - 3 3 3 3 3
CO3 3 3 3 3 2 - - - 3 - 2 - 3 3 2 2 2
CO4 2 2 2 1 2 - -- - 2 - 1 - 2 1 1 2 1
CO5 2 3 2 1 2 1 2 1 2 2 1 1
CO6 1 2 1 2 1 1 1 3 2 2 1 2

Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSP 114:Application based programming in Python Lab

School: SET Batch: 2018-2022

Program: B.Tech Current Academic Year: 2018
Branch:All Semester: II
1 Course Code CSP114
2 Course Title Application Based Programming in Python Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course Emphasis is placed on procedural programming, algorithm design, and
Objective language constructs common to most high level languages through
Python Programming.
6 Course Upon successful completion of this course, the student will be able to:
Outcomes CO1. Apply decision and repetition structures in program design.
CO2. Implement methods and functions to improve readability of
programs.
CO3. Demonstrate the use of Python lists, tuples and dictionaries
CO4. Describe and apply object-oriented programming methodology.
CO5. Apply top-down concepts in algorithm design.
CO6. Write Python programs to illustrate concise and efficient
algorithms
7 Course Python is a language with a simple syntax, and a powerful set of
Description libraries. It is widely used in many scientific areas for data exploration.
This course is an introduction to the Python programming language for
students without prior programming experience. We cover data types,
control flow, object-oriented programming.
8 Outline syllabus CO Mapping

Unit 1 Practical based on conditional statements and

Prepared by :iGAPPage 40
 control structures
1. Program to implement all conditional CO1,C06
statements
2. Program to implement different control
structures
Unit 2 Practical related to List, Tuples and dictionaries
1. Program to implement operations on lists CO3,CO6
2. Program to implement operations on
Dictionary
3. Program to implement operations on Tuple
Unit 3 Practical related to Functions and Exception
Handling
1. Program to implement Exception Handling CO2,CO6
2. Program to use different functions
Unit 4 Practical related to Object Oriented
Programming
Program to use object oriented concepts like CO4,CO6
inheritance, overloading polymorphism etc.
Program for file handling
Unit 5 Practical related to Modules and Applications
Program to use modules and package CO2,CO5,CO6
Program to implement searching and sorting
Mode of Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* 4. The Complete Reference Python, Martin C. Brown,
McGraw Hill
Other 5. Introduction to computing in problem solving using
References Python, E Balagurusamy, McGraw Hill

6. Introduction to programming using Python, Y.

Daniel Liang, Pearson

7. Mastering Python, Rick Van Hatten, Packet

Publishing House

8. Starting out with Python, Tony Gaddis, Pearson

Syllabus: MTH 145:Probability and Statistics

School: SET Batch :2018- 2021

Program: B.Tech. Current Academic Year: 2018-19

Prepared by :iGAPPage 41
 Branch: CSE Semester: II
1 Course Code MTH 145
2 Course Title Probability and Statistics
3 Credits 4
4 Contact 3-1-0
Hours
(L-T-P)
Course Compulsory
Status
5 Course The objective of this course is to familiarize the students with
Objective statistical techniques. It aims to equip the students with standard
concepts and tools at an intermediate to advanced level that will
serve them well towards tackling various problems in the
discipline.
6 Course CO1: Explain the concept of probability and Random Variable.
Outcomes (K2,K3, K4)
CO2: Explain the concept of distribution functions, densities
andprobability distributions; illustrate discrete and continuous
probability distributions. (K1, K2, K3, K4)
CO3: Describe the concept of moments, skewness and Kurtosis;
evaluatecorrelation and regression – Rank correlation; discuss
bivariate distributions and their properties
. (K1, K2, K5)
CO4: Discuss the basic of Curve fitting by the method of least
squares; evaluate straight lines, second degree parabolas and
more general curves. (K1, K2, K5)
CO5: Describe and use the concepts test of significance: Large
sample test for single proportion, difference of proportions;
calculate single mean, difference of means, and difference of
standard deviations. (K1,K2,K3)
CO6: Explain the basic concepts of tests of small samples-
Student’s T test, Chi-square test for goodness of fit, and evaluate
the result. (K2, K4, K5)
7 Course This course is an introduction to the fundamental of
Description Mathematics. The primary objective of the course is to develop
the basic understanding of statistics including measures of
central tendency, correlation and regression, statistical methods
of data sampling, probability and random variables and various
discrete andcontinuous probability distributions and their
properties.
8 Outline syllabus :Probability and Statistics CO
Mapping
Unit 1 Basic Probability
A Probability spaces, conditional probability, Bayes' CO1

Prepared by :iGAPPage 42
 rule.

Discrete random variables, Independent random CO1

B variables
C Expectation of Discrete Random Variables, CO1
Chebyshev's Inequality
Unit 2 Discrete and Continuous Probability Distributions
A Discrete Probability distributions: Binomial, Poisson. CO2
B Continuous random variables and their properties, CO2
distribution functions and densities.
C Normal, exponential and gamma distribution. CO2
Unit 3 Statistics
A Moments, skewness and Kurtosis. CO3
B Correlation and regression – Rank correlation. CO3
C Bivariate distributions and their properties. CO3
Unit 4 Applied Statistics
A Curve fitting by the method of least squares- fitting CO4, CO5
of straight lines, second degree parabolas and more
general curves.
B Test of significance: Large sample test for single CO4, CO5
proportion,
C Difference of proportions, single mean, difference of CO4, CO5
means, and difference of standard deviations.
Unit 5 Testing Hypothesis
A Test for single mean, difference of means CO6
B test for ratio of variances CO6
C Chi-square test for goodness of fit and CO6
independence of attributes
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* 1. Erwin Kreyszig, Advanced
Engineering Mathematics, 9th
Edition, John Wiley & Sons, 2006.
2. P. G. Hoel, S. C. Port and C. J.
Stone, Introduction to Probability
Theory, Universal Book Stall, 2003
(Reprint).
3. S. Ross, A First Course in
Probability, 6th Ed., Pearson
Education India, 2002.

Prepared by :iGAPPage 43
 Other 1. W. Feller, An Introduction to Probability
References Theory and its Applications, Vol. 1, 3rd
Ed., Wiley, 1968.
2. B.S. Grewal, Higher Engineering
Mathematics, Khanna Publishers, 35th
Edition, 2000. Veerarajan T.,
Engineering Mathematics (for
semester III), Tata McGraw-Hill, New
Delhi, 2010.

COURSE OUTCOMES – PROGRAMME OUTCOMES MAPPING TABLE

PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO
C145.1 3 3 2 2 3 1 - - - 1 1 1
C145.2 3 2 3 2 2 2 - - - 1 1 2
C145.3 3 3 2 2 2 1 - - - 1 1 1
C145.4 3 2 2 2 2 1 - - - 1 1 1
C145.5 3 3 2 2 2 1 - - - 1 1 2
C145.6 3 3 2 3 2 2 - - - 1 1 2
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSP103:Multimedia Application Lab

School: SET Batch: 2018-2022

CSE/IT Current Academic Year: 2018
Semester: II
1 Course Code CSP103
2 Course Title Multimedia application Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Core
Status
5 Course Provide the knowledge to design and develop web application .Students will
Objective gain the skills and project-based experience needed for entry into web
application and development careers
6 Course On successful completion of this module students will be able to:
Outcomes 1. Use critical thinking skills to create web pages

Prepared by :iGAPPage 44
 2. Design interactive web pages
3. Design web pages/site having validation on user data access.
4. Develop web site for small business and organization or for individual
7 Course This course is an overview of the modern technologies used for the Web
Description development.
8 Outline syllabus CO Mapping
Unit 1
1. Write HTML code to display your bio-data CO1,CO2
2. Write HTML code to show the working of
hyperlinks.Create a Home page having three links: About
Us, Our Services and Contact Us. Create separate web
pages for the three links.
3. Write HTML code to create unordered list. Create disc
bullets, circle bullets, square bullets lists of the subjects
you are studying in CURRENT semester
Unit 2
1. Write HTML code to create ordered list. Create CO2
numbered, uppercase list, lowercase list, roman
numbered list, lower roman numbered list of the
subjects you are studying in CURRENT semester.
2. Write HTML code to perform Image mapping using
image tags.Set image height/width, border, alignment
properties.
3. Write a HTML code to create Table to store information
regarding employee using Table tags. Employee name,
Id, DOJ, Experience. Create table for 5 employees.
Unit 3
1. Write a HTML code for student registration using form CO2,CO3
tags.
2. Write a HTML code to show the working of Canvas tag.
3. Write HTML code to embed multimedia: audio and video
into web page
Unit 4

1. Write an HTML code to demonstrate the usage of inline CO3

CSS.
2. Write an HTML code to demonstrate the usage of
internal CSS.
3. Write an HTML code to demonstrate the usage of
external CSS.

Unit 5
1. Write an HTML code to design an image gallery. CO3,CO4
2. Design horizontal navigation bar for XYZ companyhome;
services; investors; past record &achievements;careers;
contact us.
Careers have dropdown
menu >Departmentwise>Countrywise>Profile Wise
3. Write Javascript code to design calculator to perform

Prepared by :iGAPPage 45
 subtraction, multiplication, division, addition operation.
5.

Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* Ivan Bayross,”HTML,DHTML, JavaScript, Perl & CGI”, BPB
Publication
Other 1. Rick Delorme,” Programming in HTML5 with
References JavaScript and CSS3”, Microsoft

Syllabus: CSE 247, Computer organization and architecture

School: SET Batch: 2018
Program: B.Tech Current Academic Year: 2018-2019
Branch: CSE/IT Semester: III
1 Course Code CSE247 Course Name
2 Course Title Computer Organization and Architecture

3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Compulsory
Status
5 Course To impart an understanding of the internal organization and operations
Objective of a computer and to introduce the concepts of processor logic design
and control logic design.
6 Course Upon successful completion of this course, the student will be able to:
Outcomes CO1:Identify the basic structure and functional units of a digital
computer. CO2:Study the design of arithmetic and logic unit and

Prepared by :iGAPPage 46
 implementation of fixedpoint and floating-point arithmetic operations
CO3:Understand basic processing unit and organization of simple
processor including instruction sets, instruction formats and various
addressing modes
CO4:Study the two types of control unit techniques
CO5:Describe hierarchical memory systems including cache memories
and select appropriate interfacing standards for I/O devices.
7 Course This course discusses the basic structure of a digital computer and
Description used for understanding the organization of various units such as
control unit, Arithmetic and Logical unit and Memory unit and I/O unit in
a digital computer.
8 Outline syllabus CO Mapping
Unit 1 Computer Organization and Design
A Functional units of digital system and their CO1
interconnections, buses, bus architecture, types of
buses and bus arbitration. Register bus and memory
transfer
B Register transfer Language, Registertransfer, Bus & CO1
memory transfer, Logic micro operations, Shift micro
operation.
C Adder-Subtractor- Incrementor, Arithmetic unit, Logic CO1
unit.
Unit 2 Computer Arithmetic
A Representation of numbers in 1’s and 2’s CO1, CO2
complement, Addition and
subtractionofs i g n e d numbers.
B Binary Multiplier, Multiplication: Signed operand CO1, CO2
multiplication, Booth algorithm
C Floating point arithmetic representation: addition and CO1, CO2
subtraction.
Unit 3 Processor Organization
A General register organization, stack organization CO3
B Instruction set architecture of a CPU - registers, CO3
Instruction types, formats, instruction execution cycle
C Addressing modes, RISC/CISC CO3
Unit 4 Control Unit
A Introduction to CPU design, Instruction interpretation CO3, CO4
and execution, Micro-operation and their register
transfer language (RTL) specification
B Hardwired control CPU design CO3, CO4
C Microprogrammed control CPU design CO3, CO4
Unit 5 Memory and I/O
A RAM/ROM/Flash memory, Designing Memory System CO1, CO5
using RAM and ROM chips
B Cache memory: Memory hierarchy, performance CO1, CO5
Considerations, mapping techniques
C Input Output: Isolated vs. Memory mapped I/O, CO1, CO5
Programmed I/O, Interrupt driven I/O, Direct Memory
Access
Mode of Theory

Prepared by :iGAPPage 47
 examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* 1. M. Morris Mano, Computer System
Architecture, Pearson
Other
1. C. Hamacher, Z. Vranesic and S. Zaky,
References
"Computer Organization", McGrawHill, 2002.
2. W. Stallings, "Computer Organization and
Architecture - Designing for Performance",
Prentice Hall of India, 2002.
3. D. A. Patterson and J. L. Hennessy, "Computer
Organization and Design - The
Hardware/Software Interface", Morgan
Kaufmann,1998.
4. J.P. Hayes, "Computer Architecture and
Organization", McGraw-Hill, 1998.

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) & Program
No. Specific Outcomes (PSO)
1. CO1. Identify the basic structure and PO1, PO2, PO3, PO6, PO12, PSO5
functional units of a digital computer.
2. CO2. Study the design of arithmetic and PO1, PO2, PO3, PO6, PO12, PSO5
logic unit and implementation of
fixedpoint and floating-point arithmetic
operations
3. CO3. Understand basic processing unit PO1, PO2, PO3, PO6, PO12, PSO5
and organization of simple processor
including instruction sets, instruction
formats and various addressing modes
4. CO4. Study the two types of control unit PO1, PO2, PO3, PO4, PO6, PO12, PSO4,
techniques PSO5
5. CO5. Describe hierarchical memory PO1, PO2, PO3, PO6, PO12, PSO4,
systems including cache memories and PSO5
select appropriate interfacing standards
for I/O devices

PO and PSO mapping with level of strength for Course Name Computer Organization
and Architecture (Course Code CSE 247)
C Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1 PSO PSO PSO PSO PSO
0 1 2 1 2 3 4 5
S
CO1 3 1 1 - - 2 - - - - - 2 - - - - 2
E
2 CO2 3 3 3 - - 3 - - - - - 3 - - - - 3
4

Prepared by :iGAPPage 48
7 CO3 3 2 3 - - 2 - - - - - 3 - - - - 3

CO4 3 2 2 - - 1 - - - - - 3 - - - 3 2

CO5 3 3 3 - - 2 - - - - - 3 - - - 3 2

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 242, Data Structures

School: SET Batch :2018-2022

Program: B.Tech. Current Academic Year: 2018-19
Branch:CSE/IT Semester:III
1 Course CSE242
Code
2 Course Title Data Structures
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Core
Status
5 Course 1. Learn the basicconcepts of Data Structures and algorithms.
Objective 2. Design and Implementation of Various Basic and Advanced Data
Structures.
3. Learn the concepts of various searching, Sorting and Hashing
Techniques.
4. Choose the appropriate data structures and algorithm design
method for a specified application.

6 Course CO1: Implement operation like traversing, insertion, deletion, searching

Outcomes etc. on various data structures.
CO2: Evaluate algorithms and data structures in terms of time and
memory complexity.
CO3 Understand the application of linear data structure(s) to
solve various problems
CO4: Understand the application of non linear data structure(s) to
solve various problems.
CO5: Implement and know when to apply standard algorithms for
searching and sorting.
CO6: Choose the most appropriate data structure(s) for a given
problem

7 Course This course starts with an introduction to data structures with its
Description classification, efficiency of different algorithms, array and pointer
based implementations and Recursive applications. As the course
progresses the study of Linear and Non-Linear data structures are

Prepared by :iGAPPage 49
 studied in details. The course talks primarily about Linked list,
stacks, queue, Tree structure, Graphs etc. This Course also deals
with the concept of searching, sorting and hashing methods.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
A Data Structure – Definition, Operations and Applications, CO1
Abstract Data Types, Algorithm – Definition, Complexity
and Asymptotic notations, Time and Space tradeoffs.
B Programming Principles – The art of writing programs, CO1
Recursion – Definition, Examples- Tower of Hanoi
problem, Fibonacci Series.
C Arrays: Implementation of One Dimensional Arrays, CO1
Multidimensional Arrays, Pointer Arrays. Applications of
Arrays, Address Calculation, Matrix Operations, Dense
and Sparse Data in Arrays.
Unit 2 Linked List
A Concept of Linked List, Garbage Collection, Overflow and CO2
Underflow, Array Implementation and Dynamic
Implementation of Singly Linked Lists
B Array Implementation and Dynamic Implementation of CO3
Doubly Linked List, Circularly Linked List
C Operations on a Linked List- Insertion, Deletion, CO2
Traversal, Polynomial Representation and Addition
Unit 3 Stack and Queue
A Stacks: Definitions, Primitive operations, Application of CO3
stacks – Conversion of Infix Expression to Postfix form,
Evaluation of Postfix Expressions
B Queues: Definition, Primitive Operations, Implementation CO3
of Circular Queues, Priority Queues
C Deques, Application of Queues. CO3
Implementation - Linked Stacks, Linked Queues.
Unit 4 Tree and Graphs
A Trees: Terminologies, Binary tree, CO4, CO6
Representation,Applications – Operations on Binary
Search Trees, Binary Search Algorithm, B Trees -
Operations on a B Tree, Applications of B-trees.AVL Tree
B Graph: Terminology, Representation, Traversals- Depth CO4, CO6
First Search, Breadth First Search.
C Graph Applications – Minimum Spanning Trees – Prim’s CO4, CO6
and Kruskal’s Algorithms, Shortest Path – Dijkstra’s
andFlyodWarshall’s Algorithm
Unit 5 Searching, Sorting and Hashing
A Implementation and Analysis - Linear search, Binary CO5
Search
B Implementation and Analysis- Bubble Sort, Merge Sort, CO5
Insertion Sort. Implementation and Analysis - Quick Sort,
Selection Sort, Heap Sort,
C Hashing: Concepts and Applications, Hash Functions, CO5
Prepared by :iGAPPage 50
 Methods of Resolving Clashes
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 1. Lipschutz, “Data Structures” Schaum’s Outline
book/s* Series, TMH
Other 1. Aaron M. Tenenbaum, Yedidyah Langsam and
References Moshe J. Augenstein “Data Structures Using C and
C++” , PHI
2. Horowitz and Sahani, “Fundamentals of Data
Structures”, Galgotia Publication
3. Jean Paul Trembley and Paul G. Sorenson, “An
Introduction to Data Structures with applications”,
McGraw Hill
4. R. Kruse etal, “Data Structures and Program
Design in C”, Pearson Education
5. G A V Pai, “Data Structures and Algorithms”, TMH

CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program
Specific Outcomes
(PSO)
1. Handle operation like traversing, insertion, deletion, PO1, PO3, PSO3
searching etc. on various data structures.
2. Evaluate algorithms and data structures in terms of time PO1, PO2, PO3, PSO1,
and memory complexity. PSO2
3. Understand the application of linear data PO2, PO3, PO4, PO9,
structure(s) to solve various problems PSO1, PSO2
4. Understand the application of non linear data PO3, PO9, PSO1, PSO2
structure(s) to solve various problems.
5. Implement and know when to apply standard PO1, PO2, PO9,
algorithms for searching and sorting. PSO1,PSO3
6. Choose the most appropriate data structure(s) for a PO1, PO2, PO4, PO9,
given problem PSO1

Prepared by :iGAPPage 51
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Course Course PO PO PO PO PO PO PO PO PO PO PO PSO PSO PS PS PS

PO
Code Name 1 2 3 4 5 6 7 8 9 10 11 12 1 2 O3 O4 O5
Data
Structure
s Using C
2 1 2 1
CO1
2 1 2 3 1
CSE CO2
242 3 3 2 3 3
CO3
3 3 2 3 3 3
CO4
1 2 2
CO5
3 3 2 3
CO6

Syllabus: CSP 242, Data Structure Lab

School: SET Batch: 2018-2022

Program: B.Tech. Current Academic Year: 2018-19
Branch: CSE/IT Semester: III
1 Course Code CSP242
2 Course Title Data Structure Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course 1. Learn the basicconcepts of Data Structures and algorithms.
Objective 2. Design and Implementation of Various Basic and Advanced
Data Structures.
3. Learn the concepts of various searching, Sorting and Hashing
Techniques.
4. Choose the appropriate data structures and algorithm design
method for a specified application.

6 Course CO1: Handle operation like traversing, insertion, deletion, searching etc.
Outcomes on various data structures.
CO2 Implement the application of linear data structure(s) to
solve various problems
CO3: Implement the application of non linear data structure(s) to
solve various problems.
CO4: Implement and know when to apply standard algorithms for
searching and sorting.
CO5: Choose the most appropriate data structure(s) for a given

Prepared by :iGAPPage 52
 problem

7 Course This course starts with an introduction to data structures with its
Description classification, efficiency of different algorithms, array and pointer
based implementations and Recursive applications. As the
course progresses the study of Linear and Non-Linear data
structures are studied in details. The course talks primarily about
Linked list, stacks, queue, Tree structure, Graphs etc. This
Course also deals with the concept of searching, sorting and
hashing methods.

8 Outline syllabus CO
Mapping
Unit 1 Introduction CO1
Program to implement Operation on Array such as CO1
Traversing, Insertion & Deletion operation
Program based on Recursion such as Towers of CO1
Hanoi, Fibonacci series etc.
Unit 2 Linked List CO2
Program to implement different operation on the CO2
following linked list: Singly, Doubly and circular linked
list.
Unit 3 Stack & Queue CO3
Program to Implement Stack operation using Array and CO3
Linked list
Program to convert infix expression to post fix CO3
expression
Program on Evaluation of Post fix expression CO3
Program to implement queue operation using array and CO3
linked list
Program to implement circular queue and deque. CO3
Unit 4 Tree & Graph CO4, CO6
Program to implement binary tree and BST. CO4, CO6
Program to implement MST and shortest path CO4, CO6
algorithm.
Unit 5 Searching, Sorting & Hashing CO5
Program on Searching and Hashing CO5
Program on Sorting. CO5
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* 1. Lipschutz, “Data Structures” Schaum’s Outline
Series, TMH
Other 1. Aaron M. Tenenbaum, Yedidyah Langsam and
References Moshe J. Augenstein “Data Structures Using C and

Prepared by :iGAPPage 53
 C++” , PHI
2. Horowitz and Sahani, “Fundamentals of Data
Structures”, Galgotia Publication
3. Jean Paul Trembley and Paul G. Sorenson, “An
Introduction to Data Structures with applications”,
McGraw Hill
4. R. Kruse etal, “Data Structures and Program
Design in C”, Pearson Education
5. G A V Pai, “Data Structures and Algorithms”, TMH

Syllabus: CSE 243, Object Oriented Programming Using JAVA

School: SET Batch : 2018

Program: Current Academic Year: 2018-2019
B.Tech
Branch:CSE Semester:III
1 Course CSE243 Course Name
Code
2 Course Object Oriented Programming Using JAVA
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course UG
Status
5 Course 1.GainknowledgeaboutbasicJavalanguagesyntaxandsemanticstowriteJavapr
Objective ogramsanduse concepts such as variables, conditional and iterative
execution methods etc.
2. Understand the fundamentals of object-oriented programming in Java,
including defining classes, objects, invoking methods etc and exception
handling mechanisms.
3. Understand the principles of inheritance, packages and interfaces.
6 Course Students will be able to:
Outcomes CO1. Identify classes, objects, members of a class and relationships among them
needed for a specific problem.
CO2. Write Java programs using OOP principles and demonstrate the
concepts of polymorphism and inheritance
CO3.Create Java programs to implement error-handling techniques using
exception handling.
CO4. Construct a professional looking package for business project using
java doc.
7 Course Basic Object Oriented Programming (OOP) concepts, including

Prepared by :iGAPPage 54
 Descriptio objects, classes, methods, parameter passing, information hiding,
n inheritance and polymorphism are introduced and their implementations
using Java are discussed.
8 Outline syllabus CO Mapping
Unit 1 Introduction to Object Oriented Paradigm
A History, The meaning of Object Orientation, Features of CO1, CO2
Java, OOPs concepts object identity,
B Encapsulation, information hiding, polymorphism CO1, CO2
inheritance Java virtual machine,
C Byte Code, Architecture of JVM, Class Loader Execution CO1,
Engine, Garbage collection. CO2,CO3
Unit 2 Introduction to Java
A Java development Kit(JDK),Introduction to IDE for java CO1,
development, Setting java environment(steps for path CO2,CO4
and CLASSPATH setting).
B Constants, Variables, Data Types, Operators, CO1,
Expressions. CO2,CO4
C Decision Making Branching, Loops, command line CO1,
argument. CO2,CO4
Unit 3 Class & Object
A Arrays, Type conversion & casting, Input from keyboard, CO1,CO2,CO
Classes Objects. 3
B Methods Method overloading, Constructors, CO1,CO2,CO
Constructors overloading. 3
C static keyword, Introducing Access Control, String CO4,CO2
handling.
Unit 4 Inheritance, package and Interface Inheritance
Implementation
A Multilevel Hierarchy, Overriding methods, Polymorphism, CO1,CO2,CO
use of this and super, Constructor call in inheritance 3
Abstract class and method,
B Final class, method and variable, Implementing Interface, CO1,CO2,CO
Concept of multiple inheritance in Java, Wrapper class 3
C Packages: User defined packages, built-in packages CO1,CO2,CO
(java.lang package), Access modifiers. 3
Unit 5 Exception and Multithreading
A Input/output: Exploring java.io, File,StreamClassesByte CO1,CO2,CO
Stream Classes and Character stream Classes,. 3
B reading and writing in file, Introduction to Exception CO1,CO2,CO
Handling, Introduction to try, catch, Finally , throw and 3
throws, Checked and Unchecked exceptions, User define
exception
C Java's Built-in Exception Chained Exception, Introduction to CO1,CO2,CO
Multithreading: Creating thread using Runnable interface 3
and Thread class, Thread life cycle, Thread priorities, sleep
method.

Prepared by :iGAPPage 55
 Mode of Theory
examinati
on
Weightag CA MTE ETE
e 30% 20% 50%
Distributio
n
Text 1.Schildt H, “The Complete Reference JAVA2”, TMH
book/s*
Other
Reference 1. Balagurusamy E, “Programming in JAVA”, TMH
s 2. Professional Java Programming:BrettSpell,WROX
Publication

CO and PO Mapping
S. Course Outcome Program Outcomes
N (PO) & Program
o. Specific Outcomes
(PSO)
1. CO1. Identify classes, objects, members of a class and relationships PO1,PO2,PO3,PO4,
among them needed for a specific problem. PSO1
2. CO2:WriteJavaapplicationprogramsusingOOPprinciplesandprop PO1, PO3, PO4,
erDemonstrate the concepts of polymorphism and inheritance PSO2
3. CO3. How to test, document and prepare a professional looking PO1,PO2,PO3,PO4
package for each business project using java doc.
4. CO3. Write Java programs to implement error handling techniques PO9, PO10,PO11,
using exception handling. PSO5

PO and PSO mapping with level of strength for Course Name Object Oriented
Programming using JAVA (Course code CSE 243)
Cos PO1 PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO PSO
2 O6 0 O1 2 O1 4 5
1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Prepared by :iGAPPage 56
Syllabus: CSP 243, Object Oriented Programming Using JAVA Lab

School: SET Batch: 2018

Program: B.Tech Current Academic Year:
Branch:CSE Semester:III
1 Course Code CSP243
2 Course Title Object oriented programming using JAVA Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course 1. Gain knowledge about basic Java language syntax and
Objective semantics to write Java programs and use concepts such as
variables, conditional and iterative execution methods etc.
2. Understand the fundamentals of object-oriented programming
in Java, including defining classes, objects, invoking methods etc
and exception handling mechanisms.
3. Understand the principles of inheritance, packages and
interfaces.
6 Course Students will be able to:
Outcomes CO1. Identify classes, objects, members of a class and
relationships among them needed for a specific problem.
CO2. Write Java application programs using OOP principles and
proper Demonstrate the concepts of polymorphism and
inheritance
CO3. Write Java programs to implement error handling techniques
using exception handling.
CO4. How to test, document and prepare a professional looking
package for each business project using javadoc.
7 Course Basic Object Oriented Programming (OOP) concepts, including
Description objects, classes, methods, parameter passing, information hiding,
inheritance and polymorphism are introduced and their

Prepared by :iGAPPage 57
 implementations using Java are discussed.
8 Outline syllabus CO
Mapping
Unit 1 Practical based on classes and objects CO1,CO2
Sub unit - a, b and c detailed in Instructional Plan
Unit 2 Practical based on constructors CO1,CO2
Sub unit - a, b and c detailed in Instructional Plan
Unit 3 Practical based on inheritance and package CO2, CO4
Sub unit - a, b and c detailed in Instructional Plan
Unit 4 Practical based on Polymorphism CO1, CO2
Sub unit - a, b and c detailed in Instructional Plan
Unit 5 Practical based on Exception handling CO1, CO3
Sub unit - a, b and c detailed in Instructional Plan
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text 1.Schildt H, “The Complete Reference JAVA2”, TMH
book/s*
Other 1. Balagurusamy E, “Programming in JAVA”, TMH
References 2.
ProfessionalJavaProgramming:BrettSpell,WROX
Publication

Syllabus: CSP 297, Project Based Learning -1

School: SET Batch : 2018 - 2022

Program: B.Tech Current Academic Year: 2018-2019
Branch: CSE / IT Semester: 3rd
1 Course Code CSP297 Course Name: Project Based Learning -1
2 Course Title Project Based Learning -1
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory
5 Course Objective 1. To align student’s skill and interests with a
realistic problem or project
2. To understand the significance of problem and
its scope
3. Students will make decisions within a
framework
6 Course Outcomes Students will be able to:
CO1: Acquire practical knowledge within the chosen

Prepared by :iGAPPage 58
 area of technology for project development
CO2: Identify, analyze, formulate and handle
programming projects with a comprehensive and
systematic approach
CO3: Discuss and accumulate the background
information
CO4: Develop effective communication skills for
presentation of project related activities
CO5: Contribute as an individual or in a team in
development of technical projects
CO6: Prepare a technical report based on the project.
7 Course Description In PBL-1, the students will learn how to define the
problem for developing projects, identifying the skills
required to develop the project based on given a set of
specifications and all subjects of that Semester.
8 Outline syllabus CO
Mapping
Unit 1 Problem Definition, Team/Group formation and CO1, CO2
Project Assignment.
Unit 2 Finalizing the problem statement, resource CO1, CO2
requirement, if any and design of the proposed
project.
Develop a block diagram and flowchart of proposed
system algorithm.
Unit 3 Implementation work under the guidance of a faculty CO1,
member and obtain the appropriate results. CO2, CO3
Unit 4 Demonstrate and execute Project with the team. CO3, CO4
Unit 5 The presentation, report, work done during the term CO4,
supported by the documentation, forms the basis of CO5, CO6
assessment.
Report should include Abstract, Introduction,
Proposed System Design/Algorithm, Experimentation
& Result Analysis, Conclusion, and References.
Presentation – PBL-1

Mode of Theory
examination
Weightage CA MTE ETE
Distribution 60% NA 40%
Text
book/s*
Other
References

Prepared by :iGAPPage 59
 CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No.
1. CO1: Acquire practical knowledge within the PO1, PO2, PO4, PO9, PO10,
chosen area of technology for project PO11, PO12
development
2. CO2: Identify, analyze, formulate and handle PO1, PO2, PO4, PO7, PO9,
programming projects with a comprehensive PO10, PO11, PO12
and systematic approach
3. CO3: Discuss and accumulate the PO1, PO2, PO5, PO9, PO10,
background information PO11, PO12
4. CO4: Develop effective communication skills PO1, PO2, PO6, PO9, PO10,
for presentation of project related activities PO11, PO12
5. CO5: Contribute as an individual or in a team PO1, PO2, PO3, PO4, PO5,
in development of technical projects PO6, PO7, PO8, PO9, PO10,
PO11, PO12
6. CO6: Prepare a technical report based on the PO1, PO2, PO3, PO4, PO5,
project. PO6, PO7, PO8, PO9, PO10,
PO11, PO12

PO and PSO mapping with level of strength for Course Name Project Based Learning -
1 (Course Code CSP297)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

C CO1 3 3 - 3 - - - - 3 3 2 3
S CO2 3 2 - 3 - - 2 - 3 3 2 3
E
2 CO3 3 2 - - 2 - - - 3 3 2 3
9
CO4 3 3 - - - 2 - - 3 3 2 3
7
CO4 3 3 2 2 2 2 3 3 3 3 2 3
CO4 3 3 2 2 2 2 3 3 3 3 2 3
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSP 299, Industrial Internship-1

School: SET Batch : 2018

Program:B.Tech Current Academic Year:
Branch: CSE Semester:III
1 Course CSP299 Course Name
Code
2 Course Title Industrial Internship-1

Prepared by :iGAPPage 60
 3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course UG
Status
5 Course 1. Acquire knowledge of the industry in which the internship is
Objective done.

2. Apply knowledge and skills learned in the classroom in a

work setting.

3. To decide the future application areas of Computer

Science and Engineering.

6 Course CO1. An ability to apply knowledge of mathematics, science, and

Outcomes engineering

CO2. An ability to design a system, component, or process to

meet desired needs within realistic constraints such as economic,
environmental, social, political, ethical, health and safety,
manufacturability, and sustainability

CO3. An ability to function on multidisciplinary teams

CO4. An ability to identify, formulate, and solve engineering

problems

CO5. An understanding of professional and ethical responsibility

CO6. Understanding the impact of engineering solutions in a

global, economic, environmental, and societal context
7 Course An internship experience provides the student with an opportunity
Description to explore career interests while applying knowledge and skills
learned in the classroom in a work setting.
8 Outline syllabus CO Mapping
Unit 1 Submission of Internship Proposal to be CO1
approved by academic advisor. For that
students will select the company and field,
ideally at the end of the first year.
Unit 2 The Student will submit the work plan approved CO2
by the supervising faculty at the university and
the internship supervisor for the organisation
offering the internship.
Unit 3 The student will do project implementation CO3,CO4

Prepared by :iGAPPage 61
 during Internship under the guidance of the
Program Director of the Host Organization. it
will be further supervised by faculty members at
the University. This activity must guarantee
continuous presence and continuity to activities
related to project.
Unit 4 Submission of evaluation form and final report CO4,CO6
completed by the intern.
Unit 5 Final evaluation form completed by the CO5
supervisor at the Host Organization and final
presentation before departmental committee.
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 60% NIL 40%
Text book/s* NA
Other
NA
References

CO and PO Mapping
S. No. Course Outcome Program Outcomes
(PO) & Program
Specific Outcomes
(PSO)
1. CO1. An ability to apply knowledge of PO1, PO2, PO12,
mathematics, science, and engineering PSO4
2. CO2. An ability to design a system, component, PO1, PO12, PSO1,
or process to meet desired needs within PSO4
realistic constraints such as economic,
environmental, social, political, ethical, health
and safety, manufacturability, and
sustainability.
3. CO3. An ability to function on multidisciplinary PO1, PO2, PO12,
teams PSO2, PSO4
4. CO4. An ability to identify, formulate, and solve PO1, PO12, PSO2,
engineering problem. PSO4
5. CO5. An understanding of professional and ethical PO1, PO6, PO8, PO12,
responsibility. PSO2, PSO4

PO and PSO mapping with level of strength for Industrial Internship(Course Code CSP
299)
Cos PO PO PO PO PO PO PO PO PO PO PO PO PS PS PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 3 4 5

Prepared by :iGAPPage 62
CO1 3 2 - - - - - - - - - 3 3 - - 3 -

CO2 3 2 - - - - - - - - - 3 - 3 - 2 -

CO3 3 2 - - - - - - - - - 3 - 2 - 3 -

CO4 3 - - - - - - - - - - 3 - 3 - 2 -

CO5 3 - - - - 2 - 2 - - - 3 - 3 - 3 -

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 244, Principles of Operating System

School: SET Batch : 2018-2022
Program: Current Academic Year: 2018-19
B.Tech
Branch: CSE Semester: IV
1 Course CSE Course Name: Principles of Operating System
Code 244
2 Course Principles of Operating System
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Core
Status
5 Course 1. This course introduces the challenges for designing the
Objective operating systems.
2. Includes different design principles and algorithms.
3. Evaluation of algorithms proposed.
4. Implementation of algorithms and utilities.
6 Course Students will be able :
Outcomes CO1:To Understand the basic concept of Operating system.
CO2:Explore process management concepts including scheduling,
synchronization, deadlocks
CO3: To understand and implement algorithms in resource
allocation and utilization.
CO4: To integrate and interpret effectiveness, efficiency of
algorithms used for resource management of operating systems.
7 Course This course introduces the design principles of operating systems,
Description resource management, identifying challenges and applying
respective algorithms.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Operating System Concepts and functions, CO1
Comparison of different Operating system

Prepared by :iGAPPage 63
 B Types of Operating Systems (Batch, CO1
Multiprogramming ,Multi Tasking ,
Multiprocessing, Distributed and Real Time
Operating System)
C Operating System Structure(Monolithic, Layered CO1
and Microkernel ), Operating System Services
Unit 2 Process Synchronization
A Process Concepts (PCB, Process States , CO1, CO2
Process Operations, Inter process
communication)
B Critical Section problem & their solutions, CO1, CO2
Introduction to Semaphores
C Classical Problems of Synchronization(Producer CO1, CO2
Consumer Problem, Readers Writer Problem,
Dining philosophers problem)
Unit 3 CPU Scheduling
A Concept , Types of schedulers( Short term, Long CO1,CO2
term, Middle term), Dispatcher, Performance
Criteria
B CPU Scheduling Algorithms( FCFS, SJF, Priority, CO1,CO2,CO3,CO4
Round Robin, Multilevel Queue, Multilevel
feedback Queue)
C Deadlock concepts & Handling CO1,CO2,CO3,CO4
Techniques(Avoidance, Prevention and
Detection & Recovery)
Unit 4 Memory Management
A Memory Hierarchy, Memory Management Unit CO1,CO2,CO3
B Paging, Segmentation CO1,CO2,CO3
C Virtual memory concept, demand paging, Page CO1,CO2,CO3
replacement algorithms(FCFS, Optimal, LRU)
Unit 5 INPUT-OUTPUT Management
A Input –Output interface, Modes of data CO1,CO2,CO3
transfer(Programmed, interrupt and DMA)
B Disk structure , Disk scheduling(FCFS,SSTF, CO1,CO2,CO3,CO4
SCAN, LOOK,C-SCAN, C-LOOK)
C File Concept ,File operations, File Directories, CO1,CO2,CO3
Case study of Windows Operating System
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 2. Silberschatz G, Operating System
book/s* Concepts, Wiley
Other 1. W. Stalling, “Operating System”, Maxwell
References Macmillan
2. Tannenbaum A S, Operating System
Design and Implementation, Prentice Hall
India
3. Milenkovic M, Operating System
Concepts, McGraw Hill

Prepared by :iGAPPage 64
 CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program Specific
Outcomes (PSO)
1. CO1: To identify the challenges and apply suitable PO1,PO2,PO3,PO4,PSO1
algorithms for them.
2. CO2: To assess the strengths and weaknesses of the PO1, PO3, PO4, PSO2
algorithms.
3. CO3: To understand and implement algorithms in PO1,PO2,PO3,PO4
resource allocation and utilization.
4. CO4: To integrate and interpret effectiveness, efficiency PO9, PO10,PO11, PSO5
of algorithms used for resource management of
operating systems.

PO and PSO mapping with level of strength for Course Name Principles of Operating
System (Course Code CSE 244)
C Cos PO1 PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO PSO
S 2 O6 0 O1 2 O1 4 5
E 1
2 CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2
4
4 CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSP 244, Principles of Operating System Lab

School: SET Batch: 2018

Program: B.Tech Current Academic Year: 2018-19
Branch: CSE Semester: IV
1 Course Code CSP 244
2 Course Title Principles of operating System Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course
Status
5 Course Introduces different type operating systems, functions of
Objective operating systems, working in a Unix/Linux and Windows
system, writing programs on Process management and file
management.

Prepared by :iGAPPage 65
 6 Course
Outcomes CO1: Working with single user multi task and multi-user
multi-tasking environment.
CO2: Identify and use utilities of Windows & Unix operating
systems
CO3: Use the resources of operating system i.e. process
management and file management
CO4: Writing programs on Process creation, multiple
process creation, process synchronization, file operations
and file buffering.
7 Course The course is designed to make the students
Description research/industry ready as operating systems are
indispensable for the systems used in industries/research
organizations. New operating systems for different gadgets
are launched in last few years. So the students will get the
design principles operating system in this course.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
Illustration of Different types of operating CO1
system: Single user Multi task, Multi user Multi
task
Basic Windows features & Unix commands. CO2
Unit 2 Processes
Process basics: Creating processes using CO2, CO3,
fork( ), the parent-child processes PID, PPID, CO4
process states: creating orphan, zombie
processes.
Unit 3 Process Synchronization
Creating multiple processes, Process table, CO3, CO4
use the command ps with –el,
Synchronization of processes by using sleep( )
& wait( ), background process,
Unit 4 Files
Basic file operations, Programs for File CO3, CO4
operations, sharing data between processes
using files.
Unit 5 File Buffering
File descriptor table, system file table, file CO3, CO4
pointer, buffer accessing block wise, use the
functions: fopen( ), fread( ), ftell( ), lseek( ),
fflush( ) etc.
Mode of Practical
examination
Weightage CA MTE ETE

Prepared by :iGAPPage 66
 Distribution 60% 0% 40%
Text book/s* 1. Sumitabha Das, “Unix Concepts and
Applications”, Tata McGraw Hill.

Other 1. Unix: The complete Reference, Kenneth

References Rosen et.al., TMH
2. Unix ‘C’ Odessey, Meeta Gandhi et.al. BPB

Course outline
This course introduces the features of GUI i.e. Windows operating system as well as
the CUI i.e. the commands used in Unix, so that the students will be familiar with both
GUI & CUI environment of operating systems. As the course progresses the students
will learn to write programs for process management and file operations. Further the
students can implement the algorithms studied in theory by writing programs using
the above principles and skills.
Course Evaluation
Attendance None
Any other CA judged on the practical conducted in the lab , weightage may be
specified
References
Text book 1. Sumitabha Das, “Unix Concepts and Applications”, Tata McGraw
Hill.

Other 1. Unix: The complete Reference, Kenneth Rosen et.al., TMH

References 2. Unix ‘C’ Odessey, Meeta Gandhi et.al. BPB

Software Windows, Unix / Any Unix family OS i.e. Linux

Syllabus: CSE 245, Computer Networks

School: SET Batch :2018-2022

Program: B.tech Current Academic Year: 2018-2019
Prepared by :iGAPPage 67
 Branch:CSE Semester: 4
1 Course CSE245 Course Name: B. Tech
Code
2 Course Computer Networks
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course 1. Provide students with an overview of networking
Objective 2. Gain insight into the issues, challenges and work at all level of
reference models
3. Provide the students with practice on applying network design
4. Enhance students communication and problem solving skills
6 Course Students will be able to:
Outcomes CO1:Demonstrate and differentiate working of all layers of the OSI
Reference Model and TCP/IP model
CO2:Investigate and explore fundamental issues driving network design
including error control, IP addressing, access control, flow and
congestion control
CO3:Have a basic knowledge of the use ofcryptography and network
security;
CO4:Understand and analyze working of various routing algorithms
7 Course To familiarize with the basic taxonomy and terminology of computer
Description networking area.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Introduction to computer networks, applications and uses, CO1, CO2
classification of Networks based on topologies,
geographical distribution and communication techniques
B Reference models: OSI model, TCP/IP model , Overview of CO1, CO2
Connecting devices (Hub, Repeaters, Switches, Bridges,
Routers, Gateways)
C Transmission Media:wired , wireless, Multiplexing CO1, CO2
techniques-FDM, TDM
Unit 2 Data Link Layer

A Functions, Framing, Error Control-Error correction CO1, CO2

codes(Hamming code),Error Detection codes(Parity Bit,
CRC)
B Flow Control- Stop and Wait Protocol, Sliding window CO1, CO2
–Goback N and Selective repeat(ARQ)
C MAC- Sub-layer Protocols: ALOHA, CSMA, CSMA/CD CO1, CO2
protocols, IEEE Standards 802.3, 802.4,802.5
Unit 3 Network Layer

Prepared by :iGAPPage 68
 A Design issues , IPV4addressing basics and Header format, CO1,CO2
CIDR, sub-netting and sub-masking
B Routing, optimality Principle Routing protocols-, Shortest CO1,CO2,CO4
path, flooding, distance vector routing , link state routing
C Congestion control-Leaky bucket , Token Bucket, jitter CO1,CO2
control
Unit 4 Transport Layer
A Need of transport layer with its services, Quality of service, CO1,CO2
connection oriented and connection less
B Transmission Control Protocol: Segment structure and CO1,CO2
header format, TCP Connection Management, Flow Control
C TCP congestion control, Internet Congestion Control CO1,CO2
Algorithm, Overview of User Datagram Protocol (UDP)
Unit 5 Application Layer
A Domain Name System (DNS), HTTP, FTP, SMTP CO1,CO2
B Network Security services, cryptography, Symmetric versus CO1,CO2,CO3
Asymmetric cryptographic algorithms- DES, and RSA
C CO1,CO2,CO3
Application of Security in Networks: Digital signature
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 9. Tanenbaum, A.S.” Computer Networks”, 4th
book/s* Edition, PHI
Other 1. Forouzan, B.., “Communication Networks”,
References TMH, Latest Edition

2. W. Stallings, “Data and Computer

Communication” Macmillan Press

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) & Program Specific
No. Outcomes (PSO)
1. CO1: Demonstrate and PO11,PO12,PSO2,PSO3,PSO4
differentiate working of all layers
of the OSI Reference Model and
TCP/IP model
2. CO2:Investigate and explore PO1,PO3,PO4,PO5,PO7,PO10,PO11PO12,PSO4
fundamental issues driving
network design
3. CO3:Have a basic knowledge of PO1,PO2,PO4,PO6,PO7,PO8,PO10,PSO1,PSO3
the use of cryptography and
network security;
4. CO4:Understand and analyze PO2,PO7,PSO2,PSO3
working of various routing
algorithms

Prepared by :iGAPPage 69
C Cos PO1 PO2 PO3 PO4 PO PO6 PO7 PO8 PO9 PO1 PO11 PO1 PSO1 PSO PSO PSO PSO
S 5 0 2 2 3 4 5
E CO1 - - - - - - - - - - 1 3 - 2 3 1 -
2
4
5 CO2 3 - 3 3 2 - 3 - - 3 1 2 - - - 1 -

CO3 2 3 - 2 - 2 3 2 - 2 - - 1 - 3 - -

CO4 - 2 - - - - 1 - - - - - - 1 3 - -

Syllabus: CSP 245, Computer Networks Lab

School: SET Batch: 2018-2022
Program: B.Tech Current Academic Year: 2018
Branch:CSE Semester: 4
1 Course Code CSP 245
2 Course Title Computer Networks Lab
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory
5 Course  To interpret the working principle of various communication
Objective protocols

 To identify the working difference between different

topologies

 To describe the concept of data transfer between nodes

6 Course By the end of this course you will be able to:
Outcomes
CO1: To interpret the working principle of various network topologies

CO2: To analyze ALOHA, CSMA,CSMA/CD for packet communication

between nodes connected to common topology

CO3: Investigate and explore fundamental issues in IP addressing and

application layer.

CO4: To distinguish different flow control mechanism over an

unreliable network
7 Course Familiarize the student with the basic taxonomy and terminology of
Description the computer networking area. Encapsulate basic understanding of
networking in a way to use and apply.

Prepared by :iGAPPage 70
 8 Outline syllabus CO Mapping
Unit 1 Introduction
Familiarization with Networking Components and CO1
devices: LAN Adapters, Hubs, Switches, Routers etc.
To implement the token passing access in BUS-LAN,
To implement the token passing access in RING-LAN.
Unit 2 Data link layer
Implement the ALOHA protocol for packet CO2
communication between a number of nodes
connected to a common bus , Implement the CSMA
protocol for packet communication between a number
of nodes connected to a common bus
Unit 3 Network Layer
IP Addressing :sub netting, Super netting CO3
Unit 4 Transport Layer
Provide reliable data transfer between two nodes over CO4
an unreliable network using the stop and-wait protocol,
Provide reliable data transfer between two nodes over
an unreliable network using the slidingwindow go back
N protocol.
Unit 5 Application Layer
Implementation and study of Simple mail transfer CO3
protocol and file transfer protocol.
Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* 10. Tanenbaum, A.S.” Computer Networks”, 4th
Edition, PHI
Other 3. Forouzan, B.., “Communication Networks”,
References TMH, Latest Edition

4. W. Stallings, “Data and Computer

Communication” Macmillan Press

Syllabus: CSE 246, Database Management System

School: Batch : 2018-2022
Program: B.Tech Current Academic Year: 2018
Branch: CSE Semester: IV
1 Course Code CSE246 Course Name
2 Course Title Database Management System
3 Credits 4
4 Contact 3-0-2

Prepared by :iGAPPage 71
 Hours
(L-T-P)
Course
Status
5 Course 1.Develop the ability to design,
Objective 2. Implement and manipulate databases.
3. Introduce students to build data base management systems.
4. Apply DBMS concepts to various examples and real life
applications.
6 Course Students will be able to:
Outcomes 1. Apply the knowledge of databases to E-R modelling.
2. Apply the concept of Relational Database model to databasedesign.
3. Learn and apply Structured Query Language (SQL) for data definition
and data manipulation.
4.Design a normalized databaseand able to perform transaction
management and concurrency control.
7 Course This course introduces database design and creation using a DBMS
Description product. Emphasis is on, normalization, data integrity, data modeling,
and creation of simple tables, queries, reports, and forms. Upon
completion, students should be able to design and implement
normalized database structures by creating simple database tables,
queries, reports, and forms.
8 Outline syllabus CO Mapping
Unit 1 Introduction to Databases:
A Introduction ofof DBMS, Characteristic of DBMS, Data CO1
Models, Database languages, Database Administrator,
Database Users.
B Three Schema architecture of DBMS, Data CO1,CO2
Models,Hierarchical, Network ,Data independence and
database language, DDL, DML, Data Modeling using
Entity Relationship Model
C Strong Entity, Weak entity, Specialization and CO1,CO2
generalization, converting ER Model to relational
tables.
Unit 2 Relational Database Language and Interfaces:
A Relational data model concepts ,Concept of keys, CO3,CO2
Mapping Constraints
B Null Values, Domain Constraints, Referential Integrity CO3,CO2
Constraints
C Unary Relational Operations: SELECT and PROJECT CO3,CO2
Relational Algebra Operations from Set Theory ,Binary
Relational Operations: JOIN and DIVISION ,SQL.
Unit 3 Normalization in Design of Databases:
A Functional Dependency, Different anomalies in CO4,CO2
designing a Database, Normalization first
B second and third normal forms, BoyceCodd normal CO4,CO2
form, multi-valued dependencies

Prepared by :iGAPPage 72
 C fourth normal forms, Inclusion dependencies, loss less CO4,CO2
join decompositions
Unit 4 Transaction Management:
A Transaction processing system, schedule and CO4,CO2
recoverability, Testing of serializability,
B Serializability of schedules, conflict & view serializable CO4,CO2
schedule
C Recovery from transaction failures, deadlock handling. CO4,CO2
Unit 5 Concurrency Control
A Two-Phase Locking Techniques for Concurrency CO4,CO2
Control , Concurrency Control Based on Timestamp
Ordering
B Multiversion Concurrency Control Techniques CO4,CO2
,Validation (Optimistic) Concurrency Control
Techniques
C Granularity of Data Items and Multiple Granularity CO4,CO2
Locking
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* 1. Korth , Silberschatz&Sudarshan, Data base Concepts,
Tata McGraw-Hill, Latest Edition
Other 1.Elmasri, Navathe, Fundamentals of Database Systems,
References Pearson Education Inc.
2.Thomas Connolly, Carolyn Begg, Database Systems: A
Practical Approach to design, Implementation and
Management, Pearson Education, Third Edition.
3.Jeffrey D. Ullman, Jennifer Windon, A first course in
Database Systems, Pearson Education.
4.Date C.J., An Introduction to Database Systems,
Addison Wesley.

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) & Program Specific
No. Outcomes (PSO)
1. CO1:Apply the knowledge of PO1,PO2,PO3,PO10,PSO12,PSO3
databases to E-R modelling.
2. CO2:Apply the concept of PO1, PO2, PO3,
Relational Database model to PS5,PO9,PO10,PO11,PO12,PSO1,PSO2,PSO3,P
databasedesign. SO5
3. CO3: Learn and apply Structured PO1,PO2,PO3,PO5,PO9,PO10,PO11,PO12,PSO1
Query Language (SQL) for data ,PSO2,PSO3PSO5
definition and data
manipulation.
4. CO4:Design a normalized PO1, PO2,PO3,
databaseand able to perform PO4,PO5,PO9,PO10,PO11,PO12,PSO1,PSO2,PS

Prepared by :iGAPPage 73
 transaction management and O3,PSO4,PSO5
concurrency control.

PO and PSO mapping with level of strength for Course Name Database Management
System(Course Code CSE 246)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1 PSO PSO PSO PSO PSO
0 1 2 1 2 3 4 5
CO1 2 1 1 - - - - - - 3 - 2 - - 1 - -

CO2 3 3 3 3 - - - 2 3 2 1 3 3 3 - 3

CO3 3 3 3 - 3 - - - 3 1 3 3 2 2 3 -- 3

CO4 3 3 3 2 3 - - - 3 1 3 3 3 3 3 2 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 246, Database management System Lab

School: SET Batch: 2018-2022

Program: B.Tech Current Academic Year:
Branch:CSE Semester: IV
1 Course Code CSP246
2 Course Title Database Management System Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course  To Develop efficient SQL programs to access Oracle
Objective databases

 Build database using Data Definition Language

Statements

 Perform operations using Data Manipulation Language

statements like Insert, Update and Delete
6 Course By the end of this course you will be able to:
Outcomes
CO1: Understandthe concept of SQL commands in DBMS

CO2: Create SQL SELECT statements that retrieve any required

data

CO3: Perform operations using Data Manipulation Language

statements like Insert, Update and Delete

Prepared by :iGAPPage 74
 CO4: Manipulate your data to modify and summaries your results
for reporting
7 Course An introduction to the design and creation of relational
Description databases. Create database-level applications and tuning robust
business applications. Lab sessions reinforce the learning
objectives and provide participants the opportunity to gain
practical hands-on experience.
8 Outline syllabus CO
Mapping
Unit 1 Practical based Data types
Classification SQL, Data types of SQL/Oracle CO1,CO2
Unit 2 Practical based on DDL commands
Create table , Alter table and drop table CO1,CO2
Unit 3 DML commands and Aggregate functions
Introduction about the INSERT, SELECT , UPDATE & CO2,CO4
DELETE command.,sum,avg,count,max,min
Unit 4 Practical based on Grouping Clauses GROUP BY CO1,CO4
ORDER BY & GROUP BY HAVING
Briefly explain Group by, order by ,having clauses
with examples.
Unit 5 Practical based on Sub- queries, JOINS CO1,CO4
Related example of Sub- queries, Joins and related
examples
Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* 1. Korth , Silberschatz& Sudarshan, Data base Concepts,
Tata McGraw-Hill
Other 11. Elmasri, Navathe, Fundamentals of Database
References Systems, Pearson Education Inc.
12. Thomas Connolly, Carolyn Begg, Database Systems:
A Practical Approach to design, Implementation and
Management, Pearson Education, Latest Edition.
13. Jeffrey D. Ullman, Jennifer Windon, A first course in
Database Systems, Pearson Education.

Syllabus: CSE 248, Theory Of Computation

School: SET Batch : 2018-2022
Program: B.Tech Current Academic Year:2018-2019
Branch:CSE Semester:IV
1 Course Code CSE-248 Course Name: Theory of Computation
2 Course Title Theory of Computation
3 Credits 4
4 Contact 3-1-0

Prepared by :iGAPPage 75
 Hours
(L-T-P)
Course
Status
5 Course The goal of this course is to provide students with an understanding
Objective of basic concepts in the theory of computation.
6 Course Students will be able to:
Outcomes CO1: Formulate the concept of Automata and related terminology.
CO2: Design DFA and NDFA and conversion from NDFA to DFA.
CO3: Construct finite automata without output and with output.
CO4:Implement regular expression and grammar corresponding to
DFA and vice-versa
CO5: Design Push down Automata from Context Free Language or
Grammar and vice-versa.
CO6: Design Turing Machine for computational problems, Develop a
clear understanding of un-decidability.
7 Course The course introduces some fundamental concepts in automata
Description theory and formal languages including grammar, finite automaton,
regular expression, formal language, pushdown automaton, and
Turing machine. Not only do they form basic models of computation,
they are also the foundation of many branches of computer science,
e.g. compilers, software engineering, concurrent systems, etc. The
properties of these models will be studied and various rigorous
techniques for analyzing and comparing them will be discussed, by
using both formalism and examples.
8 Outline syllabus CO Mapping
Unit 1 Finite Automata
A Introduction to languages, Kleene closures, Finite CO1, CO2
Automata (FA), Transition graph, Nondeterministic
finite Automata (NFA), Deterministic finite
Automata (DFA).
B Equivalence of NDFA and DFA, Construction of DFA CO1, CO2
from NFA and optimization of Finite Automata.
C Applications and Limitation of FA. (FAT tool). CO1, CO2
Unit 2 Regular Expression and Finite Automata
A Regular Expression, Finite Automata with null move, CO1, CO2,CO4
Regular Expression to Finite Automata.
B Arden Theorem, Pumping Lemma for regular CO1, CO2,CO4
expressions.
C FA with output: Moore machine, Mealy machine and CO1, CO2,CO3
Equivalence.
Unit 3 REGULAR & CONTEXT FREE LANGUAGE
A Defining grammar, Chomsky hierarchy of CO4
Languages and Grammar. Ambiguous to
Unambiguous CFG.
B Simplification of CFGs. CO4
C Normal forms for CFGs, Pumping lemma for CFLs. CO4
Unit 4 PUSH DOWN AUTOMATA
A Description and definition of PDA and Non- CO5
Deterministic PDA, Working of PDA.

Prepared by :iGAPPage 76
 B Acceptance of a string by PDA with final state and CO5
with Null store. Two stack PDA.
C Conversion of PDA into CFG, Conversion of CFG into CO5
PDA.
Unit 5 TURING MACHINE
A Turing machines (TM): Basic model, definition and CO6
representation, Language acceptance by TM.
B Turing machine as a computational machine, CO6
Halting problem of TM, Universal TM (Visual Turing
machine).
C Modifications in TM, Undecidability of Post CO6
correspondence problem, Church’s Thesis, Godel
Numbering.
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* 1. K.L.P. Mishra and N.Chandrasekaran,
“Theory of Computer Science(Automata,
Languages and Computation)”, PHI
Other 1.Peter Linz, “Formal Languages and Auomata”,
References Narosa Publishing House

2.Hopcroft, Ullman, “Introduction to Automata

Theory, Language and Computation”, Narosa
Publishing House

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No. & Program Specific
Outcomes (PSO)
1. CO1: Formulate the concept of Automata and related PO1,PO2,PO3,PO4,PSO1
terminology.
2. CO2: Design DFA and NDFA and conversion from NDFA PO1, PO3, PO4, PSO2
to DFA.
3. CO3: Construct finite automata without output and with PO1,PO2,PO3,PO4
output.
4. CO4: Implement regular expression and grammar PO9, PO10,PO11, PSO5
corresponding to DFA and vice-versa
5 CO5: Design Push down Automata from Context Free PO1,PO2,PO3,PO4,PSO1
Language or Grammar and vice-versa .
6 CO6: Design Turing Machine for computational PO1,PO3,PO4,PSO2
problems,Develop a clear understanding of un-
decidability.

PO and PSO mapping with level of strength for Course Name Theory of Automata (Course
Code CSE248)
Cos PO1 PO PO PO PO PO PO PO PO PO PO PO PSO1 PSO PSO PS PSO5
2 3 4 5 6 7 8 9 10 11 12 2 3 O4

Prepared by :iGAPPage 77
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

CO5 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO6 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSP 298, Project Based Learning(PBL) -2

School: SET Batch : 2018-2022

Program: B.Tech Current Academic Year: 2018-2019
Branch: CSE Semester: 4th
1 Course Code CSP298 Course Name: Project Based Learning - 2
2 Course Title Project Based Learning -2
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory
5 Course Objective 4. To align student’s skill and interests with a
realistic problem or project
5. To understand the significance of problem
and its scope
6. Students will make decisions within a
framework
6 Course Outcomes Students will be able to:
CO1: Acquire practical knowledge within the chosen
area of technology for project development
CO2: Identify, analyze, formulate and handle
programming projects with a comprehensive and
systematic approach
CO3: Discuss and accumulate the background
information
CO4: Develop effective communication skills for
presentation of project related activities
CO5: Contribute as an individual or in a team in
development of technical projects
CO6: Prepare a technical report based on the project.
7 Course Description In PBL-2, the students will learn how to define the
problem for developing projects, identifying the skills
required to develop the project based on given a set
ofspecifications and all subjects of that Semester.

Prepared by :iGAPPage 78
 8 Outline syllabus CO
Mapping
Unit 1 Problem Definition,Team/Group formation and CO1, CO2
Project Assignment.
Unit 2 Description and design of the proposed project. CO1, CO2
Specifying resource requirement, if any.
Unit 3 Implementation work under the guidance of a CO1,
faculty member. CO2, CO3
Unit 4 Demonstrate and execute Project with the team. CO3, CO4
Unit 5 The presentation, report, work done during the term CO4,
supported by the documentation, forms the basis of CO5, CO6
assessment.
Report should include Abstract, Introduction,
Proposed System Design/Algorithm,
Experimentation & Result Analysis, Conclusion, and
References.
Presentation – PBL-2
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 60% NA 40%
Text
book/s*
Other
References

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No.
1. CO1: Acquire practical knowledge within the PO1, PO2, PO4, PO9,
chosen area of technology for project PO10, PO11, PO12
development
2. CO2: Identify, analyze, formulate and handle PO1, PO2, PO4, PO7,
programming projects with a PO9, PO10, PO11, PO12
comprehensive and systematic approach
3. CO3: Discuss and accumulate the PO1, PO2, PO5, PO9,
background information PO10, PO11, PO12
4. CO4: Develop effective communication PO1, PO2, PO6, PO9,
skills for presentation of project related PO10, PO11, PO12
activities
5. CO5: Contribute as an individual or in a team PO1, PO2, PO3, PO4,PO5,
in development of technical projects PO6, PO7, PO8, PO9,
PO10, PO11, PO12
6. CO6: Prepare a technical report based on PO1, PO2, PO3, PO4,PO5,

Prepared by :iGAPPage 79
 theproject. PO6, PO7, PO8, PO9,
PO10, PO11, PO12

PO and PSO mapping with level of strength for Course Name Project Based Learning -
2 (Course Code CSP298)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 - 3 - - - - 3 3 2 3
CO2 3 2 - 3 - - 2 - 3 3 2 3
CO3 3 2 - - 2 - - - 3 3 2 3
CO4 3 3 - - - 2 - - 3 3 2 3
CO4 3 3 2 2 2 2 3 3 3 3 2 3
CO4 3 3 2 2 2 2 3 3 3 3 2 3
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 341, Design and Analysis of Algorithms

School: SET Batch :2018

Program:B.Tech Current Academic Year:
Branch:CSE Semester:V
1 Course Code CSE Course Name: Design and Analysis of Algorithms
341
2 Course Title Design and Analysis of Algorithms
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course UG
Status
5 Course Objective of this course is to
Objective 1. Reinforce basic design concepts (e.g., pseudocode,
specifications, top-down design)
2. Knowledge of algorithm design strategies
3. Familiarity with an assortment of important algorithms.
4. Enable students to analyze time and space complexity
6 Course Students will be able to:
Outcomes CO1: Analyze the asymptotic performance of algorithms
CO2: Write rigorous correctness proofs for algorithms.
CO3: Demonstrate a familiarity with major algorithms and data
structures
CO4: Apply important algorithmic design paradigms and methods
of analysis

Prepared by :iGAPPage 80
 7 Course This course introduces concepts related to the design and analysis
Description of algorithms. Specifically, it discusses recurrence relations, and
illustrates their role in asymptotic and probabilistic analysis of
algorithms. It covers in detail greedy strategies divide and conquer
techniques, dynamic programming and max flow - min cut theory
for designing algorithms, and illustrates them using a number of
well-known problems and applications.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Notion of an Algorithm – Fundamentals of CO2, CO3
Algorithmic Problem Solving – Important
Problem Types – Fundamentals of the
Analysis of Algorithm Efficiency – Analysis
Framework
B Asymptotic Notations and their properties – CO1, CO2, CO3
Mathematical analysis for Recursive and
Non-recursive algorithms, Recurrences
relations
C Divide-and-conquer: Analysis and Structure CO1, CO2, CO4
of divide-and-conquer algorithms, Divide-and
-conquer examples- Binary search, Quick
sort, Merge sort, Medians and Order Statics,
Strassen’s Matrix Multiplication.
Unit 2 Dynamic Programming
A Overview, Difference between dynamic CO1, CO2, CO3,
programming and divide and conquer CO4
B Applications and analysis: Matrix Chain CO1, CO2, CO4
Multiplication, 0/1 Knapsack Problem
records
C Applications and analysis: Longest Common CO1, CO2, CO3,
sub-sequence, Optimal Binary Search tree CO4
Unit 3 Greedy Method
A Overview of the Greedy paradigm, Analysis CO1,CO2,CO3,
and example of exact optimization solution, CO4
Minimum Spanning Tree – Prim’s and
Kruskal’s Algorithm
B Fractional Knapsack problem, Single source CO1, CO2, CO3,
shortest paths, task scheduling CO4
C Overview and analysis of Backtracking &
Branch and Bound: N-Queens problem and
Sum of subsets
Unit 4 Advanced Data Structures CO1,CO2,CO3
A Red-Black Trees - Definition, Applications, CO1,CO2,CO3
Insertion and deletion of elements in RB-
Tree
B B-Trees - Definitions, Applications, Insertion CO1,CO2,CO3
and Deletion in B-Trees

Prepared by :iGAPPage 81
 C Data Structure for Disjoint Sets - Definition,
Operations, Applications in Kruskal’s
algorithm.
Unit 5 Selected Topics CO1,CO2,CO3,
A Introduction to NP Complete and NP Hard CO1,CO2,CO3,
Problems, Examples, Amortized Analysis
B Approximation Algorithms – Travelling Sales CO1,CO2,CO3
Person Problem and Vertex Cover Problem,
Randomized Algorithms, Need, Evaluation of
π, Randomized Quick Sort Algorithm
C String Matching Algorithms – Naive String CO1,CO2,CO3,
Matching Algorithm, Rabin Karp Algorithm. CO4
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* 3. Cormen et al., “Introduction of Computer
Algorithms”, Prentice Hall India
Other 3. Sahni et al., “Fundamentals of Computer
References Algorithms”, Galgotia Publications.

4. Hopcroft A, The Design And Analysis

Computer Algorithms, Addison Wesley

CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program Specific
Outcomes (PSO)
1. CO1:Analyze the asymptotic performance of algorithms PO1,PO2,PO3,PO4,PSO1
2. CO2: Write rigorous correctness proofs for algorithms PO1, PO3, PO4, PSO2
3. CO3: Demonstrate a familiarity with major algorithms PO1,PO2,PO3,PO4
and data structures
4. CO4:Apply important algorithmic design paradigms and PO9, PO10,PO11, PSO5
methods of analysis

PO and PSO mapping with level of strength for Course Name Design and Analysis of
Algorithms Course Code CSE 341)
Cos PO1 PO PO3 PO4 PO5 P PO7 PO PO9 PO1 P PO1 PSO PSO PSO PSO PSO
2 O6 8 0 O1 2 1 2 3 4 5
1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Prepared by :iGAPPage 82
Syllabus: CSP 341, Design and Analysis of Algorithms Lab

School: SET Batch: 2018-2022

Program: B.Tech Current Academic Year:
Branch: CSE Semester:V
1 Course Code CSP 341
2 Course Title Design and Analysis of Algorithms Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course Objective of this course is to
Objective  Reinforce basic design concepts (e.g., pseudocode,
specifications, top-down design)
 Knowledge of algorithm design strategies
 Familiarity with an assortment of important algorithms.
 Enable students to analyze time and space complexity
6 Course Students will be able to:
Outcomes CO1: Analyze the asymptotic performance of algorithms
CO2: Write rigorous correctness proofs for algorithms.
CO3: Demonstrate a familiarity with major algorithms and data
structures
CO4: Apply important algorithmic design paradigms and methods of
analysis
7 Course This course introduces concepts related to the design and analysis of
Description algorithms. Specifically, it discusses recurrence relations, and
illustrates their role in asymptotic and probabilistic analysis of
algorithms. It covers in detail greedy strategies divide and conquer
techniques, dynamic programming and max flow - min cut theory for
designing algorithms, and illustrates them using a number of well-
known problems and applications.
8 Outline syllabus CO
Mapping
Unit 1 Practical based on algorithm design by brute CO1, CO2,
force and divide and conquer paradigm CO4
Sub unit - a, b and c detailed in Instructional Plan
Unit 2 Practical related to dynamic programming CO1, CO2.
paradigm CO3, CO4
Sub unit - a, b and c detailed in Instructional Plan
Unit 3 Practical related to greedy method CO2, CO3,
CO4
Sub unit - a, b and c detailed in Instructional Plan
Unit 4 Practical related to advanced data structures CO2, CO3,

Prepared by :iGAPPage 83
 CO4
Sub unit - a, b and c detailed in Instructional Plan
Unit 5 Practical related to string matching algorithms CO1, CO2,
CO3, CO4
Sub unit - a, b and c detailed in Instructional Plan
Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* -
Other
References

Syllabus: CSE 344, Compiler Design

School: SET Batch : 2018

Program: B.Tech Current Academic Year:2018-2019
Branch:CSE Semester: V
1 Course CSE Course Name
Code 344
2 Course Compiler Design
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Core
Status
5 Course 1. To provide students with an overview of the issues that arise
Objective in Compiler construction as well as to throw light upon the
significant theoretical developments and tools that are deep
rooted into computer science.
2. To introduce the major phases of Compiler construction and
also its theoretical aspects including regular expressions,
context-free grammars, Finite Automata etc.
6 Course After the successful completion of this course, students will be
Outcomes able to :
CO 1: Employ formal attributed grammars for specifying the
syntax and semantics of programming languages.
CO 2: Apply regular patterns and grammars.
CO 3: Comprehend the working knowledge of the major phases
of compilation, particularly lexical analysis, parsing, semantic
analysis, and code generation.
CO 4: Implement parsing and translation techniques for

Prepared by :iGAPPage 84
 automation of computing tasks.
CO 5: Design and write a complex programming project on
system software.
7 Course To provide students with an overview of the issues that arise in
Description Compiler construction as well as to throw light upon the
significant theoretical developments and tools that are deep
rooted into computer science.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Introduction to Compiler, Phases and passes, CO1, CO2
Bootstrapping, Cross-Compiler
B Finite state machines and regular expressions and CO1, CO2
their applications to lexical analysis
C lexical-analyzer generator, Lexical Phase errors CO1, CO2
Unit 2 Parsing Techniques
A The syntactic specification of programming CO1, CO2
languages: Context free grammars, derivation and
parse trees.
B Basic Parsing Techniques: Parsers, Shift reduce CO1, CO2
parsing, operator precedence parsing, top down
parsing, predictive parsers.
Automatic Construction of efficient Parsers: LR
parsers, the canonical Collection of LR(0) items,
constructing SLR parsing tables
C Constructing Canonical LR parsing tables, CO1, CO2
Constructing LALR parsing tables, using ambiguous
grammars. Syntactic phase errors and semantic
errors.
Unit 3 Syntax Directed Translations And Intermediate
Code Generation
A Syntax directed definition, Construction of syntax CO3,CO4
trees, syntax directed translation scheme
B Variants of Syntax Trees, Three Address Codes CO3,CO4
C Translation of Expression, Type Checking and CO3,CO4
control flow.
Unit 4 Symbol table
A Data structure for symbols tables, representing CO3,CO4
scope information.
B Run-Time Administration: Implementation of simple CO3,CO4
stack allocation scheme
C Run Time Storage Management CO3,CO4
Unit 5 Code Generation And Optimization
A Sources of Optimization of basic blocks and flow CO5,CO6
graphs
B Basic Blocks, Flow graphs, DAG CO5,CO6
C Global Data Flow Analysis CO5,CO6
Mode of Theory
examination

Prepared by :iGAPPage 85
 Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 1. 1.Aho, Sethi, Ulman, compilers Principles,
book/s* Techniques, and Tools, Pearson Education,
2003
Other 1. Lauden, Principles of Compiler
References Construction.
2. D. M. Dhamdhere Compiler Construction--
Principles and Practice, Macmillan India,

CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program Specific
Outcomes (PSO)
1. CO1:CO1: Employ formal attributed grammars for PO1,PO2,PO3,PO4,PSO1
specifying the syntax and semantics of
programming languages.
2. CO2 Apply regular patterns and grammars. PO1, PO3, PO4, PSO2
3. CO3: Comprehend the working knowledge of the PO1,PO2,PO3,PO4
major phases of compilation, particularly lexical
analysis, parsing, semantic analysis, and code
generation.
4. CO4: Implement parsing and translation PO9, PO10,PO11, PSO5
techniques for automation of computing tasks.
5. CO5: Design and write a complex programming PO1,PO2,PO3,PO4,PSO1
project on system software.

PO and PSO mapping with level of strength for Course Name Compiler Design (Course
Code CSE 344)
COs PO1 PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO PSO
2 O6 0 O1 2 O1 4 5
1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

CO5 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Prepared by :iGAPPage 86
Syllabus: CSP 344, Compiler Design Lab
School: SET Batch: 2018-2022
Program: B.Tech Current Academic Year:
Branch:CSE Semester:5
1 Course Code CSP 344
2 Course Title Compiler Design Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Status Compulsory
5 Course 1. To provide students with an overview of the issues that arise in
Objective Compiler construction as well as to throw light upon the
significant theoretical developments and tools that are deep
rooted into computer science.
2. To introduce the major phases of Compiler construction and
also its theoretical aspects including regular expressions, context-
free grammars, Finite Automata etc.
6 Course After the successful completion of this course, students will be
Outcomes able to :
CO 1: Employ formal attributed grammars for specifying the
syntax and semantics of programming languages.
CO 2: Apply regular patterns and grammars.
CO 3: Comprehend the working knowledge of the major phases of
compilation, particularly lexical analysis, parsing, semantic
analysis, and code generation.
CO 4: Implement parsing and translation techniques for
automation of computing tasks.
CO 5: Design and write a complex programming project on
system software.
7 Course To provide students with an overview of the issues that arise in
Description Compiler construction as well as to throw light upon the
significant theoretical developments and tools that are deep
rooted into computer science.
8 Outline syllabus CO Mapping
Unit 1 Introduction
1. Write a C program to identify whether a CO1, CO2
given line is a comment or not.

2. Write a C program to recognize strings

under ‘a’, ‘a*b+’, ‘abb’.

3. Implement the lexical analyser using Lex.

Prepared by :iGAPPage 87
 Unit 2 Parsing Techniques
1. Write a program for constructing of LL (1) CO1, CO2
parsing for any given language.

2. Write a C program for constructing

recursive descent parsing for any given
language.

Unit 3 Syntax Directed Translations And Intermediate

Code Generation
1. Implement Program semantic rules to CO3, CO4
calculate the expression that takes an
expression with digits, + and * and
computes the value.

2. Program to generate a Intermediate

code(3 Address code).

Unit 4 Symbol table CO3, CO4

Implement symbol table CO1, CO2

Unit 5 Code Generation And Optimization

Implement DAG CO5,CO

Mode of Jury/Practical/Viva
examination
Weightage CA CO3,CO4 ETE
Distribution 60% 40%
Text book/s* 1. 1.Aho, Sethi, Ulman, compilers Principles,
Techniques, and Tools, Pearson Education,
2003
Other 1. Lauden, Principles of Compiler Construction.
References 2. D. M. Dhamdhere Compiler Construction--
Principles and Practice, Macmillan India,

Syllabus: CSP 302, Technical Skill Enhancement Course-1 (Simulation Lab)

School: SET Batch : 2018

Program: Current Academic Year:
B.TECH
Branch:CSE Semester: V
1 Course CSP 302 Technical Skill Enhancement Course-1
Code ( Simulation Lab)
2 Course Simulation Lab

Prepared by :iGAPPage 88
 Title
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Lab
Status
5 Course  Demonstrate basic programming skills – functions,
Objective arrays, loops, conditional statements, procedures

 Demonstrate technical communication skills: Create a

comprehensive report and an oral presentation with
accurate visual representations of a model and its
results.

6 Course Students will be able to:

Outcomes CO1: Students will apply MATLAB Programming to solve real
life problem.
CO2: implement the mathematical representation of the
model.
CO3: create a simulation in a computational tool in Matlab
CO4: Utilize Matlab as a computational tool
7 Course This course introduces the concepts of MATLAB programing,
Description Modelling and simulation to identify the problems, and choose
the relevant models and algorithms to apply.Matlab is used
for scientific applications involving images, sound, and other
signals.
8 Outline syllabus CO Mapping
UNIT-I Introduction
A Introduction to MATLAB, Basic CO1, CO2
Commands, Variables and Operators, Logical
Operators and their Control flow, Algorithm
B MATLAB conditional statements CO1, CO2
C MATLAB loops, Solve a problem for one case,
then iterate (Take care of middle, then first
and last)
UNIT-2 Structures and Cell arrays

A Structures, Properties, Declaration of CO2,CO3

Structure, Definition, Accessing Elements
from structure, Use of Structure
B Array, Cell Array, Array operation, Cell Array CO2
Operations, Introduction Complexity, Divide
and conquer.

Prepared by :iGAPPage 89
 C Scripts and Functions CO3
UNIT-3 Review of Mathematical Operations
A Mathematical operations on sequences: CO2
Convolution, graphical and analytical techniques
B Overlap and add methods, matrix method, CO2
some examples and solutions of LTI systems,
C MATLAB examples CO1,CO3
UNIT-4 Modeling
A Stochastic models, Curve fitting, CO4
Graphing data in MATLAB
B Accuracy and precision in modeling CO1, CO2
C Verification and validationProject on CO1, CO2
Simulation based
UNIT-V Matlab Applications
A Working with Sound, Working with Images CO2, CO4
B File, Types of File, file Input/Output CO1, CO2
Operations, Reading and Writing files, Building
GUI’s
C Recursion, Compression CO1, CO3

UNIT-5 Visualization
A Stochastic models, Curve fitting, CO4
B Graphing data in MATLAB CO4
C Accuracy and precision in modeling CO4
Mode of Verification and validationProject on
examination Simulation based
Weightage Project on ETE
Distribution Simulation
based
60 % 40%
Text
book/s*
Other 1.
References
CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program Specific
Outcomes (PSO)
1. CO1: Students will apply MATLAB Programing to PO1,PO2,PO3,PO4,PSO1
solve real life problem.
2. CO2: implement the mathematical representation of PO1, PO3, PO4, PSO2
the model.
3. CO3: create a simulation in a computational tool in PO1,PO2,PO3,PO4
Matlab

Prepared by :iGAPPage 90
 4. CO4: Utilize Matlab as a computational tool - PO9, PO10,PO11, PSO5

PO and PSO mapping with level of strength for Course NameSimulation Lab (Course
Code CSP 302)
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

COs PO PO PO PO PO PO PO PO PO PO PO PO PS PSO PSO PS PSO5

1 2 3 4 5 6 7 8 9 10 11 12 O1 2 3 O4
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

Prepared by :iGAPPage 91
Syllabus: CSP 397, Project Based Learning(PBL)-3

School: SET Batch : 2018-2022

Program: B.Tech Current Academic Year: 2018
Branch: CSE Semester: 5th
1 Course Code CSP397 Course Name: Project Based Learning -3
2 Course Title Project Based Learning – 3
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status Compulsory
5 Course Objective 7. To align student’s skill and interests with a
realistic problem or project
8. To understand the significance of problem
and its scope
9. Students will make decisions within a
framework
6 Course Outcomes Students will be able to:
CO1: Acquire practical knowledge within the chosen
area of technology for project development
CO2: Identify, analyze, formulate and handle
programming projects with a comprehensive and
systematic approach
CO3: To prepare the designs requirements,
functional and concept design.
CO4: Develop effective communication skills for
presentation of project related activities
CO5: Contribute as an individual or in a team in
development of technical projects
CO6: Prepare a technical report based on the project.
7 Course Description In PBL-3, the students will learn how to define the
problem for developing projects, identifying the skills
required to develop the project based on given a set
ofspecifications and all subjects of that Semester.
8 Outline syllabus CO
Mapping
Unit 1 Problem Definition,Team/Group formation and CO1, CO2
Project Assignment.
Unit 2 Description and design of the proposed project CO1, CO2
using ER Diagrams.Specifying resource
requirement, if any.
Unit 3 Implementation work under the guidance of a CO1,
faculty member. CO2, CO3
Unit 4 Demonstrate and execute Project with the team. CO3, CO4
Unit 5 The presentation, report, work done during the term CO4,

Prepared by :iGAPPage 92
 supported by the documentation, forms the basis of CO5, CO6
assessment.
Report should include Abstract, Introduction,
Proposed System Design/Algorithm,
Experimentation & Result Analysis, Conclusion, and
References.
Presentation – PBL-3
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 60% NA 40%
Text
book/s*
Other
References

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No.
1. CO1: Acquire practical knowledge within the PO1, PO2, PO4, PO9, PO10,
chosen area of technology for project PO11, PO12
development
2. CO2: Identify, analyze, formulate and handle PO1, PO2, PO4, PO7, PO9,
programming projects with a comprehensive PO10, PO11, PO12
and systematic approach
3. CO3: Discuss and accumulate the PO1, PO2, PO5, PO9, PO10,
background information PO11, PO12
4. CO4: Develop effective communication skills PO1, PO2, PO6, PO9, PO10,
for presentation of project related activities PO11, PO12
5. CO5: Contribute as an individual or in a team PO1, PO2, PO3, PO4,PO5,
in development of technical projects PO6, PO7, PO8, PO9, PO10,
PO11, PO12
6. CO6: Prepare a technical report based on PO1, PO2, PO3, PO4,PO5,
theproject. PO6, PO7, PO8, PO9, PO10,
PO11, PO12

PO and PSO mapping with level of strength for Course Name Project Based Learning -
3 (Course Code CSP397)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 - 3 - - - - 3 3 2 3
CO2 3 2 - 3 - - 2 - 3 3 2 3
CO3 3 2 - - 2 - - - 3 3 2 3

Prepared by :iGAPPage 93
CO4 3 3 - - - 2 - - 3 3 2 3
CO5 3 3 2 2 2 2 3 3 3 3 2 3
CO6 3 3 2 2 2 2 3 3 3 3 2 3

Syllabus: CSP 399, Industrial Internship-II

School: SET Batch : 2018-2022
Program:B.Tech Current Academic Year:
Branch: CSE Semester:V
1 Course Code CSP399 Course Name
2 Course Title Industrial Internship-II
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course UG
Status
5 Course 1. Experience the activities and functions of business professionals.
Objective 2. Develop and refine oral and written communication skills.
3. Identify areas for future knowledge and skill development.
6 Course CO1. Experience of applying existing engineering knowledge in similar
Outcomes or new situations
CO2. Ability to identify when new engineering knowledge is required,
and apply it
CO3. Ability to integrate existing and new technical knowledge for
industrial application.
CO4. Knowledge of contemporary/engineering practice.
CO5. Use of acquired techniques, skills, and modern engineering tools
necessary for engineering practice.
CO6. Ability to work on multi‐disciplinary teams.

7 Course An internship experience provides the student with an opportunity to

Description explore career interests while applying knowledge and skills learned in
the classroom in a work setting. The experience also helps students
gain a clearer sense of what they still need to learn and provides an
opportunity to build professional networks.
8 Outline syllabus CO Mapping
Unit 1 Define objectives and conditions for the CO1
internship, ensuring students that it is related
to the study path carried out at the University.
Specify the names of the university supervisor,
the Host Organization supervisor and the
duration, the period in which the internship will
be carried out and any changes in duration
Unit 2 The internship work plan is drawn up in CO2
consultation with the student, the supervising
faculty at the university and the internship
supervisor for the organisation offering the

Prepared by :iGAPPage 94
 internship.
Unit 3 Project during Internship involves: a) project CO2,CO3
activated by the Program Director / Host
Organization. b) Project activity to be
monitored by faculty members at the
University. This activity must guarantee
continuous presence and continuity to
activities related to project.
Unit 4 Submission of evaluation form and final report CO4
completed by the intern.
Unit 5 Final evaluation form completed by the CO5,CO6
supervisor at the Host Organization and final
presentation before departmental committee.
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 60% NIL 40%
Text book/s* NA
Other
NA
References

CO and PO Mapping
S. No. Course Outcome Program Outcomes (PO)
& Program Specific
Outcomes (PSO)
1. CO1. Experience of applying existing engineering PO1, PO2, PO12, PSO4
knowledge in similar or new situations

2. CO2. Ability to identify when new engineering PO1, PO12, PSO1, PSO4
knowledge is required, and apply it
3. CO3. Ability to integrate existing and new technical PO1, PO2, PO12, PSO2,
knowledge for industrial application PSO4
4. CO4. Knowledge of contemporary/engineering PO1,PO12, PSO 2,PSO4
practice.
5. CO5. Use of acquired techniques, skills, and PO1,PO6,PO8,PO12, PSO
modern engineering tools necessary for 2,PSO4
engineering practice.
6. CO6. Ability to work on multi‐disciplinary teams. PO1,PO7,PSO2

PO and PSO mapping with level of strength for Industrial Internship-II(Course Code CSP 399)

Cos PO PO PO PO PO PO PO PO PO PO PO PO PS PSO PSO PS PS

1 2 3 4 5 6 7 8 9 10 11 12 O1 2 3 O4 O5
CO1 3 2 - - - - - - - - - 3 3 - - 3 -

Prepared by :iGAPPage 95
CO2 3 2 - - - - - - - - - 3 - 3 - 2 -

CO3 3 2 - - - - - - - - - 3 - 2 - 3 -

CO4 3 - - - - - - - - - - 3 - 3 - 2 -

CO5 3 - - - - 2 - 2 - - - 3 - 3 - 3 -

CO6 3 - - - - - 2 - - - - - - 2 - - -

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 348,Introduction to Mathematical & Statistical Techniques

in Computer Science (Program Elective-1)

School: SET Batch : 2018

Program: Current Academic Year:
B.Tech
Branch:CSE Semester:V
1 Course CSE 348 Course Name
Code
2 Course Introduction to Mathematical and Statistical Techniques in Computer
Title Science
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Program Elective-I
Status
5 Course The objective of the course is to teach students the mathematical &
Objective statistical techniques that provide sound basis for research and application
development in Computer Science.
6 Course By the end of the course, students will be able to:
Outcome CO1: Understand important mathematical and statistical methods that are essential
s for Computer Science research and application development;
CO2: Apply mathematical and statistical methods in their research and application
development.
CO3:Use a mathematical tool such as MATLAB efficiently.
7 Course In this subject, the fundamental concepts and principles of Mathematical &
Descripti Statistical Techniques together with the challenging issues in Computer Science
on software development will be introduced. Discussion on various topics related to
mathematics and Computer Science will also be conducted.
8 Outline syllabus CO
Mapping
Unit 1 Introduction,Computational Errors andtheirAnalysis
A Accuracyofnumbers,Errorsandageneralerrorformula,ErrorsinNumeric CO1, CO2
alComputations.

Prepared by :iGAPPage 96
 B Errorsina Series Approximation. CO1, CO2
C Precisions CO1, CO3
Unit 2 Numerical Techniques
A LU decomposition for systems of linear equations; CO1, CO2
B numerical solutions of non-linear algebraic equations by Secant, CO1, CO2,
Bisection and Newton-Raphson Methods;
C Numerical integration by trapezoidal and Simpson’s rules. CO1, CO2
Unit 3 Probability
A Probability: Conditional Probability; CO1,CO2
B CO1,CO2,C
Mean, Median, Mode and Standard Deviation;. O3
C Random Variables; Distributions;
Unit 4 Permutation
A uniform, normal, exponential CO1,CO2
B Poisson, Binomial distribution CO1,CO2
C CO1,CO2,C
Permutations; Combinations; Counting; Summation; O3
Unit 5 Hypothesis testing
A Generating functions; recurrence relations; CO2,CO3
B Techniquesforstatisticalqualitycontrol, CO2,CO3
C CO1,CO2,C
Testingofhypothesis. O3
Mode of Theory
examinati
on
Weightag CA MTE ETE
e 30% 20% 50%
Distributi
on
Text M. Goyal, “Computer Based Numerical & Statistical Techniques”,
book/s* Infinity Science Press, LLC, MA, USA.
Other 1. Matheus Grasselli and Dimitry Pelinovsky, “Numerical
Referenc Mathematics”, Jones and Bartlet Publishers, USA.
es 2. Lars Elden, “Mattrix Methods in Data Mining and Pattern
Recognition”, SIAM (Society for Industrial and Applied
Mathematics), USA.

3. Internet as a resource for references.

CO and PO Mapping

Prepared by :iGAPPage 97
 S. Course Outcome Program Outcomes (PO) &
No. Program Specific Outcomes
(PSO)
1. CO1: Understand important mathematical and PO1,PO2,PO3, PSO1
statistical methods that are essential for
Computer Science research and application
development;
2. CO2: Apply mathematical and statistical PO1, PO3, PSO2
methods in their research and application
development.
3. CO3:Use a mathematical tool such as MATLAB PO1,PO2,PO3
efficiently.

Syllabus: CSE 349,Introduction to Graph Theory and its

Applications(Program Elective-1)

School: SET Batch :2018

Program: B.Tech Current Academic Year: 2018-19
Branch:CS/IT Semester:5
1 Course CSE349 Course Name: Introduction to Graph Theory and its
Code Application
2 Course Introduction to Graph Theory and its Application
Title
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Program Elective-I
Status
5 Course The objective of the course is to teach students the basic graph theory
Objective concepts and their applications in computer science.
6 Course After successful completion of the course students will be able to
Outcomes 1. demonstrate some of the most important notions and types
of graph theory and develop their skill in solving basic
exercises
2. interpret the fundamentals of graphs and trees and to relate
them with the use in computer science applications
3. explore a graph with the help of matrices and to find a minimal
spanning tree for a given weighted graph
4. apply graph-theoretic algorithms and methods used in
computer science
5. develop efficient graph-theoretic algorithms
(mathematically)explore the applications of coloring problem
of graph theory

Prepared by :iGAPPage 98
 7 Course This course is to teach students the basic graph theory concepts and their
Description applications in computer science.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
A Basic terminologies and concepts of Graph Theory, CO1
Fundamental types of graphs, Applications in various areas
B Properties of graphs, theorems based on different types of CO1,CO4
graph and various operations on graphs
C Special types of graphs (Hamiltonian, Euler), Travelling CO1, CO5
salesman problem
Unit 2 TREES
A Fundamentals of trees and their types, Binary trees and their CO2
properties, importance of binary trees in data structure
(searching algorithms)
B fundamental circuits, spanning trees, algorithms to find CO2, CO3
spanning trees in a weighted graph (Kruskal& Prim)
C Applications: Representation of the algebraic expressions as CO4
ordered binary trees, Huffman procedure for construction of
an optimal tree for a given set of weights.
Unit 3 CUT SETS
A a cut-set of a connected graph, the fundamental circuit CO1
,Properties of circuits & cut–sets, Concept of connectivity
and separability
B Concept of Planar graphs with introduction to Kuratowski’s CO4
non-planar graphs, Proof of Euler’s formula
C Detection of planarity , geometric duals of graph, thickness & CO5
Crossings, network flow
Unit 4 Coloring and Covering
A Concept of proper coloring of vertices of a graph, chromatic CO4, CO5
number , Chromatic partitioning
B Chromatic polynomial, finding chromatic polynomial of a CO4, CO5
given graph
C Matching, Covering, Five color problem and its proof CO4, CO5
Unit 5 Matrix Representation of Graphs& Applications
A Incidence matrix, sub matrices of A(G), circuit matrix, CO3, CO4
fundamental circuit matrix and Rank of B
B Cut set matrix , fundamental cut set matrix, path matrix, CO4
Adjacency matrix
C Finding Rank of different matrices, Relationship among Af, Bf, CO4, CO5
andCf
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 1. Deo, N, Graphtheory with applications to Engineering
book/s* and Computer Science , Prentice Hall India

Other 1. Wilson R J, Introduction to Graph Theory,

PearsonEducation

Prepared by :iGAPPage 99
 References 2. Harary, F, Graph Theory, Narosa
3. Bondy& Murthy, Graph theory and application.
Addison Wesley

CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program
Specific Outcomes
(PSO)
1. CO1: demonstrate some of the most important notions and PO1, PO2, PSO1
types of graph theory and develop their skill in solving basic
exercises
2. CO2: interpret the fundamentals of graphs and trees and to PO1, PO2, PO3, PO4,
relate them with the use in computer science applications PSO2
3. CO3: explore a graph with the help of matrices and to find a PO3, PO4, PO5, PSO2
minimal spanning tree for a given weighted graph
4. CO4: apply graph-theoretic algorithms and methods used in PO4, PO5, PO6, PSO2,
computer science PSO4
5. CO5: develop efficient graph-theoretic algorithms PO4, PO5, PO9, PSO2,
(mathematically) PSO4
explore the applications of colouring problem of graph theory

PO and PSO mapping with level of strength for Course Name: Introduction to Graph
Theory and its Application (CSE 349 )
Cos PO1 PO PO3 PO4 PO P PO7 PO PO9 PO1 P PO1 PS PSO PS PSO PSO
2 5 O6 8 0 O1 2 O1 2 O3 4 5
1
CO1 3 3 2 2 1 1 1 1 1 1 2 2 3 2 1 2 1

CO2 3 3 3 3 2 1 1 1 2 2 1 2 2 3 1 2 1

CO3 2 2 3 3 3 2 1 1 1 2 2 2 2 3 2 2 2

CO4 2 2 2 3 3 3 1 2 2 1 1 2 2 3 2 3 1

CO5 2 2 2 3 3 2 2 2 3 1 1 2 1 3 1 3 1

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: ARP 302, Higher Order Mathematics and Advanced People Skills

School: SET Batch : 2018-19

Program:B.Tech Current Academic Year: 2018-19
Branch: CSE Semester: VIth |HOM
1 Course Code ARP 302 Course Name : Higher Order Mathematics and

Prepared by :iGAPPage 100

 Advanced People Skills
2 Course Title Higher Order Mathematics and Advanced People Skills
3 Credits 2
Contact Hours
4 0-0-4
(L-T-P)
Course Status
To enhance holistic development of students and improve their
employability skills. Provide a 360 degree exposure to learning
elements of Business English readiness program, behavioural
traits, achieve softer communication levels and a positive self-
5 Course Objective branding along with augmenting numerical and altitudinal abilities.
To up skill and upgrade students’ across varied industry needs to
enhance employability skills. By the end of this semester, a will
have entered the threshold of his/her 4thphase of employability
enhancement and skill building activity exercise.
CO1: Understanding basics of Human Resources
CO2: Role Clarity | KRA | KPI | Understanding JD
CO3: Conflict Management
6 Course Outcomes CO4: The art of Negotiations
CO5: Understanding Personal Branding
CO6: Relationship Management | Verbal Abilities-4
CO7: Level-4 Quant & aptitude, Reasoning abilities
This penultimate stage introduces the student to the basics of
Human Resources. Allows the student to understand and interpret
KRA | KPI and understand Job descriptions. A student also
7 Course Description understands how to manage conflicts, brand himself/herself,
understand relations and empathise others with level-4 of quant,
aptitude and logical reasoning
8 Outline syllabus – ARP 302
CO
Unit 1 Ace the Interview
MAPPING
HR Sensitization ( Role Clarity | KRA | KPI | Understanding JD ) | Conflict CO1, CO2,
A Management CO3
B Negotiation Skills | Personal Branding CO4, CO5
C Empathy VS Sympathy | Relationship Management | Verbal Abilities-4 CO6
Unit 2 Introduction to APTITUDE TRAINING- Reasoning- Logical/ Analytical
A Sitting Arrangement & Venn Diagrams | Puzzles | Distribution | Selection CO7
B Direction Sense | Statement & Conclusion | Strong & Weak Arguments CO7
C Analogies,Odd One out | Cause & Effect CO7
Unit 3 Quantitative Aptitude
A Average , Ratio & Proportions,Mixtures & Allegation CO7
B Geometry-Lines,Angles& Triangles CO7
C Problem of Ages | Data Sufficiency - L2 CO7
Weightage ( CA )Class Assignment/Free Speech Exercises / JAM – 60% | (ETE) Group
Distribution Presentations/Mock Interviews/GD/ Reasoning, Quant & Aptitude – 40%
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – ArihantPublications | Quicker Maths- M. Tyra |
Text Power of Positive Action (English, Paperback, Napoleon Hill) | Streets of Attitude (English, Paperback,
book/s* Cary Fagan, Elizabeth Wilson) The 6 Pillars of self-esteem and awareness – Nathaniel Brandon | Goal
Setting (English, Paperback, Wilson Dobson

Prepared by :iGAPPage 101

Syllabus:CSE 346, Artificial Intelligence

School: SET Batch : 2018

Program: B.Tech Current Academic Year:
Branch: CSE Semester:VI
1 Course CSE34 Course Name
Code 6
2 Course Artificial Intelligence
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Core
Status
5 Course The objective of the course is to introduce basic fundamental concepts
Objective in Artificial Intelligence (AI), with a practical approach in understanding
them. To visualize the scope of AI and its role in futuristic
development.
6 Course Students will be able to:
Outcomes CO1: Compare AI and non-AI solutions.
CO2: Apply AI techniques in problem solving.
CO3: Analyze the best search technique and implement it in real-life
applications.
CO4: Classify supervised and unsupervised learning and knowledge
representation.
CO5: To explore the scope of AI in various application domains.
7 Course This course introduces basic aspects of Artificial intelligence
Description comparing the AI and conventional solutions to real world problems,
utilizing and analyze AI techniques for identifying optimal solutions to
search strategies.
8 Outline syllabus CO Mapping
Unit 1 INTRODUCTION TO AI
A Foundation of AI, Goals of AI, History and AI course line, CO1, CO5
B Introduction to Intelligent Agents; Environment; Structure of CO1, CO5
Agent,
C AI Solutions Vs Conventional Solutions; a philosophical CO1, CO5
approach; a practical approach.
Unit 2 PROBLEM SOLVING AGENTS
A Problem solving using Search Techniques; Problems; CO1, CO2,
Solutions; Optimality, CO3
B Informed Search Strategies; Greedy Best-First; A* Search; CO1, CO2,
Heuristic Functions, CO3
C Uninformed Search Strategies; BFS; DFS; DLS; UCS; IDFS; CO1, CO2,

Prepared by :iGAPPage 102

 BDS. Local Search algorithms: Hill Climbing, genetic CO3
Algorithms.
Unit 3 KNOWLEDGE & REASONING
A Knowledge-Based Agents; clause form, First-Order Logic; CO1,CO4
Syntax-Semantics in FOL;
B Representation revisited, ; Simple usage; Inference CO1, CO4
Procedure; Inference in FOL;
C Forward Chaining; Backward Chaining; Resolution CO4
Unit 4 LEARNING
A Common Sense Vs Learning; Components; CO4
Representations; Forms of learning, Feedback, Learning
Types: Supervised; Unsupervised;
B Reinforcement Learnings, Decision trees, CO4
C Artificial Neural Networks: Introduction, types of networks; CO4
Single Layer and Multi-Layer n/w.
Unit 5 APPLICATIONS
A case studies on NLP, Image Processing;, CO1,CO5
B Robotics – Hardware; Vision; Navigation based case CO1,CO5
studies,
C Water jug problem and similar case studies CO1,CO5
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 5. Russell S &Norvig P, Artificial Intelligence: A
book/s* Modern Approach, Prentice Hall.
Other 14. Rich E& Knight K, Artificial Intelligence, Tata
References McGraw Hill, Edition 3.

15. Dan W. Patterson, Artificial Intelligence & Expert

Systems, Pearson Education with Prentice Hall
India. Indian Edition.

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No. & Program Specific
Outcomes (PSO)
1. CO1: Compare between AI and non-AI solutions. PO1,PO2,PO7,PO9,PO10,
,PSO1
2. CO2: Apply AI techniques in problem solving. PO2, PO3, PO4, PO5,
PSO2
3. CO3: Analyze the best search technique and implement PO1,PO2,PO3,PO4, PO6,
it in real-life applications. PO9, PO11, PO12
4. CO4: Classify supervised and unsupervised learning and PO6,PO11, PSO5
knowledge representation.
5. CO5: To explore the scope of AI in various application PO9, PO11,PO12, PSO5
domains.

Prepared by :iGAPPage 103

 PO and PSO mapping with level of strength for Course Name Artificial
Intelligence(Course Code CSE 346)

Cos PO1 PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO PSO
2 O6 0 O1 2 O1 4 5
1
CO1 3 3 1 1 -- -- 3 - 2 2 - - 3 - - - -

CO2 1 2 3 3 3 -- -- 1 1 1 - - 1 2 - - -

CO3 3 3 3 3 -- 2 -- 1 2 1 3 2 - - - - -

CO4 1 1 1 1 - 3 -- 1 1 - 3 1 1 1 1 1 3

CO5 1 1 1 1 - - -- 1 3 1 3 2 1 1 1 1 2

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus:CSP 346, Artificial Intelligence Lab

School: SET Batch: 2018-2022
Program: B.Tech Current Academic Year: 2018
CSE
Branch: CSE Semester: VI
1 Course Code CSP346
2 Course Title Artificial Intelligence Lab

3 Credits 2
4 Contact 3-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course The objective is to gain knowledge of basic concepts of artificial
Objective intelligence and machine learning.
6 Course Upon successful completion of this course, the student will be able to:
Outcomes CO1. Identify the basic components of library environment and
installations.
CO2. Understand the working of machine learning libraries.
CO3. Analyze the significant methodology needs to be applied for data
preprocessing.
CO4. Develop some application oriented projects on Image Processing,
Natural Language Processing etc
CO5. Identify how to use github and submit back genuine contributions
on the same.
7 Course Artificial Intelligence Lab covers the hands-on, understanding and
Description analysis of machine learning technology and to trace its recent trend.
8 Outline syllabus CO Mapping

Prepared by :iGAPPage 104

 Unit 1 Library Environment Understanding and installation
3. To install the pypi libraries for Machine Learning. CO1
4. Review of python datatypes for Artificial Intelligence
and Machine Learning
Unit 2 Machine Learning Experiments
1. Develop a machine learning model for standard CO2
database using Support Vector Machines
2. Develop a machine learning model for standard
database using Decision Trees.
3. Develop a machine learning model for standard
database using Random Forest.
Unit 3 Data Preprocessing
1. Deploy standardization and normalization on CO3
some standard dataset.

2. Deploy Principal Component Analysis to extract

relevant features on some standard database.

Unit 4 Application Oriented Experiment

1. Develop a decision boundary for facial CO4
recognition purpose.

2. Develop a decision boundary to predict the

emotions from the human voice.

Unit 5 Industry Oriented Experiments

1. Understanding of github and conda CO5
environments.

2. To use the github packages and libraries to frame

a standard project and commit back to github.

Mode of Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* 1. Russell S &Norvig P, Artificial Intelligence: A
Modern Approach, Prentice Hall.
Other
1. D. H. Wolpert. The supervised learning no-free
References
-lunch theorems. In Soft Computing and
Industry, pages 25–42. Springer, 2002.
2. V. Vapnik. The nature of statistical learning
theory. Springer Science & Business Media,
2013.
3. C. J. Burges. A tutorial on support vector
machines for pattern recognition. Data mining
and knowledge discovery, 2(2):121–167,
1998.

Prepared by :iGAPPage 105

 4. J. H. Friedman, J. L. Bentley, and R. A.
Finkel. An algorithm for finding best matches
in logarithmic expected time. ACM
Transactions on Mathematical Software
(TOMS), 3(3):209–226, 1977.

Syllabus: CSP 301, Technical Skill Enhancement Course-2( Application

Development Lab)

School: SET Batch: 2018

Program: BTech Current Academic Year: 2018-19
Branch: Semester:2
1 Course Code CSP301
2 Course Title Application Development Lab
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Compulsory/Elective
Status
5 Course Describe the components and structure of a mobile development
Objective frameworks (Android SDK and Eclipse Android Development Tools
(ADT)) and learn how and when to apply the different components to
develop a working system.
6 Course On successful completion of the course, the student will:
Outcomes 1. Design App user Interface
2. Perform Event driven programming
3. Implement relational Databases on devices using SQLite
4. Examine the usage of commonly available device sensors
while building Android App
7 Course The course will introduce concepts of the Android platform, Android
Description application components, Activities and their lifecycle, UI design. It will
also help students to build applications according to their problem
statements.
8 Outline syllabus CO
Mapping
Unit 1 Introduction to Android
CO1
1. Configuration of android SDK and test run of
application on device

2. Create “Hello World” application. That will display

“Hello World” in the middle of the screen in the
emulator.

3. Develop an Android Application to implement

Activity life cycle.

Prepared by :iGAPPage 106

 Unit 2 Android UI Components CO1
4. Create a layout of Calculator using Grid layout. CO1
5. Develop an Android Application to implement event
listener on above layout.

6. Develop an Android Application to implement

implicit intent.

Unit 3 Services and Notification

7. Develop an Android Application to implement CO1,CO2
Service life cycle

8. Develop an Android Application to implement

status bar notification

9. Create a menu with 5 options and selected option

should appear in text box

Unit 4 Working with SQL Lite CO1,CO2

10. Create and Login application as above. On CO1,CO2
successful login, pop up the message.

11. Create an application to implement Create, Insert

and update operation on the database.

12. Create an application to perform Delete and retrieve

operation on the database.

Unit 5 Sensor Device

13. Develop an Android Application to detect availability CO1
of all sensors.

14. Develop an Android Application to Fetch data from

sensors

15. Develop an Android Application for development of

compass application with help of Orientation sensor

Mode of Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* 1. Anubhav Pradhan and Anil V. Deshpande , Composing
Mobile Apps: Learn, Explore, Apply Using Android , 1st
Edition, Wiley India.
Other 1. Wei-Meng Lee , Beginning Android 4 Application
References Development.
2. Neil Smyth ,Android Studio Development essentials-
Android 6

Prepared by :iGAPPage 107

Syllabus: Android Development(Program Elective-2)

School: SET Batch : 2018

Program: B.Tech Current Academic Year: 18-19
Branch: CSE Semester: VI
1 Course CSE-350 Course Name
Code
2 Course Android Development
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Core/Elective
Status
5 Course Describe the components and structure of a mobile development frameworks
Objective (Android SDK and Eclipse Android Development Tools (ADT)) and learn how
and when to apply the different components to develop a working system.
6 Course On successful completion of the course, the student will:
Outcomes 1. Design App user Interface
2. Perform Event driven programming
3. Implement relational Databases on devices using SQLite
4. Examine the usage of commonly available device sensors while
building Android App
7 Course The course will introduce concepts of the Android platform, Android
Description application components, Activities and their lifecycle, UI design.It will also help
students to build applications according to their problem statements.
8 Outline syllabus CO Mapping
Unit-1 Introduction to OOP
A History, The meaning of Object Orientation,
Features of OOP, OOPs concepts, object identity
B Encapsulation, information hiding,
C polymorphism inheritance, Interfaces
Unit-2 Introduction to DBMS
A Relational data model concepts ,Concept of keys,
Mapping Constraints
B DDL and DML commands: Create, Insert, update, alter
etc. Fetch and update database
C Unary Relational Operations: SELECT and PROJECT
Relational Algebra Operations from Set Theory .
Unit-3 Introduction to Operating System
Process Concepts (PCB, Process States , Process
Operations, Inter process communication)
Memory Hierarchy, Memory Management Unit, Paging,
Segmentation
Types of Operating Systems (Batch, Multiprogramming

Prepared by :iGAPPage 108

 ,Multi-Tasking , Multiprocessing, Distributed and Real
Time Operating System)
Unit 4 Android UI Components
A Layouts-Linear layout, Relative layout, Table layout, Frame CO1,CO2
layout
B Button, TextView, EditTextView, Label, List, Radio Button, CO1,CO2
Checkbox
C Concept of intent, configuration of intent, Intent filters CO1,CO2
Unit 5 Activities, Services and Notification
A Services- states and life cycle CO1
B Type of notification, Toast notification, status bar CO1,CO2
notification
C Creating Menu Option Menu, Context Menu CO1,CO2
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 1. Anubhav Pradhan and Anil V. Deshpande , Composing Mobile Apps: Learn, Explore,
book/s* Apply Using Android , 1st Edition,Wiley India.
Other 1. Wei-Meng Lee , Beginning Android 4 Application Development.
References 2. Neil Smyth ,Android Studio Development essentials-Android 6

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) &
No. Program Specific Outcomes
(PSO)
1. CO1:Design App user Interface PO4,PO5,PSO4
2. CO2:Perform Event driven programming PO3,PO5
3. CO3:Implement relational Databases on devices using PO4,PO5,PO9
SQLite
4. CO4:Examine the usage of commonly available device PO5,PO7,PO12,PSO4
sensors while building Android App
PO and PSO mapping with level of strength for Android Development(Course Code
CSE 350)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO PSO
3 4
CO1 1 2 2 3 3 2 1 2 2 2 2 2 1 2 2 3

CO2 2 2 3 2 3 1 1 2 2 2 1 2 2 2 2 2

CO3 2 1 2 3 3 1 2 - 3 2 2 2 - 1 1 2

CO4 2 1 1 1 3 1 3 - 2 1 2 3 - 2 1 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus:CSE 351Introduction to Cloud Computing(Program Elective-2)

Prepared by :iGAPPage 109

 School: SET Batch : 2018
Program: Current Academic Year: 2018-19
B.Tech
Branch: CSE/IT Semester: VI
1 Course CSE351 Course Name
Code
2 Course Introduction to Cloud Computing
Title
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Elective
Status
5 Course 5. Provide students with an overview of the fundamental concepts of
Objective Cloud Computing.

6. Gain insight into the challenges and limitations Models of cloud

computing.

7. To learn the various technologies of the cloud computing

paradigm and learn about recent advances in Cloud Computing
and enabling technologies.

8. Prepare students for research in the area of cloud Computing

risks, cloud security challenges and virtual security management.

9. Enhance students communication and problem solving skills

6 Course Students will be able to:

Outcomes CO1: To understand the cloud computing Concepts.
CO2:Explain how and why this paradigm came about and the influence of
several enabling technologies like Virtualization (e.g. VMware) and
Google file systems
CO3:Build cloud based applications using MS Azure, Amazon AWS and/or
Google App Engine.
CO4:Understanding of Cloud Computing risk issues, Cloud security
challenges and management of Virtual system security.
7 Course This course introduces advanced aspects of Cloud Computing,
Description encompassing the principles, to analyze the cloud, identify the problems,
and choose the relevant models and algorithms to apply.
8 Outline syllabus CO Mapping
Unit 1 Introduction Cloud Computing
A Introduction to distributed systems, Defining Cloud CO1, CO2
Computing, Understanding of Cloud Architecture:
Composability, Infrastructure, Platform, Virtual

Prepared by :iGAPPage 110

 Appliances, Communication Protocols, Applications,
Understanding Services: SaaS, PaaS, IaaS, Service
Oriented Architecture(SOA),Salesforce.com and CRM
SaaS
Unit 2 Understanding Abstraction and Virtualization
A Advanced Load Balancing, the Google Cloud, Virtual CO1,
machine types, VMware vSphere, Understanding CO2,CO4
Machine Imaging, Porting Applications.
Storage in the Cloud:
Google file system.
Unit 3 Cloud Computing with the Titans
A Google Web Services: Google app Engine, Google Web CO1,CO2,CO3
Toolkit. Amazon: Amazon Elastic Cloud Computing,
Amazon Simple Storage System, Amazon Block Store
(EBS). Microsoft: Azure Service Platform, Exchange
Online.
Unit 4 Cloud Computing Risk Issues
A The CIA Triad: Confidentiality, Integrity, And Availability. CO1,CO2,CO3
Privacy and Compliance: PCI DSS, Information Privacy
and Privacy law. Common Threats and Vulnerability:
Logon Abuse, Inappropriate System Use, Eavesdropping,
Denial-of-service (DoS) Attack, Session Hijacking Attack.
Cloud Service Provider (CSP) Risks: Back Door,
Spoofing, Replay Attack, Social Engineering Attack,
Dumpster Diving, Trojan Horse and Malware.
Unit 5 Cloud Computing Security Challenges and virtualization
A Security Policy Implementation, Policy Types: Senior CO1,CO2,CO3
Management Statement of Policy, Regulatory Policies,
Advisory Policies, And Informative Policies.
B Virtual Security Management:Virtual Threats: CO1,CO2,CO3
Hypervisor Risks, Increase Denial of Service Risk. VM-
Specific Security Techniques: Hardening the Virtual
Machine, Securing VM Remote Access.
Mode of Theory
examination
Weightage CA MTE
Distribution
30% 20%
Text 6. Barrie Sosinsky “Cloud Computing (Bible)” ,Wiley
book/s*
Other 7. Anthony T.Velte, Toby J. Velte, Robert Elsenpeter”Cloud
References Computing: A Practical Approach” TATA McGRAW-HILL
Edition.

8. Ronald L. Krutz and Russell Dean Vines, “Cloud Security: A

comprehensive Guide to Secure Cloud Computing”,
WILEY.

Prepared by :iGAPPage 111

 CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program Specific
Outcomes (PSO)
1. CO1: To understand the cloud computing Concepts PO1,PO2,PO3,PO4,PSO1
2. CO2:Explain how and why this paradigm came about PO1, PO3, PO4, PSO2
and the influence of several enabling technologies
like Virtualization (e.g. VMware) and Google file
systems
3. CO3:Build cloud based applications using MS Azure, PO1,PO2,PO3,PO4
Amazon AWS and/or Google App Engine.
4. CO4:Understanding of Cloud Computing risk issues, PO9, PO10,PO11, PSO5
Cloud security challenges and management of
Virtual system security.

PO and PSO mapping with level of strength for Course Name Introduction to Cloud
Computing (Course Code CSE 351)
Cos PO PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO PSO
1 2 O6 0 O1 2 O1 4 5
1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 352, Web Designing (Program Elective-3)

School: SET Batch : 2018

Program: B.Tech Current Academic Year: 2018-19
Branch:CSE/IT Semester:VI
1 Course CSE352 Course Name:
Code
2 Course Web Designing
Title
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Elective

Prepared by :iGAPPage 112

 Status
5 Course The objective of this course is to provide a foundation of technologies and
Objective technical skills in web development. Based upon the development of a web,
this course provides an insight of computer and networking technologies, and
hands on experience in web programming.
6 Course 1) Design and develop a simple interactive web application
Outcomes 2) Demonstrate the ability to design web sites utilizing multiple tools and
techniques.
3) Build dynamic web pages using JavaScript

4) Apply the network programming knowledge to setup a web site

7 Course This course is an overview of the modern Web technologies used for the Web
Description development. The purpose of this course is to give students the basic
understanding of how things work in the Web world from the technology point
of view as well as to give the basic overview of the different technologies.
8 Outline syllabus CO
Mapping
Unit 1 Introduction
A Web Page: Static and dynamic sites, client and server end CO1,CO2
technology, URL syntax, open source web design tools
overview.
B HTML basic tags, image map, implementation of links, table, CO1
form design.
C Page layout design: using frame, div and span tag, iframes, CO1,CO2
DHTML
Unit 2 HTML5
A New elements, semantic, canvas, offline webpage, canvas, CO1
SVG
B HTML Media: video, audio, HTML API: geolocation CO2
C Location storage, Migration from HTML to HTML5. CO2
Unit 3 CSS
A CSS: Introduction, syntax, selector, text formatting, margin, CO2,CO3
align, Positioning, background formatting, Navigation bar, and
image gallery.
B CSS3: Introduction, colors, text formatting, fonts formatting, CO2
Background formatting
C 2D transform, Transition, animation, user interface CO4
Unit 4 XML
A XML: Introduction, syntax, well form XML document CO1,CO2
B DTD, schema, XML Technology: xlink, xpath, xpointer, xslt CO1,CO2
C displaying XML file data into HTML file CO2
Unit 5 Java Script
A Syntax, comment, statement, variable, operators, conditional CO3,CO4
statements, looping statements
B functions, object, events, Accessing form elements CO3,CO4
C History, pop up windows, cookies. CO3,CO4
Mode of Theory
examination

Prepared by :iGAPPage 113

 Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 5. Ivan Bayross,”HTML,DHTML, JavaScript, Perl & CGI”, BPB
book/s* Publication
6. Rick Delorme,” Programming in HTML5 with JavaScript
and CSS3”, Microsoft
Other 1. Burdman, “Collaborative Web Development” Addison
References Wesley.
2. Chris Bates, “Web Programing Building Internet
Applications”, 2nd Edition, WILEY.
3. Steven Holzner,“PHP: The Complete Reference”,
TataMcGraw Hill Publication

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) &
No. Program Specific Outcomes
(PSO)
1. CO1: Design and develop a simple interactive web PO3,PO8,PO12,PSO3
application
2. CO2: Demonstrate the ability to design web sites PO3,PO5,PO10,PO12,PSO1,PSO2
utilizing multiple tools and techniques.
3. CO3:Build dynamic web pages using JavaScript PO3,PO12
4. CO4: Apply the network programming knowledge to PO10,PO12
setup a web site

PO and PSO mapping with level of strength for Course Web Designing(CSE 352 )
Cos PO1 PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO
2 O6 0 O1 2 O1 4
1
CO1 1 2 3 1 1 1 2 3 2 2 1 3 2 2 3 3

CO2 1 2 3 2 3 1 2 2 2 3 2 3 3 3 1 1

CO3 1 2 3 -- 2 1 2 2 2 2 -- 3 2 2 1 3

CO4 1 2 2 1 2 1 2 2 -- 3 1 3 2 1 1 2

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 353, Software Project Management (Program Elective-3)

School: SET Batch : 2018-2022

Program: B. Current Academic Year:
Tech
Branch:CSE Semester:VI
1 Course CSE353

Prepared by :iGAPPage 114

 Code
2 Course Software Project Management
Title
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Elective
Status
5 Course 1. Introduces students with an overview and concepts of
Objective software project management.

2. Gain insight into the challenges and limitations of

different phases of software project management

3. Using techniques for planning, monitoring and control

of software projects

4. Prepare students understand project evaluation and

software effort estimation.

5. Enhance the managerial and leadership skillsof the

students

6 Course Students will be able to:

Outcomes
CO1: Apply software project management and engineering methods
in the projects under taken.
CO2:design and conduct a software effort estimation in a project
under taken
CO3: develop the ability to lead or, work in a team till the completion
of a project.
CO4: Have an ability understand and identify various software project
management problems, and solve these problems by designing and
selecting appropriate strategies, and methods.
7 Course This course introduces concepts of software project management in
Description which Project Planning, Project Evaluation, Software Effort
estimation, Monitoring and control and Managing contracts tools and
techniques are included.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Introduction to software project management, CO1, CO2
software projects versus other types of project,
B activities covered by software project management, CO1, CO2
the project as a system, problems with software
projects,
C management control, stakeholders, requirement CO1, CO2

Prepared by :iGAPPage 115

 specification, information and control in
organization.
Unit 2 Project Planning
A Introduction to step wise project planning, select CO1,
project, identify project scope and objectives, CO2,CO4
B identify project infrastructure, analyze project CO1,
characteristics, identify project products and CO2,CO4
activities,
C estimate effort for each activity, identify activity risk, CO1,
allocate resources, review/publicize plan, execute CO2,CO4
plan and lower levels of planning
Unit 3 Project Evaluation
A Strategic assessment, Technical assessment: cost- CO1,CO2,CO3
benefit analysis, cash flow forecasting,
B cost-benefit evaluation techniques, risk evaluation. CO1,CO2,CO3
C Application development models: the waterfall CO4
model, the V-process model, the spiral model,
software prototyping, tools
Unit 4 Software Effort estimation
A Introduction, Where are estimates done?, problems CO1,CO2,CO3
with over and under estimates,
B the basis for software estimating, effort estimation CO1,CO2,CO3
techniques, expert judgment, estimating by analogy,
Albert function point analysis,
C Function points MARK II, object points, COCOMO, CO1,CO2,CO3
publishing the resource schedule, cost schedule, the
scheduling sequence
Unit 5 Monitoring and Managing contracts
A Creating the framework, collecting the data, CO1,CO2,CO3
visualizing progress, cost monitoring, earned value,
B prioritizing monitoring, getting the project back to CO1,CO2,CO3
target, change control.
C Managing contracts: types of contract, stages in CO1,CO2,CO3
contract placement, typical terms of a contract,
contract management, contract management,
acceptance.
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 1. Software Project Management, Bob Hughes and
book/s* Mike Cotterell, McGraw Hill
Other 2. Software Project Management A Unified
References Framework, Walker Royce, Addison-Wesley
3. A practitioner’s Guide to Software Engineering,
Roger Pressman, Tata McGraw Hill 2014 8th

Prepared by :iGAPPage 116

 edition.
4. Basics of Software Project Management, NIIT,
Prentice-Hall India, Latest Edition.

CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program Specific
Outcomes (PSO)
1. CO1: Apply software project management and PO1,PO2,PO3,PO4,PSO1
engineering methods in the projects under taken.
2. CO2:design and conduct a software effort estimation in PO1, PO3, PO4, PSO2
a project under taken
3. CO3:Develop the ability to lead or, work in a team till the PO1,PO2,PO3,PO4
completion of a project.
4. CO4: Have an ability understand and identify various PO9, PO10,PO11
software project management problems, and solve these
problems by designing and selecting appropriate
strategies, and methods.

PO and PSO mapping with level of strength for Course Name Software Project
Management (CSE 353)
Cos PO1 PO PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO
2 O6 0 O1 2 O1 4
1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSP 398, Project Based Learning (PBL) -4

School: SET Batch : 2018

Program: B.Tech Current Academic Year: 2018
Branch: CSE Semester: 6th
1 Course Code CSP398 Course Name: Project Based Learning -4
2 Course Title Project Based Learning-4
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)

Prepared by :iGAPPage 117

 Course Status Compulsory
5 Course Objective 10. To align student’s skill and interests with a
realistic problem or project
11. To understand the significance of problem and its
scope
12. Students will make decisions within a framework
6 Course Outcomes Students will be able to:
CO1: Acquire practical knowledge within the chosen area
of technology for project development
CO2: Identify, analyze, formulate and handle
programming projects with a comprehensive and
systematic approach
CO3: To design and implementsolutions to open-
endedproblem/project.
CO4: Develop effective communication skills for
presentation of project related activities
CO5: To deploy and justify the project and contribute as
an individual or in a team in development of technical
projects
CO6: Use different tools forcommunication, design,
implementation, testing andreport writing.
7 Course Description In PBL-4, the students will learn how to define the
problem for developing projects, identifying the skills
required to develop the project based on given a set
ofspecifications and all subjects of that Semester.
8 Outline syllabus CO Mapping
Unit 1 Problem Definition,Team/Group formation and CO1, CO2
Project Assignment. Create Software Requirement
Specification
Unit 2 Finalize and present the functional design brief, CO1, CO2
concept designs and the outline design process
results to an outline design report.
Unit 3 Implementation or Coding: the actual coding work CO1, CO2,
of different modules/units is started. CO3
Unit 4 Test the project modules CO3, CO4
Unit 5 Demonstrate and execute Project with the team. CO4, CO5,
The presentation, report, work done during the term CO6
supported by the documentation, forms the basis of
assessment.
Report should include Abstract, Introduction,
Proposed System Design/Algorithm,
Experimentation & Result Analysis, Conclusion, and
References.
Presentation – PBL-4

Prepared by :iGAPPage 118

 Mode of Theory
examination
Weightage CA MTE ETE
Distribution 60% NA 40%
Text
book/s*
Other
References

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No.
1. CO1: Acquire practical knowledge within the chosen PO1, PO2, PO4, PO9,
area of technology for project development PO10, PO11, PO12
2. CO2: Identify, analyze, formulate and handle PO1, PO2, PO4, PO7,
programming projects with a comprehensive and PO9, PO10, PO11, PO12
systematic approach
3. CO3: Discuss and accumulate the background PO1, PO2, PO5, PO9,
information PO10, PO11, PO12
4. CO4: Develop effective communication skills for PO1, PO2, PO6, PO9,
presentation of project related activities PO10, PO11, PO12
5. CO5: Contribute as an individual or in a team in PO1, PO2, PO3, PO4,PO5,
development of technical projects PO6, PO7, PO8, PO9,
PO10, PO11, PO12
6. CO6: Prepare a technical report based on theproject. PO1, PO2, PO3, PO4,PO5,
PO6, PO7, PO8, PO9,
PO10, PO11, PO12

PO and PSO mapping with level of strength for Course Name Project Based Learning -
4 (Course Code CSP398)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 - 3 - - - - 3 3 2 3
CO2 3 2 - 3 - - 2 - 3 3 2 3
CO3 3 2 - - 2 - - - 3 3 2 3
CO4 3 3 - - - 2 - - 3 3 2 3
CO4 3 3 2 2 2 2 3 3 3 3 2 3
CO4 3 3 2 2 2 2 3 3 3 3 2 3
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Prepared by :iGAPPage 119

Syllabus: CSE 458, Web Technology

School: SET Batch : 2018

Program: Btech Current Academic Year: 2018-19
Branch:CSE Semester:7
1 Course CSE458 Course Name
Code
2 Course Web Technology
Title
3 Credits 4
4 Contact 3-0-2
Hours
(L-T-P)
Course Compulsory
Status
5 Course Provide the knowledge to design and develop web application with and without
Objective database. Students will gain the skills and project-based experience needed for
entry into web application and development careers. It provides information
about web technologies that relate to the interface between web servers and their
clients.
6 Course On successful completion of this module students will be able to:
Outcomes 6. Design interactive web pages
7. Design web pages/site having validation on user data access.
8. Develop web site for small business and organization or for individual
9. Client server communication RMI
7 Course The purpose of this course is to give students the basic understanding
Description of how different computers and devices to communicate and share resources as
well as to give the basic overview of the different technologies.
8 Outline syllabus CO Mapping
Unit 1 INTRODUCTION TO HTML & JAVA SCRIPT
A HTML basic tags, various links implementation, image map, CO1
table formatting, form design.
B Java Script: Introduction, syntax, comment, statement, CO2
variable, operators, Conditional statements, looping
statements
C Functions, object, events, Accessing form elements, CO2
validating form elements
Unit 2 XML
A Introduction, syntax, well form XML document, DTD, schema CO1,CO3
B XML Processors/Parser: DOM and SAX CO1,CO3
C XML Technology: xlink, xpath, xpointer, xslt , displaying XML CO1,CO3
file data into HTML file
Unit 3 JAVA APPLET & SERVLET
A Introduction to Applet , Creation of applet,Managing Applets CO1,CO3
B Introduction to JDBC and its Components,Implementing CO1,CO3
JDBC in Applet.

Prepared by :iGAPPage 120

 C Servlet, Creating Servlet, Managing request and response in CO1,CO3
Servlet, Servlet Collaboration, Session Tracking
Unit 4 JAVA SERVER PAGES & ENTERPRISE JAVA BEANS
A Introduction to JSP , Life cycle of JSP,JSP Application Design CO3
B Scripting elements, scriptlet tag, expression tag, declaration CO3
tag, Implicit Objects, JSP Objects, Directive Elements
C EJB - Introduction, Components of EJB, Architecture of CO3
EJB
Unit 5 RMI AND JAVA NETWORKING
A Remote Method Invocation - Introduction, Structure of CO4
RMI, Implementing RMI
B Sockets: Introduction, Application, TCP socket, UDP socket CO4
C Socket Implementation, Client and Server sockets, data CO4
transmission over socket
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text
book/s* 1. Ivan Bayross,”HTML,DHTML, JavaScript, Perl & CGI”,
BPB Publication
2. Schildt H, “The Complete Reference JAVA2”, TMH
3. Schildt H, “The Complete Reference J2EE”, TMH
Other 2. Rick Delorme,” Programming in HTML5 with
References JavaScript and CSS3”, Microsoft

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) & Program
No. Specific Outcomes (PSO)
1. CO1:Design interactive web pages by applying PO3,PO5,PO8,PO12,PS01,PSO3,PSO4
CSS .
1. CO2: Design web page which has animation PO3,PO5,PO8,PO10,PSO3,PSO4
and dynamic data
2. CO3: Design web pages/site having validation PO3,PO4,PO5,PO8,PO10,
on user data access. PS01,PSO3,PSO4
.
3. CO4: Develop web site for small business and PO3,PO4,PO5,PO8,PO10,
organization or for individual PO12,PSO3,PSO4

PO and PSO mapping with level of strength for Course Web Technology(Course Code
CSE 458)
Cos PO1 PO2 PO3 PO4 PO5 P PO7 PO8 PO9 PO1 P PO1 PS PSO2 PSO3 PSO
O6 0 O1 2 O1 4
1
CO1 1 - 3 1 3 2 - 3 2 2 2 3 3 - 3 3

CO2 2 - 3 2 3 2 - 3 1 3 2 3 2 - 3 3

Prepared by :iGAPPage 121

CO3 1 - 3 3 3 2 - 3 1 3 2 3 3 - 3 3

CO4 2 - 3 3 3 2 - 3 2 3 2 3 2 - 3 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSP 458, Web Technology Lab

School: SET Batch: 2018

Program: BTECH Current Academic Year:
Branch:CSE Semester: VII
1 Course Code CSP458
2 Course Title Web Technology Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Provide the knowledge to design and develop web application with and
Status without database. Students will gain the skills and project-based experience
needed for entry into web application and development careers. It provides
information about web technologies that relate to the interface between web
servers and their clients.
5 Course On successful completion of this module students will be able to:
Objective 1. Design interactive web pages
2. Design web pages/site having validation on user data access.
3. Develop web site for small business and organization or for
individual
4. Client server communication RMI
6 Course This course is an overview of the modern Web technologies used for
Outcomes the Web development. The purpose of this course is to give students
the basic understanding of how different computers and devices to
communicate and share resources as well as to give the basic overview of
the different technologies.
7 Course
Description
8 Outline syllabus CO Mapping
Unit 1 INTRODUCTION TO HTML & JAVA SCRIPT
1. Write HTML code to design College Website

2. Write HTML code to design students CO1, CO2

registration form

3. Write javascript code to perform validation

on above form.

Unit 2 XML

Prepared by :iGAPPage 122

 1. Write a program in XML to create Product CO1,CO2
Catalog.

2. Write a program for Product Catalog DTD.

3. Write a program to display the XML file data

into HTML file.

Unit 3 JAVA APPLET & SERVLET

1. Write a program to count number of CO2,
character in words in the text written in CO3,CO4
text area.

2. Write a program to draw circle using

mouse click event.

3. Write a program to insert and then

retrieve name,rollno,and branch rom the
database using JDBC

Unit 4 JAVA SERVER PAGES & ENTERPRISE JAVA BEANS

1. Write a program to create registration CO1,CO2,CO3

form using jsp.

2. Write a program to describe

jsp:param,jsp:include and jsp forward
action.

3. Write a program to implement EJB

Unit 5 RMI AND JAVA NETWORKING

1. Write a program to perform addition using
RMI
CO3,CO4
2. Create Chat application using TCP socket
Programming.

3. Write a program in which Client keeps

reading input from user and sends to the
server until “Over” is typed.
Mode of Jury/Practical/Viva
examination

Prepared by :iGAPPage 123

 Weightage CA MTE ETE
Distribution 60% 0% 40%
Text book/s* 1. Ivan Bayross,”HTML,DHTML, JavaScript, Perl &
CGI”, BPB Publication
2. Schildt H, “The Complete Reference JAVA2”, TMH
3. Schildt H, “The Complete Reference J2EE”, TMH
Other 4. Rick Delorme,” Programming in HTML5 with
References JavaScript and CSS3”, Microsoft

Syllabus: CSP 497, Major Project -1

School: SET Batch : 2018 - 2022
Program: B.Tech Current Academic Year: 2018-2019
Branch: CSE Semester: 7th
1 Course Code CSP497 Course Name: Major Project -1
2 Course Title Major Project -1
3 Credits 3
4 Contact Hours 0-0-6
(L-T-P)
Course Status Compulsory
5 Course Objective 13. To align student’s skill and interests with a realistic
problem or project
14. To understand the significance of problem and its
scope
15. To realize the outcome artifacts of the project.
16. Students will make decisions within a framework
6 Course Outcomes Students will be able to:
CO1: Identify problems in engineering and technology in
selected field of interest. Gather and manage the
information required to develop a project
CO2: Discuss and accumulate the background information
CO3: Synthesize and apply prior knowledge of mathematics,
computer science and engineering.
CO4: To prepare the designs requirements, functional and
concept design.
CO5: To build and evaluate the modules to verify the
required need of the project.
CO6: To start the actual implementation of the project work
to produce the deliverables. To design and implement
solutions to open-ended problem/project.
7 Course Description The object of Major Project-I is to enable the student to take
up investigative study in the broad field of Computer
Science & Engineering, either fully theoretical/practical
orinvolving both theoretical and practical work to be
assigned by the Department on an individual basis or

Prepared by :iGAPPage 124

 two/three students in a group, under the guidance of a
Supervisor.
8 Outline syllabus CO
Mapping
Unit 1 Problem identification, Literature survey/Gather & analyze CO1, CO2
information from multiple sources
Unit 2 Formulate solution/ Problem Description: Project Planning, CO1, CO2,
Time and Cost Estimation and budgeting, Risk CO3
Management, Project scheduling and Planning Tools: Work
Breakdown structure, LRC, Gantt charts, CPM/PERT
Networks. Creating System Requirement Specifications
(Functional & Non Functional)
Unit 3 Preparing Design: Data Flow Diagrams & Flow Charts, Use CO2, CO3,
of appropriate tools and techniques for project design CO4
Unit 4 Identify and Implement Project Modules CO4, CO5
Unit 5 Use of appropriate tools/technologies for coding the CO4, CO5,
modules CO6
Report on final problem statement, specifications, project
schedule, final concept design and project schedule
Report and Presentation - Project Modules development
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 60% NA 40%
Text
book/s*
Other
References

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No.
1. CO1: Identify problems in engineering and PO1, PO2, PO3, PO4, PO5, PO8,
technology in selected field of interest. Gather PO9, PO10, PO11, PO12
and manage the information required to develop a
project
2. CO2: Discuss and accumulate the background PO1, PO2, PO4, PO7, PO9,
information. PO10, PO11, PO12
3. CO3: Synthesize and apply prior knowledge of PO1, PO2, PO3, PO6, PO5, PO9,
mathematics, computer science and engineering PO10, PO11, PO12
4. CO4: To prepare the designs requirements, PO1, PO2, PO3, PO6, PO7, PO9,
functional and concept design PO10, PO11, PO12
5. CO5: To build and evaluate the prototype to verify PO1, PO2, PO3, PO4, PO5, PO7,
the required need of the project. PO9, PO10, PO11, PO12
6. To start the actual implementation of the project PO1, PO2, PO3, PO4, PO5, PO6,
work to produce the deliverables. To design and PO7, PO8, PO9, PO10, PO11,
implement solutions to open-ended PO12
problem/project.

Prepared by :iGAPPage 125

PO and PSO mapping with level of strength for Course Name Major Project -1 (Course Code
CSP497)

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 3 3 3 - - 2 3 3 2 3

CO2 3 2 3 3 3 - 2 - 3 3 2 3

CO3 3 2 3 - 3 3 - - 3 3 2 3

CO4 3 2 3 - - 2 2 - 3 3 2 3

CO5 3 2 3 3 3 - 2 2 2 3 3 3

CO6 3 2 3 3 3 1 3 3 3 3 3 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 499, Industrial Internship-III

School: SET Batch : 2018-2022

Program:B.Tech Current Academic Year:
Branch: CSE Semester:VII
1 Course CSP499 Course Name
Code
2 Course Title Industrial Internship-III
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course UG
Status
5 Course 1. Get hands-on experience about real world problems in a field
Objective relevant to their major of studies.
2. Acquire confidence for employment after graduation.
3. Acquire skills important for time management, discipline,
selflearning
4. Effective communication and so on. Learn practically about
team-work, collaboration, and leadership.
6 Course CO1: Arrive at work as scheduled, ready to work, and stay for the agreed
Outcomes upon time
CO2: Present yourself in a professional manner at all times, including
being appropriately dressed for your workplace
CO 3: Communicate any concerns with your supervisor and the

Prepared by :iGAPPage 126

 internship coordinator in a timely manner and respectfully
CO 4: Demonstrate enthusiasm and interest in what you are doing; ask
questions and take initiative as appropriate.
CO 5. Exposure to professional and ethical responsibility
7 Course The Internship aims to offer students the opportunity to apply
Description their knowledge in real-life environments through an industry
placement for eight-weeks. It is expected that the skills students
will gain from working with an organization will help them perform
better on their jobs after graduation. In addition, the Internship
greatly increases the chances for students to obtain full time
employment after graduation.
8 Outline syllabus CO Mapping
Unit 1 Define objectives and conditions for the CO1
internship, ensuring students that it is related
to the study path carried out at the University.
Specify the names of the university supervisor,
the Host Organization supervisor and the
duration, the period in which the internship will
be carried out and any changes in duration
Unit 2 The internship work plan is drawn up in CO2
consultation with the student, the supervising
faculty at the university and the internship
supervisor for the organisation offering the
internship.
Unit 3 Project during Internship involves: a) project CO3,CO6
activated by the Program Director / Host
Organization. b) Project activity to be
monitored by faculty members at the
University. This activity must guarantee
continuous presence and continuity to
activities related to project.
Unit 4 Submission of evaluation form and final report CO3,CO4
completed by the intern.
Unit 5 Final evaluation form completed by the CO4,CO5
supervisor at the Host Organization and final
presentation before departmental committee.
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 60% NIL 40%
Text book/s* NA
Other
NA
References

Prepared by :iGAPPage 127

 CO and PO Mapping
S. No. Course Outcome Program Outcomes
(PO) & Program
Specific Outcomes
(PSO)
1. CO1: Arrive at work as scheduled, ready to work, PO1, PO2, PO12,
and stay for the agreed upon time. PSO4
2. CO2: Present yourself in a professional manner at PO1, PO12, PSO1,
all times, including being appropriately dressed for PSO4
your workplace
3. CO 3: Communicate any concerns with your PO1, PO2, PO12,
supervisor and the internship coordinator in a PSO2, PSO4
timely manner and respectfully
4. CO 4: Demonstrate enthusiasm and interest in PO1, PO12, PSO2,
what you are doing; ask questions and take PSO4
initiative as appropriate.
17. CO 5. Exposure to professional and ethical PO1, PO6, PO8, PO12,
responsibility PSO2, PSO4

PO and PSO mapping with level of strength for Industrial Internship-III(Course Code
CSP 499)

Cos PO1 P PO PO PO5 P PO PO8 PO9 PO P PO P PSO PSO PS PS

O 3 4 O 7 10 O 12 S 2 3 O4 O5
2 6 1 O
1 1
CO1 3 2 - - - - - - - - - 3 3 - - 3 -
CO2 3 2 - - - - - - - - - 3 - 3 - 2 -
CO3 3 2 - - - - - - - - - 3 - 2 - 3 -
CO4 3 - - - - - - - - - - 3 - 3 - 2 -
CO5 3 - - - - 2 - 2 - - - 3 - 3 - 3 -
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: ARP 401, Problem Solving Creative Thinking and Leadership

Skills

School: SET Batch : 2018-22

Prepared by :iGAPPage 128

 Program: Current Academic Year: 2018-19
Branch: CSE Semester: VIIth |PSC
Course Name Problem Solving Creative Thinking and
1 Course Code ARC 401
Leadership Skills
2 Course Title Problem Solving Creative Thinking and Leadership Skills
3 Credits 1
Contact
4 Hours 0-0-2
(L-T-P)
Course
Status
To enhance holistic development of students and improve their employability
skills. Provide a 360 degree exposure to learning elements of Business
English readiness program, behavioural traits, achieve softer communication
Course levels and a positive self-branding along with augmenting numerical and
5
Objective altitudinal abilities. To up skill and upgrade students’ across varied industry
needs to enhance employability skills. By the end of this semester, a will have
entered the last threshold of his/her employability enhancement and skill
building activity exercise.
CO1: Inculcate Innovative & Critical Thinking abilities | Problem Solving attitude
Course CO2:Team Building & Team Synergy | Ownership | Accountability | Trust
6 CO3: Time Management | Leadership skills | Verbal Abilities-5
Outcomes
CO4: Level-5 of quant , aptitude and reasoning abilities
This is the final level of the program where in a student is now a step away
from full readiness to step out and greet the world. This semester equips
Course
7 students with Innovative & Critical Thinking abilities, Problem Solving
Description attitude,Team Building, Team Synergy,Ownership, Accountability, Trust,
Time Management, Leadership skills and Verbal Abilities-5
8 Outline syllabus – ARC 401
CO
Unit 1 Campus to Corporate
MAPPING
A Innovative & Critical Thinking | Problem Solving CO1
B Team Building & Team Synergy | Ownership | Accountability | Trust CO2
C Time Management | Leadership skills | Verbal Abilities-5 CO3
Unit 2 Introduction to APTITUDE TRAINING- Reasoning- Logical/ Analytical
A Puzzles | Linear Arrangement & Circular | AMCAT Practice Paper Exercise Kit CO4
B E- Litmus Practice Paper Kit CO4
C C- Cube Practice Test CO4
Unit 3 Quantitative Aptitude
A AMCAT Practice Paper Exercise Kit CO4
B E- Litmus Practice Paper Kit CO4
C C- Cube Practice Test CO4
Weightage ( CA )Class Assignment/Free Speech Exercises / JAM – 60% | (ETE) Group
Distribution Presentations/Mock Interviews/GD/ Reasoning, Quant & Aptitude – 40%
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – ArihantPublications | Quicker Maths- M. Tyra |
Text Power of Positive Action (English, Paperback, Napoleon Hill) | Streets of Attitude (English, Paperback, Cary
book/s* Fagan, Elizabeth Wilson) The 6 Pillars of self-esteem and awareness – Nathaniel Brandon | Goal
Setting (English, Paperback, Wilson Dobson

Prepared by :iGAPPage 129

Syllabus: CSE 460, Mobile Computing (-4)

School: SET Batch : 2018

Program: B.Tech Current Academic Year:
Branch:CSE Semester:VII
1 Course CSE460 Course Name
Code
2 Course Mobile Computing
Title
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course ELECTIVE
Status
5 Course
Objective The objective of the course is to impart knowledge of mobile and
wireless computing systems and techniques.
6 Course Students will be able to:
Outcomes CO1. Understand the basic concepts and principles in mobile
computing.
CO2.Analyze the structure and components for mobile IP and
mobility Management.
CO3. Develop algorithms for allocation estimations based on
different positioning techniques and platforms.
CO4. Design and develop mobile applications.
7 Course This course will give you an understanding of mobile computer
Description systems particularly in the context of wireless network systems
such as 2G/3G/4G mobile telephony, data networks, and other
wireless networks and infrastructure.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Wireless transmission , Frequencies for radio CO1, CO2
transmission
B Signals , Antennas , Signal Propagation , CO1, CO2
Multiplexing, Modulations
C Spread spectrum, MAC, SDMA , FDMA , TDMA , CO1, CO2
CDMA , Cellular Wireless Networks
Unit 2 Telecommunication Networks

Prepared by :iGAPPage 130

 A GSM: Mobile services, System architecture, Radio CO1,CO2,CO4
interface, Protocols
B Localization and calling, Handover, Security CO1,CO2,CO4
C General Packet Radio Service (GPRS): GPRS CO1,CO2,CO4
Architecture, GPRS network nodes,
Unit 3 Wireless LANs
A Introduction to IEEE 802.11b/g/n CO1,CO2,CO3
B Bluetooth technologies and architecture. CO1,CO2,CO3
C HIPERLAN, WML programming CO4,CO2
Unit 4 Mobile Network Layer
A Mobile IP Goals, Entities, IP packet Delivery Agent CO1,CO2
Advertisement and Discovery, Registration.
B Hidden and exposed terminal problems ,Routing CO1,CO2
protocols classification
C DSDV, DSR, AODV , Security CO1,CO2,CO3
Unit 5 Mobile Transport Layer & Wireless Application
Protocol
A Traditional TCP, Indirect TCP, CO1,CO2,CO4
B Snooping TCP, Mobile TCP CO1,CO2,CO4
C WAP: Protocols, Architecture CO1,CO2,CO4
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text 1.JochenSchiller : Mobile Communication,
book/s* Pearson Education.
Other 1.U. Hansman and L. Merck : Principles of Mobile
References Computing”, 2nd Ed., Springer.
2. D. Milojicic, F. Douglis. : Mobility Processes,
Computers and Agents”,Addison Wesley.

CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program Specific
Outcomes (PSO)
1. CO1. Understand the basic concepts and principles PO1,PO2,PO3,PO4,PSO1
in mobile computing.
2. CO2.Analyze the structure and components for PO1, PO3, PO4, PSO2
mobile IP and mobility Management.
3. CO3. Develop algorithms for allocation estimations PO1,PO2,PO3,PO4
based on different positioning techniques and
platforms.

4. CO4. Design and develop mobile applications. PO9, PO10,PO11, PSO5

Prepared by :iGAPPage 131

 PO and PSO mapping with level of strength for Course Name Mobile
Computing(Course Code CSE 460)
Cos PO1 P PO PO PO5 P PO PO PO9 PO P PO P PSO PSO PS PS
O 3 4 O 7 8 10 O 12 S 2 3 O4 O5
2 6 1 O
1 1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2
CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2
CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1
CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

Syllabus: CSE 459, Software Testing(-4)

School: SET Batch : 2018-22
Program:B.Tech Current Academic Year:
Branch:CSE/IT Semester:VII
1 Course Code CSE459 Course Name
2 Course Title Software Testing
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course ELECTIVE
Status
5 Course The primary objective of this course is to introduce and instruct
Objective software testing and Quality assurance concepts, strategies, and
techniques in order to develop a total understanding of the testing
process and how it impacts the software project.
6 Course Students will be able to:
Outcomes CO1: Perform functional and non-functional testing
CO2: Design test case and make test case report
CO3:Locate bugs and analyze their impact
CO4:Perform control flow and data flow testing
CO5:Memorize how to effectively plan your tests, communicate the
bugs you find, and measure your success as a software tester
CO6:Assess various test automation tools available in market and
choose appropriate tool for kinds of testing
7 Course This course will examine fundamental software testing and related
Description program analysis techniques. In particular, the important phases of
testing will be reviewed, emphasizing the significance of each phase
when testing different types of software. The course will also include
concepts such as test generation, test coverage, regression testing,
mutation testing, program analysis (e.g., program-flow and data-flow
analysis), and test prioritization.
8 Outline syllabus CO Mapping

Prepared by :iGAPPage 132

 Unit 1 Introduction
A Human and errors, Testing Objectives, Principles CO1, CO2
of Testing, Behaviour and Correctness,
Debugging and its techniques
B Software metrics, Software Testing Life Cycle, CO1, CO2
Testing activities and Levels, Testing myths and
facts
C Testing exit criteria, Bug defect life cycle, White CO1, CO2, CO6
Box and Black Box Testing
Unit 2 Unit Testing
A Concept of Unit Testing, Static Unit Testing, CO1, CO2,CO4
Defect Prevention, Dynamic Unit Testing,
Mutation Testing
B Control Flow Testing: Overview of Control Flow CO1, CO2,CO4
Testing, Control Flow Graph, Paths in a Control
Flow Graph
C Path Selection Criteria, Regression testing , Agile CO1, CO2,CO4
testing
Unit 3 Data Flow & Performance testing
A Data Flow Anomaly, Overview of Dynamic Data CO1,CO2,CO3
Flow Testing, Data Flow Graph, Data Flow Terms
B Data Flow Testing Criteria, Comparison of Data CO1,CO2,CO3
Flow Test Selection Criteria, Feasible Paths and
Test Selection Criteria
C Integration Testing: Integration Testing, CO4, CO6
Integration Techniques , Performance testing:
Stress , Load , Volume
Unit 4 Functional Testing
A Equivalence Class Partitioning, Boundary Value CO1,CO2,CO3
Analysis, Decision Tables, Random Testing, Error
Guessing, Category Partition
B Test case designing – Test cases, Test case CO1,CO2,CO3
format, Test case designing, Acceptance testing
and criteria
C Automation testing: Need for automation , CO1,CO2,CO3
categorization of Testing tools, Selection of
testing tools, Guidelines for automated testing
Unit 5 Controlling and Monitoring
A Test metrics and measurements –project, CO1,CO2,CO3,CO6
progress and productivity metrics – Status
Meetings – Reports and Control Issues – Criteria
for Test Completion – SCM
B Types ofreviews – Developing a review program CO1,CO2,CO3
– Components of Review Plans– Reporting
C Review Results. – evaluating software quality – CO1,CO2,CO3,CO6
defect prevention – testing maturitymodel
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%

Prepared by :iGAPPage 133

 Text book/s* 1. SagarNaik&PiyuTripathy, “Software Testing
and Quality Assurance: Theory and Practice”,
Wiley.
Other 1.Naresh Chauhan, “Software Testing : Principles
References and practices”, Oxford university press
2.Boris Beizer, “Software Testing Techniques”,
Dreamtech Press
3.K.K. Aggrawal and Yogesh Singh, “ Software
Engineering” New Age International Publication

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No. & Program Specific
Outcomes (PSO)
1. CO1:Perform functional and non-functional testing PO1,PO2,PO3,PO4,PSO1
2. CO2:Design test case and make test case report PO1, PO3, PO4, PSO2
3. CO3:Locate bugs and analyze their impact PO1,PO2,PO3,PO4
4. CO4: Perform control flow and data flow testing PO9, PO10,PO11, PSO5
5. CO5: Memorize how to effectively plan your tests, PO1,PO2,PO3,PO4
communicate the bugs you find, and measure your
success as a software tester.

6. CO6:Assess various test automation tools available in PO1, PO3, PO4, PSO2
market and choose appropriate tool for kinds of testing

PO and PSO mapping with level of strength for Course Name Software Testing(Course Code
CSE 459)

Cos PO1 P PO PO PO5 P PO PO PO9 PO P PO P PSO PSO PS PS

O 3 4 O 7 8 10 O 12 S 2 3 O4 O5
2 6 1 O
1 1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

CO5 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO6 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Prepared by :iGAPPage 134

Syllabus: CSP 498, Major Project - 2

School: SET Batch : 2018 – 2022

Program: B.Tech Current Academic Year: 2018-2019
Branch: CSE / IT Semester: 3rd
1 Course Code CSP498 Course Name: Major Project -2
2 Course Title Major Project -2
3 Credits 9
4 Contact Hours 0-0-18
(L-T-P)
Course Status Compulsory
5 Course Objective 1. To understand the concept of project design
after the completion of project planning
2. Students making decisions within a framework
3. Continuous evaluation of the project
4. A final product to be evaluated for quality

6 Course Outcomes Students will be able to:

CO1: To identify the test procedure for each
implemented module
CO2: To perform testing using test techniques
associated with the white box and black box test-
approach methods
CO3: To deploy and justify the project after successful
testing
CO4: Use different tools forcommunication, testing
andreport writing.
CO5:Enhancing the technical skill and report writing.
CO6: To provide a goodtraining for the students in R&D
work and technical leadership.
7 Course Description The objective of Major Project-II is to enable the
student to extend further the development of project
till testing and deployment under the guidance of a
Supervisor.
8 Outline syllabus CO
Mapping
Unit 1 Testing of the modules, Use of appropriate CO1, CO2
tools/techniques for testing
Unit 2 Deploy & demonstrate developed modules of the CO1,
project CO2, CO3
Unit 3 Preparing a Project Report in the standard format for CO4,
being evaluated by the Supervisor CO5, CO6
Unit 4 Submission of Project and Report to Departmental CO4,

Prepared by :iGAPPage 135

 Committee CO5, CO6
Unit 5 Final Presentation before Departmental Committee CO6

Mode of Theory
examination
Weightage CA MTE ETE
Distribution 60% NA 40%
Text
book/s*
Other
References

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No.
1. CO1: To start the actual implementation of PO1, PO2, PO3, PO4, PO5,
the project work to produce the deliverables. PO8, PO9, PO10, PO11,
To design and implementsolutions to open- PO12
endedproblem/project.
2. CO2: To identify the test procedure for each PO1, PO2, PO4, PO7, PO9,
implemented module PO10, PO11, PO12
3. CO3: To perform testing using test PO1, PO2, PO3, PO6, PO5,
techniques associated with the white box and PO9, PO10, PO11, PO12
black box test-approach methods
4. CO4: To deploy and justify the project after PO1, PO2, PO3, PO6, PO7,
successful testing PO9, PO10, PO11, PO12
5. CO5:Use different tools forcommunication, PO1, PO2, PO3, PO4, PO5,
design,implementation, testing andreport PO7, PO9, PO10, PO11,
writing. PO12
6. CO6: To provide a goodtraining for the PO1, PO2, PO3, PO4, PO5,
students in R&D work and technical PO6, PO7, PO8, PO9, PO10,
leadership. PO11, PO12

PO and PSO mapping with level of strength for Course Name Major Project -2 (Course
Code CSP498)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 3 3 - - 2 3 3 2 3
CO2 3 2 3 3 3 - 2 - 3 3 2 3
CO3 3 2 3 - 3 3 - - 3 3 2 3
CO4 3 2 3 - - 2 2 - 3 3 2 3
CO5 3 2 3 3 3 - 2 2 2 3 3 3

Prepared by :iGAPPage 136

CO6 3 2 3 3 3 1 2 2 2 3 3 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 454(-5)

School: Batch : 2018-22
Program: B.Tech Current Academic Year:
Branch:CSE Semester:VIII
1 Course Code CSE454 Course Name
2 Course Title Wireless Networks
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course UG
Status
5 Course
Objective The objective of this course is to enable students to understand the
basic concepts of wireless networks specially MANETs and Sensor
networks and apply these concepts for designing, evaluating and
comparing wireless networks.
6 Course Students will be able to:
Outcomes CO1: Differentiate between various types of wireless networks.
CO2: Compare various MAC and routing protocols in sensor networks.
CO3: Analyze energy management issue in MANETs.
CO4: Establish a sensor networks.

7 Course Overview of wireless network architectures including cellular networks,

Description local area networks, multi-hop wireless networks such as ad hoc
networks, mesh networks, and sensor networks; capacity of wireless
networks; medium access control, routing protocols, and transport
protocols for wireless networks; mechanisms to improve performance
and security in wireless networks; energy-efficient protocols for sensor
networks.
8 Outline syllabus CO Mapping
Unit 1 FUNDAMENTAL OF WIRELESS NETWORKS
A Basic Networking Concepts CO1, CO2
B Wireless LANs and PANs: Bluetooth, 802.11, and CO1, CO2
Hiper LAN
C Wireless internet, mobile ip (wi-fi routers) CO1, CO2,CO3
Unit 2 INTRODUCTION TO MANETs
A Overview of MANETs CO1, CO2,CO4
B Cellular vs. Ad-hoc networks, issues and challenges CO1, CO2,CO4
C MAC protocols for ad-hoc networks CO1, CO2,CO4
Unit 3 CHALLENGES IN MANETs
A Routing protocols for ad-hoc networks, DSR/AODV CO1,CO2,CO3

Prepared by :iGAPPage 137

 etc. (NS2)
B Transport protocols for ad-hoc networks CO1,CO2,CO3
C Energy Management in Ad-Hoc Wireless Networks CO2,CO4
Unit 4 SENSOR NETWORKS
A Introduction, Applications and Issues CO1,CO2,CO3
B Networking Sensors, MAC protocols and Routing CO1,CO2,CO3
protocols
C Infrastructure Establishment Issues CO1,CO2,CO3
Unit 5 CHALLENGES IN SENSOR NETWORKS
A Tasking and control in sensor networks CO1,CO2,CO4
B Sensor network plat forms and tools, emerging trends CO1,CO2,CO4
in sensor networks (SENSE)
C Establishing sensor network using Zigbee, CO1,CO2,CO4
Mode of Enabling Technologies For Wireless Sensor
examination Networks.
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* 1.Ad Hoc Wireless Networks: Architectures and
Protocols. C. Siva Ram Murthy, Prentice Hall PTR.

Other 1.Wireless Sensor Networks: An Information

References Processing Approach, Feng Zhao and Leonidas
Guibas, Publisher: Morgan Kaufmann.
2. Ad-hoc networks and sensor networks: Theory and
Applications, D.D. Marios, D.P. Agarwal World
Scientific.

CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No. & Program Specific
Outcomes (PSO)
1. CO1: Differentiate between various types of wireless PO1,PO2,PO3,PO4,PSO1
networks
2. CO2: Compare various MAC and routing protocols in PO1, PO3, PO4, PSO2
sensor networks.

3. CO3: Analyze energy management issue in MANETs PO1,PO2,PO3,PO4

4. CO4: Establish a sensor networks. PO9, PO10,PO11, PSO5

PO and PSO mapping with level of strength for Course Name Wireless Networks (Course Code
CSE 454)
Cos PO1 P PO PO PO5 P PO PO PO9 PO P PO P PSO PSO PS PS
O 3 4 O 7 8 10 O 12 S 2 3 O4 O5
2 6 1 O
1 1
CO1 3 3 3 3 -- -- -- 2 2 1 2 1 3 2 2 1 2

CO2 3 2 3 3 -- -- -- 2 2 2 1 1 2 3 2 1 2

Prepared by :iGAPPage 138

CO3 3 3 3 3 -- -- -- 1 1 1 3 2 3 2 1 1 1

CO4 2 2 2 2 1 -- -- 2 3 3 3 1 2 2 2 1 3

1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSA403, Digital Image Processing (-5)

School: SET Batch : 2018-2022

Program: B-TECH Current Academic Year:
Branch: CSE Semester: VIII
1 Course Code CSA 403 Course Name: Digital Image Processing
2 Course Title Digital Image Processing
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status UG
5 Course Students will try to learn:
Objective 18.To study the image fundamentals and mathematical
transforms necessary for image processing.
19. To study the image enhancement techniques
20. To study image restoration procedures.
21. To study the image compression procedures
6 Course Students will be able to:
Outcomes CO-1. Recognize the fundamental concepts of a digital
image processing system.
CO-2. Formulate images in the frequency domain using
various transformations.
CO-3. Perform operations for image enhancement and
image restoration.
CO-4. Interpret image segmentation and representation
techniques.
CO-5. Design Image application for recognitions.
CO-6. Support Computer Vision techniques in intelligent
systems.
7 Course Basic concepts of Digital Image Processing
Description
8 Outline syllabus CO Mapping
Unit 1 Introduction
A Fundamental of digital image processing: CO1,
B Image Enhancement in Spatial Domain CO1
C Arithmetic/Logic Operations in Image CO1
enhancement
Unit 2 Image Enhancement in Frequency Domain
A Fourier Transform Filters – CO2

Prepared by :iGAPPage 139

 B Low-pass filter in frequency domain CO2
C High-pass filter in frequency domain CO2
Unit 3 Image Restoration & segmentation
A Restoration Process model. CO3
B Segmentation and Region Extraction, CO3
C Edge Detection and Corner Detection. CO3
Unit 4 Color Image Processing
A Color Models, Color Transformation CO4
B Morphological Image Processing CO4
C Morphological Operations CO4
Unit 5 Application of Digital Image Processing
A Face Recognition CO5 ,CO6
B Optical character recognition CO5,CO6
C Computer vision CO5,CO6
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 30% 20% 50%
Text book/s* 1. Digital Image Processing 2nd Edition, Rafael C.
Gonzalvez and Richard E. Woods. Published by: Pearson
Education.
Other 1. Digital Image Processing and Computer Vision, R.J.
References Schalkoff. Published by: John Wiley and Sons, NY.

2. Fundamentals of Digital Image Processing, A.K. Jain.

Published by Prentice Hall, Upper Saddle River, NJ.

CO and PO Mapping
S. Course Outcome Program Outcomes (PO) &
No. Program Specific Outcomes
(PSO)
1. CO-1. Recognize the fundamental PO1,PO2,PO3,PO11,PO12
concepts of a digital image PSO1,PSO2,PSO3,PSO4,SPO5
processing system.
2. CO-2. Formulate images in the frequency PO1,PO2,PO3,PO11,PO12
domain using various PSO1,PSO2,PSO3,PSO4,SPO5
transformations.
3. CO-3. Perform operations for image PO1,PO2,PO3,PO11,PO12
enhancement and image PSO1,PSO2,PSO3,PSO4,SPO5
restoration.
4. CO-4. Interpret image segmentation and PO1,PO2,PO3,PO11,PO12
representation techniques. PSO1,PSO2,PSO3,PSO4,SPO5

Prepared by :iGAPPage 140

 5. CO-5. Design Image application for PO1,PO2,PO3,PO11,PO12
recognitions. PSO1,PSO2,PSO3,PSO4,SPO5
6. CO-6. Support Computer Vision PO1,PO2,PO3,PO11,PO12
techniques in intelligent systems. PSO1,PSO2,PSO3,PSO4,SPO5

PO and PSO mapping with level of strength for Course Name Digital Image
Processing(CSA 403)

COs PO PO PO PO P PO PO PO PO PO P P PS PS PSO PS PS
1 2 3 4 O5 6 7 8 9 10 O1 O1 O1 O2 3 O4 O5
1 2
CO1 3 2 3 - - - - - - - 2 1 3 2 2 1 2
CO2 3 2 3 - - - - - - - 2 1 3 2 2 1 2
CO3 3 2 3 - - - - - - - 1 1 2 3 2 1 2
CO4 3 2 3 - - - - - - - 3 2 3 2 1 1 1
CO5 3 2 3 - - - - - - - 3 1 2 2 2 1 3
CO6 3 2 3 - - - - - - - 3 1 2 2 2 1 3
1-Slight (Low) 2-Moderate (Medium) 3-Substantial (High)

Syllabus: CSE 456, Distributed System Concepts & Design (-6)

School: SET Batch : 2018-22

Program: B.Tech Current Academic Year: 2018-19
Branch: CSE Semester: VIII
1 Course CSE456 Course Name
Code
2 Course Title Distributed System Concepts & Design
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course ELECTIVE
Status
5 Course The course aims to provide an understanding of the principles on which
Objective the distributed systems are based; their architecture, algorithms and
how they meet the demands of contemporary distributed applications.

Prepared by :iGAPPage 141

 The course covers the building blocks for a study of distributed
systems, and addressing the characteristics and the challenges that
must be addressed in their design: scalability, heterogeneity, security
and failure handling being the most significant.
6 Course CO1: Understand the basic elements and concepts related to distributed
Outcomes system technologies
CO2: Acquire knowledge of the core architectural aspects of distributed
systems
CO 3: Design and implement distributed applications
CO 4:Distinguish the main underlying components of distributed
systems and centralized system
CO 5: Use and apply important security algorithms in distributed
systems
7 Course This course covers issues and solutions related to the design and the
Description implementation of distributed algorithms for different issues of
distributed system.
8 Outline syllabus CO Mapping
Unit 1 Characterization of Distributed Systems
A Introduction, Examples of distributed Systems CO1
B Resource sharing and the Web Challenges. CO2
C System Models: Architectural models, Fundamental CO2
Models
Unit 2 Theoretical Foundation for Distributed System
A Limitation of Distributed system: Absence of global CO2, CO3
clock, shared memory
B Logical clocks; Lamport’s logical clock, vector logical CO2, CO3
clocks
C Causal ordering of messages. Termination detection. CO2, CO3
Unit 3 Distributed Mutual Exclusion
A Classification of distributed mutual exclusion, CO3, CO4
requirement of mutual exclusion theorem
B Token based Mutual exclusion algorithms, Non token CO3, CO4
based Mutual exclusion algorithms
C Performance metric for distributed mutual exclusion CO3, CO4
algorithms
Unit 4 Distributed Deadlock Detection
A System model, resource vs. communication CO3, CO4
deadlocks
B Deadlock prevention, avoidance, detection & CO3, CO4
resolution, centralized dead lock detection,
C distributed dead lock detection: Path pushing CO3, CO4
algorithms, edge chasing algorithms.
Unit 5 Data Security & Case Study
A Introduction , A Model of Cryptography, Private key Co1,CO3, CO4
cryptography

Prepared by :iGAPPage 142

 B Public key cryptography, Authentication in Distributed CO1, CO3, CO4
System
C Case study: The Kerberos System. CO1, CO3, CO4
Mode of Theory
examination
Weightage CA MTE
Distribution
30% 20%
Text 1.Coulouris et al, Distributed System: Concepts and
book/s* Design, Pearson Education
Other 1. Singhal & Shivaratri, Advanced Concept in Operating
References Systems, Tata McGraw Hill.
2. Tanenbaum A S, Distributed System, Prentice Hall India
3.Stallings, W, Cryptography and Network Security, 4th
Edition, Prentice hall India

CO and PO Mapping
S. Course Outcome Program Outcomes
No. (PO) & Program
Specific Outcomes
(PSO)
1. Understand the basic elements and concepts PO1, PO2, PSO1, PSO3
related to distributed system technologies
2. Acquire knowledge of the core architectural PO1,PO2, PO3, PO4,
aspects of distributed systems PO9, PSO1, PSO2,
PSO3
3. Design and implement distributed applications PO1, PO2, PO9, PSO1,
PSO2, PSO3
4. Distinguish the main underlying components of PO1, PO2, PO9,
distributed systems and centralized system PSO1,PSO2, PSO3

5. Use and apply important security algorithms in PO1, PO2, PO9,

distributed systems PSO1,PSO2, PSO3

Prepared by :iGAPPage 143

PO and PSO mapping with level of strength for Course Name Distributed System
Concepts & Design (Course Code CSE 456)

Cou P P P P P P
rse P P P P P P P P O O O S S S
Course Name
Cod O PO O O O O O O O 1 1 1 O O O
e 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
Distributed System
Concepts & Design
CO1 2 1 2 1
CSE CO2 2 1 2 3 1
456 CO3 3 3 2 3 3
CO4 3 3 2 3 3 3
CO5 1 3 3 3 1 2 3 3 2

Prepared by :iGAPPage 144