CCCT DCST FINAL_2023_230710_104219_230710_104440

STATE BOARD OF TECHNICAL EDUCATION
EDUCATION DEPARTMENT
GOVERNMENT OF SIKKIM
TASHILING, GANGTOK, EAST SIKKIM
STATE BOARD OF TECHNICAL EDUCATION

EDUCATION DEPARTMENT
GOVERNMENT OF SIKKIM, GANGTOK
Page 1 of 95
ACKNOWLEDGEMENT
The development of an outcome based Model Curriculum for Diploma courses in Engineering
& Technology is a result of thoughtful deliberations at various stages of dedicated and
specialized experts. This model curriculum has been framed to meet the expectations of an
academically challenging environment, develop problem solving skills by students, align with
current standards and to enrich the students learning to make them self-enablers and match
job requirements on successful completion of their courses.
I wish to acknowledge all the esteemed experts who have been involved in the process of
developing this outcome based model curriculum for the “Diploma in Computer Science and
Technology ” to be adopted in the polytechnics of Sikkim.
I, the undersigned, do hereby authenticate the syllabus revision of Diploma in Computer

Science and Technology from the academic year of 2022-2023 until further notice.
Place: ______________________
Date: ______________________
Director,
State Board of Technical Education,
Education Department,
Government of Sikkim, Gangtok
Page 2 of 95
Definition of Credit:
1 Hr. Lecture (L) per week 1 credit
1 Hr. Tutorial (T) per week 1 credit
1 Hr. Practical (P) per week 0.5 credit
2 Hours Practical (P) per week 1 credit
Course code and definition:
Course code Definitions
L Lecture
T Tutorial
P Practical
HS Humanities & Social Sciences Courses
BS Basic Science Courses
ES Engineering Science Courses
PC Program Core Courses
PE Program Elective Courses
OE Open Elective Courses
AU Audit Courses
SI Summer Internship
PR Project
SE Seminar
Page 3 of 95
List of Programme Core Courses (PC)
Hours per Week Credits

SN Course Code Semester
Course Title L T P (L+T+P)
1 COPC201 Computer Programming 2 0 0 2 III
Scripting Languages (Python,

2 COPC203 Perl, etc – anyone) 2 0 0 2 III
3 COPC205 Data Structures 2 0 0 2 III
4 COPC207 Computer System Organisation 3 1 0 4 III
5 COPC209 Algorithms 3 1 0 4 III
Computer Programming
6 COPC211 Lab 0 0 4 2 III
7 COPC213 Scripting Languages Lab 0 0 4 2 III
8 COPC215 Data Structures Lab 0 0 2 1 III
9 COPC202 Operating Systems 2 0 0 2 IV
10 COPC204 Introduction to DBMS 2 0 0 2 IV
11 COPC206 Computer Networks 2 0 0 2 IV
12 COPC208 SSAD/Software Engineering 3 0 0 3 IV
13 COPC210 Web Technologies 2 0 0 2 IV
14 COPC212 Operating Systems Lab 0 0 2 1 IV
Introduction to DBMS Lab

15 COPC214 0 0 2 1 IV
16 COPC216 Computer Networks Lab 0 0 2 1 IV
17 COPC218 Web Technologies Lab 0 0 2 1 IV
18 COPC301 Introduction to e-Governance 2 1 0 3 V
19 COPC303 IoT 2 1 0 3 V
Total 27 4 18 40
Page 4 of 95
List of Program Elective Courses (PE)
Hours per Week Credits

Sl.
Course Code Course Title
No.
L T P (L+T+P)
1 COPE301/302 Mobile Computing 3 0 2 4
2 COPE303/304 Multimedia Technologies 3 0 2 4
3 COPE305/306 Fundamentals of AI 3 1 0 4
4 COPE307/308 Advance Computer Networks 3 0 2 4
5 COPE309/310 Information Security 3 0 2 4
6 COPE311/312 Network Forensics 3 0 2 4
Data Sciences: Data Warehousing and

7 COPE313/314 Data Mining 3 1 2 4
FOSS (Free and Open-Source Software)

8 COPE315/316 3 0 2 4
9 COPE317/318 Software Testing 3 0 2 4
Total 27 2 16 36
Page 5 of 95
List of Open Elective Courses (OE)
Hours per week Credits

SN Code No. Course Title
L T P
1 **OE### Economic Policies in India 3 0 0 3
2 **OE### Artificial Intelligence & Machine Learning 3 0 0 3
3 **OE### Soft Computing Techniques 3 0 0 3
4 **OE### Project Management 3 0 0 3
5 **OE### Renewable Energy Technologies 3 0 0 3
6 **OE### Energy Conservation & Audit 3 0 0 3
7 **OE### Product Design 3 0 0 3
8 **OE### Engineering Economics & Accountancy 3 0 0 3
9 **OE### Operations Research 3 0 0 3
10 **OE### Renewable Energy Technologies 3 0 0 3
11 **OE### Energy Efficiency and Audit 3 0 0 3
**OE### Web Designing and Multimedia

12 Technology 3 0 0 3
13 **OE### History of Science and Engineering 3 0 0 3
14 **OE### Internet of Things 3 0 0 3
15 **OE### Professional Orientation 3 0 0 3
16 **OE### Disaster Management 3 0 0 3
17 **OE### Sustainable Development 3 0 0 3
18 **OE### Smart Systems 3 0 0 3
19 **OE### Robotics 3 0 0 3
20 **OE### Introduction to E-Governance 3 0 0 3
21 **OE### Cyber Security Laws, Standards and IPR 3 0 0 3
22 **OE### Organic and Natural Farming Practices 3 0 0 3
23 **OE### Classical Text Reading 3 0 0 3
24 **OE### 3-D Printing 3 0 0 3
25 **OE### Virtual Reality 3 0 0 3
26 **OE### Mechatronics 3 0 0 3
27 **OE### Artificial Intelligence 3 0 0 3
Page 6 of 95
HUMANITIES & SOCIAL SCIENCES COURSES (HS)
Sl. Hours per week
No Code No. Course Title Semester Credits
L T P
1 HS101 Communication Skills in English 2 0 0 I 2
2 HS103 Sports and Yoga 0 0 2 I 1
3 HS105 Communication Skills in English Lab 0 0 2 I 1
4 HS302 Entrepreneurship and Start-ups 3 1 0 VI 4
Total Credits 8
AUDIT COURSES (AU)
Hours per week

Sl. No Code No. Course Title Semester Credits
L T P
1 AU102 Environmental Science 2 0 0 II 0

Essence of Indian Knowledge and
2 AU202 Tradition 2 0 0 IV 0
3 AU302 Indian Constitution 2 0 0 VI 0

Total Credits 0
PROJECT WORK, SEMINAR AND INTERNSHIP IN INDUSTRY OR ELSEWHERE

Sl. Hours per week
No Code No. Course Title Semester Credits
L T P
Summer Internship – I (3-4 weeks) after

1 SI201 2
IInd Sem
Summer Internship – II (4-6 weeks)

2 SI301 3
after IVth Sem
3 PR 202 Minor Project 0 0 4 IV 2

4 0 0 2 V
PR302 Major Project 4
5 0 0 6 VI
6 SE302 Seminar 1 0 0 VI 1
Total Credits 12
Page 7 of 95
SYLLABUS FOR
DIPLOMA IN COMPUTER SCIENCE AND TECHNOLOGY
III SEMESTER
Hours per Contact

COURSE Marks
Sl Course Title week hr. per Credits
CODE
NO L T P week Internal External Total
Computer
COPC201 2 0 0 2 2 40 60 100
1 Programming in C
COPC203 Scripting Languages 2 0 0 2 2 40 60 100

2
COPC205 Introduction to DBMS 2 0 0 2 2 40 60 100

3
Computer System
COPC207 2 1 0 3 3 40 60 100
4 Organization
COPC209 Algorithms 3 1 0 4 4 40 60 100

5
SI201 Summer Internship-1 2 100 100

6
Computer
COPC211 0 0 4 4 2 30 20 50
7 Programming in C Lab
COPC213 Scripting Languages Lab 0 0 4 4 2 30 20 50

8
COPC215 DBMS Lab 0 0 2 2 1 30 20 50

9
Essence of Indian
AU202 Knowledge and 2 0 0 2
10 Tradition
26 20 750
Page 8 of 95
SYLLABUS OF COMPUTER PROGRAMMING IN C 2 HRS/WEEK AND 15 CYCLES PER SEMESTER
Subject Title: COMPUTER PROGRAMMING Credit: 02
Subject Code: COPC201 Semester: SECOND
Lecture Hrs. / week: 02 Hrs. Tutorials Hrs. / week: 0

Practical Hrs. / week: 02 Hrs. Total Hrs. / semester: 30 Hrs.
End semester Assessment Progressive Assessment
Theory: 60 Marks. Theory: 40 Marks.
RATIONALE/AIM: The course covers the basics of programming and demonstrates fundamental programming
techniques, customs and terms including the most common library functions and the usage of the pre-processor.
This course helps the students in gaining the knowledge to write simple C language applications, mathematical
and engineering problems
COURSE OUTCOME: After successful completion of the course, students will be able to:
1. Write, compile and debug programs in C language.
2. Use different data types in a computer program.
3. Design programs involving decision structures, loops, arrays and functions.
4. Identify the difference between call by value and call by reference
5. Use pointers to understand the dynamics of memory
6. Create and perform different file operations.
SUBJECT CONTENTS
UNIT TOPICS / EXPERIMENTS TIME MARKS

ALLOCATED(HRS)
BASICS OF C PROGRAMMING
1.1 Introduction to the C Language.
1.2 Problem solving techniques, Algorithm, Pseudo code, Flow

chart
1. 1.3 C Programs structure & techniques.
1.4 C Tokens, Identifiers, Statements, Data Types, Variables,

Constants, Input / Output.
1.5 Operators, Expressions, Precedence and Associatively,

Expression Evaluation, Type conversions.
2. Decision making and Looping
Page 9 of 95
2.1 Decision Making Structure.
2.2 Repetition statements or Looping constructs.
2.3 Decision and Loop examples
2.4 Introducing Break, continue, go to with Simple C Program

examples.
Introduction to Structured Programming using Functions
3.1 Functions, user defined and inbuilt functions, inter function

3.
communication (call by value, call by reference).
3.2 C programming examples
Array and Pointers
4.1 Arrays– Basic concepts, one-dimensional arrays, two –

dimensional arrays with C programming examples
4.2 Pointers – Introduction (Basic Concepts), pointers to pointers.

4.
4.3 Pointer Applications, Arrays and Pointers, Pointer Arithmetic,
pointers to functions, command –line arguments.
4.4 Introduction to structures and unions, memory allocation

functions.
Introduction to String manipulations and File operations
5.1 Strings – Concepts, C Strings, String Input / Output functions,

basic string manipulation functions, string /data conversion.
5.
5.2 Input and Output – Concept of a file, streams, text files and
binary files, State of a file, Opening and Closing files, file input /
output functions (standard library input / output functions for
files).
Total Hours
Textbooks:
Programming in C. E Balagurusamy
Reference Books:
Let Us C: Yeshwanth Kanitkar
Page 10 of 95
SYLLABUS OF SCRIPTING LANGUAGE 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Scripting Language Credit: 02
Subject Code: COPC203 Semester: THIRD
Lecture Hrs. / Tutorials Hrs. /

week: 02 Hrs. week: 00 Hrs.
Practical Hrs. / Total Hrs. /

week: 00 Hrs. semester: 30 Hrs.
End semester Progressive

Assessment Assessment
RATIONALE/AIM:
Programmers, developers and other related professionals use a variety of tools, including scripting
languages, to create software and systems. Understanding what scripting languages are and the types
that exist can help to become more familiar with programming tools that can make you a better
programmer or improve understanding of how the software use is made.
1: Define and Identify the role of scripting languages.
2: Differentiate and program different data structures and arrays using Python.
3: Write functions and organise projects into modules.
4: Understand the web2py framework.

SUBJECT CONTENTS

ALLOCATED(HRS)
Introduction, Variables and Data Types -
1.1 Need of Python Programming, Applications

Basics of Python Programming, Running
Python Scripts, Variables, Assignment,
Keywords, Input-Output, Indentation.
1.
1.2 Types - Integers, Strings, Booleans;
Operators- Arithmetic Operators, Comparison
(Relational) Operators, Assignment Operators,
Logical Operators, Bitwise Operators.
1.3 Membership Operators, Identity

Operators, Expressions and order of
Page 11 of 95
evaluations Control Flow- if, if-elif-else, for,
while, break, continue, pass.
Data Structure & Control statements
2.1 Lists - Operations, Slicing, Methods;

Tuples, Sets, Dictionaries, Sequences,
Arrays.
2.2 Conditional blocks using if, else and elif

2.
2.3 For loops and iterations, while loops, Loop
manipulation using continue, break and else
(and pass in Python)
2.4 Programming using conditional and loops

block
Functions, Modules and Packages in Python
3.1 Defining Function, Calling Functions,

Passing Arguments, Keyword Arguments,
Default Arguments, Variable-length
arguments.
3.2 Scope of the Variables in a Function -

Global and Local Variables.
3. 3.2 Modules: Creating modules, import
statement, from. Import statement, name
spacing.
3.4 Organizing Python codes using function

and modules
3.5 Importing own module as well as external

modules
3.5 Understanding Packages
File I/O, Text Processing, Regular Expressions
4.1 Understanding read functions
4.2 Understanding write functions

4.
4.3 Programming using file operations
4.4 Powerful pattern matching and searching
4.5 Power of pattern searching using regex
Page 12 of 95
Frameworks
5.1 Frameworks - Web2Py

5.
5.2 Basic Concept on Writing Scripts and
debugging
Total Hours
Textbooks:
1. Taming Python by Programming, Jeeva Jose, Khanna Publishing House

2. Starting Out with Python, Tony Gaddis, Pearson
Reference Books:
1. Core Python Programming, Wesley J. Chun, Prentice Hall

2. Python Programming: Using Problem Solving Approach, Reema Thareja, Oxford University
Page 13 of 95
SYLLABUS OF INTORDUCTION TO DATABASE MANAGEMENT SYTEM(DBMS) 2 HRS/WEEK 15 CYCLES PER
SEMESTER
INTORDUCTION TO DATABASE
Subject Title: MANAGEMENT SYTEM(DBMS) Credit: 02

Lecture Hrs. / week: 02 Hrs. Tutorials Hrs. / week: 00 Hrs.

RATIONALE/AIM: The course Introduction to Database Management System is an important in diploma

programme for Computer Science & Technology. This course is framed keeping in mind the fundamental
knowledge, design and applications in various fields of database management system relevant to the diploma
level
1. Design a database, and database-based applications.

2. Use a DBMS in different field.
3. Handle the critical role of database system in designing several information system-based software systems or
applications.
4. Perform as a database administrator.
5. Implement the database system in any organisation.
SUBJECT CONTENTS

ALLOCATED(HRS)
INTRODUCTION TO BASIC OF DATABASE SYSTEM
1.1 Introduction
1.2 File oriented and Database Approach
1. 1.3 Database System Concepts
1.4 Database Architecture.
1.5 Date Models, Schemas and instances
1.6 Concepts of Client Server Architecture and distributed system
ENTITY-RELATION SHIP
2.1 Introduction of ER
2.
2.2 Data Modeling using the Entity-Relationship Model
2.3 The Enhanced Entity-Relationship (EER) model
2.4 E-R Model concept with examples
Page 14 of 95
RELATIONAL DATABASE MODEL
3.1 The Relational Data Model
3.2 Relational Database Constraints
3. 3.3 ER/EER to Relational Model mapping
3.4 Relational Algebra
3.5 Relational Calculus
Structure Query Language(SQL-99)

4.1 Introduction to SQL programming Techniques
4. 4.2 Schema definition
4.3 Constraints
4.4 Queries and Views
4.5 Securities setting through queries
FUNCTIONAL DEPENDENCIES AND NORMALIZATION
5. 5.1 Functional dependencies in database.
5.2 Normalization for relational databases
5.3 Relational database design algorithm and further dependencies.
Total Hours
Textbooks:
1. Fundamentals of Database Systems, Elmasri & Navathe, Pearson Education

2. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata McGraw-Hill.
3. Introduction to SQL, Rick F.Vander Lans, Pearson Education
Reference Books:
1. Database System Concepts, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, McGraw-Hill, New
Delhi, India.
2. Introduction to Database Systems, C.J.Date, Pearson Education
Page 15 of 95
SYLLABUS OF COMPUTER SYSTEM ORGANISATIO 4 HRS/WEEK 15 CYCLES PER SEMESTER
Computer System
Subject Title: Organisation Credit: 04

Lecture Hrs. / week: 03 Hrs. Tutorials Hrs. / week: 01 Hrs
Practical Hrs. / week: 00 Hrs. Total Hrs. / semester: 60Hrs.

RATIONALE/AIM: Understand the organization of a computer with its various processing units, memory and
peripherals.
1. Understand the basics of computer organization: structure and operation of computers and their peripherals.
2. Understand the concepts of programs as sequences or machine instructions.
3. Expose different ways of communicating with I/O devices and standard I/O interfaces.
4. Describe memory structures.
5. Describe arithmetic and logical operations with integer and floating-point operands.
SUBJECT CONTENTS

ALLOCATED(HRS)
Introduction
1.1 Structure of Computers: Computer Functional units, Von-

Neumann architecture, Bus structures, Basic Operational Concepts,
Data representation (Fixed and Floating point), Error detecting
1. codes.
1.2 Register Transfer and Micro Operations: Register transfer, Bus

and memory transfers, Arithmetic micro-operations.
1.3 Logic micro-operations, Shift micro-operations, and Arithmetic

logic shift unit.
Memory Operations
2. 2.1 Micro Programmed Control: Control memory, Address
sequencing, and design of control unit.
Page 16 of 95
2.2 Computer Arithmetic: Addition and Subtraction, Multiplication
and Division algorithms, Floating-point arithmetic operation.
2.3 Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline Vector

Pro- cessing, Array Processors.
Microprocessors
3.1 Introduction to Microprocessors Architecture: Instruction Set
3. Architecture design principles from programmer’s perspective.
3.2 One example microprocessor (Intel, ARM, etc).
Programming Tools and Techniques

4.1 Assembly Language Programming: Simple programs, Assembly
language programs involving logical, branch and call instructions.
4. 4.2 Sorting, evaluation of arithmetic expressions.
String manipulation
4.3 Assembler directives, procedures and macros.
Memory and Digital Interfacing
5.1 Addressing and address decoding, interfacing RAM, ROM,

5. EPROM, programmable peripheral interface.
5.2 Various modes of operation and interfacing to processor,

interfacing keyboard, displays, etc.
Total Hours
Textbooks:
1. Computer Organization and Architecture 10th Edition - William Stalling
Reference Books:
2. Computer Organization and Architecture by Carl Hamacher
Page 17 of 95
SYLLABUS OF ALGORITHMS 4 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: ALGORITHMS Credit: 04
Lecture Hrs. / week: 03 Hrs. Tutorials Hrs. / week: 01Hrs.

Theory: 60Marks. Theory: 40Marks.
RATIONALE/AIM:
The aim of this course is to prepare the student with the algorithmic foundations of computing. A sound grasp of
algorithms is essential for any computer science engineer. Almost all programming involves algorithms at some
level.
COURSE OUTCOME
On successful completion of the course, the students will be able to:
1. Describe the analysis of algorithm efficiency using different notations

2. Implement various sorting algorithms
3. Identify the performance characteristics of fundamental searching algorithms
4. Explain the major graph algorithms and their analyses
5. Evaluate data compression techniques and construct search patterns.
SUBJECT CONTENTS

ALLOCATED(HRS)
Fundamentals
1. Programming Models. Data Abstraction. Sets, Multisets, Stacks,
Queues. Asymptotic and worst-case analysis of algorithms.
Sorting
2. Sorting problem- Bubble sort, Selection sort, Insertion sort, Merge
sort, Quick sort.
Searching
3. Symbol Tables, Binary Search Trees, Balanced Search Trees. Hash
Tables.
Page 18 of 95
Graphs
Definition of a directed and undirected graph. Paths, Cycles,

4. spanning trees. Directed Acyclic Graphs. Topological Sorting.
Minimum Spanning Tree algorithms. Shortest Path algorithms:
Dijkstra’s algorithm. Flow-based algorithms.
Strings
5. String Sort. Tries. Substring Search. Regular Expressions.
Elementary Data compression.
Total Hours
Textbooks:
1. Algorithms, Sedgewick and Wayne, Pearson

2. Introduction to Algorithms, Cormen, Leiserson, Rivest and Stein. MIT Press
3. Introduction to Theory of Computation, Sipser Michael, Cengage Learning.
4. Design & Analysis of Algorithms, Gajendra Sharma, Khanna Publishing House
Reference Books:
1. Fundamental of Algorithms by Gills Brassard, PaulBratley, PHI.

2. Design and Analysis of Computer Algorithms by Aho, Hopcroft and Ullman, Pearson
Page 19 of 95
SYLLABUS OF COMPUTER PROGRAMMING IN C 4 HRS/WEEK 15 CYCLES PER SEMESTER
Computer Programming in C
Subject Title: Lab Credit: 02
Subject Code: COPC211 Semester: Third

RATIONALE/AIM: This Lab course is intended to practice what is taught in theory class of ‘Computer Programming’
andbecome proficient in computer programming. Computer programming is all about regular practice.Students
should work on solved and unsolved problems listed in the text books, and the problems given by the teacher.
1.Understanding a functional code organization.
2.Ability to define and manage data types based on problem subject domain.
3.Ability to work with characters and strings.
4.Ability to work with arrays
5.Understanding a concept of pointer.
SUBJECT CONTENTS

ALLOCATED(HRS)
1. Familiarization with flowcharts making in MS Word, Setting up of a

programming environment (Editor, Compiler, etc.)
2. Programs using I/O statements, data types and various operators
3. Programs using expression evaluation and precedence
4. Programs using decision making statements and

branching statements
5. Programs using loop statements
6 Programs to demonstrate use of numeric manipulation

using functions
Page 20 of 95
7 Programs to demonstrate parameter passing
mechanism using functions
8 Programs to demonstrate recursion
9 Programs to demonstrate applications of n dimensional

arrays
10 Programs to demonstrate use of pointers.
Programs to demonstrate dynamic memory allocation
11 Programs to demonstrate file operations
12 Programs to demonstrate use of string manipulation

using string functions
Total Hours
Textbooks:
1. Programming in C: E Balagurusamy
Reference Book:
1. Let us C : Yeshwant Kanitkar
Page 21 of 95
SYLLABUS OF SCRIPTING LANGUAGES 4 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Scripting Languages Lab Credit: 02

Subject Code: COPC213 Semester: Second

Practical: 20 Marks. Practical: 30 Marks.
RATIONALE/AIM: This Lab course is intended to practice what is taught in theory class of ‘Scripting Language Lab’
and become proficient in python. Programming is all about regular practice.Students should work on solved and
unsolved problems listed in the text books, and the problems given by the teacher.
1. Demonstrate the basic techniques used to create scripts for automating system administrative tasks.
2. Design, code, and test applications using Python scripts.
3. Demonstrate the use of regular expressions in processing text.
4. Construct web scraping scripts to programmatically obtain data and content from web pages.
5. Demonstrate the use of Python to manage applications using networking.
6. Control the keyboard and mouse with GUI automation.
7. Use Python to process Excel spreadsheets, PDF and CSV files, Word documents, and JSON data.
SUBJECT CONTENTS

ALLOCATED(HRS)
INTRODUCTION TO SCRIPTING LANGUAGE – PYTHON:
1.1 Demonstrate Python installation.

1. 1.2 Program to demonstrate print statement.
1.3 Program to Illustrate comment statement
1.4 Program to Demonstrate data structure and data types.
INTRODUCTION TO PYTHON BASICS:
2.1 Program to Demonstrate String Operation

2.2 Program to Demonstrate simple input and output
2. 2.3 Program to Illustrate Output formatting.
2.4 Program to Demonstrate Arithmetic operations.
2.5 Program to Demonstrate Relational operations.
2.6 Program to Demonstrate Array concept.
PYTHON – Program Flow:
3.
3.1 Program to Demonstrate indentation.
3.2 Program to Demonstrate if statement.
Page 22 of 95
3.3 Program to Demonstrate for loop.
3.4 Program to Demonstrate while loop.
3.5 Program to Demonstrate range statement.
3.6 Program to Demonstrate Break and Continue.
3.7 Program to Demonstrate Assert statements.
PYTHON- FUNCTIONS:
4.1 Program to Demonstrate own functions

4.2 Program to Demonstrate function parameters.
4. 4.3 Program to Demonstrate variable arguments.
4.4 Program to Demonstrate scope of the functions.
4.5 Program to Demonstrate lambda functions and map.
4.6 Program to Demonstrate filter function.
PYTHON-MODULES AND EXCEPTIONS HANDLING
5.1 Program to Demonstrate to create a module.

5. 5.2 Program to Demonstrate standard modules.
5.3 Program to Demonstrate errors and exceptions handling with
try.
5.4 Program to Demonstrate multiple exceptions handling.
PYTHON-FILE HANDLING
6. 6.1 Program to Demonstrate different file handling modes.

6.2 Program to Demonstrate handling file exceptions.
6.3 Program to Demonstrate the working of with statement.
PYTHON-CLASSES
7.1 Program to Demonstrate new style classes.

7. 7.2 Program to Demonstrate how to create a class.
7.3 Program to Illustrate instance methods.
7.4 Program to Illustrate inheritance.
7.5 Program to Demonstrate polymorphism.
PYTHON REGULAR EXPRESSIONS
8.1 Program to demonstrate split.

8. 8.2 Program to demonstrate working with special characters, date
emails.
8.3 Program to Illustrate quantifiers and search methods.
PYTHON – SQL TIER CONNECTION
9. 9.1 Program to create DB Table and DB connection.
9.2 Program to insert, read, update and delete operations.
PYTHON WEB APPLICATION
10. 10.1 Demonstrate the installation of Django
10.2 Develop a Web application using Django
Total Hours
Textbooks:
1. Taming Python by Programming, Jeeva Jose, Khanna Publishing House

2. Starting Out with Python, Tony Gaddis, Pearson
Page 23 of 95
Reference Books:
3. Starting Out with Python (2009) Pearson , Tonny Gaddis

4. Python Algorithms Apress, Magnus Liet Hetland
Page 24 of 95
SYLLABUS OF INTORDUCTION TO DATABASE MANAGEMENT SYTEM LAB (DBMS) 2 HRS/WEEK 15 CYCLES
PER SEMESTER
INTORDUCTION TO DATABASE
MANAGEMENT SYTEM LAB
Subject Title: (DBMS) Credit: 01

RATIONALE/AIM: The course Introduction to Database Management System is an important in diploma

programme for Computer Science & Technology. This course is framed keeping in mind the fundamental
knowledge, design and applications in various fields of database management system relevant to the diploma
level.
1.Design a database, and database-based applications.

2.Use a DBMS in different field.
3.Handle the critical role of database system in designing several information system-based software systems or
4.applications.
5.Perform as a database administrator.
6.Implement the database system in any organisation.
SUBJECT CONTENTS

ALLOCATED(HRS)
Familiarisation with DBMS tools, installation and configuration.

1. Case Study 1: Student should decide on a case study and formulate
the problem statement.
Conceptual Designing using ER Diagrams (Identifying entities,

attributes, keys and relationships between entities, cardinalities,
generalization, specialization etc.)
Converting ER Model to Relational Model (Represent entities and

2.
relationships in Tabular form, Represent attributes as columns,
identifying keys)
Note: Student is required to submit a document by drawing ER

Diagram to the Lab teacher.
Page 25 of 95
Case studies like: Visitor Management database, Students’
Academic database, Inventory Management System database,
Bank Operations database
Creation of Tables using SQL- Overview of using SQL tool, Data

3. types in SQL, Creating Tables (along with Primary and Foreign keys),
Altering Tables and Dropping Tables
Practicing DML commands- Insert, Select, Update, Delete.

4. Use Queries using ANY, ALL, IN, EXISTS, NOT EXISTS, UNION,
INTERSECT, CONSTRAINTS etc.
Practice Queries using COUNT, SUM, AVG, MAX, MIN, GROUP BY,
5.
HAVING, VIEWS Creation and Dropping.
Normalization -To remove the redundancies and anomalies in the

6.
above relational tables, Normalize up to Third Normal Form.
Total Hours
Textbooks:
1.Fundamentals of Database Systems, Elmasri & Navathe, Pearson Education

2.Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata McGraw-Hill.
Reference Books:
1. Database System Concepts, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, McGraw-Hill, New
Delhi, India.
2. Introduction to Database Systems, C.J.Date, Pearson Education
Page 26 of 95
SYLLABUS OF ESSENCE OF INDIAN KNOWLEDGE AND TRADITION 2 HRS/WEEK 15 CYCLES PER SEMESTER
Essence of Indian Knowledge

Subject Title: and Tradition Credit: 00
Subject Code: AU202 Semester: THIRD

Theory: - Theory: -
Course Content:
• Basic Structure of Indian Knowledge System:
(i) वेद, (ii) उऩवे द (आयेवेद, धने वेद, गन्धवे द, स्Tऩत्य आदद) (iii) वे दTTे ग (शिक्T, कलऩ,
ननरुत, व् Tकरण, ज्योनतष छTे द), (iv) उऩTइग (धरे्म िTस्र, रे् े रे् TTे सT, ऩे रTण, तकिरTस्र)
• Modern Science and Indian Knowledge System
• Yoga and Holistic Health care
• Case Studies.
Reference Materials
1.Cultural Heritage of India-Course Material V. Sivaramakrishna Bharatiya Vidya Bhavan, Mumbai, 5th
Edition, 2014
2.Modern Physics and Vedant Swami Jitatmanand Bharatiya Vidya Bhavan
3.The wave of Life Fritz of Capra
4.Tao of Physics Fritz of Capra
5.Tarkasangraha of Annam Bhatta, International V N Jha Chinmay Foundation, Velliarnad, Amaku,am
6.Science of Consciousness Psychotherapy and Yoga Practices RN Jha Vidyanidhi Prakasham, Delhi, 2016
Harvard business ISBN: 978-142219602
Page 27 of 95
FOURTH SEMESTER
Hours per Contact
COURSE Marks
CODE
Introduction to OOPs in
COPC202 2 0 0 2 2 40 60 100
1 JAVA
COPC204 Data Structures in C 2 0 0 2 2 40 60 100

2
COPC206 Computer Networks 2 0 0 2 2 40 60 100

3
COPC208 Software Engineering 3 0 0 3 3 40 60 100

4
COPC210 Web Technologies 2 0 0 2 2 40 60 100

5
**OE202 Open Elective-1 4 0 0 4 4 40 60 100

6
COPC212 JAVA Lab 0 0 2 2 1 30 20 50

7
COPC214 Data Structures in C Lab 0 0 2 2 1 30 20 50

8
Computer Networks
COPC216 0 0 2 2 1 30 20 50
9 Lab
COPC218 Web Technologies Lab 0 0 2 2 1 30 20 50

10
11 Proj.202 Minor Project 0 0 4 4 2 50 50
26 21 850
Page 28 of 95
SYLLABUS OF OBJECT-ORIENTED PROGRAMMING IN JAVA 2 HRS/WEEK AND 15 CYCLES PER SEMESTER
OBJECT ORIENTED
Subject Title: PROGRAMMING IN JAVA Credit: 02
Subject Code: COPC202 Semester: FOURTH

RATIONALE/AIM: Introduction to Object-Oriented Programming (OOP) puts an emphasis on the fundamentals of

structured design with classes and Objects. The Java programming language is used as programming language for
this course. This course is designed to teach OOP concepts, techniques, and applications in the programing
paradigm. The trainee will learn the difference between procedural and object oriented programming.
1 Write basic programs using JAVA language
2. Develop Applications for Range of Problems Using Object-Oriented Programming Techniques
3. Design Simple Graphical User Interface Applications.
SUBJECT CONTENTS

ALLOCATED(HRS)
BASICS OF JAVA PROGRAMMING
1. 1.1 Data types, Variables, Operators

1.2 Control structures including selection, Looping
1.3 Methods
1.4 Arrays
BASICS OF OO PROGRAMMING
2.1 Need for OOP Paradigm, OOP Concepts, and Abstraction

Mechanisms.
2.2 Concepts of Classes, Objects, Constructors, Finalizer, Methods,

2.
Access Control.
2.3 Garbage Collection, Overloading Methods and Constructors.
2.4 Inbuilt classes like String, Character, StringBuffer, File, this

reference.
Page 29 of 95
INHERITANCE AND POLYMORPHISM
3.1 Inheritance in Java, Super and sub class

3.
3.2 Polymorphism, Overriding, Object class.
3.3 Abstract class, Interface, Package
EXCEPTIONS AND MULTITHREADING IN JAVA
4.1 Exception handling

4. 4.2 Basic I/O Programming
4.3 Thread life cycle and methods, Runnable interface, Thread

synchronization
EVENT AND GUI PROGRAMMING
5.1 Event handling in java, Event types, Mouse and key events
5.2 GUI Basics, Panels, Frames, Layout Managers: Flow Layout,

Border Layout, Grid Layout
5.
5.3 GUI components like Buttons, Check Boxes, Radio Buttons,
Labels, Text Fields, Text Areas, Combo Boxes, Lists, Scroll Bars,
Sliders,
5.4 Applet and its life cycle, basic applet programming
Total Hours
Textbooks:
Programming in JAVA. E Balagurusamy
Reference Books:
JAVA: The Complete Reference by Herb Shield
Page 30 of 95
SYLLABUS OF DATA STRUCTURES 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Data Structures Credit: 02

RATIONALE/AIM: To provide strong foundation for implementing programming language to formulate, analyse
anddevelop solutions related to various data structures problems.
1. Design Arrays, Stacks, Queues and Lists along with various on these data structures.
2. Use Binary Tree, Binary Search tree, for elementary computational processes such as
Binary search.
3. Implement algorithms to find the minimum spanning tree of a given graph.
SUBJECT CONTENTS

ALLOCATED(HRS)
Introduction to Data Structures

1.
1.1 Basic Terminology, Classification of Data Structures, Operations
on Data Structures.
Linear Data Structures
2.1 Stacks: Introduction to Stacks, Array Representation of Stacks,
Operations on a Stack
2.2 Applications of Stacks-Infix-to-Postfix Transformation, evaluating
2. Postfix Expressions.
2.3 Queues: Introduction to Queues, Array Representation of
Queues, Operations on a Queue,
2.4 Types of Queues-De Queue, Circular Queue
2.5 Applications of Queues-Round Robin Algorithm.
Linked Lists
3.1 Singly Linked List, Representation in Memory,
3. Operations on a Single Linked List
3.2 Circular Linked Lists
3.3 Doubly Linked Lists
Page 31 of 95
3.4 Operations of Stack and Queue using Linked List
Non Linear Data Structures

4.1 Trees: Basic Terminologies, Definition and Concepts
of Binary Trees,
4.
4.2 Representations of a Binary Tree using Arrays and
Linked Lists.
4.3 Operations on a Binary Tree-Insertion, Deletion,
Traversals, Types of Binary Trees.
Graph
5.
5.1 Graph Terminologies, Representation of Graphs-
Set, Graph Traversals
Total Hours
Textbooks:
Data Structure Programming by Tanenbaum
Reference Books:
Data Structure Programming by P B KUTUR
Page 32 of 95
SYLLABUS OF COMPUTER NETWORKS 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: COMPUTER NETWORKS Credit: 02


RATIONALE/AIM: The course introduces main concepts of networking; application areas; classification; reference
models; transmission environment; technologies; routing algorithms; IP, UDP and TCP protocols; reliable data
transferring methods; application protocols; network security; management systems; perspectives of
communication networks.
1. Build an understanding of the fundamental concepts of computer networking.
2. Familiarize with the basic taxonomy and terminology of the computer networking area.
3. Enumerate the layers of the OSI model and TCP/IP.
4. Explain the function(s) of each layer.
SUBJECT CONTENTS

ALLOCATED(HRS)
INTRODUCTION
1.1 Introduction to computer networks; Network Models- OSI

Reference Model, TCP/IP Model;
1. 1.2 Network Topologies, Theoretical basis for communication,
guided transmission media, wireless transmission, the public
switched telephone networks, mobile telephone system.(
Coaxial, UTP, STP, Fiber Optic Cables; Wireless Media – HF, VHF,
UHF, Microwave, Ku Band;)
THE DATA LINK LAYER
2. 2.1 Design issues, error detection and correction, elementary data

link protocols, sliding window protocols, example data link protocols
- HDLC, the data link layer in the internet.
Page 33 of 95
2.2 THE MEDIUM ACCESS SUBLAYER: Channel allocations problem,
multiple access protocols, Ethernet, Data Link Layer switching,
Wireless LAN, Broadband Wireless, Bluetooth.
THE NETWORK LAYER
3.1 Network layer design issues.

3. 3.2 Routing algorithms and Principles (Distance-vector, Link-
state) and protocols (RIP, OSPF).
3.3 IP addressing: Classless & Classful, Sub netting.
3.4 The network layer in the internet (IPv4 and IPv6 headers).
THE TRANSPORT LAYER
4. 4.1 Transport service, elements of transport protocol.
4.2 Transport layer protocols: UDP and TCP, SCTP.
Functioning of Network Devices

5.
5.1 NIC, Hub, Switch, Router, WiFi Devices;
5 .2 Network Management System and example protocol (SNMP).
Total Hours
Textbooks:
1. Computer Networks (3rd edition), Tanenbaum Andrew S., International edition, 1996.
Reference Books:
1. Computer Networks – A System Approach, Larry L. Peterson & Bruce S. Davie, Computer Networking – ED
Tittel , 2002, T.M.H
Page 34 of 95
SYLLABUS OF SOFTWARE ENGINEERING 3 HRS/WEEK AND 15 CYCLES PER SEMESTER
Subject Title: SOFTWARE ENGINEERING Credit: 03

Theory: 60Marks. Theory: 40 Marks.
RATIONALE/AIM: Inculcate essential technology and software engineering knowledge and skills essential to build
reasonably complex usable and maintainable software iteratively. Emphasize on structured approach to handle
software development.
1. define the need of software and distinguish the software life cycle models
2. identify the end-user requirements into system and software
3. identify and apply appropriate software architectures and patterns to carry out high level design of a
system
4. apply testing principles to software project and assure the quality of software
5. apply the project management and analysis principles to software project development.
SUBJECT CONTENTS

ALLOCATED(HRS)
Introduction to Software Engineering:
1.1 The evolving role of software, changing nature of software,

1. software myths, costs, systems engineering & software
Engineering
1.2 Software Life Cycle Models: Classical waterfall model, Iterative
waterfall model, Prototyping model, Spiral model, Agile Model.
Development Activities:
2.1 Requirements Gathering and Analysis- Functional and non-

functional requirements, user requirements, system requirements,
the software requirements document.
2.
2.2 Requirements engineering process- Feasibility studies,
requirements elicitation and analysis, requirements validation,
requirements management.
Page 35 of 95
Design:
3.1 Design process and design quality, design concepts, the design
model. System models: Context models, behavioural models, data
3. models, object models, structured methods.
3.2 Software architecture, data design, architectural styles and

patterns, architectural design, conceptual model of UML.
3.3 Effective Coding and Debugging techniques.
Software Planning and Estimation
4.1 Need for the proper management of software projects

Management activities
4.2 Project planning Software Size Estimation and Cost Estimation

4. Software Estimation –Size Estimation Function Point Analysis LOC
Estimation
4.3 What is Productivity COCOMO models
4.4 Project scheduling Task set for Software project
4.5 Defining a task network Scheduling
Project Management:
5.1 Project management concepts, Configuration and Release

5. Management,
5.2 Version Control and its tools (Git), Release Planning, Change
Management, Software Maintenance, Project Metrics
Total Hours
Text books:
1. Software Engineering – A Practitioner’s Approach, 7th Edition, Roger Pressman.

2. Software engineering, Ian Sommerville, Pearson Education
3. An Integrated Approach to Software Engineering, Pankaj Jalote, Springer Verlag
Reference Books:
4. Software Engineering, Nasib Singh Gill, Khanna Book Publishing Co. India.
5. Software Engineering, K. K. Agarval, Yogesh Singh, New Age International Publishers
6. Fundamentals of Software Engineering, Rajib Mall, PHI Learning Private Limited
Page 36 of 95
SYLLABUS OF SYLLABUS OF WEB TECHNOLOGY 4 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: WEB TECHNOLOGY Credit: 2
End semester Assessment

60 Marks. Progressive Assessment Theory: 40 Marks.
Theory:
RATIONALE/AIM:
The applications that are being developed are platform neutral and mostly developed in web. Web technology
provides an inside out of how the student can develop application that are platform independent and web deployed
using internet.
COURSE OUTCOME
1. To understand various components of internet along with the features and the protocol used in web
technologies.
2 Explain and demonstrate the creation of static and dynamic webpage using markup languages.
3 To understand the concept of interactive tools and various features of Javascript.
4 Explain the working of PHP, database and expression language in creation of dynamic webpage.
SUBJECT CONTENTS

ALLOCATED(HRS)
Internet Basics:
1.1. Basic concepts, Communication on the Internet, Internet

Domains, Internet Server Identities, Establishing Connectivity on the
Internet, Client IP Address,
1.2. Brief Overview of TCP/IP and its Services, Transmission Control

1 Protocol, Web Server, Web Client, Domain Registration, Gateways.
1.3. HTML: Introduction to Hypertext Markup Language, Common

tags, Anchors, Backgrounds, Images, Webpage structure, Hyper
linking, Lists, Character Formatting, Color Control, Images, Tables,
Frames, Multimedia, Cascading style sheet, Application with layers.
Page 37 of 95
JavaScript and XML
2.1. Client-side Forms, JavaScript, Incorporating JavaScript in

HTML,JavaScript expressions, Control flow and functions, String and
2 Arrays, JavaScript objects,
2.2. JavaScript Forms: Managing frames in JavaScript, Cookies,

history, location. XML, XSL and other markup languages, CGI
Scripting with Perl.
PHP
3 3.1. Basic concepts strings, functions and OOPs, File handling,
3.2. Working with database and AJAX.
Servlets & JSP
4.1. Introduction to Servlets and JSP basics.
4.2. Implementation of Sessions, Cookies, Filter, Listener, and

4
Wrapper,
4.3. Expression language-EL, JSP Standard Tag Library-JSTL,
4.4. MySQL, JDBC, Connection pooling.
Total Hours
TEXTBOOKS:
1. Jackson, Web Technologies: A Computer Science Perspective, Pearson Education,
2007.
2. S. Holzner, Php: The Complete Reference, TMH, 2007.
3. Kriss Jamsa, Konrad King, HTML & Web Design, TMH Publications, 2002.
4. Jason Hunter, William Crawford, Servlet Programming, O’REILY, 2010.
5. Tom Negrino and Dori Smith, JavaScript for the World Wide Web, 3E, 2011.
REFERENCE BOOKS
1. Joel Murach, Andrea Steelman, Murach's Java Servlets and JSP, Murach’s, 2E, 2008.
Page 38 of 95
SYLLABUS OF SYLLABUS OF OOPS IN JAVA 4 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: JAVA Lab Credit: 02

Subject Code: CST503 Semester: Second

RATIONALE/AIM:
Introduction to object-oriented programming. Emphasis on the fundamentals of structured design with classes,
including development, testing, implementation, and documentation. Includes object-oriented programming
techniques, classes, and objects. The Java programming language is used as the teaching vehicle for this course.
COURSE OUTCOME
1. Design/Develop Object Oriented Program in JAVA

2. Resolve defects and revise and adapt existing code
3. Demonstrate the ability to make effective use of object-oriented encapsulation.
4. Demonstrate the ability to make effective use of object-oriented inheritance.
5. Demonstrate the ability to make effective use of object-oriented polymorphism and the Java Collections
Framework.
6. Demonstrate the ability to make effective use of GUI Programming
SUBJECT CONTENTS

ALLOCATED(HRS)
INTRODUCTION TO JAVA PROGRAMMING.
1. 1.1 Program to hello world and class introduction?

1.2 Write and test a Java program to convert a given temperature
in FAHRENHEIT to CELCIUS using the following conversion
formula.C= [(F-32)/1.8] and display the value in tabular form.
INTRODUCTION TO JAVA BASICS-A:
2.1 Write a Java program to check if the no. of year for which the
2. employee has served the organization is greater than three.
Than a bonus of RS-2500 is given to the employee. If the year of
service is not greater than three than the bonus is 0.
2.2 Write and test a java program to find the Addition, Subtraction,
Multiplication and Division of two numbers.
Page 39 of 95
INTRODUCTION TO JAVA BASICS-B:
3.1 Write a java program to demonstrate the use of IO stream for

asking user to Input Data.
3. 3.2 Write a program using do-while loop to calculate and print the
first in Fibonacci series (n given).
3.3 Given a number, write a program using while loop to reverse
the digits of the numbers 1 2 3 4 5 should be printed as 5 4 3 2
1.
JAVA – CLASSES AND OBJECTS:
4. 4.1 Create an object called "myObj" and print the value of x:

4.2 Design a class called Height with following data members. Feet,
inches - Create two objects of Height and find their sum, 1
feet=12 inches
JAVA– METHOD OVERLOADING:
5.1 WAP in java to demonstrate method overloading: changing no

of arguments.
5.2 WAP in java to demonstrate method overloading: changing
5. data type of arguments.
5.3 WAP to demonstrate method overloading is not possible by
changing the return type of method only.
5.4 WAP to demonstrate method overriding.
5.5 WAP to demonstrate method overloading for area of rectangle,
area of circle and area of square.
JAVA- THIS KEYWORD:
6.1 WAP to demonstrate using ‘this’ keyword to refer current class

6. instance variables
6.2 WAP to demonstrate using ‘this’ keyword to invoke current
class constructer.
6.3 WAP to demonstrate using ‘this’ keyword to return the current
class instance.
JAVA-INHERITANCE:
7.1 WAP in java to illustrate the concept of single inheritance.

7.2 WAP in java to illustrate the concept of Multi-Level inheritance.
7. 7.3 WAP in java to illustrate the concept of Hierarchical
inheritance.
7.4 WAP in JAVA to demonstrate inheritance for class Bicycle as
base class, class MountainBike as derived class which extends
Bicycle class and class Test is a driver class to run program
7.5 WAP in java to demonstrate use of super with variables.
JAVA-INTERFACE:
8.1 WAP in java to demonstrate the working of interface.

8. 8.2 WAP in Java to implement Printable interface with one method
and its implementation is provided in the A6 class.
8.3 WAP in Java to implement Drawable interface with one method
and its implementation is provided in the Rectangle and Circle
class.
Page 40 of 95
8.4 WAP to demonstrate a class implements an interface but one
interface extends another interface.
JAVA- TRY AND CATCH
9.1 WAP in java to demonstrate control flow of try-catch clause,

when exception occur in try block and handled in catch block
9. 9.2 WAP in java to demonstrate control flow of try-catch clause,
when exception occurs in try block and not handled in catch
block.
WAP in java to demonstrate control flow of try-catch clause, when
exception does not occur in try block
10.1 WAP in java to demonstrate concept of Threads in JAVA.

10.
10.2 Draw a GUI using JAVA AWT.
Total Hours
Textbooks:
Programming with JAVA by E Balagurusamy
Reference Books:
JAVA: The Complete Reference by Herb Shield
Page 41 of 95
SYLLABUS OF SYLLABUS OF DATA STRUCTURE Lab 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Data Structures Lab Credit: 02

1.Design Arrays, Stacks, Queues and Lists along with various on these data structures.
2. Use Binary Tree, Binary Search tree, for elementary computational processes such as
Binary search
3. Implement algorithms to find the minimum spanning tree of a given graph.
SUBJECT CONTENTS

ALLOCATED(HRS)
Recap of Array implementation.

Write a program to insert element in the position specified by the
1.
user.
Write a program to count no of particular symbols in an array with
multiple symbols.
2. Write a program to demonstrate the, working of a Stack (e.g. PUSH
and POP Operation) of size N using an array.
3. Write a program to convert to check valid infix algebraic
expression.
4. Write a program to convert from infix to postfix form.
5. Write a program to evaluate a mathematical expression

in postfix form.
Write a program to demonstrate the, working of a
6
Simple Queue (e.g. PUSH and POP Operation) of size N
using an array.
7 Write a program to implement Priority Queue and
elementary operations e.g. insertion and deletion
8 Write a program to implement Singly Linked List
Operations.
Page 42 of 95
9 Write a program to implement Doubly Linked List
Operations.
Write a program to demonstrate the, working of a Stack
10
(e.g. PUSH and POP Operation) using Linked List
concepts.
11 Write a program to demonstrate the, working of a Tree
and BST.
12 Write a program to demonstrate the traversal of Tree
and Find minimum spanning tree
Total Hours
Textbooks:
2. Data Structures in C: P B Kutur
Page 43 of 95
SYLLABUS OF SYLLABUS OF COMPUTER NETWORKS 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Computer Networks Lab Credit: 02

Subject Code: COPC216 Semester: Fourth

RATIONALE/AIM:
This course will enable students to learn basics of Computer networks, networking and standards used.
1. Build an understanding of the fundamental concepts of computer networking.
2. Familiarize with the basic taxonomy and terminology of the computer networking area.
3. Enumerate the layers of the OSI model and TCP/IP.
4. Explain the function(s) of each layer.
SUBJECT CONTENTS

ALLOCATED(HRS)
Familiarisation with various types of networking cables and

connectors, identifying them clearly.
1
Familiarisation with various networking devices – NICs, Hub, Switch,
Router, WiFi access point, etc.
2 Making patch cords using different types of cables and connectors -

crimping, splicing, etc.
Configuring computing devices (PC, Laptop, Mobile, etc.) for
3
network, exploring different options and their impact – IP address,
gateway, DNS, security options, etc.
Network simulation tool using Cisco Packet Tracer; Building LAN
4
and Switches, Create topologies.
Network simulation tool using Cisco Packet Tracer; Building a switch

5
interface and address list.
Page 44 of 95
Network simulation tool using Cisco Packet Tracer; Configuration of
6
Routers.
7 Setting up a wired and wireless LAN in the Lab.
8 Client server connectivity and message passing using Socket.
Network simulation tool using Cisco Packet Tracer; Simulation of

10
Principles of Routing Protocols.
Total Hours
Textbooks:
1. Cisco press books on CCNA

2. User manual of networking devices available in the lab
Page 45 of 95
SYLLABUS OF SYLLABUS OF WEN TECHNOLOGIES LAB 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Web Tech Lab Credit: 01


RATIONALE/AIM: The applications that are being developed are platform neutral and mostly developed in web.
Web technology provides an inside out of how the student can develop application that are platform independent
and web deployed using internet.
1. Develop various components of internet along with the features and the protocol used in web technologies.
2 Explain and demonstrate the creation of static and dynamic webpage using markup languages.
3 To understand the concept of interactive tools and various features of Javascript.
4 Explain the working of PHP, database and expression language in creation of dynamic webpage.
SUBJECT CONTENTS

ALLOCATED(HRS)
INTRODUCTION TO WEB TECHNOLOGY.
1. Installation of Notepad++ and XAMPP Server.
Demonstrate client server connection.
Developing Web Application using HTML, JavaScript:
2. Demonstrate HTML header, frames and tables.
Develop a login web page using JavaScript and HTML.
Developing Advanced Web Application Programs using CSS

3. Develop a CSS and apply to the login page developed using HTML
and JavaScript.
PHP Basics
4.
Create a simple web page using PHP.
Page 46 of 95
PHP-SQL tier CONNECTION
5. Create a database in MYSQL.
Create a webpage to display data fetched from MYSQL.
WEB Service Application

6.
Develop a web service application for college admission process.
Total Hours
TEXT BOOKS
1. Jackson, Web Technologies: A Computer Science Perspective, Pearson Education, 2007.

2. S. Holzner, PHP: The Complete Reference, TMH, 2007.
REFERENCE BOOKS
1. Joel Murach, Andrea Steelman, Murach's Java Servlets and JSP, Murach’s, 2E, 2008.
Page 47 of 95
SYLLABUS OF INTRODUCTION TO DATA SCIENCE 4 HRS/WEEK AND 15 CYCLES PER SEMESTER
Open Elective-1(Intro to Data

Subject Title: Science) Credit: 04
Subject Code: OE202 Semester: FOURTH

Practical Hrs. / week: 0Hrs. Total Hrs. / semester: 60 Hrs.
RATIONALE/AIM: Introduction to Data Science is a subject to imbibe basic knowledge on data science, their
relevance and think critically about, data in all forms.
1 Know standard methods of data analysis and information retrieval
2. Be able to formulate the problem of knowledge extraction as combinations of data filtration, analysis and
exploration methods.
3. Be able to translate a real-world problem into mathematical terms.
4. Be able to visualise the analysis results.
SUBJECT CONTENTS

ALLOCATED(HRS)
An Introduction
1.5 Introduction to Data Science – Evolution of Data Science – Data

Science Roles
1. 1.6 The Difference Between Business Analytics (BI), Data Analytics
and Data Science
1.7 Data Collection Strategies, Data Pre-Processing Overview, Data
Cleaning,
1.8 Data Integration and Transformation Data Reduction
Statistics for Data Science
2.1 Statistical Terminologies: Population and Sampling methods,

2. Statistic, Population Statistic, Sample Statistic, Probability.
2.2 Descriptive Statistics Fundamentals: Central Tendency, Mean,
Median, mode
2.3 Spread of the Data: Variance, Standard Deviation, Range
2.4 Relative Standing: Percentile, Quartile, Inter-quartile Range
Page 48 of 95
2.5 Heat Map, Correlation Statistics, ANOVA
Importance of Probability
3.1 Probability Concepts
3.2 Conditional Probability
3.3 Dependent and Independent Events

3.
3.4 Bayes' Formula
3.5 Uniform and Binomial Distribution
3.6 Normal and Lognormal Distribution
3.7 p values, Confidence Level
The Data Science Process
4.1 Define the Problem, Get the Data, Explore the Data, Clean the
Data, Model the Data, Communicate the Findings
4.2 Data Cleaning: Dropping Rows, Imputing Missing Values
4.3 Data Transformation: Binary Encoding, One-Hot Encoding,

4. Standardization, Normalization
4.4 Feature Selection
4.5 Hypothesis Testing
4.6 Linear Regression and Logistic Regression
4.7 Market Basket Analysis
Data Visualisation
Bubble Chart, Sparklines, Waterfall chart, Box Plot

5.
Line Charts, Frequency Chart Bimodal & Multimodal Histograms
Scatter Plot, Pie Chart, Bar Graph, Line Graph
Total Hours
Text books:
1. Essential Math for Data Science: Calculus, Statistics, Probability Theory, and Linear Algebra, by Hadrien
Jean
Reference Books:
1. Build a Career in Data Science, by Emily Robinson and Jacqueline Nolis
Page 49 of 95
SYLLABUS OF OPEN ELECTIVE-1(FUNDAMENTALS OF AI) 4 HRS/WEEK AND 15 CYCLES PER SEMESTER
OPEN ELECTIVE-
Subject Title: 1(FUNDAMENTALS OF AI) Credit: 04
Subject Code: OE202 Semester: FOURTH

RATIONALE/AIM: An introduction to the basic principles, techniques, and applications of Artificial Intelligence.
Coverage includes knowledge representation, logic, inference, problem solving, search algorithms, game theory,
perception, learning, planning, and agent design. Students will experience programming in AI language tools.
1. Demonstrate fundamental understanding of the history of artificial intelligence (AI) and its foundations.
2. Apply basic principles of AI in solutions that require problem solving, inference, perception, knowledge
representation, and learning.
3. Demonstrate awareness and a fundamental understanding of various applications of AI techniques in
intelligent agents, expert systems, artificial neural networks and other machine learning models.
SUBJECT CONTENTS

ALLOCATED(HRS)
Introduction
1.1 Overview and Historical Perspective, Turing test.

1. 1.2 Physical Symbol Systems and the scope of SymbolicAI, Agents.
1.3 Fundamental problems and challenges - realism, brittleness,
scalability, real-time requirements, the frame problem, the
homunculus problem, the substrate problem, symbol grounding
1.4 Common-sense knowledge and common-sense reasoning.
Knowledge Representation and Search
2.1 Knowledge representation: logic as form of expression (syntax
2. and semantics of propositional logic and predicate logic).
2.2 Heuristic Search: Best First Search, Hill Climbing, Beam Search,
2.3 Randomized Search: Simulated Annealing
2.4 Genetic Algorithms, Ant Colony Optimization.
Patterns, Associations and Correlations
3.1 Finding Optimal Paths: Branch and Bound, A*, IDA*, Divide
3. and Conquer approaches, Beam StackSearch.
3.2 Problem Decomposition: Goal Trees, AO*, Rule Based Systems,
Rete Net.
3.3 Game Playing: Minimax Algorithm, AlphaBeta Algorithm, SSS*.
Page 50 of 95
Planning
4. 4.1 Classical planning and execution.
4.2 Planning and Constraint Satisfaction: Domains, Forward and
Backward Search, Goal Stack Planning.
4.3 Plan Space Planning, Graph plan, Constraint Propagation.
Neural Network Algorithm and Learning
5.1 Neural networks: background and fundamentals.
5. 5.2 Artificial evolution, genetic algorithms - short introduction.
5.3 Multiple autonomous agents, swarm intelligence, stigmergy,
emergence.
5.4 Learning - short introduction.
Total Hours
Text books:
Artificial Intelligence For Dummies by John Paul Mueller
Reference Books:
Artificial Intelligence BY Stuart Russell
Page 51 of 95
FIFTH SEMESTER
Hours per Contact
COURSE Marks
CODE
Introduction to e-
COPC301 2 0 0 2 2 40 60 100
1 Governance
2 COPC303 Operating Systems 2 2 2 40 60 100
Data Analytics in
COPC305 2 1 0 3 3 40 60 100
3 Python
4 COPE301 Program Elective-1 4 0 0 4 4 40 60 100
6 OE301 Open Elective-2 3 0 0 3 3 40 60 100
7 SI301 Summer Internship-2 2 50 50
Data Analytics in
COPC307 2 2 1 30 20 50
8 Python Lab
9 PR302 Major Project 0 0 4 4 1 50 50
26 22 750
Page 52 of 95
SYLLABUS OF INTRODUCTION TO E-GOVERNANCE 2 HRS/WEEK AND 15 CYCLES PER SEMESTER
INTRODUCTION TO E-
Subject Title: GOVERNANCE Credit: 02
Subject Code: COPC301 Semester: FIFTH
RATIONALE/AIM: The aim of this course is to cover the concepts of e-Governance and to understand how
technologies and business modelsshape the contours of government for improving citizen services and bringing in
transparency.
COURSE OUTCOME:
Through exposure to introductory ideas and practices followed in a selected number of e-Governance
initiatives in India, the course will help students to understand and appreciate the essence ofe-Governance.
SUBJECT CONTENTS
ALLOCATED(HRS)
Exposure to emerging trends in ICT for development;
1. Understanding of design and implementation of e-Government
projects, e-governance lifecycle.
Need for Government Process Re-engineering ,GPR); National e-

2. Governance Plan(NeGP) for India;SMART Governments &
Thumb Rules
Architecture and models of e-Governance, including Public

Private Partnership (PPP); Need for In- novation and Change
3. Management in eGovernance; Critical Success Factors; Major
issue including corruption, resistance for change, e-Security and
Cyber laws
Focusing on Indian initiatives and their impact on citizens;

Sharing of case studies to highlight best practices in managing e-
4. Governance projects in Indian context. Visits to local e-
governance sites (CSC, eSeva, Post Office, Passport Seva Kendra,
etc) as part of Tutorials.
Mini Projects by students in groups – primarily evaluation of

5. various e-governance projects.
Total Hours
Reference Books:
1. Managing Transformation –Objectives to Outcomes. J Satyanarayana, Prentice Hall India
2. The State, IT and Development. Kenneth Kenniston, RK Bagga and Rohit Raj Mathur,
SagePublications India Pvt Ltd.
Page 53 of 95
SYLLABUS OF OPERATING SYSTEMS 2 HRS/WEEK AND 15 CYCLES PER SEMESTER
Subject Title: OPERATING SYSTEM Credit: 02

RATIONALE/AIM: The aim of this course is to provide an overall concept regarding the operating system. Students
will interact with various resource management techniques that are very crucial for the management of hardware
and software computing resources. The students will also get opportunity to interact with various operating
system such as Unix / Linux / windows and mobile OS like Android.
1. Acquire the concepts of operating systems and open source OS.
2. Illustrate single user, multiuser, multitasking and multiprocessing.
3. Examine various roles of O.S like process management, memory management, device management, file
management and security management.
4. Assess inter process communication in Operating system.
5. Evaluate basic concept and features of mobile O.S-case study like Android.
SUBJECT CONTENTS
ALLOCATED(HRS)
CONCEPTS OF OPERATING SYSTEM
1.1 Overview of Operating System.
1. 1.2 Basic concepts of UNIX/LINUX and Windows architecture.
1.3 OS Kernel, services and systems calls, system programs.
PROCESS AND MEMORY MANAGEMENT

2.1 Process Management: Process concepts, operations on
2. processes, IPC, Process Scheduling, Multi-threaded programming.
2.2 Memory management: Memory allocation, Swapping, Paging,
Segmentation, Virtual Memory, various faults.
FILE MANAGEMENT SYSTEM
3.1 Concepts of a file
3.2 Different types of file systems
3.3 Access methods, directory structure, file system mounting
3.
3.4 File sharing and protection
3.5 File system structure and implementation
3.6 Directory implementation, free- space management, efficiency
and performance.
I/O SYSTEM
4.1 Mass storage structure - overview, disk structure, disk
4. attachment,
4.2 Disk scheduling algorithms, swap space management
4.3 Concepts of RAID and its types
OS SECURITY
5.
5.1 Authentication, Access Control, Access Rights, System Logs
Page 54 of 95
Total Hours
Textbooks:
2. Operating System Concepts, Silberschatz and Galvin, Wiley India Limited
3. UNIX Concepts and Applications, Sumitabha Das, McGraw-Hill Education
Reference Books:
3. Operating Systems, Internals and Design Principles, Stallings, Pearson Education, India
4. Modern Operating Systems, Andrew S. Tanenbaum, Prentice Hall of India
Page 55 of 95
SYLLABUS OF SYLLABUS OF DATA ANALYTICS IN PYTHON 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Data analytics in Python Credit: 02

1 Establish the core concepts and fundamentals of Python as object oriented programming concept.
2 Explore new avenues of using NumPy and Pandas with respect to data analytics.
3 Implement Python data science concept for data pre-processing, and analysing the result.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction : Review of Python Programming
1.1 Need of Python Programming, Applications Basics of Python
Programming, Running Python Scripts, Variables, Assignment,
Keywords, Input-Output, Indentation.
1.2 Types - Integers, Strings, Booleans; Operators- Arithmetic
1. Operators, Comparison (Relational) Operators, Assignment
Operators, Logical Operators, Bitwise Operators.
1.3 Membership Operators, Identity Operators, Expressions and
order of evaluations Control Flow- if, if-elif-else, for, while,
break, continue, pass
1.4 Lists - Operations, Slicing, Methods; Tuples, Sets, Dictionaries,
Sequences. Comprehensions
Classes and OOP Concept in Python
Procedural and Object-Oriented Programming, Classes and
2 working with instances, Method overloading, Polymorphism,
importing internal module as well as external modules in the code
Packages understanding and their usage.
Data Structures for data analytics in Python
2.1 NumPy: multidimensional NumPy arrays (ndarrays) • Load and
save ndarrays • Use slicing, boolean indexing, and set operations
to select or change subsets of an ndarray.
3 2.3 Pandas: Series and DataFrames • Perform arithmetic
operations on Series and DataFrames • Load data into a DataFrame
• Deal with Not a Number (NaN) values. Create data frames from
.csv, excel sheet, python dictionary, list for tuples.
Page 56 of 95
Tools for data analytics
3.1 Matplotlib
4 3.2 SciPy; Maths and Statistics
3.3Scikit Learn Modelling process, data representation,
linear modelling and curve fitting.
Data Visualization
5
4.1 Creating a Pie chart, Line graph, bar graph, Histogram, box plot.
Total Hours
Textbooks:
Beginning Python Publication Peter Norton, Alex Samuel
Reference Books:
1. Starting Out with Python (2009) Pearson , Tonny Gaddis
2. Python Algorithms Apress, Magnus Liet Hetland
3. Python Object Oriented Programming PACKT Press, Dusty Phillips
Page 57 of 95
SYLLABUS OF PROGRAM ELECTIVE-1(SOFT COMPUTING BASICS) 4 HRS/WEEK 15 CYCLES PER SEMESTER
Program Elective-1(Soft
Subject Title: Computing basics) Credit: 04
Subject Code: COPE301 Semester: FIFTH
RATIONALE/AIM: The course introduces main concepts of networking; application areas; classification; reference
models; transmission environment; technologies; routing algorithms; IP, UDP and TCP protocols; reliable data
transferring methods; application protocols; network security; management systems; perspectives of
communication networks.
1. State about soft computing and their applications.
2. Apply fuzzy logic and reasoning to handle uncertainty and solve various engineering problems.
3. Analyse various neural network architectures
4. Apply genetic algorithms to combinatorial optimization problems.
5. Evaluate and compare solutions by various soft computing approaches for a given problem.
SUBJECT CONTENTS
ALLOCATED(HRS)
INTRODUCTION TO SOFT COMPUTING
1.1Introduction to Soft Computing, Difference between Hard and
1. Soft Computing
1.2 Characteristics of Soft Computing
1.3 Applications of Soft Computing.
FUZZY LOGIC
2.1 Introduction to Fuzzy logic, Fuzzy sets, Fuzzy set versus Crisp
set, Fuzzy membership functions
2.
2.2. Operations on Fuzzy sets, Fuzzy relations, rules, propositions,
implications and inferences
2.3. Defuzzification techniques, Some applications of Fuzzy logic.
ARTIFICIAL NEURAL NETWORKS
3.1 Structure and Function of a single neuron, Biological neuron
and its working, Simulation of biological neurons to problem
solving, Artificial neuron, Definition of ANN, Difference b/w ANN
and human brain, characteristic of ANN, single layer network,
3. Activation functions.
3.2 Realization of AND, OR, Ex-OR gates Using Mcculloch-Pitts
Neuron Model.
3.3 The perceptron neural network architectures: Single layer feed
forward ANNs, Multi-layer feed forward ANNs. Applications of
ANNs to solve some real-life problems.
GENETIC ALGORITHMS
4.1 Concept of "Genetics" and "Evolution" and its application to
4.
probabilistic search techniques.
4.2 Working Principle, Various Encoding methods, Fitness function
Page 58 of 95
4.2 GA Operators- Encoding, Reproduction, Crossover, Mutation,
selection Convergence of GA, Bit wise operation in GA, Multi-level
Optimization
4.3 Applications & advances in GA, Differences & similarities
between GA & other traditional methods.
HYBRID SOFT COMPUTING TECHNIQUES & APPLICATIONS
5.1 Neuro-fuzzy hybrid systems, Genetic - neuro hybrid systems,
Genetic-fuzzy hybrid and Fuzzy-genetic hybrid systems.
5.2 Application: A fusion approach of multispectral images with
5.
SAR, optimization of traveling salesman problem using genetic
algorithm approach, soft computing-based hybrid fuzzy
controllers.
Total Hours
Textbooks:
1. Samir Roy & Udit Chakraborty, “Introduction to Soft Computing, Neuro-Fuzzy and Genetic Algorithms”,
Pearson.
2. S.N. Sivanandam & S.N. Deepa, “Principles of Soft Computing”, Wiley Publications, 2nd Edition
Page 59 of 95
SYLLABUS OF PROGRAM ELECTIVE-1( ADV. WEB DEVELOPMENT) 4 HRS/WEEK AND 15 CYCLES PER
SEMESTER
Program Elective-1( Adv. Web

Subject Title: Development) Credit: 03
RATIONALE/AIM: Application that is being developed is platform neutral and mostly developed in web. Web
technology provides an inside out of how the student can develop application that are platform independent and
web deployed using internet.
1: Demonstrate static and dynamic webpage using markup languages
2: Apply various searching and browsing tools.
3: Illustrate the concept of GUI programming an Applet programming.
4: Discover application level technology like HTTP, Web Server, Browsing and the various protocols that are being
used in web technology.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction
1.1. Overview and evolution of Internet programming and
1 application tools, searching and browsing tools.
1.2. Markup Languages and its application on the web: HTML, XML
and related concepts.
Java programming
2.1. Applet programming; Servlets, Java Beans, event handling
and swing programming ;
2
2.2. Java database connectivity; Multi-Thread programming in
Java.
Network Programming
3.1. Client Server programming
3.2. Remote Method Invocation
3 3.3. Communication protocol: TCP/IP, IP addressing and domain
registration and related concepts.
3.4. Application level technology: HTTP, Web Server, Browsing,
Firewall.
Search Mechanisms
4.1. Search Engine, Crawler Technology, Filtering Technology
Content based Searching, Agent Technology, Internet Robot.
4 4.2. Advance Internet applications: Data and Web mining; e-
commerce;
4.3. Distributed Objects – component object model, common
object request broker architecture, Web security.
Page 60 of 95
Total Hours
Text books:
1. Jackson, Web Technologies: A Computer Science Perspective, Pearson Education, 2007.
2. S. Holzner, Php: The Complete Reference, TMH, 2007.
Reference Books:
1. Behrouz Forouzan, TCP/IP Protocol Suite 4E, TMH, 2010.
2. Stevens David L., Comer Douglas E., Internetworking With TCP/IP: Design, Implementation, And c Internals, 3E,
Prentice Hall, 2009.
Page 61 of 95
SYLLABUS OF SYLLABUS OF PROGRAM ELECTIVE-1(ADV. NETWORKING) 4 HRS/WEEK 15 CYCLES PER
SEMESTER
Program Elective-1 (Adv.
Subject Title: Credit: 2
Networking)
RATIONALE/AIM:
This module aims to provide a broad coverage of some new advanced topics in the field of computer networks
(wireless networks, Network security, Protocols, network storage and monitoring with QoS etc.)
COURSE OUTCOME
1 Identify core concepts/theories/algorithms of computer networks
2. Some hands-on capability on various network devices and tools
3 Capability to design and implement a computer network
SUBJECT CONTENTS
ALLOCATED(HRS)
Review of Networking Basics;
1.1 Network layer and protocols : IP addressing ,IP, Mobile IP
1.2 Advance Topics in IPv4 – Subnetting, Multicasting, Unicast and
multicast Routing protocols
1. 1.3 Protocols (IGMP, PIM, DVMRP);
1.4 Advance Topics in TCP – TCP services , flow management,
congestion control and avoidance, protocol spoofing;
1.5 IPV4 mapping to IPv6; transition to IPv6; IPv6 protocols
Telecom Networks, Switching Techniques;

2.6 Introduction to Frame Relay, ATM, MPLS;
2.7 VSAT Communication – Star and Mesh architectures,
2. bandwidth reservation;
2.8 Wireless Networks – WiFi, WiMax, Cellular Phone Technologies
– GSM, CDMA, 3G, 4G
Network storage and Monitoring with QoS

3.1 Network Redundancy, Load Balancers, Caching, Storage
3. Networks;
3.2 QoS; Network Monitoring – SNMP, RMON
Introduction to Network Security

4.1 Need for security; security attacks; services and mechanism;
network security
4. 4.2 Introduction to Cryptography; symmetric and asymmetric key
4.2 VLAN, VPN, Firewall, IP Security, Proxy Servers, SSL, TLS
Page 62 of 95
Network Simulation and Design
51. Simulation of Network (Packet tracer/putty)and its design with
case studies and exercises,
5.
5.2 IP Addressing schema
5.3 Protocol Analysers (Wireshark, etc)
TEXTBOOKS:
Communication Networking – An Analytical Approach, Anurag-Manjunath-Joy
REFERENCE BOOKS
RFCs and Standards Documents (www.ietf.org and other standard body websites)
TCP/IP Illustrated (Vol.1,2), Stevens
Page 63 of 95
SYLLABUS OF SYLLABUS OF PROGRAM ELECTIVE-1 (INFORMATION SECURITY) 4 HRS/WEEK 15 CYCLES PER
SEMESTER
Program Elective-1
(Information Security)
End semester Progressive Assessment
Assessment Theory: 60Marks. Theory: 40 Marks.
COURSE OUTCOME
7. Identify the need for information security
8. Discover threats that need to be handled.
9. Explore the security mechanism needed in the web.
10. Examine the network security products and security standards available.
SUBJECT CONTENTS
ALLOCATED(HRS)
Information Security Foundations
1.1 Introduction to Information Security, The CIA Triad,
Various aspects of information security (PAIN)
1. 1.2 Security Features of Operating Systems, Authentication,
Logs, Audit Features.
1.3 File System Protection, User Privileges, RAID options, Anti-
Virus Software.
Introduction to Cryptography
2.1 Types of Cryptography: Symmetric key and Asymmetric
Key Cryptography, Encryption and Decryption Techniques.
2.2 Cryptographic Algorithms: Cryptographic hash, Message
2.
Digest, Data Encryption Standard, Advanced Encryption
Standard, RSA, ECC
2.3 Network security model, Cryptographic systems,
Cryptanalysis, Steganography.
Internet and Web Application Security
3.1 Web Security: Different protocol , authentication,
authorization, Owasp Top 10, How HTTP/HTTPS works (TLS/
SSL handshake)
3. 3.2 Common vulnerabilities in Web application: Injection, XSS,
Broken Access Control, LFI, RFI, RCE etc.
3.3 VAPT Phases: Understanding how to perform web
application security assessment. (Scoping, Assessment, and
reporting)
Network Security Products
4.1 Firewall, IDS/IPS, VPN Concentrator
4.
4.2 Content Screening Gateways
Page 64 of 95
Security Standards
5.1 Introduction to Security Standards – ISO 27001
Indian IT Act, IPR laws.
5.
5.2 Security Audit procedures; Developing Security Policies;
Disaster Recovery.
5.3 OWASP, COBIT, SANS
Total Hours
Textbooks:
1. Principles of Information Security By Michael E. Whitman and Herbert J. Mattord
Reference Books:
1. Web Application Hacker's Handbook: Finding and Exploiting Security Flaws
by Dafydd Stuttard
4. Hacking: The Art of Exploitation, 2nd Edition by Jon Erickson
Page 65 of 95
SYLLABUS OF SYLLABUS OF PROGRAM ELECTIVE-2(IOT) 4 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Program Elective-2(IOT) Credit: 03

RATIONALE/AIM: Internet of Things (IoT) is presently an important technology with wide ranging interest from
Government, academia and industry. IoT cuts across different application domain verticals ranging from civilian to
defence sectors which includes agriculture, space, health care, manufacturing, construction, water, mining, etc.
Today it is possible to build different IoT solutions such as shopping system, infrastructure management in both
urban and rural areas, remote health monitoring and emergency notification systems, and transportation systems.
Therefore, it is very important to learn the fundamentals of this emerging technology.
1. Analyse the complexity of IoT and use IoT components to solve the problems.
2. Apply IoT concept using Arduino and Raspberry PI with sensors and Actuators.
3. Explore the latest research areas in the course.
4. Identify the applications of IoT in real world.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction to IoT; Sensing; Actuation
1.9 Definition and Characteristics of IoT –categories of IoT
1.10 Physical Design of IoT: IoT LAN, WAN, Node, Gateway,
proxy
1. 1.11 IoT communication models
1.12 IoT Protocols
1.13 Definition of Sensor –Features of sensor –Sensor class-
Sensor Types
1.14 Functions and types of actuators
Basics of IoT Networking, Communication Protocols, Sensor
networks
2.9 IoT Network Components
2.10 Functional components of IoT network
2.11 IoT Communication protocols (WiFi, Bluetooth,RFID,
Zigbee,IEEE 802.15.4)- Data protocols(MQTT,CoAP,
2.
Websocket)- AMQP
2.12 IoT enabled Technologies– Wireless Sensor Networks,
Cloud Computing, Big data analytics, SDN,NFV.
2.13 Basic components of sensor node-constraints on sensor
nodes-Applications and challenges.
2.14 Sensor web
Introduction to Arduino programming, Integration of
Sensors/Actuators to Arduino
3.
3.1 Introduction to Arduino- Features and Types of Arduino
3.2 Arduino IDE –an open-source software
Page 66 of 95
3.3 Supported data types-Operators- control statements- Loops-
Arrays-String-math library-Random number-Interrupts-Functions
and libraries –Example programs
3.4 Sensor (Temperature/humidity)interface with Arduino –Sensor
library-Connection setup
3.5 Actuator interface with Arduino (Hardware and software)-Servo
Motor-stepper motor-Relay-functions and libraries
Implementation of IoT with Raspberry Pi

4.1 Introduction to Raspberry PI - Interfaces (serial, SPI, I2C)-setup
Raspberry PI-OS setup
4.2 Programming – Python program with Raspberry PI with focus of
4.
interfacing external gadgets, controlling output, reading input.
4.3 Implementing IoT with Raspberry PI-example using sensor and
PI camera
Case Studies: Agriculture, Healthcare, Activity Monitoring

5. 5.1 Domain Specific IoTs – Home, City, Environment, Energy.
5.2 Retail, Logistics, Agriculture, Industry, health and Lifestyle
Total Hours
Textbooks:
1. Internet of Things: Architecture and Design Principles, Raj Kamal, McGraw Hill
References:
1. Internet of Things by Dr. Jeeva Jose, Khanna Publishing House (Edition 2017)
2. “Internet of Things: A Hands-on Approach”, by Arshdeep Bahga and Vijay Madisetti (Universities Press)
3. “The Internet of Things: Enabling Technologies, Platforms, and Use Cases”, by Pethuru Raj and Anupama C.
Raman (CRC Press)
4. https://nptel.ac.in/noc/individual_course.php?id=noc17-cs22
Page 67 of 95
SYLLABUS OF SYLLABUS OF PROGRAM ELECTIVE-2 (ADVANCED AI(NN) ) 4 HRS/WEEK 15 CYCLES PER
SEMESTER
Program Elective-2
Subject Title: (Advanced AI(NN) ) Credit: 03
RATIONALE/AIM: This course introduces the basic neural models, learning algorithms, and some of their
applications.
1 Form a Basic neuron models using McCulloch-Pitts model and the generalized one.
2 Represent multilayer perceptron, distance or similarity based neural networks, associative memory, and self-
organizing feature map.
3 Design and Implement basic learning algorithms.
4 Explore various applications.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introductory Concepts and Definitions
1.1 Artificial Neural Networks (ANN) and their biological roots and
motivations.
1.2 ANNs as numerical data/signal/image processing devices.
1.3 A summing dendrite synapses and their weights, pre-and
1.
postsynaptic signals, activation potential, and activation function.
1.4 Excitatory and inhibitory synapses.
1.5 The biasing input.
1.6 Types of activating functions.
1.7 Encoding (training phase) and decoding (active phase).
Taxonomy of neural networks
2.1 Feedforward and recurrent networks with supervised and
unsupervised learning laws.
2.
2.2 Static &dynamic processing systems, basic data structures:
mapping of vector spaces.
2.3 Clusters, principal components.
Feed Forward Network
3.1 Feed Forward Neural Networks
3.2 The Perceptron Formulation
3.
3.3 Learning Algorithm
3.4 Proof of convergence
3.5 Limitations
Multilayer Feed Forward Neural Networks
4.1 Motivation and formulation (the XOR problem)
4. 4.2 Learning Algorithm
4.3 Discussion on Convergence and Optimization
4.4 Applications
Page 68 of 95
Feed Back Neural Network
5.1 Feedback neural networks
5.2 Pattern storage and retrieval, Hopfield model, Boltzmann
5.
machine,
5.3 Recurrent neural networks.
5.4 Applications
Total Hours
Reference Textbooks:
1. A Primer on neural networks for natural language processing, by Yaov Goldbeg.
2. R. G. Cowell, A. P. Dawid, S. L. Lauritzen and D. J. Spiegelhalter. "Probabilistic Networks and Expert
Systems". Springer-Verlag. 1999.
3. M. I. Jordan (ed). "Learning in Graphical Models". MIT Press. 1998. Collection of papers. These appear
collated here.
4. J. Pearl. "Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference." Morgan
Kaufmann. 1988.
5. Graphical models by Lauritzen, Oxford science publications
6. F. V. Jensen. "Bayesian Networks and Decision Graphs". Springer. 2001.
7. Neural Networks and Deep Learning by Michael Nilson
Page 69 of 95
SYLLABUS OF SYLLABUS OF PROGRAM ELECTIVE-2(DATA SCIENCE: DATA WAREHOUSING AND MINING) 3
HRS/WEEK 15 CYCLES PER SEMESTER
Program Elective-2(Data
science: Data warehousing
Subject Title: and Mining) Credit: 03
Practical Hrs. / week: 0 0Hrs. Total Hrs. / semester: 60 Hrs.
RATIONALE/AIM: Introduce students to the domain of Data Warehousing and Data Mining
1 Understanding core concepts/theories/algorithms of Data Mining and data warehousing
2 Student will have general idea about Data Warehousing and Data Mining techniques
3 Explore further and effectively use related tools.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction
1.5 Motivation, Importance, Definitions,
1.6 Kind of Data, Data Mining Functionalities
1.7 Kinds of Patterns, Classification of Data Mining
Systems, Data Mining Task Primitives
1.8 Integration of A Data Mining System with A
Database or Data Warehouse System.
1. 1.9 Major Issues in Data Mining
1.10 Types of Data Sets and Attribute Values, Basic
Statistical Descriptions of Data, Data Visualization,
Measuring Data Similarity.
1.11 PREPROCESSING: Data Quality, Major Tasks in
Data Pre-processing, Data Reduction, Data
Transformation,and Data Discretization, Data
Cleaning,and Data Integration
Data Warehousing and online Analytical Processing
21. Data Warehouse basic concepts
2.2 Data Warehouse Modeling - Data Cube and OLAP,
2. Data Warehouse Design and Usage,
2.3 Data Warehouse Implementation, Data
Generalization by Attribute-Oriented Induction, Data
Cube Computation.
3. Patterns, Associations, and Correlations
Page 70 of 95
3.1 Mining Frequent Patterns, Associations,and
Correlations: Basic Concepts, Efficient and Scalable
Frequent Item set
3.2 Mining Methods, Pattern Evaluation Methods,
Applications of frequent pattern and associations.
3.3 Frequent Patterns and Association Mining: A Road
Map, Mining Various Kinds of Association Rules,
Constraint-Based Frequent Pattern Mining, Extended
Applications of Frequent Patterns.
Classification
4.1 Basic Concepts, Decision Tree Induction, Bayesian
Classification Methods, Rule-Based Classification,
Model Evaluation, and Selection.
4. 4.2 Techniques to Improve Classification Accuracy:
Ensemble Methods.
4.3 Handling Different Kinds of Cases in Classification,
Classification by Neural Networks, Support Vector
Machines, Pattern-Based Classification, Lazy Learners
(or Learning from Your Neighbours).
Cluster Analysis
5.1 Basic Concepts of Cluster Analysis, Clustering Structures.
5.2 Major Clustering Approaches, Partitioning Methods,
Hierarchical Methods, Density-Based Methods, Model-Based
5. Clustering
5.3 Outlier analysis, Identifying and handling of outliers, Outlier
Detection Techniques.
5.4 WEB MINING: Basic concepts of web mining, different types of
web mining, PAGE RANK Algorithm, HITS Algorithm.
Total Hours
Textbooks:
1. Margaret H Dunham, Data Mining Introductory and Advanced Topics, Pearson Education
Reference Books:
2. Jiawei Han, Micheline Kamber, Jian Pei, Data Mining: Concepts and Techniques, Elsevier
3. Amitesh Sinha, Data Warehousing, Thomson Learning, India.
4. Xingdong Wu, Vipin Kumar, the Top Ten Algorithms in Data Mining, CRC Press, UK.
Page 71 of 95
SYLLABUS OF OPEN ELECTIVE-2 (ROBOTICS) 3 HRS/WEEK AND 15 CYCLES PER SEMESTER
Subject Title: Open Elective-2 (Robotics) Credit: 03

Subject Code: OE301 Semester:
RATIONALE/AIM:
To introduce the concepts of Robotic system, its components and instrumentation and control related to robotics.
1. explain the fundamentals of robotics and its components
2. illustrate the Kinematics and Dynamics of robotics
3. elucidate the need and implementation of related Instrumentation & control in robotics
4. illustrate the movement of robotic joints with computers/microcontrollers.
5. Explain sensors and instrumentation in robotics
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction :
1. 1.1 Definition , Application of mobile Robotics
History of mobile Robotics.
Design of system and Navigation architecture
2.1 Reference control scheme of mobile robotics.
2.2 Temporal decomposition of architecture, control
2
decomposition, hybrid architecture, mobile architecture,
perception.
2.3 Representation and the mapping process.
Locomotion:
3.1 Issues for locomotion, legged mobile robots, wheeled mobile
robots. Kinematics introduction, forward and reverse kinematics,
wheeled kinematics and its constraints.
3
3.2 Mobile system locomotion, human biped locomotion as a
rolling polygon.
3.3 Representation of robot position through the reference
frame.
Perception:
4.1 Sensors for mobile robots, sensor classification
4.2 Characterization and sensor performance, Wheeled motor
sensor, ground base beacon.
4.3 Active ranging, motion/Speed sensor, vision-based sensors
4 Navigation:
4.4 Localization overview, path planning
Computational intelligence :
4.4 Swarm Intelligence, Evolutionary computation, Artificial
immune system, ant algorithm.
Page 72 of 95
Mobile robot programming:
5.1 Hands-on introduction to the field of mobile robotics and
various issues in designing and planning of robot work
environment.
5
5.2 It includes the construction and programming of robotics
agents using robotic kits and microcontrollers applying concepts
of locomotion, perception, navigation, and computational
intelligent algorithm.
Total Hours
Text books:
1. Mikell P. Groover, Mitchell Weiss, Roger N Nagel, Nicholas G Odrey, “Industrial Robotics Technology,
Programming and Applications”, Tata –McGraw Hill Pub. Co., 2008.
2. Deb.S.R and Sankha Deb, "Robotics Technology and Flexible Automation", Tata McGraw Hill
Publishing Company Limited, 2010.
3. Klafter.R.D, Chmielewski.T.A, and Noggin’s., “Robot Engineering: An Integrated Approach”’, Prentice
Hall of India Pvt. Ltd., 1994.
4. Fu.K.S, Gonzalez.R.C&Lee.C.S.G, “Robotics control, sensing, vision and intelligence”, Tata- McGraw
Hill Pub. Co., 2008
5. Yu. “Industrial Robotics”, MIR Publishers Moscow, 1985.
Page 73 of 95
SYLLABUS OF OPEN ELECTIVE-2 (MULTIMEDIA TECHNOLOGIES) 3 HRS/WEEK AND 15 CYCLES PER
SEMESTER
Open Elective-2 (Multimedia
Subject Title: Technologies) Credit: 03
RATIONALE/AIM: Introduction to Data Science is a subject to imbibe basic knowledge on data science, their
1 1: To learn the basics and Fundamentals of Multimedia
2: To understand how Multimedia can be incorporated
3: Describe the concepts of Digital image.
4: Understand the concept of Multimedia Programming.
SUBJECT CONTENTS
ALLOCATED(HRS)
INTRODUCTION -
1.1 Multimedia Hardware
1. 1.2 Multimedia Software
1.3 Multimedia operating systems
1.4 Multimedia communication system
Basic Compression Techniques -
2.1 Lossy and Lossless
2.1 Hufmann Encoding
2. 2.3 Runlength Encoding
2.4 LZW Encoding
2.5 JPEG, MPEG, MP3, MP4, LZMA, FLAC, ALAC, ITU G.722, H.261,
H.265
Content Development and Distribution -
3.1 Desktop publishing (Coral Draw, Photoshop, Page maker)
3.
3.2 Multimedia Animation & Special effects (2D/3D animation,
Flash)
Introduction to Digital Imaging -
4.1 Basics of Graphic Design and use of Digital technology
4.
4.2 Definition of Digital images
4.3 Digital imaging in multimedia
Introduction to Multimedia Programming and Applications
5.
Total Hours
Text books:
3. An Introduction to Multimedia Authoring, A. Eliens
4. Fundamentals of Multimedia, Prentice Hall/Pearson, Ze-Nian Li & Mark S. Drew
Reference Books:
3. Multimedia and Animation, V.K. Jain, Khanna Publishing House, Edition 2018
4. Fundamentals of Multimedia, Ramesh Bangia, Khanna Book Publishing Co., N. Delhi (2007)
Page 74 of 95
SYLLABUS OF OPEN ELECTIVE-2 (IMAGE PROCESSING AND PATTERN RECOGNITION) 3 HRS/WEEK AND 15
CYCLES PER SEMESTER
Open Elective-2 (Image
Processing and Pattern
Subject Title: Recognition) Credit: 03
RATIONALE/AIM: Introduction to Data Science is a subject to imbibe basic knowledge on data science and , their
1: Illustrate the digital image fundamentals and mathematical transforms necessary for image processing
2: Implement basic image enhancement algorithms and techniques
3: Describe the concepts of image compression and its various methods.
4: Identify the methods of feature extractions
5: Apply basic pattern classification methods.
SUBJECT CONTENTS
ALLOCATED(HRS)
INTRODUCTION -
1.1 Image Processing Components & Application
1.2 Elements of visual perception
1. 1.3 Image sensing and acquisition
1.4 Simple image formation, Image sampling and Quantization
1.5 Representing digital images and Image Quality.
1.6 Introduction to colour image – RGB and HSI Models
Image Enhancement-
2.1 Image histogram, point operations and look-up tables
2.1 Contrast stretching methods, histogram equalization
2.3 Tresholding, digital negative, intensity level slicing.
2.4 Spatial operations: Averaging, directional smoothing, median,
2.
filtering,
Spatial low pass, high pass and band pass filtering.
2.5 Enhancement with Frequency Transformations DFT, FFT.
2.6 Frequency Domain Low Pass Filters
2.7 Frequency Domain High Pass Filters
Image Compression -
3.1 Fundamentals of Compression – Compression Ratio,
Redundancy.
3.
3.2 Spatial Redundancy
3.3 Inter pixel Redundancy
3.4 Psychovisual Redundancy
Feature extraction and Dimension Reduction -
4.1 Colour
4. 4.2 Texture
4.3 Shape
4.4 Local Features
Page 75 of 95
4.5 Hog, SIFT and Surf
4.6 Edge based segmentation-Region based Segmentation
4.7 Principal Component Analysis
Pattern Recognition -
5.1 Basic Concept, Design Concept and Methodologies
5.2 Simple Pattern Recognition Model
5.
5.3 Unsupervised classification; k-means clustering, ISODATA,
5.4 Supervised classification; maximum likelihood, and minimum
distance to means, K-NN
Total Hours
Text books:
1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Third Ed., Prentice-Hall’2008.
2. Anil.K.Jain – Fundamentals of Digital Image Processing- Pearson Education-2003.
Reference Books:
1. William K. Pratt, Digital Image Processing, John Wiley, 4th Edition, 2007.
Page 76 of 95
SYLLABUS OF SYLLABUS OF DATA ANALYTICS IN PYTHON 2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: Data analytics in Python Credit: 1

Subject Code: COPC305 Semester:
Practical Hrs. / week: 0 2Hrs. Total Hrs. / semester: 30 Hrs.
RATIONALE/AIM: To introduce Python programming basics and program design with functions using Python
programming language for data analytics.
1. Identify the basic concepts of scripting and the contributions of scripting language
2. Analyse and perform real time data manipulation using numpy pandas.
3. Build statistical modeling using scikit learn using Python code.
4. Create practical and contemporary applications.
SUBJECT CONTENTS
ALLOCATED(HRS)
Write a program to perform different Arithmetic Operations on
1 numbers in Python.
Write a program to create, concatenate and print a string and

accessing sub-string from a given string.
2 Write a python script to print the current date in the following
format “Sun May 29 02:26:23 IST 2022”
Write a program to create, append, and remove lists in python.

3
Write a program to demonstrate working with tuples in python.
4
Write a program to demonstrate working with dictionaries in
5
python.
Perform numerical analysis and data manipulation using Numpy
6
Perform exploratory data analysis using pandas
7
Perform image related operation using Scipy (rotate,crop,sharp,
8
de-noising etc.)
Perform statistical modelling using Scikit learn (IRIS dataset)
9
Plotting the data using X-Y graph, Bar- chart, and using other
10
plotting techniques.
Total Hours
Textbooks:
1. Beginning Pyhton Wrox Publication Peter Norton, Alex Samuel
Page 77 of 95
SIXTH SEMESTER
Hours per Contact
COURSE Marks
CODE
Entrepreneurship and
HS302 3 1 0 4 4 40 60 100
3 Start-ups
4 OE302 Open Elective-3 3 0 0 3 3 40 60 100
5 AU302 Indian Constitution 2 0 0 2 0 40 60 100
6 PR302 Major Project 0 0 6 6 3 50 100 150
7 SE302 Seminar 1 0 0 1 1 50 50
26 19 700
Page 78 of 95
SYLLABUS OF PROGRAM ELECTIVE-3 4 HRS/WEEK AND 15 CYCLES PER SEMESTER
PROGRAM ELECTIVE-3 Free
and Open Source
Subject Title: Software(FOSS) Credit: 04
Subject Code: COPC201 Semester: SIXTH
RATIONALE/AIM: The course covers the basics of FOSS architecture and programming and demonstrates
fundamental programming techniques.
1.Differentiate proprietary and FOSS
2.Implement and design concepts on FOSS
3.Knowledge of OpenSource
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction
1.1Introduction: Open Source, Free Software, Free Software vs.
Open Source
Software, Public Domain Software, FOSS does not mean any cost.
1. 1.2 History: BSD, The Free Software Foundation and the GNU
Project.
1.3 Understanding the FOSS Community and FOSS Philosophy,
Benefits of Community based Software Development
1.4 Guidelines for working with FOSS community,
Decision making and Looping
2.1 Example Projects: Apache webserver, GNU/Linux, Android,
Mozilla(Firefox), Wikipedia, Drupal, WordPress, GCC, GDB, GitHub,
Open Office.
2.2 Understanding the developmental models, licensing’s, mode of
funding, commercial/non-commercial use.
2.3 Open Source Hardware, Open Source Design, Open source
2.
Teaching. Open source media.
2.4 Introduction to GitHub, interacting with the community on
GitHub, Communication and etiquette, testing open source code,
reporting issues, contributing code.
2.5 Introduction to Wikipedia, contributing to Wikipedia Or
contributing to any prominent open source project of student’s
choice. Starting and Maintaining own Open Source Project.
3.1 Libreoffice Tools;
3. 3.2 Samba: Cross platform
3.3 Introduction about LAMP, XAMP, Drupal platforms
3.4 Brief Introduction to Programming using languages like Java
/Python / Perl etc.
Page 79 of 95
4.1 Database Systems Mysql, PostgreSQL or equivalent
4.2 Open Source UML Tools
4. 4.3 Introduction to Mobile Programming
4.4 Version Control Systems like SVN, Git or equivalent;
4.5 Project Management Tools; Bug Tracking Systems; Package
Management Systems
Introduction to String manipulations and File operations
5.1 Open Source Operating Systems: GNU/Linux, Android, FreeBSD,
Open Solaris.
5.
5.2 Open Source Hardware, Virtualization Technologies
5.3 Containerization Technologies: Docker.
5.4 Development tools, IDEs, debuggers
Total Hours
Textbooks:
1. Unix Concepts and Applications by Sumitabha Das,TataMcGrawHillEducation,2006
2. The official Ubuntu Book, 8 th Edition
Reference Books:
1. The Linux Documentation Project: http://www.tldp.org/
2. Docker Project Home: http://www.docker.com
3. Linux kernel Home: http://kernel.org
4. Open Source Initiative: https://opensource.org/
Page 80 of 95
SYLLABUS OF PROGRAM ELECTIVE-3 4 HRS/WEEK AND 15 CYCLES PER SEMESTER
PROGRAM ELECTIVE-3
Subject Title: SOFTWARE TESTING Credit: 04
RATIONALE/AIM: Testing is a process or steps of a software items analysing in order to detect the state of
disagreement between actual and required / expected conditions. Software testing is essential to notice the
defects and errors which may occur during the development phases. Software testing is important since it verifies
the customer’s reliability and their content with application.
1: Describe the need of software testing and list different types of defects.
2: Discuss the basic concepts of testing techniques and illustrate various types of testing.
3: Apply software testing skills in different domains and develop test plans for evaluation.
4: Detect the issues in software applications.
5: Select appropriate automation tool for testing and analyse its effectiveness.
SUBJECT CONTENTS
ALLOCATED(HRS)
Software Testing Fundamentals
1.1 Definition, Importance of Testing, Role of Tester
1.2 Software Testing Principles, Software Testing Life Cycle
1.3 Verification and validation, quality perspectives
1.4 V” model of Testing, QA process, cost of testing
1. 1.5 Types of Testing – Manual Vs. Automatic
1.6 Manual Testing - Black Box testing, White Box testing, Unit
testing, System testing, Integration testing and Acceptance testing
1.7 Testing Techniques - Software Testing Techniques with Test
Case Design, Boundary Value Analysis & Equivalence Partitioning,
Decision Table Testing, State Transition Testing, Use Case Testing
Writing Test Cases
2.1 Overview of Test Documentation, Test Case, Use Case, Scenario
2.1 Prepare Test Plan & Strategy, Writing Test Cases
2.
2.6 Test Analysis
2.7 Requirements Traceability Matrix (RTM)
2.8 Test Data Generation: and What is, How to, Example, Tools
Test Automation
3.1 Automation Testing
3.2 Automated Testing Process & Test tool selection
3.
3.3 Framework for Automation
3.4 Types of Automated Testing and Automation Testing Tools
3.5 Why automation, when not to automate
Automatic Testing in Python
4. 4.1 Classes, imports and Libraries
4.2 Exceptions and Exception Handling
Page 81 of 95
4.3 Unit Testing in Pytest / Pycharm
4.4 Basic of Selenium with python
4.5 Writing a Python Test
Quality Assurance -
5.1 Code reviews
5. 5.2 Quality tools
5.3 Change management
5.4 version control
Total Hours
Textbooks:
The Art of Software Testing by Glenford Myers, Corey Sandler, Tom Badgett
Reference Books:
Lessons Learned in Software Testing, by Kaner, Bach, and Pettichord
Perfect Software and Other Illusions About Testing, by Gerald M. (Jerry) Weinberg
Page 82 of 95
SYLLABUS OF PROGRAM ELECTIVE-4 4 HRS/WEEK 15 CYCLES PER SEMESTER
PROGRAM ELECTIVE-4 CLOUD
COMPUTING
Theory:
RATIONALE/AIM: This course provides a hands-on comprehensive study of Cloud concepts and capabilities across
the various Cloud service models including Infrastructure as a Service (IaaS), Platform as a Service (PaaS),
Software as a Service (SaaS), The SaaS and PaaS topics covered in the course will familiarize students with the use
of vendor-maintained applications and processes available on the Cloud on a metered on-demand basis in multi-
tenant environments. The course also covers the Cloud security model and associated challenges and delves into
the implementation and support of High Performance Computing and Big Data support capabilities on the Cloud.
Through hands-on assignments and projects, students will learn how to configure and program IaaS services.
1. Understand Cloud delivery models in details
2. Understand briefly Cloud Computing Reference Architecture.
3. Define cloud security models in on demand services.
4. Differentiate various cloud reference architecture.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction of delivery models in Cloud Computing
1.1 Introduction to cloud delivery models, List various cloud
delivery models
1 1.2 Advantages of delivery models in cloud, trade-off in cost to
install versus flexibility, Cloud service model architecture.
Infrastructure as a Service (IaaS)

2.1. Introduction to Infrastructure as a Service delivery model,
2 2.2. Characteristics of IaaS, Architecture, examples of IaaS,
2.3. Applicability of IaaS in the industry.
Platform as a Service (PaaS)

3.1. Introduction to Platform as a Service delivery model,
3.2. Characteristics of PaaS, patterns, architecture and examples of
3 PaaS,
3.3. Applicability of PaaS in the industry
Software as a Service (SaaS)

4.1. Introduction to Software as a Service delivery model,
4 4.2. Characteristics of SaaS, Architecture, examples of SaaS,
4.3. Applicability of SaaS in the industry.
Page 83 of 95
Cloud Computing Reference Architecture (CCRA)
5.1. Introduction to Cloud computing reference architecture
(CCRA), benefits of CCRA,
5
5.2. Architecture overview, versions and application of CCRA for
developing clouds.
Total Hours
Textbooks:
Cloud Computing Architecture (IBM ICE)
Reference Books:
1. Cloud computing for Dummies (November 2009) Judith Hurwitz, Robin Bloor, Marcia Kaufman, Fern
Halper
2. IBM Cloud Computing http://www.ibm.com/cloud-computing/us/en/
Page 84 of 95
PROGRAM ELECTIVE-4
MACHINE LEARNING
Theory:
RATIONALE/AIM: Machine Learning is a latest course that branch of Computer Science must be included. It uses
algorithms to imitate the way in which humans learn through statistical methods to train algorithms and make
predictions. The accuracy of these predictions improves over time.
1. To formulate a machine learning problem
2. Select an appropriate algorithm for analysing data in a given feature space.
3. Differentiate classification and clustering.
4. To select feature of importance to practical applications and detect patterns in the data.
SUBJECT CONTENTS
ALLOCATED(HRS)
Machine Learning Foundations
1.15 Design of a Learning System, Types of Machine Learning:
1. Supervised Learning and Unsupervised Learning
1.16 Mathematical Foundations of Machine Learning
1.17 Applications of Machine Learning.
Supervised Learning - I
2.1 Simple Linear Regression Multiple Linear Regression
2. 2.3 Polynomial Regression
2.3 Evaluating Regression Models
2.4 Model Selection, Bagging, Ensemble Methods.
Supervised Learning - II
3.1 Classification: Logistic Regression , Decision Tree Regression and
Classification
3.
3.2 Random Forest Regression and Classification
3.3 Support Vector Machine Regression and Classification
3.4 Evaluating Classification Models.
Unsupervised Learning
4.1 Clustering: K-Means Clustering, Density-Based Clustering
4.
4.2 Dimensionality Reduction
4.3 Collaborative Filtering.
Association Rule Learning and Reinforcement Learning
5.1.Association Rule Learning, Apriori
5.
5.2 Reinforcement Learning, Upper Confidence
5.3 Deep Learning
Total
Text books:
1. Machine Learning by Tom M. Mitchell, McGraw-Hill
Reference Books:
1. Machine Learning: The art and Science of Algorithms that make sense of Data by Peter Flach
Page 85 of 95
PROGRAM ELECTIVE-4
Subject Title: NATURAL LANGUAGE Credit: 4
PROCESSING
Theory:
RATIONALE/AIM:
Natural language processing deals with written text. Students will learn how to process written text from basic of
fundamental knowledge starts with Finite automata, Regular expression and probabilistic model with n-grams. This
course also covers basis of semantic analysis and discourse analysis and drives it to machine translation. This NLP
course will boost student knowledge to research level where they can conduct new level of research.
COURSE OUTCOME
1. Define natural language processing
2. Demonstrate the state-of-the-art algorithms and techniques for text-based processing of natural language
with respect to morphology
3. Apply POS tagging for a given natural language and select a suitable language modelling technique based
on the structure of the language
4. Analyse semantics of language for text processing
5. Demonstrate understanding of the language generation techniques and develop current methods for
statistical approaches to machine translation.
SUBJECT CONTENTS
ALLOCATED(HRS)
INTRODUCTION TO NATURAL LANGUAGE PROCESSING (NLP):
1.1Introduction, History, Components, NLP Phases, Applications
1.
1.2 Ambiguity and Uncertainty in Language.
MORPHOLOGICAL ANALYSIS
2.1 Regular Expressions, Basic Regular Expression Patterns, Regular
2. Grammar, Finite State Automata, DFA
2.2 Types of Morphemes, Inflectional Morphology, Derivational
Morphology, Finite-State Morphological Parsing, Porter Stemmer
WORD LEVEL AND SYNTACTIC ANALYSIS
3.1 N-grams Models of Syntax - Counting Words - Unsmoothed N-
grams
3.
3.2 Part of Speech Tagging-Rule Based Part of Speech Tagging -
Stochastic Part of Speech
Tagging - Transformation-Based Tagging
SEMANTICS ANALYSIS
4.1 Elements- Hyponymy, Homonymy, Polysemy, Synonymy,
Antonymy. Building Blocks of Semantic System
4.
4.2 Lexical semantics and word-sense disambiguation.
Compositional semantics. Semantic Role Labeling and Semantic
Parsing.
Page 86 of 95
LANGUAGE GENERATION AND DISCOURSE ANALYSIS
5.1 Discourse, Reference Resolution, Text Coherence, Discourse
Structure, Psycholinguistic Studies of Reference and Coherence
5. 5.2 Language Generation: Architecture, Surface Realizations,
Discourse Planning
5.3 Machine Translation: Transfer Metaphor, Direct Translation,
Statistical Techniques
TEXTBOOKS: 1.
Christopher D. Manning and Hinrich Schutze, Foundations of Natural Language Processing, 6th Edition, The MIT
Press Cambridge, Massachusetts London, England, 2003
REFERENCE BOOKS
1. Nitin Indurkhya and Fred J. Damerau, Handbook of Natural Language Processing
2.Daniel Jurafsky and James H. Martin “Speech and Language Processing”, 3rd edition, Prentice Hall, 2009.
Page 87 of 95
SYLLABUS OPEN ELECTIVE-3 3 HRS/WEEK 15 CYCLES PER SEMESTER
OPEN ELECTIVE-3 Human to
Machine Interaction
Subject Code: OE302 Semester: SIXTH
60 Marks. 40 Marks.
Theory: Theory:
RATIONALE/AIM: The objective of this course is to iintroduce the foundations of Human Computer Interaction,
design technologies and user interface design and development. Learn the foundations of Human Computer
Interaction and to learn the guidelines for user interface design and development
COURSE OUTCOME
1. Develop meaningful user interface
2. Assess the importance of user feedback
3. Design effective HCI for individuals and persons with disabilities
4. Develop storyboard and design prototype
5. Design GUI, Web UI and Reports
SUBJECT CONTENTS
ALLOCATED(HRS)
Foundations of HCI The Human:
1.1. I/O channels, Memory, Reasoning and problem solving;
1.2. The computer: Devices, Memory, processing and
1
networks;
1.3. Interaction: Models, frameworks, Ergonomics, styles,
elements, interactivity, Paradigms
Design Rules and Techniques
2.1. Interactive Design basics:
process, scenarios, navigation, screen design, Iteration
and prototyping.
2
2.2. Usability engineering, Prototyping in practice, design
rationale.
2.3. Design rules: principles, standards, guidelines, rules.
2.4. Evaluation Techniques, Universal Design
Models and Theories
3.1. Cognitive models, Socio-Organizational issues and stake
3 holder requirements;
3.2. Communication and collaboration models-Hypertext,
Multimedia and WWW
Mobile HCI Mobile Ecosystem
4.1. Platforms, Application frameworks,
4.2. Types of Mobile Applications: Widgets, Applications,
4
Games;
4.3. Mobile Information Architecture, Mobile 2.0,
4.4. Mobile Design: Elements of Mobile Design, Tools.
Page 88 of 95
Web Interface Design
5.1. Designing Web Interfaces: Drag & Drop, Direct Selection,
5
Contextual Tools, Overlays, Inlays and Virtual Pages,
Process Flow
Total Hours
Textbooks:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale; Human Computer Interaction; Pearson Education, 2004
(UNIT I,II and III), 3rd Edition.
2. Brian Fling; Mobile Design and Development , O’Reilly Media Inc., 2009 (UNIT –IV)
Reference Books:
5. Bill Scott and Theresa Neil ; Designing Web Interfaces; OReilly, 2009 (UNIT V), First Edition
Page 89 of 95
SYLLABUS OF OPEN ELECTIVE-3 HRS/WEEK 15 CYCLES PER SEMESTER
OPEN ELECTIVE-3 NETWORK
FORENSICS
Subject Code: OE302 Semester: SIXTH
Theory:
RATIONALE/AIM: This course is mandated to define basics of digital forensics along with some of security issues
of network communications. Use of network forensics tools and techniques for evaluation network forensics
investigation is also to be prescribed to the students.
1. Analyse the Network vulnerabilities.
2. Examine methodologies for network forensics identification.
3. Apply tools and techniques for network vulnerabilities finding.
4. Evaluate procedure for network forensics investigation.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction to Network Forensics
1.18 Review of Networking concepts and Protocols,
1.
1.19 Terminologies to Network Forensics, various aspects of
Network Forensics
Network Forensics Tools
2.1 Introduction to Network Forensic Tools and techniques.
2. 2.2 Wireshark, TCP Dump, Syslog, NMS,
2.3 Promiscuous Mode, Network Port Mirroring
2.4 Snooping, Scanning tools.
Network Forensics in OSI layer
3.1 Use of Logs, MAC tables and ARP in Network Forensics.
3.2 Understanding and Examining Data Link Layer.
3.3 Understanding and Examining Physical Layer and Ethernet
3.
Switch
3.4 Understanding and Examining Network Layer.
3.5 Router Logs, WiFi Device logs
3.6 Firewall logs
Network Forensics in OS and Application
4.1 Understanding audit features of OS and applications.
4. 4.2 Enabling and Examining Server logs.
4.3 User activity logs, Browser history analysis
4.4 Proxy server logs, Antivirus logs, Email logs
Challenges of Network Forensics
5.1 Limitations and challenges of network forensics due to
5. encryption.
5.2 Challenges due to spoofing, mobility, storage limitations.
5.3 Cyber Security and Privacy laws.
Page 90 of 95
Total Hours
Textbooks:
1. Learning Network Forensics by Samir Datt, PACKT Publications.
2. Digital Forensic: The Fascinating World of Digital Evidences by Nilakshi Jain (Author), Dhananjay R.
Kalbande, WILEY publications.
References:
1. Network Forensics By Ric Messier, WILEY publications.
2. Introduction to Security and Network Forensics by William J. Buchanan, CRC press publications.
Page 91 of 95
SYLLABUS OF INDIAN CONSTITUTION-2 HRS/WEEK 15 CYCLES PER SEMESTER
Subject Title: INDIAN CONSTITUTION Credit: 00
Subject Code: AU302 Semester: SIXTH

Theory:
1. Understand constitution and its functionaries
SUBJECT CONTENTS
ALLOCATED(HRS)
The Constitution - Introduction
• The History of the Making of the Indian Constitution
• Preamble and the Basic Structure, and its
1. interpretation
• Fundamental Rights and Duties and their
interpretation
• State Policy Principles
Union Government
• Structure of the Indian Union
2. • President – Role and Power

• Prime Minister and Council of Ministers
• Lok Sabha and Rajya Sabha
State Government
• Governor – Role and Power
3.
• Chief Minister and Council of Ministers
• State Secretariat
Local Administration
• District Administration
4.
• Municipal Corporation
• Zila Panchayat
Election Commission
• Role and Functioning
5. • Chief Election Commissioner
• State Election Commission
Page 92 of 95
Total Hours
Textbooks:
Ethics and Politics of the In- dian Constitution, Rajeev Bhargava, Oxford University Press, New Delhi,
2008
The Constitution of India, B.L. Fadia, Sahitya Bhawan; New edition (2017)
Introduction to the Consti- tution of India, DD Basu Lexis Nexis; Twenty-Third 2018 edition
Page 93 of 95
SYLLABUS OF ENTREPRENEURSHIP AND START-UPS -4 HRS/WEEK 15 CYCLES PER SEMESTER
ENTREPRENEURSHIP AND
START-UPS
Subject Code: HS302 Semester: SIXTH
Theory:
Rationale:
1. Understanding the dynamic role of entrepreneurship and small businesses
2. Organizing and Managing a Small Business
3. Financial Planning and Control
4. Forms of Ownership for Small Business
5. Strategic Marketing Planning
6. New Product or Service Development
7. Business Plan Creation
1. Acquiring Entrepreneurial spirit and resourcefulness.
2. Familiarization with various uses of human resource for earning dignified means of living.
3. Understanding the concept and process of entrepreneurship - its contribution and role in the
growth and development of individual and the nation.
4. Acquiring entrepreneurial quality, competency, and motivation.
5. Learning the process and skills of creation and management of entrepreneurial venture.
SUBJECT CONTENTS
ALLOCATED(HRS)
Introduction to Entrepreneurship and Start – Ups
• Definitions, Traits of an entrepreneur,
1. Intrapreneurship, Motivation
•
Types of Business Structures,
Similarities/differences between entrepreneurs
and managers.
Business Ideas and their implementation
• Discovering ideas and visualizing the business
2. • Activity map
• Business Plan
Idea to Start-up
• Market Analysis – Identifying the target
3. market,
• Competition evaluation and Strategy
Development,
Page 94 of 95
• Marketing and accounting,
• Risk analysis
Management
• Company’s Organization Structure,
4.
• Recruitment and management of talent.
• Financial organization and management
Financing and Protection of Ideas
• Financing methods available for start-ups in
India
5.
• Communication of Ideas to potential investors
– Investor Pitch
• Patenting and Licenses
Exit strategies for entrepreneurs, bankruptcy, and succession
6.
and harvesting strategy
Total Hours
Textbooks:
1. The Startup Owner’s Manual: The Step-by-Step Guide for Building a Great Company Steve Blank
and Bob Dorf K & S Ranch, ISBN – 978-0984999392
2. The Lean Startup: How Today’s Entrepreneurs Use Continuous Innovation to Create Radically Successful
Businesses Eric Ries Penguin UK,ISBN – 978-0670921607
3. Demand: Creating What People Love Before They Know They Want It Adrian J. Slywotzky with Karl
Weber Headline Book Publishing, ISBN – 978-0755388974
4. The Innovator’s Dilemma: The Revolutionary Book That Will Change the Way You Do Business Clayton
M. Chris- tensen
Page 95 of 95

CCCT DCST FINAL_2023_230710_104219_230710_104440

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CCCT DCST FINAL_2023_230710_104219_230710_104440

Uploaded by

Copyright:

Available Formats

STATE BOARD OF TECHNICAL EDUCATION

STATE BOARD OF TECHNICAL EDUCATION

I, the undersigned, do hereby authenticate the syllabus revision of Diploma in Computer

1 Hr. Lecture (L) per week 1 credit

1 Hr. Tutorial (T) per week 1 credit

1 Hr. Practical (P) per week 0.5 credit

2 Hours Practical (P) per week 1 credit

Course code and definition:

Course code Definitions

HS Humanities & Social Sciences Courses

BS Basic Science Courses

ES Engineering Science Courses

PC Program Core Courses

PE Program Elective Courses

OE Open Elective Courses

Hours per Week Credits

1 COPC201 Computer Programming 2 0 0 2 III

Scripting Languages (Python,

3 COPC205 Data Structures 2 0 0 2 III

4 COPC207 Computer System Organisation 3 1 0 4 III

5 COPC209 Algorithms 3 1 0 4 III

7 COPC213 Scripting Languages Lab 0 0 4 2 III

8 COPC215 Data Structures Lab 0 0 2 1 III

9 COPC202 Operating Systems 2 0 0 2 IV

10 COPC204 Introduction to DBMS 2 0 0 2 IV

11 COPC206 Computer Networks 2 0 0 2 IV

12 COPC208 SSAD/Software Engineering 3 0 0 3 IV

13 COPC210 Web Technologies 2 0 0 2 IV

14 COPC212 Operating Systems Lab 0 0 2 1 IV

Introduction to DBMS Lab

16 COPC216 Computer Networks Lab 0 0 2 1 IV

17 COPC218 Web Technologies Lab 0 0 2 1 IV

18 COPC301 Introduction to e-Governance 2 1 0 3 V

Hours per Week Credits

1 COPE301/302 Mobile Computing 3 0 2 4

2 COPE303/304 Multimedia Technologies 3 0 2 4

4 COPE307/308 Advance Computer Networks 3 0 2 4

5 COPE309/310 Information Security 3 0 2 4

6 COPE311/312 Network Forensics 3 0 2 4

Data Sciences: Data Warehousing and

FOSS (Free and Open-Source Software)

9 COPE317/318 Software Testing 3 0 2 4

Hours per week Credits

1 **OE### Economic Policies in India 3 0 0 3

2 **OE### Artificial Intelligence & Machine Learning 3 0 0 3

3 **OE### Soft Computing Techniques 3 0 0 3

4 **OE### Project Management 3 0 0 3

5 **OE### Renewable Energy Technologies 3 0 0 3

6 **OE### Energy Conservation & Audit 3 0 0 3

7 **OE### Product Design 3 0 0 3

8 **OE### Engineering Economics & Accountancy 3 0 0 3

9 **OE### Operations Research 3 0 0 3

10 **OE### Renewable Energy Technologies 3 0 0 3

11 **OE### Energy Efficiency and Audit 3 0 0 3

**OE### Web Designing and Multimedia

13 **OE### History of Science and Engineering 3 0 0 3

14 **OE### Internet of Things 3 0 0 3

15 **OE### Professional Orientation 3 0 0 3

16 **OE### Disaster Management 3 0 0 3

17 **OE### Sustainable Development 3 0 0 3

18 **OE### Smart Systems 3 0 0 3

20 **OE### Introduction to E-Governance 3 0 0 3

21 **OE### Cyber Security Laws, Standards and IPR 3 0 0 3

22 **OE### Organic and Natural Farming Practices 3 0 0 3