COMPLETE Syllabus

GITA AUTONOMOUS COLLEGE
BHUBANESWAR
CURRICULUM
&
DETAILED SYLLABUS
TWO-YEAR POST-GRADUATE PROGRAM

MASTER OF COMPUTER APPLICATION (MCA)
ADMISSION BATCH
2023-2024
DEPARTMENT OF MCA
Vision
To foster prosperity through technological development by means of education, innovation
and collaborative research and emerge as a premier technical institution in India.
Mission
1. To impart quality professional education to students from around the country, so as to nurture
innovations, technological advances, discipline and moral ethics.
2. To provide broad based education where students are urged to develop their professional skills.
3. To draw the best expertise in science, technology and management to impart overall training to
students in visualizing, synthesizing and executing projects.
4. To incubate a spirit of entrepreneurship and innovation in our students.
5. To undertake sponsored research and provide consultancy services in industrial, educational and
other relevant areas of the society.
Departmental Vision
To impart high quality result oriented technical education that enable the students to meet the
global needs/challenges and to emerge as a centre of excellence in the area of Information
Technology.
Departmental Mission
1. To mould the students with sound theoretical and practical knowledge in computing
applications.
2. To produce industrious and ethically upright professionals.
3. To develop innovative thinking and research culture among students.
Approval History
Date Resolutions
The curriculum structure and detailed syllabus of 1st Year & 2nd Year as
proposed by the Boards of Studies is approved by the Academic Council.
The curriculum structure and detailed syllabus approved by Governing
body members.
Program Outcomes
Graduates Attributes (GAs) form a set of individually assessable outcomes that are the components
indicative of the graduate’s potential to acquire competence to practice at the appropriate level. The
National Board of Accreditation (NBA) has defined Program Outcomes (POs) for UG Engineering
programmes, but not for the MCA programme. Silicon Institute of Technology has defined POs for
MCA programme in line with NBA, so that the outcomes can be assessed in a similar manner to UG
programmes. The Program Outcomes for MCA programme are given below:
PO1. Apply knowledge of computing fundamentals, mathematics and domain knowledge appropriate
for computing models from defined problems and requirements.
PO2. Design and develop applications to analyze and solve all computer science related problems.
PO3. Design applications for any desired needs with appropriate considerations for any specific need
on societal and environmental aspects.
PO4. Analyze and review literature to invoke the research skills to design, interpret and make
inferences from the resulting data. PO5. Integrate and apply efficiently the contemporary IT tools to
all computer applications.
PO6. Solve and work with a professional context pertaining to ethics, social, cultural and cyber
regulations.
PO7. Function effectively both as a team leader and team member on multi disciplinary projects to
demonstrate computing and management skills.
PO8. Communicate effectively and present technical information in oral and written reports.
PO9. Ability to understand the impact of system solutions in a contemporary, global, economical,
environmental, and societal context for sustainable development.
PO10. Appreciate the importance of goal setting and to recognize the need for life-long learning.
Program Educational Objectives (PEOs)

PEO1. Develop software solutions to problems across a broad range of application domains through
analysis and design.
PEO2. Work professionally and communicate effectively in interdisciplinary environment, either
independently or in team, and demonstrate leadership in academia and industry.
PEO3. Utilize computational techniques and develop software by integrating existing technologies
and adapt to new technologies for building rich software applications for benefit of the society.
Program Specific Outcomes (PSOs)

PSO1. Develop and apply the concepts of Computer application in various fields like Web designing
and development, Mobile application development, and Network & communication technologies.
PSO2. Apply standard practices and strategies in software development & project development using
open-ended programming environments to deliver quality applications for business success.
PSO3. Employ modern computer languages, technologies, environments, and platforms in creating
innovative career paths to be an entrepreneur, and a zest for higher studies.
Course Types & Definitions
L Lecture
T Tutorial
P Laboratory / Practical / Sessional
BS Basic Sciences
LC Laboratory Courses
HS Humanities & Social Sciences (including Management)
ES Engineering Sciences
PC Professional Core
PE Professional Elective
OE Open Elective
MC Mandatory Course
OO Massive Open Online Course (MOOC) - Self Study
PI Summer Internship / Industry Internship / Project Work / Seminar
VV Viva Voce
FIRST SEMESTER
THEORY
SL. TYPE SUBJECT
SUBJECT L T P CREDI
NO. CODE TS
01 ES MCAT101 Programming in ‘C’ 3 - - 3
Computer Organization and
02 PC MCAT102 3 - - 3
Architecture
03 BS MCAT103 Discrete Mathematics 3 - - 3
04 PC MCAT104 Database Management System 3 - - 3
05 PC MCAT105 Operating Systems 3 - - 3
06 PC MCAT106 Personality & Soft Skill Development- 4 - - 2
I
07 PC MCAT107 Employability Skill – I 1
PRACTICAL
‘C’ Programming Lab
08 P MCAP101 - - 4 2
09 P MCAP102 Database Management System Lab - - 4 2
10 P MCAP103 Operating Systems Lab - - 4 2
TOTAL 24
SECOND SEMESTER
THEORY
SL. TYPE SUBJECT
SUBJEC L T P CREDITS
NO. CODE T
01 ES MCAT201 Data Structure 3 - - 3
02 PC MCAT202 Computer Network 3 - - 3
03 PC MCAT203 Artificial Intelligence & Machine 3 - - 3
Learning
04 ES MCAT204 Object Oriented Programming 3 - - 3
using JAVA
05 PC MCAT205 Software Engineering 3 - - 3
06 PC MCAT206 Personality and Soft Skill 3 - - 2
Development- II
07 PC MCAT107 Employability Skill – II 3 - - 1
08 PC MCAT207 Universal Human Value 2 - - 1
PRACTICAL
09 LC MCAP201 Data Structure Lab - - 4 2
10 P MCAP202 Computer Network Lab - - 4 2
11 P MCAP203 AI & ML Lab using Python - - 4 2
12 P MCAP204 Java Programming Lab - - 4 2
13 P MCAP205 Software Engineering Lab - - 4 2
TOTAL 29
THIRD SEMESTER
THEORY
SL. TYPE SUBJECT
SUBJEC L T P CRED
NO. CODE T ITS
01 PC MCAT301 Internet and Web Technology 3 - - 3
02 HS MCAT302 Data Mining and Data Warehousing 3 - - 3
03 ES MCAT303 Design and Analysis of Algorithm 3 - - 3
04 Elective – I 3 - - 3
OE MCAT304 Information Security and
Management
OE MCAT305 Computer Graphics & Multimedia
OE MCAT306 Natural Language Processing
OE MCAT307 Cloud Computing
OE MCAT308 Dot Net Programming
OE MCAT309 Internet of Things
05 Elective–II (To be opted from 3
NPTEL MOOC Pool)
PRACTICAL
06 P MCAP301 Internet and Web Technology Lab - - 4 2
07 P MCAP302 Design and Analysis of Algorithms 2
Lab
08 P MCAP303 Data Mining and Data Warehousing - - 4 2
Lab
09 PI MCAP304 Minor Project/Internship & Viva - - 4 2
TOTAL 23
FOURTH SEMESTER
The entire fourth semester is devoted to practice orientation and training. During the semester
students have to undertake compulsory project-oriented training for 90 days and submit a
project report based on the work done for evaluation. Each student has to arrange summer
training/internship in Industry or Educational Institute for 2 to three months duration or
research work followed by depositing a project report and presentation in fourth semester. All
students should appear the Project Viva.
SESSIONALS
SL. TYPE SUBJECT
SUBJECT L T P CREDITS
NO. CODE
01 PI MCAP401 Industrial Training cum Project / - - - 12
Research project
02 VV Viva Voce - - - 02
TOTAL 14
CREDIT DISTRIBUTION
Semester Semester Semester Semester Total
1 2 3 4
24 29 23 14 90
Internal Evaluation Scheme
Assignment 05
Quiz and Surprise Test 05
Regularity & Punctuality 05
Mid Semester Exam. 25
End Semester Exam. 60
Total 100
Practical/Sessional Evaluation Scheme
Practical and its assessments:

Experiment (work) planning and execution -20
Results and interpretation -30
Report -30
Understanding on the theory related viva-voce to experiment -20
-----------------------------------------------------------------------------------
Total Marks =100
DETAILED SYLLABUS
FIRST SEMESTER
1st L-T-P
MCAT101 PROGRAMMING IN ‘ C’ Credit 3
Semester 3-0-0
Evaluation Scheme
Teacher’s Assessment Written Assessment Total

Quiz Surprise Test(s) Assignment(s) Mid-Term End-Term
05 05 05 25 60 100
UNIT – I (08 hours)

C Language Fundamentals: Introduction to C, Algorithms, Flowcharts, Character set,
Identifiers, keywords, data types, Constants and variables, statements, expression, operators,
precedence of operators, Input-output process, type conversion and type casting.
UNIT – II (08 hours)

Decision Control and Looping Statements: Conditional branching statements, if, if-else, if-
else-if, switch case, control statements, control structures, while loop, do-while loop, for loop,
nested loops, break and continue statements, goto statement.
UNIT – III (08 hours)

Arrays and Strings: Declaration of array, accessing elements of an array, sorting values in
arrays, bubble sort, linear search, operations on array, traversal, insertion, deletion, two
dimensional arrays, declaring strings, reading and writing strings, string manipulation
functions.
UNIT – IV (08 hours)

Functions: Introduction to functions, function declaration/ function prototypes, function
definition, function call, return statement, passing parameters to functions, scope of variables,
storage class, recursive functions.
Handling Pointer: Concepts on pointers, Declaration of pointer , Pointer arithmetic, Pointer &
Arrays , Array of pointers ,Dynamic memory allocation.
UNIT – V (08 hours)

Structures, Union and Enumerated data types: Structure declaration, typedef declaration,
accessing members of structures, self- referential structures, unions, enumerated data types,
Basic File Handling functions.
File Handling : Concepts of file , Opening and Closing of file , Input/ Output operations in
file, Random access in file.
Course Outcomes:
CO1: To formulate simple algorithms for arithmetic and logical problems.
CO2: To translate the algorithms to programs (in C language).
CO3: To test and execute the programs and correct syntax and logical errors.
CO4: To implement conditional branching, iteration and recursion.
CO5: To use arrays, pointers and structures to formulate algorithms and programs.
CO7: To apply programming to solve simple numerical method problems
Text Books:
1. E. Balagurusamy, Programming in ANSI ‘C’, 8th Edition, Tata McGraw Hill,2019.

2. Reema Thareja, Data Structures Using C, 2ndEdition, Oxford University Press,2014.
Reference Books:
1. M. Tanenbaum, “Data Structures using C&C++”,Prentice-Hall of India Pvt. Ltd.
2. A.K.Rath and A. K. Jagadev, “Data Structures and Program
Designusing C”, 2nd Edition, SciTech Publications,2011.
3. Bruno R Preiss, “Data Structures and Algorithms with Object Oriented
Design Pattern in C++”, John Wiley & Sons, Inc.,1999.
4. Horowitz and Sahani, “Fundamentals of data Structures”,Galgotia Publication
Pvt. Ltd.
1st COMPUTER ORGANIZATION AND L-T-P

MCAT102 Credit 3
Semester ARCHITECTURE 3-0-0
Evaluation Scheme

05 05 05 25 60 100

Fundamentals of Digital Electronics: Number systems, Floating Point Arithmetic, Error
Detection and Correction, Boolean algebra, Minimization techniques, Sum of min terms,
Product of max terms, Simplification using Karnaugh’s Map (up to 4 variables),
Combinational Circuits, Sequential Circuits, Shift Register, Counters, Design of Combinational
and SequentialCircuits.

Basic Computer Organization and Design: Von Neumann Architecture, Instruction codes,
Computer registers, Computer instructions, Timing and Control, Instruction cycle, Memory-
Reference Instructions, Input-output and interrupt, Design of Basic computer, Design of
Accumulator Unit.

Central Processing Unit: Introduction, General Register Organization, Stack Organization,
Instruction format, Addressing Modes, Data transfer and manipulation, Program Control,
Reduced Instruction Set Computer (RISC), Pipeline Processing, Parallel Processing.
Input-Output organization: Peripheral Devices, I/O output interface, Asynchronous data

transfer, Modes of transfer, Priority Interrupt, DMA, Input output Processor, Serial
Communication.
Memory Organization: Memory Hierarchy, Main Memory, Cache Memory.

Programming the Basic Computer: Introduction, Machine Language, Assembly Language, the
Assembler, Program loops, Programming Arithmetic and Logic Operations, Subroutines, I-O
Programming, Ten Advanced Optimization of Cache Performance, Memory Technology and
Optimization, Protection, Crosscutting Issues, Memory Hierarchies in the ARM Cortex-A8 and
Intel Core i7.
Course outcomes:
CO1: To draw the functional block diagram of single bus architecture of a computer.
CO2: To describe the function of the instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set.
CO3: To know the design concept of Control unit and operation of ALU.
CO4: To Analyze cache performance, cache optimizations, memory technologies, Protection via
virtual memory and virtual machine.
CO5: To assess the performance of a given CPU organization, and apply design techniques to
enhance performance using pipelining and parallelism.
Text Books:
1. Mano M Morris, Computer System Architecture, 3rd Edition (Updated), Pearson,2016.
2. William Stallings, Computer Organization and Architecture: Designing
for Performance, 9th Edition, Pearson,2013.
Reference Books:
1. Hamacher, Computer Organization, 5th Edition, Mc Graw Hill Education,2011.

2. John P Hayes, Computer Architecture and Organization, 3rd Edition, Mc Graw Hill
Education,2017.
1st L-T-P
MCAT103 DISCRETEMATHEMATICS Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 hours)

Sets and Proposition:
Basics: Finite and Infinite Sets, Combinations of Sets, Multisets, Venn Diagrams.
Propositional Logic: Propositions and Logical Operations, functionally complete set of
connectives, Well Formed Formulas, Laws of equivalence, Normal forms, Predicate calculus,
Inference Theory.
Notion of Proof: Direct and Indirect Proof, Inductive proofs.
UNIT-II (08 hours)

Relations and Functions, Counting Techniques:
Relations: Properties of Relations, Matrices of relations, Closure operations on relations,
Equivalence Relations, Computer Representation of Relations, Partial Ordering Relations and
Lattices, Properties of Lattices, Hasse Diagram of partially ordered set.
Functions: Introduction to functions and its types, Function for Computer Science, Discrete
numeric Functions, Composition of Functions, Invertible Functions, Recursive Functions,
Generating functions.
Counting- Basics of Counting Techniques, Pigeonhole Principle, Generalized Permutations
and Combinations, Recurrences Relations.
UNIT-III (08 hours)

Graph Theory- Basic Concept of Graph Theory and Terminology, representation of Graphs,
Bipartite, Regular, Planar and connected graphs, reachability and connectedness.
Matrix representation of graphs, Storage representation and manipulation of graphs, Euler
graphs, Hamiltonian path and circuits, graph traversals, shortest path in weighted graphs,
Graph Isomorphism andHomomorphism.
UNIT-IV (08 hours)

Group Theory:
Algebraic Structures: Definition, Properties, Types: Semi Groups, Monoid, Groups, Abelian
group, Subgroup, cyclic groups, Factor group, Permutation groups, Normal subgroup, Cosets
and Lagrange’s Theorem, Homomorphism and Isomorphism of Groups.
UNIT-V (08 hours)

Boolean Algebra: Boolean Functions, Representing Boolean Functions, Principal of Duality,
Design and Implementation of Digital Networks, Karnaugh maps.
Coding Theory: Codes and Group codes, Error detection and correction using Group codes,
Hamming Code.
Course Outcomes:
CO1: Use logical notation
CO2: Perform logical proofs
CO3: Apply recursive functions and solve recurrence relations
CO4: Determine equivalent logic expressions
CO5: Describe useful standard library functions, create functions, and declare parameters
CO6: Use graphs and trees
CO7: Apply basic and advanced principles of counting
CO8: Define sets and sequences
CO9: Calculate discrete probabilities.
Text Books:
1. C. L. Liu, D. P. Mohapatra, Discrete Mathematics: A Computer Oriented Approach,

4th Edition, McGraw-Hill Education (India) Private Limited, New Delhi, 2013.
2. K. E. Rosen, “Discrete mathematics and its applications”, McGraw Hill International,
7th Edition,2011.
Reference Books:
1. B. Kolman, R. C. Busby, S. Ross, “Discrete Mathematical Structures”, Prentice Hall of

India, 6th. Edition, 2010.
2. S. Lipschutz, Discrete Mathematics, Tata McGraw Hill, 2nd. Edition,2005
3. Richard Johnson bough, “Discrete Mathematics”, Pearson Education, 8th. Edition, 2018.
4. T. Veerarajan," Discrete Mathematics “. Tata McGrawHill,2012.
1st L-T-P
MCAT104 DATABASE MANAGEMENT SYSTEM Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100

Introduction to database system, Overview of DBMS Data Abstraction & Three level architecture
for a DMS, Instance, schema & Data Independence, Data model, Database language, Database
Users and User Interface, Database Administrator

Basic of ER-model, Database constraints & key attribute, Modelling using ER- diagram Extended E-
R features, Relational model structure, Mapping of E-R model into Relational database design, keys,
Integrity constraints (referential, domain), Relational Algebra basic operations, Relational Algebra
derived operations, Relational Algebra functions, Queries on relational algebra

Introduction to normalization, Functional dependency, Armstrong axioms, Anomalies in database
design & Normalization, closures, first normal form,2ndNormal form,3rd normal form, BCNF,
Lossless and lossy decomposition, fourth and fifth normal form.
UNIT-IV (08 hours)

Introduction to SQL, SQL statement types, DDL & DML, CONCEPT OF DCL & TCL, SQL
operations (set, aggregate, constraint’s view etc….), SQL operations, PL- SQL, Cursor, Trigger.
UNIT-V (08 hours)

introduction to Transaction processing concept, ACID properties, States of transaction,
Serializability, Concurrency Control, locking, Dead lock & Deadlock prevention, recovery
Management, Data Ware housing, Data Mining.
Course outcomes:
CO1: Differentiate the database concepts from conventional file storage system and describe
DBMS architecture, relational, hierarchical and network database models
CO2: Analyze application data using E-R modelling and describe the logical and physical
database designs.
CO3: Understand relational algebra, calculus and apply structured query language (SQL) for
database definition and manipulation.
CO4: Demonstrate an understanding of normalization theory and apply such knowledge to the
normalization of a database.
CO5: Use transaction management systems and recover methods.
Text Books:
1. R. Elmasri and S. B. Navathe, Fundamentals of Database Systems, Pearson Education,

Inc., 7th Edition,2015.
2. Silberschatz, H. F. Korth and S. Sudarshan, Database System Concepts, Tata McGraw-
Hill, 6th Edition, 2011.
1st L-T-P
23MCAT105 OPERATING SYSTEMS Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 hours)
Introduction: Evolution of operating systems, Types of operating systems, Different views of
the operating systems, Operating system concepts and structures.
Processes: The process concept, system programmer's view of processes. The operating
system's view of processes, operating system services for process management, scheduling
algorithms, Performance evaluation.
UNIT-II (08 hours)

Inter-process Communication and Synchronization: The need for inter-process
synchronization, Mutual exclusion, Semaphores, Classical problems in concurrent
programming, Critical region, Monitors.
Deadlock: Deadlock criteria, prevention, avoidance, detection and recovery algorithms.
UNIT-III (08 hours)

Memory Management: Contiguous memory allocation, Swapping, paging and segmentation,
virtual memory, Page replacement algorithms. Design issues for paging systems,
Segmentation.
UNIT-IV (08 hours)

Principles of I/O Hardware and software: I/O devices, Device controllers, Principles of I/O
Software, Interrupt handlers, Device drivers, Device independent I/O software, User space I/O
software.
UNIT-V (08 hours)

File Systems: File systems, Directories, File system implementation, Security & protection
mechanisms.
Disks: Disk hardware, scheduling algorithms, Error handling, track-at-a-time caching, RAM
Disks.Clock hardware, Clock software.
Terminals: Terminal hardware & software, Memory-mapped terminals, I/O Software.
Course Outcomes:
CO1: Understand fundamental operating system abstractions such as processes, threads, files,
semaphores,IPC abstractions, shared memory regions, etc.
CO2: Analyze important algorithms eg. Process scheduling and memory management algorithms.
CO3: Categorize the operating system’s resource management techniques, dead lock
management techniques, memory. management techniques.C5.
CO4: Demonstrate the ability to perform OS tasks in Red Hat Linux Enterprise.
Text Books:
1. Silberschatz& Galvin, Operating system concepts, 9th Edition, Wiley,2018.

2. D. M. Dhamdhere , Operating Systems a Concept Based Approach, 3rd Edition,
McGraw Hill Education,2017.
Reference Books:
1. P. C. Bhatt, An Introduction to Operating Systems: Concepts & Practice, 4th

Edition, Prentice Hall of India,2013.
2. Andrew S Tanenbaum and Albert S Woodhull, Operating System Design &
Implementation, 3rd Edition, Pearson Education,2015.
3. William Stallings, “Operating Systems Internals & Design Principles”, Pearson
Education
4. Naresh Chauhan, “Principles of Operating Systems”, Oxford India Publications
5. Pabitra Pal Choudhury, “Operating System Principles and Design”, PHI
Publication
1st PERSONALITY AND SOFTSKILL L-T-P

MCAT106 Credit 2
Semester DEVELOPMENT – I 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

Effective Reading Skills: Process of Reading, Global and Local Comprehension, Sub skills of
Skimming, Scanning, Inferencing, Guessing word-meaning, Using appropriate speed for various
kinds of reading. Correction of Reading faults of Eye-fixation, Regression, Finger-pointing, Sub-
vocalising, Reading aloud, and indiscriminate use of the Dictionary. The module will acclimatize
students with short stories of R. K Narayan, which will enable them to understand the nuances of
reading and comprehension.
UNIT-II (08 Hours)

Nitty Gritty of Writing in English : Writing Process, Paragraph writing, Summarizing, Blogging,
Paraphrasing, Précis-writing, Essay writing and Reading Comprehension. The module will
familiarize students with the nitty gritty of writing in English by drawing from the referred text
books.
UNIT-III (08 Hours)

The Quintessence of Effective Pronunciation: Introduction to Phonetics: IPA, Received
Pronunciation, Phonetic and Non-Phonetic Writing Systems.
UNIT-IV (08 Hours)

IPA: Vowels and Consonants, MTI, Problem sounds; Stress, Intonation, Rhythm, Strong and Weak
forms. The module will familiarize students with the sounds of English language and help them to
use it in day-today situations.
UNIT-V (08 Hours)

Applied Grammar: Articles, Prepositions, Subject-Verb agreement, State and Event verbs, Modals
and Auxiliaries, Finite and Non-finite Verbs; Tenses; Vocabulary The student will get a better
understanding of the nuances and application of grammar and vocabulary in day-to-day usage.
Course Outcomes
CO1: Use English Language effectively in spoken and written forms
CO2: Comprehend the given texts and respond appropriately.
CO3: Communicate confidently in various contexts and different cultures.
CO4: Acquire basic proficiency in English including reading and listening comprehension, writing
and speaking skills.
CO5: Understand various principles of communication, its various stages and the role of audience
and purpose, deal with the barriers that affect communication in a professional set- up.
Text Books
1. Malgudi Days by R.K Narayan
2. The Submerged Valley and Other Stories by Manoj Das
Reference Books:
1. Real Writing with Readings by Susan Anker

2. Oxford modern English Grammar
3. English vocabulary in use (Michael MC Carthy)
1st L-T-P
23MCAT107 EMPLOYABILITY SKILL - I Credit 2
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

Quantitative: Aptitude Average, Age-Problem, Ratio Proportion, Ratio Cross Product Mixture
Allegation, Percentage.
UNIT-II (08 Hours)

Programming Logic: Understanding of Programming logic (tested though Pseudo
code) ,Variables ,Data types, Input and output code snippet (based on C),operators in C , control
structure, coding based on Loops, function, recursion, pointers , Command line Programming ,use of
online Compilers for automata round.
UNIT-III (08 Hours)

Logical Reasoning: Coding Decoding, Blood Relation, Direction Test, logical Verb-Diagram,
Ranking and Order.
UNIT-IV (08 Hours)

Coding Based Data Structure Introduction to Data structure using C, Dynamic memory allocation,
self-referential structure, stack based coding round questions, application of stack and Queue based
coding round question.
UNIT-V (08 Hours)

Simple Interest, Compound Interest. Sorting techniques, code (section, Bubble ,merge, insertion
quick etc),searching technique(linear And binary search) .
Course Outcomes:
CO1: To develop placement enabled programming skill according to industry pattern.
CO2: To develop quantitative and reasoning skill for recruitment.
CO3: To provide pre placement training for campus recruitment.
CO4: To provide specific short cut techniques to solve QAand LR problems with in stipulated time
CO5: To develop coding skill for medium level and difficult level automata round.
Text Books:
1.Teach Yourself Quantitative Aptitude, Mc Graw hill Arun Sharma, ,2nd edition
2. Comprehensive Guide for Campus Recruitment, Dheeraj Sharma, Test Wiley
Reference Books:
1. Programming in C. P. Dey and M Ghosh, Oxford University Press.

2. The Pearson guide to Quantitative Aptitude, Khattar, Pearson 3rd edition.
3. Programming for Problem solving, E Balaguruswamy, Mc graw Hill education 2019
PRACTICALS
L-T-
1st Credit
MCAP101 ‘C’ PROGRAMMING LAB P
Semester 2
0-0-2
Evaluation Scheme
Experiment (work) Results and Viva-voce to

Report Total
Planning and execution interpretation experiment
20 30 30 20 100
C programming: variables and expression assignment, Loop, if-else, Case statement, break,
continue, Single & Multidimensional arrays, Functions, recursion, file handling in C, Pointers,
address operator, declaring pointers and operations on pointers.
Stack: Problems of stack, evaluation of Arithmetic expressions in infix, prefix, and postfix
forms.
Queue: Problems on queues, circular queues, insertion and deletion on queues.
Searching and sorting algorithm: Problems on Binary Search, Quick sort, Bubble sort
Course Outcomes:
CO1: Read, understand and trace the execution of programs written in C language.
CO2: Develop programs using the basic elements like control statements, Arrays and String.
CO3: Implement Programs with pointers, and learn to use the pre-processors, command line
arguments etc.
CO4: Write the C code for a given algorithm
CO5: Write programs that perform operations using derived data types.
CO6: Write programs that perform various operations on files
L-T-
1st DATABASE MANAGEMENT SYSTEM Credit
23MCAP102 P
Semester LAB 2
0-0-2
Evaluation Scheme

Report Total
20 30 30 20 100
Creation of a database and writing SQL queries to retrieve information from the database,
Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based on
conditions, Creation of Views, Synonyms, Sequence, Indexes, save point, creating an Employee
database to set various constraints. Creating relationship between the databases, Study of
PL/SQL block, write a PL/SQL block to satisfy some conditions by accepting input from the
user, write a PL/SQL block that handles all types of exceptions. Creation of Procedures. Creation
of database triggers and functions.
Course Outcomes:
CO1: Apply the concept for database design, create database, and develop queries.
CO2: Implement different database programs using procedures, function, and cursor.
CO3: Implement database features such as triggers, packages etc.
CO4: Implement ODBC/JDBC connectivity with programming languages and write programs to
store and retrieve data by using queries.
CO5: Use transaction management systems and recovery methods.
1st L-T-P Credit

MCAP103 OPERATING SYSTEMS LAB
Semester 0-0-2 2
Evaluation Scheme

Report Total
20 30 30 20 100
Introduction to Linux OS and basic VI editor commands, Linux File Structure and advanced
Linux commands like grep, pipe, cut etc., Introduction to UNIX Shell Script: Arithmetic
Expressions, Relational & Conditional Operators, UNIX Shell Script: Looping, Case structure,
Process Creation, process handing, process signaling through fork(), exec(), CPU Scheduling
(Non-Pre-emptive) FCFS, SJF, Priority, CPU Scheduling (Pre-emptive) SRTF, RR, Priority-
based preemptive scheduling, Multi-Threaded application using POSIX threads,
Synchronization using Semaphore (Producer- Consumer, Reader-Writer), Message passing:
Pipe and Signals, Deadlock implementation
Course Outcomes:
CO1: Experiment with Unix commands and shell programming.
CO2: Build ‘C’ program for process and file system management using system calls.
CO3: Choose the best CPU scheduling algorithm for a given problem instance.
CO4: Identify the performance of various page replacement algorithms.
CO5: Develop algorithm for deadlock avoidance, detection and file allocation strategies.
SECOND SEMESTER
2nd L-T-P
MCAT201 DATA STRUCTURE Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

Introduction: Basic Terminology: Elementary data organizations, Data structures. Operations:
insertion, deletion, traversal etc. Analysis of an algorithm, Asymptotic notations, Time-Space
trade off. Searching: Linear Search and Binary Search Techniques and their complexity
analysis.
UNIT-II (08 Hours)

Stack and Queues: ADT stack and its operations: Algorithm and their complexity analysis,
Application of stacks: Expression, Conversion and Evaluation- Corresponding algorithms and
complexity analysis. ADT Queue, Types of Queues: Simple Queue, Circular Queue, Priority
Queue; Operations on each type of Queues: Algorithms and their analysis.
UNIT-III (08 Hours)

Linked Lists: Singly linked lists: Representation of memory, Algorithms of several operations:
Traversing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack
and Queue, Header nodes, Doubly linked list: Operations on it and algorithmic analysis;
Circular linked list: all operations their algorithms and the complexity analysis.
UNIT-IV (08 Hours)

Sorting and Hashing: Objective and properties of different sorting algorithms: Selection Sort,
Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Hear Sort; Performance and Comparison
among all the methods, Hashing.
UNIT-V (08 Hours)
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary
Tree, Binary Search Tree, AVL Tree; Tree Operations on each of the trees and their
algorithms with complexity analysis. Applications of Binary Trees. B Tree, B+ Tree:
definitions, algorithms and analysis.
Graph: Basic Terminologies and representations, Graph search and traversal algorithms and
complexity analysis.
Course Outcomes:
CO1: Understand the concept of Dynamic memory management, data types, algorithms, Big
O notation.
CO2:Understand basic data structures such as arrays, linked lists, stacks and queues.
CO3:Describe the hash function and concepts of collision and its resolution methods
CO4:Solve problem involving graphs, trees and heaps
CO5:Apply Algorithm for solving problems like sorting, searching, insertion and deletion of
data.
Text Books:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, “Introduction to Algorithms”, PHI
Publication.
2. Anany V. Levitin, “Introduction to the Design and Analysis of Algorithms”, Pearson
Education Inc., New Delhi.
2nd L-T-P
MCAT202 COMPUTER NETWORKS Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100

Introduction Concepts: Goals and Applications of Networks, Network structure and
architecture, The OSI reference model, services, Network Topology Design - Delay Analysis,
Back Bone Design, Local Access Network Design, Physical Layer Transmission Media,
Switching methods, ISDN, Terminal Handling.

Medium Access Sub Layer: Channel Allocations, LAN protocols, Overview of IEEE
standards - FDDI. Data Link Layer - Elementary Data-Link Protocols, Sliding Window
protocols, ErrorHandling.

Network Layer: Point-to-Point Networks, routing, Congestion control, Internetworking-TCP /
IP, IP packet, IP address, IPv4 & IPv6.
TCP/IP Protocol Stack:TCP and UDP, Routing Protocols

Transport and Session Layer: Design issues, connection management, TCP - Window
Management. remote procedure call.
Presentation Layer: Design issues, Data compression techniques, cryptography.
Application Layer: File Transfer, Access and Management, Electronic mail(SMTP, MIME,
IMAP, POP3) – HTTP – DNS- SNMP – Telnet – FTP –Security –
PGP –SSH, Virtual Terminals, DHCP, NetSim, NS2
Course outcomes:
CO1: Analyze the concepts of networks, types and architectures.
CO2: Explain various techniques and modes of transmission (Analog and Digital).
CO3: Identify error free transmission of data and analyse data collision with various protocols.
CO4: Describe IPv4 & IPv6 addressing schemes, subnets, routing principles and algorithms used in
the network layers.
CO5: Explain the protocols of transport & application layers and understand the working principles
of Internet & the World Wide Web.
CO6: Illustrate the real time applications of networks.
Text Books:
1. B. A. Forouzen, "Data Communication and Networking", 5th Edition, TMH,2017
2. A.S. Tanenbaum, Computer Networks, 5th Edition, Pearson Education.2013
Reference Books:
1. W. Stallings, Data and Computer Communication, 8th Edition, Macmillan Press,2017

2. Larry L. Peterson and Bruce S. Davie, Computer Networks: A System Approach, 5th
Edition, Morgan Kaufmann Publishers,2011.
3. James F.Kuross, Keith W.Ross,“Computer Networking, A Top Down Approach Featuring the
Internet”,Third Edition, Addison Wesley, 2004.
4. NaderF.Mir,“Computer andCommunicationNetworks”,PearsonEducation,2007
5. Comer, “Computer Networks and Internet swith Internet Applications”, Fourth Edition,
PearsonEducation,2003.
2nd ARTIFICIALINTELLIGENCE AND L-T-P

MCAT203 Credit 3
Semester MACHINE LEARNING 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 hours)

Introduction to AI, production system, production rules, State-space problem, Problem Solving by
Intelligent search: BFS, DFS, Iterative Deepening Search, Hill Climbing, Simulated Annealing,
heuristic Search: A*,AO* , Adversary Search: MIN-MAX Algorithm, Alpha-Beta Cut-off
algorithm.
UNIT-II (08 hours)

Propositional Logic, Theorem Proving by Propositional Logic, Resolution principle, Predicate
Logic, wff conversion to clausal form, Dealing with Imprecision and Uncertainty: Probabilistic
Reasoning, Dempster-Shafer Theory for Uncertainty Management.
UNIT-III (08 hours)

Basics Concepts of Machine Learning: Brief Introduction to Machine Learning Concepts,
Machine Learning Terminology, Machine Learning vs. Statistics, Types of Machine Learning
Algorithms, Supervised Learning vs. Unsupervised Learning, Applications of Machine Learning.
UNIT-IV (08 hours)

Supervised Learning: Basic concepts of Supervised Learning, Decision tree induction, Evaluation
of classifiers, Rule induction, Classification using association rules, Naïve Bayesian
classification, Naïve Bayes for text classification, Support vector machines, Combining
Classifiers Ensemble methods: Bagging and Boosting, Applications of Supervised Learning.
UNIT–V (08 hours)

Unsupervised Learning: Clustering - K-means, Representation of clusters, Hierarchical clustering,
Distance functions, Gaussian Mixture Model (GMM), Spectral Clustering, Expectation
Maximization (EM), Principal Components Analysis (PCA).
Reinforcement Learning Tasks and their types in reinforcement learning, Approaches to

Reinforcement Learning and Examples, Machine Learning vs. Deep Learning, Introduction to
Deep Learning and its applications.
Course Outcomes:
CO1: Demonstrate fundamental understanding of the history of artificial intelligence (AI) and its
foundations.
CO2: Apply basic principles of AI in solutions that require problem solving, inference,
perception, knowledge representation, and learning.
CO3: 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.
CO4: Demonstrate proficiency developing applications in an 'AI language', expert system shell,
or
data mining tool.
CO5: Demonstrate proficiency in applying scientific method to models of machine learning.
CO6: Demonstrate an ability to share in discussions of AI, its current scope and limitations, and
societal implications.
Text Books:
1. S.J. Russell & P. Norvig, Artificial Intelligence: A modern Approach, Pearson,2009.

2. P.H Winston, Artificial Intelligence, Addison Wesley,2011.
Reference Books:
1. E Rich &K Knight, Artificial Intelligence, McGraw Hill Education; 3rd Edition,2017.
2. Nils J. Nilsson, Artificial Intelligence: A new Synthesis –, 1stEdition, Elsevier,1997.
2nd OBJECT ORIENTED L-T-P
MCAT204 Credit 3
Semester PROGRAMMING USING JAVA 3-0-0
Evaluation Scheme

05 05 05 25 60 100

JAVA BASICS: Types of Programming languages, Advantage of Object‐Oriented
Programming. Introduction to Java and its features, JVM and its architecture, java tokens, data
types, operators, typecasting, control structures, conditional statements, loops, jumping
statements, java arrays, multidimensional arrays, taking input from keyboard‐command line
arguments using Scanner& Buffered Reader .
Introduction to classes and objects, classes, methods, objects, description of data hiding and
data encapsulation, constructors, use of static keyword in java, use of this keyword in java,
array of objects, concept of access modifiers (public, private, protected, default).
INHERITANCE AND POLYMORPHISM: Basic concepts, Types of inheritance, Member
access rules, Usage of this and Super key word, Method Overloading, Method overriding,
Abstract classes, Dynamic method dispatch, Usage of final keyword.
PACKAGES AND INTERFACES: Defining package, Access protection, importing packages,

Defining and Implementing interfaces, and Extending interfaces.
I / O STREAMS: Concepts of streams, Stream classes- Byte and Character stream, Reading
console Input and Writing Console output, File Handling.
UNIT-III (06 hours)

EXCEPTION HANDLING: Exception types, Usage of Try, Catch, Throw, Throws and Finally
keywords, Built-in Exceptions, Creating own Exception classes.
MULTI THREADING: Concepts of Thread, Thread life cycle, creating threads using Thread
class and Runnable interface, Synchronization, Thread priorities, Inter Thread communication.
UNIT-IV (08 hours)
Java collections: Introduction to java collections framework, util package interfaces‐list,
set, map etc, List interfaces and its classes, Setter interfaces and its classes.
JDBC: Driver, types of Drivers, Database Connection Steps, Driver Manager Class, Statement
Interface, Prepared Statement Interface, execute Query, execute Update Result Set Interface,
UNIT-V (08 hours)
SWINGS: Introduction to Swings, Hierarchy of swing components. Containers, Top level
containers - JFrame, JWindow, JDialog, JPanel, JButton, JToggleButton, JCheckBox,
JRadioButton, JLabel,JTextField, JTextArea, JList, JComboBox, JScrollPane.APPLETS: Life
cycle of an Applet, Differences between Applets and Applications, Developing applets, simple
applet.
Course outcomes:
CO1: Knowledge of the structure and model of the Java programming language, (knowledge)
CO2: Use the Java programming language for various programming technologies
(understanding)
CO3: Develop software in the Java programming language, (application).
CO4: Evaluate user requirements for software functionality required to decide whether the
Java programming language can meet user requirements (analysis).
CO5: Propose the use of certain technologies by implementing them in the Java programming
language to solve the given problem (synthesis).
CO6: Choose an engineering approach to solving problems, starting from the acquired
knowledge of programming and knowledge of operating systems. (evaluation).
Text Books:
1. PatricNaughton, Herbert Schildt, Java 2 Complete Reference, 9 th Edition, McGraw Hill

Education,2017
2. R. Nageswara Rao, Core Java: An Integrated Approach, 1 st Edition, Dreamtech Press,
2016
Reference Books:
1. Ivor Horton, Beginning Java, 7thEdition, Wiley,2011

2. Core Java For Beginners, 3rd Edition, Vikash Publication,2013
3. Jim Keogh, Complete Reference- J2EE, 1st Edition, McGraw Hill Education, 2017
2nd L-T-P
23MCAT205 SOFTWAREENGINEERING Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
Introduction to Software Engineering: Emergence of software engineering, changes in
software development practices, system engineering and role of system analyst.
Software Life Cycle Models: Need for a life cycle model, phase entry and exit criteria,
classical waterfall model, iterative waterfall model, iterative waterfall model, prototype model,
evolutionary model, V model, Spiral model, selection criteria for the various models and Agile
model development.
Requirement Analysis and Specification: Requirement gathering and analysis, functional

requirements, organization of the SRS document, decision trees and decision tables, formal
system specification, axiomatic specification, algebraic specification and 4GL.

Introduction to Design: Importance of design, design activities and methodologies, good
design characteristics, cohesion, coupling, layered modular design, fan–in and fan–out,
approaches to design.
Function Oriented Design Approach: Structured analysis, data flow diagrams, structured
design, transform analysis and transaction analysis, structure chart.
Object Oriented Design with UML: Overview of Object-Oriented Concepts, UML (Unified
Modeling Language), UML Diagrams for Users View, Structural View, Behavioral View,
Implementation View and Environmental View, Designing Use Case Diagram, Class Diagram,
Sequence Diagram and State Charts.
UNIT - III (08 hours)

Coding: Coding standards, code walkthrough, code inspection, documentation – internal and
external documentation and Gunning’s Fog index.
Testing: Validation and verification, fault and failure, debugging, debugging approaches, unit
testing, black box testing, equivalence class partitioning, boundary value analysis, white box
testing, integration testing, system testing – alpha, beta and acceptance testing, stress testing
and regression testing.
Maintenance: Characteristics of maintenance, types of maintenance, software reverse

engineering, maintenance process model and maintenance cost estimation.
UNIT – IV (08
hours)
Software Project Management: Roles of a project manager, project planning, project size
estimation, project estimation techniques - empirical, heuristic (COCOMO) and analytical,
staffing estimation, scheduling, organization and team structure, risk management and SCM.
Reliability and Quality Management: Introduction to reliability, reliability metrics,
reliability growth modelling, software quality, ISO 9001, SEI CMM and SixSigma.
Computer Aided Software Engineering: Scope of CASE, benefit of CASE, CASE in

software life cycle, second generation CASE tool and CASE environment architecture.
Course Outcomes:
CO1: Plan a software engineering process life cycle , including the specification, design,
implementation, and testing of software systems that meet specification, performance,
maintenance and quality requirements.
CO2: Able to elicit, analyze and specify software requirements through a productive working
relationship with various stakeholders of the project.
CO3: Analyze and translate a specification into a design, and then realize that design practically,
using an appropriate software engineering methodology.
CO4: Know how to develop the code from the design and effectively apply relevant standards
and perform testing, and quality management and practice.
CO5: Able to use modern engineering tools necessary for software project management, time
management and software reuse.
Text Books:
2. Rajib Mall: Fundamentals of Software Engineering, 4 th Edition, Prentice Hall of

India,2014
3. I. Summerville: Software Engineering 10th Edition, Pearson Education,2017
Reference Books:
1. Roger S. Pressman: A Practitioner’s Approach, 7th Edition, McGraw Hill Education,2009

2. Craig Larman: Applying UMI and Patterns An introduction OOAD and the Unified
Process, 3rd Edition, Pearson Education, 2015
2nd PERSONALITY AND SOFT SKILL L-T-P

MCAT206 Credit 2
Semester DEVELOPMENT-II 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (10 Hours)

Reading Skills: Reading comprehension, Reading for gist and understanding. The students will be
able to understand the nuances of solving Reading Comprehensions.
UNIT-II (10 Hours)
Writing Skills: Essay writing, Paragraph writing, E-mail writing, Précis-writing, Blog writing. The
module will familiarize students with the essentials of writing in English by drawing from the
referred books.
UNIT-III (10 Hours)

Vocabulary: Contextual Vocabulary, analogies, inferences. The module will familiarize students
with the skills of solving questions on vocabulary and to enable them to use contextual vocabulary.
UNIT-IV (10 Hours)

Applied Grammar: Subject-Verb agreement, State and Event verbs, Modals and Auxiliaries, Finite
and Non-finite Verbs, Tenses, Voice Change. The student will get a better understanding of the
nuances and application of grammar and vocabulary in day-to-day usage.
Course Outcomes:
CO1: Use English Language effectively in spoken and written forms
CO2: Comprehend the given texts and respond appropriately.
CO3: Communicate confidently in various contexts and different cultures.
CO4: Acquire basic proficiency in English including reading and listening comprehension, writing
and speaking skills.
CO5: Understand various principles of communication, its various stages and the role of audience
and purpose, deal with the barriers that affect communication in a professional set- up.
Textbooks:
1. Oxford modern English Grammar
2. Destination B1 Grammar and Vocabulary with Answer Key (Malcolm Mann & Steve
Taylore-Knowles)
2nd L-T-P
MCAT207 EMPLOYABILITY SKILL - II Credit 2
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

Quantitative Aptitude Profit and Loss, Time and Work, Pipes and Cistern, Time Speed Distance,
Permutation Combination, Probability, Number System, Data Interpretation, Data Sufficiency.
UNIT-II (08 Hours)

Database Systems OOPS Concept, Intro to DBMS ,ER diagram, key concepts,
Normalization ,problem solving on keys and normalization ,SQL basics ,DDL,DML,DCL,
select ,join operation ,sub query, correlated sub query, Group function, Having order by clause
database objects, Transaction management.
UNIT-III (08 Hours)

Logical Reasoning Venn-Diagram, Alphabet and Series, Syllogism, Seating Arrangement, Clock and
Calendars, Puzzles, Cubes and Dice, Non Verbal Reasoning.
UNIT-IV (08 Hours)

OOPS and Data Structure Introduction to DMA Linked list based coding with use of self referential
structure, Linked list, Java based coding on abstract class, Interface MCQ based on fundamentals of
Java Programming, Polymorphism.
UNIT-V (08 Hours)

Algebra, Logarithm, Surds and Indices, Geometry & Mensuration. array & string based Coding using
C and Java.
Course Outcomes:
CO1: To develop placement enabled programming skill according to industry pattern.
CO2: To develop quantitative and reasoning skill for recruitment.
CO3: To provide pre placement training for campus recruitment.
CO4: To provide specific short cut techniques to solve QAand LR problems with in stipulated time
CO5: To develop coding skill for medium level and difficult level automata round.
Text Book:
1. Raghurama Krishnan, Johannes Gehrke , Database Management Systems, 3rd edition,
TataMcGraw Hi
2. Teach Yourself Quantitative Aptitude, Arun Sharma, Mc Graw hill ,2nd edition.
3. Professional Java Programming by Brett Spell, WROX Publication
2nd L-T-P
MCAT207 UNIVERSAL HUMAN VALUE Credit 2
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

Introduction to Value Education: Value Education, Definition, Concept and Need for Value
Education. The Content and Process of Value Education. Basic Guidelines for Value Education. Self-
exploration as a means of Value Education. Happiness and Prosperity as parts of Value Education.
UNIT-II (08 Hours)

Harmony in the Human Being: Human Being is more than just the Body. Harmony of the Self (‘I’)
with the Body. Understanding Myself as Co-existence of the Self and the Body. Understanding
Needs of the Self and the needs of the Body. Understanding the activities in the Self and the activities
in the Body.
UNIT-III (08 Hours)

Harmony in the Family and Society and Harmony in the Nature: Family as a basic unit of
Human Interaction and Values in Relationships. The Basics for Respect and today’s Crisis:
Affection, e, Guidance, Reverence, Glory,
Gratitude and Love. Comprehensive Human Goal: The Five Dimensions of Human Endeavour.
Harmony in Nature: The Four Orders in Nature. The Holistic Perception of Harmony in Existence.
UNIT-IV (08 Hours)

Social Ethics: The Basics for Ethical Human Conduct. Defects in Ethical Human Conduct. Holistic
Alternative and Universal Order. Universal Human Order and Ethical Conduct. Human Rights
violation and Social Disparities.
UNIT-V (08 Hours)

Professional Ethics: Value based Life and Profession. Professional Ethics and Right Understanding.
Competence in Professional Ethics. Issues in Professional Ethics – The Current Scenario. Vision for
Holistic Technologies, Production System and Management Models.
Course Outcomes:
CO1: Understand the significance of value inputs in a classroom and start applying them in their
life and profession
CO2: Distinguish between values and skills, happiness and accumulation of physical facilities,
the Self and the Body, Intention and Competence of an individual, etc.
CO3: Understand the role of a human being in ensuring harmony in society and nature.
CO4: Distinguish between ethical and unethical practices, and start working out the strategy to
actualize a harmonious environment wherever they work.
Text Books
1. A.N Tripathy, New Age International Publishers, 2003.
2. Bajpai. B. L , , New Royal Book Co, Lucknow, Reprinted, 2004
Reference Books:
1. Bertrand Russell Human Society in Ethics & Politics

2. Corliss Lamont, Philosophy of Humanism
3. Gaur. R.R. , Sangal. R, Bagaria. G.P, A Foundation Course in Value Education, Excel
Books, 2009.
4. Gaur. R.R. , Sangal. R , Bagaria. G.P, Teachers Manual Excel Books, 2009.
5. I.C. Sharma . Ethical Philosophy of India Nagin & co Julundhar.
PRACTICALS
L-T-
2nd Credit
MCAP201 DATA STRUCTURE LAB P
Semester 2
0-0-2
Evaluation Scheme
Report Total
20 30 30 20 100
LIST OF PROGRAMS:
1. C Program to Implement Stack

2. C Program to Implement Stack using Two Queues
3. C Program to Reverse a Stack using Recursion
4. C Program to Reverse a Stack without Recursion
5. C Program to Illustrate Stack Operations using MACROS
6. C Program to Implement Stack Operations using Dynamic Memory Allocation
7. C Program to Implement Two Stacks in a Single Array
8. C Program to Implement Queue
9. C Program to Implement Priority Queue Operations
10. C Program to Implement Queues using Stack
11. C Program to Implement Queue using Two Stacks
12. Singly Linked List Program in C with Operations
13. C Program to Demonstrate Circular Single Linked List
14. C Program to Check if Singly Linked List is Palindrome
15. C Program to Convert Singly Linked List to Circular List
16. C Program to Implement Binary Tree
17. C Program to Implement Threaded Binary Tree
18. C Program to Count the Number of Nodes in Binary Tree
Course Outcomes:
CO1: Design algorithms using appropriate design techniques (brute-force, greedy, dynamic
programming, etc.).
CO2: Implement a variety of algorithms such assorting, graph related, combinatorial, etc., in
a high level language.
CO3: Analyse and compare the performance of algorithms using language features.
CO4: Apply and implement learned algorithm design techniques and data structures to solve
real- world problems.
L-T-
2nd Credit
MCAP202 COMPUTER NETWORKS LAB P
Semester 2
0-0-2
Evaluation Scheme

Report Total
20 30 30 20 100
Implementation of Stop and Wait Protocol and Sliding Window Protocol.

Study of Socket Programming and Client – Server model
Write a code simulating ARP /RAR Protocols.
Write a code simulating PING and TRACEROUTE commands
Create a socket for HTTP for web page upload and download.
Write a program to implement RPC (Remote Procedure Call)
Implementation of Subnetting. Applications using TCP Sockets like Echo client and echo
server, Chat, File Transfer, Applications using TCP and UDP Sockets like DNS, SNMP
File Transfer, Study of Network simulator (NS).and Simulation of Congestion Control
Algorithms using/NetSim, perform a case study about the different routing algorithms to
select the network path with its optimum and economical during data transfer.
Course Outcomes:
CO1: Experiment with transmission media, connector, Hubs, Switches and installation of
NIC.
CO2: Implement client server applications with TCP/UDP Socket Programming in a
standalone machine and over a network.
CO3: Apply HTTP over TCP/UDP connection with help of a Browser.
CO4: Simulate Datalink layer protocols using NetSim/NS3.
CO5: Develop applications to communicate over heterogeneous networks (Internet).
L-T-
2nd Credit
MCAP201 AI & ML LAB USING PYTHON P
Semester 2
0-0-2
Evaluation Scheme

Report Total
20 30 30 20 100
LIST OF PROGRAMS:
1. Compute the GCD of two numbers.
2. Find the square root of a number (Newton’s method)
3. Exponentiation (power of a number)
4. Find the maximum of a list of numbers
5. Linear search and Binary search
6. Selection sort, Insertion sort
7. Write a Program to Implement 8-Puzzle problem using Python
8. Write a Program to Implement Depth First Search using Python.
9. Write a Program to Implement Breadth First Search using Python.
10. Programs that take command line arguments (word count)
11. Find the most frequent words in a text read from a file
12. Simulate elliptical orbits in Pygame
13. Simulate bouncing ball using Pygame
Course Outcomes:
CO1: Understand the basic concept of python programming.
CO2: Apply programming concept to solve problem.
CO3: Develop logic for problem solving.
CO4: Remember the python programming approach for problem solving.
CO5: Design various model to handle and process data.
L-T-
2nd
MCAP204 JAVA PROGRAMMING LAB P Credit 2
Semester
0-0-2
Evaluation Scheme

Report Total
20 30 30 20 100
Introduction: An overview of JAVA program, data types, variable and arrays, operators,
control statements.
Classes& Objects: The general form of a class, declaring objects, assigning object reference
variables, methods, constructors.
Inheritance: Inheritance basics, member access and inheritance, using super to call super class
constructors. Creating a multilevel hierarchy, method overriding, dynamic method dispatch,
using abstract classes, using final with inheritance.
Packages: Defining a package, finding packages and CLASSPATH, access protection,
importing packages.
Interfaces: Defining an interface, implementing interfaces, applying interfaces, variables in
interfaces, use static methods in an interface.
Exception Handling: Exception-Handling Fundamentals, Exception Types.
I/O Basics: Streams, reading console input, writing console output, reading and writing files.
Multithreaded Programming: The java thread model, creating a thread, creating multiple
threads. Applet fundamentals, the applet class, applet architecture, applet initialization and
termination. Introducing the AWT, working with windows, graphics, and text.
JDBC: Introduction to JDBC, Drivers Types, JDBC Objects, SQL query objects.
Course Outcomes:
CO1: Implement Object oriented features using Java.
CO2: Apply the concept of polymorphism and inheritance.
CO3: Implement exception handling.
CO4: Develop window-based application using Swing
L-T-
2nd
MCAP205 SOFTWARE ENGINEERING LAB P Credit 2
Semester
0-0-2

Report Total
20 30 30 20 100
List of Experiments:
1. To know about Phases in software development project, overview, need,
coverage of topics
2. To assign the requirement engineering tasks
3. To perform the system analysis : Requirement analysis, SRS
4. To perform the function oriented diagram : DFD and Structured chart
5. To perform the user‟s view analysis : Use case diagram
6. To draw the structural view diagram : Class diagram, object diagram
7. To draw the behavioral view diagram : Sequence diagram, Collaboration diagram
8. To draw the behavioral view diagram : State-chart diagram, Activity diagram
9. To draw the implementation view diagram: Component diagram
10. To draw the environmental view diagram : Deployment diagram
11. To perform various testing using the testing tool unit testing, integration testing
Course Outcomes:
CO1: To understand the requirements and design the SRS
CO2: To implement the software design through DFD.
CO3: Implement of different UML diagrams
CO4: Implement of different testing tools
THIRD SEMESTER
3rd INTERNET AND WEB TECHNOLOGY L-T-P

MCAT301 Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

INTRODUCTION TO INTERNET: Introduction, Evolution of Internet, WEB2.0 and Evolution of
WWW. Internet Protocol -TCP/IP, UDP, HTTP, Secure Http(https) Internet Addressing Scheme –
Ipv4 & IPv6,Domain Name Server and IP Addresses-Mapping. Building Web Sites: Planning for
designing Web pages, site navigation, model and structure of a Website, Web Servers, Web
Browsers, Two Tier and Three Tier Web Based Architecture.
UNIT-II (08 Hours)

HTML CSS AND SCRIPTING: HTML – Introduction, SGML, DTD (Document Type Definition).
Basic HTML using images links, Lists, Tables and Forms, Frames for designing a good interactive
website. HTML Standards, Issues in HTML HTML5: Migration, New Elements, Semantics, Canvas,
SVG, Google Maps, Multimedia, APIs CSS: Syntax, Class Selector, Id Selector. External and
Internal Style Sheets, Inline Style, and the class selector, div & span tags. Change the properties like
background images, colors, and manipulating texts, using fonts, borders and boxes, margins, padding
lists, positioning using CSS.
CSS3: Rounded Corners, Border Images, Gradients, Shadows, 2D and 3D Transforms, Transitions,
Animations, object-fit, Multiple Columns, Box Sizing, Flexbox.
UNIT-III (08 Hours)

Java Script – Java Script Object Model, Variables-Constant – Expressions, Conditions-Relational
Operators- Data Types – Flow Control – Popup Boxes, Try.... Catch Statement, Throw Statement,
and Objects of JavaScript: Date object, array object, Boolean object, math object Functions &
Objects-events and event handlers – Data type Conversion & Equality –Accessing HTML form
elements. Email and password validations.
UNIT-IV (08 Hours)

XML and JAVA Applets: What is XML – Basic Standards, Schema Standards, Linking &
Presentation Standards, Standards that build on XML, Generating XML data, writing a simple XML
File, creating a Document type definition, Documents & Data, Defining Attributes & Entities in the
DTD, Defining Parameter Entities & conditional Sections, Designing an XML data structure, XML
Normalization. Approaches to Dynamic Pages: CGI, Java Applets, Plug Ins, Active X controls, Java
Applet: Introduction to Java, Writing Java Applets, Life cycle of applet, Design a login page using
applets. Designing of applications using applet.
UNIT-V (08 Hours)

PHP: Starting to script on server side, Arrays, function and forms. Advance PHP: File Upload,
Cookies, Sessions, Filters, Error Handling, Exception Databases: Basic command with PHP
examples, Connection to server, creating database, selecting a database, listing database, listing table
names creating a table, inserting data, altering tables, queries, deleting database, deleting data and
tables, PHP my admin and database bugs.
Course Outcomes
CO1: Ability to relate practical problems to internet web technology concepts
CO2: Ability to model problems using standard web technology concepts
CO3: Ability to apply web technology skills in real-world problem solving
Text Books
1. Internet of Web Technology by A. Ravichandran, Khanna Book Publishing Co (P) Ltd,1st
Edition,2013
2. Internet & Web Technologies By Rajkamal, Mcgraw Hill Education,1st Edition,2013
Reference Books:
1. Internet Technology and Web Design by Isrd Group, Mcgraw Hill Education,1st
Edition,2014
2. Web Technology: A Developer by N.P.Gopalan, J. AKILANDESWARI , Phi Learning, 2nd
Edition,2016
3. Web Technologies: A Computer Science Perspective, by Jackson, Pearson Education India,
1st Edition,2015
4. Html5 Covers Css3 Javascript Xml Xhtml Ajax Php & Jquery Black Book by Na,Dreamtech
( Biztantra ),2nd Edition,2018
3rd DATA MINING AND DATA L-T-P

MCAT302 Credit 3
Semester WAREHOUSING 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08
Hours)
Data Warehousing and Business Analysis: - Data warehousing Components –Building a Data
warehouse –Data Warehouse Architecture – DBMS Schemas for Decision Support – Data
Extraction, Cleanup, and Transformation Tools –Metadata – reporting – Query tools and
Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional Data Analysis.
UNIT-II (08 Hours)

Data Mining: - Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration
and Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation-
Architecture of A Typical Data Mining Systems- Classification of Data Mining Systems.
Association Rule Mining: - Efficient and Scalable Frequent Item set Mining Methods – Mining
Various Kinds of Association Rules – Association Mining to Correlation Analysis – Constraint-
Based Association Mining.
UNIT-III (08 Hours)

Classification and Prediction: - Issues Regarding Classification and Prediction – Classification by
Decision Tree Introduction – Bayesian Classification – Rule Based Classification – Classification by
Back propagation – Support Vector Machines – Associative Classification – Lazy Learners – Other
Classification Methods – Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a
Classifier or Predictor – Ensemble Methods – Model Section.
UNIT-IV (08 Hours)

Cluster Analysis: - Types of Data in Cluster Analysis – A Categorization of Major Clustering
Methods – Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based
Methods – Model-Based Clustering Methods – Clustering High-Dimensional Data – Constraint-
Based Cluster Analysis – Outlier Analysis.
UNIT-V (08 Hours)

Mining Object, Spatial, Multimedia, Text and Web Data:
Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data Mining
– Multimedia Data Mining – Text Mining – Mining the World Wide Web.
Course Outcomes:
CO1: Identify the scope and necessity of Data Mining & Warehousing for the society
CO2: Describe the designing of Data Warehousing so that it can be able to solve the root problems.
CO3: To understand various tools of Data Mining and their techniques to solve the real time
problems.
CO4: To develop ability to design various algorithms based on data mining tools.
CO5: To develop further interest in research and design of new Data Mining techniques.
Text Books
1. Jiawei Han, Micheline Kamber and Jian Pei“Data Mining Concepts and Techniques”, Third
Edition, Elsevier, 2011.
2. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata
McGraw – Hill Edition, Tenth Reprint 2007.
Reference Books:
1. K.P. Soman, Shyam Diwakar and V. Ajay “Insight into Data mining Theory and Practice”,
Easter Economy Edition, Prentice Hall of India, 2006.
2. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition,
Prentice Hall of India, 2006.
3. Pang-Ning Tan, Michael Steinbach and Vipin Kumar “Introduction to Data Mining”, Pearson
Education, 2007.
3rd DESIGN AND ANALYSIS OF L-T-P

MCAT303 Credit 3
Semester ALGORITHMS 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 hours)

Growth of Functions, Asymptotic notations, Analysis of Insertion sort, Divide and Conquer
technique, Recurrences, Solving Recurrences: Substitution Method, Recurrence tree, Master’s
theorem, Generating function, Analysis of Merge sort.
UNIT-II (08 hours)

Heap sort, Analysis of heap sort, Data structure for disjoint sets, Disjoint set operations,
Greedy Technique: Huffman Codes, Knapsack problem. Graph Algorithms: Minimum
spanning tree (Algorithm of Kruskal& Prim), Single source shortest paths (Dijkstra’s
Algorithm), All pairs shortest paths (Floyd-Warshall algorithm).
UNIT-III (08 hours)

Dynamic programming: Evaluation of Binomial Coefficient, Matrix chain multiplication,
Longest Common Subsequence (LCS), The Simplex Method-The Maximum-Flow Problem.
UNIT-IV (08 hours)

Brute Force – Closest-Pair and Convex-Hull Problems-Exhaustive Search – Traveling
Salesman Problem – Knapsack Problem – Assignment problem. Multiplication of Large
Integers – Strassen’s Matrix Multiplication-Closest-Pair and Convex-Hull Problems
UNIT-V (08 hours)

Concept of Backtracking: N Queen Problem, Branch and Bound, Approximation Algorithms:
Polynomial Time, Polynomial-Time certification, NP-Completeness, NP Completeness and
reducibility. The vertex-cover problem, the subset sum problem, Algorithm for travelling-
salesperson problem.
Course Outcomes: At the end of the course, the students will be able to:
CO1: Analyze the asymptotic performance of algorithms.
CO2: Understand different algorithm design techniques.
CO3: Apply important algorithmic design paradigms and methods of analysis.
CO4: Demonstrate familiarity with major algorithms and data structures.
CO5: Evaluate different classes of problems: P, NP, NP Complete and NP Hard.
CO6: Develop algorithms to apply in common engineering design situations
Text Books:
1. S. Sridhar, Design and Analysis of Algorithms, 1st Edition, Oxford,2015.

2. T.H Coremen C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, 3 rd Edition, MIT
Press, 2009.
Reference Books:
1. E.HorwitzS.Sahani, S.Rajasekharn, Fundamentals of Computer Algorithms, 2ndEdition,

University Press,2008.
2. Michael T. Goodrich, Algorithm Design: Foundations, Analysis & Internet examples, 1 st
Edition, Wiley,2001.
3. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third
4. Edition, Pearson Education, 2012.
5. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson
Education, 2009.
3rd INFORMATION SECURITY AND L-T-P

MCAT304-OE Credit 3
Semester MANAGEMENT 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 hours)

The Security Problem in Computing: The meaning of computer Security, Computer Criminals,
Methods of Defense; Elementary Cryptography: Substitution Ciphers, Transpositions, Making
“Good” Encryption Algorithms, Private-Key Crypto systems, The Data Encryption Standard,
The AES Encryption Algorithm, Public-Key Cryptosystems, Public Key Encryptions, Uses of
Encryption, Pseudo-randomness, and Hashing.
UNIT-II (08 hours)

Program Security: Secure Programs, Non-malicious Program Errors, viruses and other malicious
code, Targeted Malicious code, controls Against Program Threats, Protection in General-
Purpose operating system protected objects and methods of protection memory and address
protection, File protection Mechanisms, User Authentication Designing Trusted O.S .
UNIT-III (08 hours)
Security polices, models of security, trusted O.S. design, Assurance in trusted

OS,Implementation examples. Digital Signatures, Authentication, Secret Sharing, Group
oriented cryptography, Identification.
UNIT-IV (08 hours)

Data base & Network Security: Security requirements, Reliability and integrity, Sensitive data,
Inference, multilevel database, proposals for multilevel security; Security in Network; Threats in
Network, Network Security Controls, Firewalls, Intrusion Detection Systems, Secure E-mail.
UNIT-V (08 hours)

Administering Security: Security Planning, Risk Analysis, Organizational Security policies
Physical Security; The Economics of Cyber security; Privacy in Computing; Legal and Ethical
Issues in Computer Security: Protecting Programs and data, Information and the law, Rights of
Employees and Employers, Software failures, Computer Crime, Case studies of Ethics.
Course Outcomes:
CO1: Examine and apply the fundamental techniques of computer security.
CO2: Identify and explain risk and potential security issues.
CO3: Demonstrate responsible computer use as it deals with social, political, legal
and ethical issues in today's electronic society.
CO4: Demonstrate foundation knowledge of information security/assurance within
the organization.
CO5: Demonstrate knowledge of security objectives and policy development.
Text Books:
1. CharlesP.Pfleeger& Shari Lawrence Pfleeger,“Security in Computing”, Fourth
Edition, 2007, Pearson Education, Inc. New Delhi. Pvt. Ltd., New Delhi.
2. WilliamStallings&Lawrie
Brown,“ComputerSecurity:PrinciplesandPractice”,FirstEdition,2008, Pearson Education,
Inc. New Delhi.
3. Charlie Kaufman, RadiaPerlman &Mike Speciner,“Network Security: Private
Communication in a Public World”, 2ndEdition, 2003, PHI Learning. New Delhi.
3rd COMPUTER GRAPHICS AND L-T-P

MCAT305-OE Credit 3
Semester MULTIMEDIA 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 hours)

Basic of Computer Graphics, Applications of computer graphics, Display devices, Random and
Raster scan systems, Graphics input devices, Graphics software and standards
UNIT-II (08 hours)

Points, lines, circles and ellipses as primitives, scan conversion algorithms for primitives, Fill area
primitives including scan-line polygon filling, inside-outside test, boundary and flood-fill, character
generation, line attributes, area-fill attributes, character attributers.
UNIT-III (08 hours)

Transformations (translation, rotation, scaling), matrix representation, homogeneous coordinates,
composite transformations, reflection and shearing, viewing pipeline and coordinates system,
window-to-viewport transformation, clipping including point clipping, line clipping (Cohen
Sutherland, liang- bersky, NLN), polygon clipping.
UNIT-IV (08 hours)

3D display methods, polygon surfaces, tables, equations, meshes, curved lies and surfaces, quadric
surfaces, spline representation, cubic spline interpolation methods, Bazier curves and surfaces, B-
spline curves and surfaces
UNIT-V (08 hours)

3D scaling, rotation and translation, composite transformation, viewing pipeline and coordinates,
parallel and perspective transformation, view volume and general (parallel and perspective)
projection transformations.
Course Outcomes:
CO1: Understand the basics of computer graphics, different graphics systems and applications of
computer graphics.
CO2: Discuss various algorithms for scan conversion and filling of basic objects and their
comparative analysis.
CO3: Use of geometric transformations on graphics objects and their application in composite form.
CO4: Extract scene with different clipping methods and its transformation to graphics display
device.
Text Books:
1. Computer Graphics, D. Hearn and P. Baker - Pearson Education - C Version
2. Computer Graphics, with OpenGL Hearn and Baker, - Pearson
Reference Books:
1. Computer Graphics, Sinha &Udai, - TMH

2. Computer Graphics, Foley and van Dam - Person Education
3rd L-T-P
MCAT306-OE SOFT COMPUTING Credit 3
Semester 3-0-0
Evaluation Scheme
05 05 05 25 60 100
UNIT-I (8
hours)
Basic tools of soft Computing: Fuzzy logic, Neural Networks and Evolutionary Computing,
Approximations of Multivariate functions, Non – linear Error surface and optimization.
UNIT-II (8 hours)
Fuzzy Logic Systems: Basics of fuzzy logic theory, Crisp and fuzzy sets; Basic set operations; Fuzzy
relations, Composition of Fuzzy relations, Fuzzy inference, Zadeh’s compositional rule of inference;
Defuzzificaiton ; Fuzzy logic control; Mamdani and Takagi and Sugeno architectures. Applications
to pattern recognition.
UNIT-III (8 hours)
Neural networks: Single layer networks, Perceptron; Activation functions; Adalinc- its training and
capabilities, weights learning, Multilayer perceptrons; error back propagation, generalized delta rule.
UNIT-IV (8 hours)
Radial basis function networks and least square training algorithm, Kohenen self – organizing map
and learning vector quantization networks; Recurrent neural networks, Simulated annealing neural
networks; Adaptive neuro-fuzzy information; systems (ANFIS).
UNIT-V (8 hours)
Evolutionary Computing: Genetic algorithms: Basic concepts, encoding, fitness function,
reproduction. Differences of GA and traditional optimization methods. Basic genetic, basic
evolutionary programming concepts Applications, hybrid evolutionary algorithms.
Course Outcomes
C01: Develop mathematical thinking and problem solving skills associated with research and writing
proofs.
C02: Get exposure to a wide variety of mathematical concepts used in computer science discipline
like probability.
C03: Use Graph Theory for solving problems.
C04: Acquire basic knowledge of sampling and estimation.
C05: Understand basic concepts of hypothesis.
Text Books:
1. F. O. Karry and C. de Silva, “Soft Computing and Intelligent Systems Design Theory, Tools
and Applications”. Pearson Education. (Printed in India).
2. J. S. R. Jang. C. T. SUN and E. Mizutani, “Neuro-fuzzy and soft-computing”.PHI Pvt. Ltd.,
New Delhi.
Reference Books:
1. Fredric M. Ham and Ivica Kostanic, “Principle of Neuro Computing for Science and
Engineering”, Tata McGraw Hill.
2. S. Haykins, “Neural networks: a comprehensive foundation”. Pearson Education, India.
3. V. Keeman, “Learning and Soft computing”, Pearson Education, India.
3rd L-T-P
MCAT307-OE CLOUD COMPUTING Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 hours)

Introduction to Cloud Computing: Cloud Computing in a Nutshell, System Models for
Distributed and Cloud Computing, Roots of Cloud Computing, Grid and Cloud, Layers and
Types of Clouds, Desired Features of a Cloud, Basic Principles of Cloud Computing,
Challenges and Risks, Service Models.
UNIT-II (08 hours)

Virtualization concepts: Virtual Machines and Virtualization of Clusters and Data Centers,
Levels of Virtualization, Virtualization Structures / tools and Mechanisms, Virtualization of
CPU, Memory and I/O Devices, Virtual Clusters and Resource Management, Virtualization
Data-Center Automation.
UNIT-III (08 hours)

Cloud computing architectures over Virtualized Data Centers: Data–Center design and
Interconnection networks, Architectural Design of Compute and Storage Clouds, Public Cloud
Platforms, Inter-cloud Resource Management.
UNIT-IV (08 hours)
Cloud Security and Trust Management, data Security in the Cloud: An Introduction to the Idea
of Data Security, The Current State of Data Security in the cloud.
UNIT-V (08 hours)
Common Standards in Cloud Computing: The Open Cloud Consortium, the Distributed
Management Task Force, Standards for Application Developers, Standards for Messaging.
Internet Messaging Access Protocol (IMAP), Standards for Security, Examples of End-User
Access to Cloud Computing.
Course Outcomes:
CO1: Describe the principles of Parallel and Distributed Computing and evolution of cloud
computing from existing technologies.
CO2: Implement different types of Virtualization technologies and Service Oriented Architecture
systems.
CO3: Elucidate the concepts of NIST Cloud Computing architecture and its design challenges.
CO4: Analyze the issues in Resource provisioning and Security governance in clouds.
CO5: Choose among various cloud technologies for implementing applications.
CO6: Install and use current cloud technologies.
Text Books:
1. Rajkumar Buyya, James Broberg and Andrzej Goscinski , Cloud Computing Principles
and Paradigms, 1st Edition, Wiley Publication,2011
2. Judith Hurwitz, Robin Bloor, Marcia Kaufman and Fern Halper, Cloud Computing for
Dummies, Wiley Publication,2009
3. Divyakant Agrawal, K. G. Selcuk Candan, Wen-Syan Li (Eds.), New frontiers in
information and software as a service, Springer Proceedings,2011
3rd L-T-P
MCAT308 .NET PROGRAMMING Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08Hours)
.Net Architecture - Core C# - Variables - Data Types - Flow control - Objects and Types- Classes
and Structs - Inheritance- Generics – Arrays and Tuples - Operators and Casts – Indexers
UNIT-II (08Hours)
Delegates - Lambdas - Lambda Expressions - Events - Event Publisher - Event Listener - Strings and
Regular Expressions - Generics - Collections - Memory Management and Pointers - Errors and
Exceptions – Reflection
UNIT-III (08Hours)
Diagnostics -Tasks, Threads and Synchronization - .Net Security - Localization - Manipulating
XML- SAX and DOM - Manipulating files and the Registry- Transactions - ADO.NET- Peer-to-Peer
Networking - PNRP - Building P2P Applications - Windows Presentation Foundation (WPF).
UNIT-IV (08Hours)
Window based applications - Core ASP.NET- ASP.NET Web forms -Windows Communication
Foundation (WCF)- Introduction to Web Services - .Net Remoting - Windows Service - Windows
Workflow Foundation (WWF) - Activities – Workflows
UNIT-V (08Hours)
Assemblies - Shared assemblies - Custom Hosting with CLR Objects - Appdomains - Core XAML -
Bubbling and Tunneling Events- Reading and Writing XAML - .Net Compact Framework - Compact
Edition Data Stores – Errors, Testing and Debugging – Optimizing performance – Packaging and
Deployment – Networking and Mobile Devices
Course Outcomes
CO1: Write various applications using C# Language in the .NET Framework.
CO2: Develop distributed applications using .NET Framework.
CO3: Create mobile applications using .NET compact Framework.
Text Books:
1. Christian Nagel, Bill Evjen, Jay Glynn, Karli Watson, Morgan Skinner . ―Professional C# 2012
and .NET 4.5‖, Wiley, 2012
2.Harsh Bhasin, ―Programming in C#‖, Oxford University Press, 2014.
3.Ian Gariffiths, Mathew Adams, Jesse Liberty, ―Programming C# 4.0‖, O‗Reilly, Fourth Edition,
2010.
4. Andrew Troelsen, Pro C# 5.0 and the .NET 4.5 Framework, Apress publication, 2012.
3rd L-T-P
MCAT309-OE INTERNET OF THINGS Credit 3
Semester 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

Introduction & Concepts: Introduction to Internet of Things, Physical Design of IOT, Logical Design
of IOT, IOT Enabling Technologies, IOT Levels. Domain Specific IOTs: Home Automation, Cities,
Environment, Energy, Retail, Logistics, Agriculture, Industry, Health & Life Style.
UNIT-II (08 Hours)

M2M & System Management with NETCONF-YANG: M2M, Difference between IOT and M2M,
SDN and NFV for IOT, Software defined Networking, Network Function Virtualization,
UNIT- II (08 Hours)

Need for IOT Systems Management, Simple Network Management Protocol, Limitations of SNMP,
Network Operator Requirements, NETCONF, YANG, IOT Systems management with NETCONF-
YANG.
UNIT-IV (08 Hours)

Developing Internet of Things & Logical Design using Python: Introduction, IOT Design
Methodology, Installing Python, Python Data Types & Data Structures, Control Flow, Functions,
Modules, Packages, File Handling, Date/ Time Operations, Classes, Python Packages
UNIT-V (08 Hours)

IOT Physical Devices & Endpoints: What is an IOT Device, Exemplary Device, Board, Linux on
Raspberry Pi, Interfaces, and Programming& IOT Devices.
Course Outcomes:
CO1: Able to understand the application areas of IOT
CO2: Able to realize the revolution of Internet in Mobile Devices, Cloud &Sensor Networks
CO3: Able to understand building blocks of Internet of Things and characteristics.
Text Books:
1.VijayMadisetti, Arshdeep Bahga,” Internet of ThingsA Hands-On- Approach”,2014, ISBN:978
0996025515
2. AdrianMcEwen, “Designing the Internet of Things”, Wiley Publishers, 2013, ISBN:978-1-118-
43062-0
3. Daniel Kellmereit, “The Silent Intelligence: The Internet of Things”. 2013, ISBN:0989973700
3rd SOFTWARE PROJECT L-T-P

MCAT310-OE Credit 3
Semester MANAGEMENT 3-0-0
Evaluation Scheme

05 05 05 25 60 100
UNIT-I (08 Hours)

Product Process and project—Definition—Product life Cycle: Prototype Development Phase, Alpha
Phase, Beta Phase, Production &Maintenance Phase—Project Life Cycle Models: Water fall Model,
Prototype Model, RAD & Spiral Model—Process Models.
UNIT-II (08 Hours)

Metrics—Software Configuration Management: Process and activities, Configuration audit, Metrics
in SCM, Tools & automation –Software Quality Assurance: Quality Control & Quality Assurance,
Tools, Measures of SQA Success–Risk Management: Risk Management Cycle, Risk Identification,
Quantification, Monitoring, Mitigation, Metrics in Risk Management.
UNIT-III (08 Hours)

In-Stream activities - Project initiation: activities, Outputs, Quality Records, completion criteria
–Project Planning and Tracking: Components, activities specific to Project tracking—Project
Closure: Effective closure Process issues, Metrics for Project Closure.
UNIT-IV (08 Hours)

Software requirement Gathering: Inputs and start criteria, Dimensions, steps, Output & Quality
records, Skill sets, Challenges, Metrics for Requirement Phase – Estimation: Phases of Estimation,
Methodology, Models for size estimation, Challenges, Metrics for Estimation Process —Design and
Development Phases-Project Management in Testing & Maintenance Phase.
UNIT-V (08 Hours)
Globalization Issues in Project management: Evolution, Challenges, Models –Impact of the internet
on Project Management: Effect of internet on Project Management, managing project for internet,
Project management activities – People Focused Process Models: People centric models, P-CMM,
other people focused Models.
Course Outcomes:
CO1: Identify the different project contexts and suggest an appropriate management strategy.
CO2: Practice the role of professional ethics in successful software development.
CO3: Identify and describe the key phases of project management.
CO4: Determine an appropriate project management approach through an evaluation of the business
context and scope of the project.
Text Books
1. Ramesh Gopalaswamy, “Managing and global Software Projects”, Tata McGraw
Hill. Tenth Reprint 2011. (Revised)
2. Roger S. Pressman, “Software Engineering - A Practitioner’s Approach”, 7th
Edition McGraw Hill, 2010. (Revised).
L-T-
3rd INTERNET AND WEB TECHNOLOGY Credit
MCAP301 P
Semester LAB 2
0-0-2
Evaluation Scheme

Report Total
20 30 30 20 100
LIST OF PROGRAMS:
1.To create a simple student bio-data form using html

2. To create an html page with different types of frames such as floating frame, navigation frame &
mixed frame.
3. Design the webpage by applying the different styles using inline, external & internal style sheets.
4. Write a java script program to read .XML file and display data in a neat format.
5. To write a Java script program to define a user defined function for sorting the values in an array.
6. To create an html page to demonstrate exception handling in java script
7. Write a jsp servlet program to implement the single text field calculator.
8. Write a jsp servlet program to demonstrate session handling using – url rewriting --hidden form
field --cookies –sessions
9. To create a php program to demonstrate the different predefined function in array, Math, Data &
Regular Expression.
10. Write a program in PHP for a simple email processing with attachment using forms
Course Outcomes:
CO1: To introduce client-side scripting with Java script and DHTML
CO2: To introduce server-side programming with Java servlets, JSP and PHP.
CO3: To learn the basic web concepts and Internet protocols
CO4: Able to do server-side programming with Java Servlets, JSP and PHP.
L-T-
3rd DATA MINING AND DATA Credit
MCAP302 P
Semester WAREHOUSING LAB 2
0-0-2
Evaluation Scheme

Report Total
20 30 30 20 100
LIST OF PROGRAMS:
1. Build Data Warehouse and Explore WEKA

2. Perform data preprocessing tasks association rule mining on data sets
3. Demonstrate performing classification on data sets
4. Demonstrate performing clustering on data sets
5. Demonstrate performing Regression on data sets
6. Credit Risk Assessment. Sample Programs using German Credit Data
7. Sample Programs using Hospital Management System
Course Outcomes:
CO1: Ability to understand the various kinds of tools
CO2: Demonstrate the classification, clustering and etc. in large data sets
CO3: Ability to add mining algorithms as a component to the exiting tools.
CO4: Ability to apply mining techniques for realistic data
L-T-
3rd DESIGN AND ANALYSIS OF Credit
MCAP303 P
Semester ALGORITHMS LAB 2
0-0-2
Evaluation Scheme

Report Total
20 30 30 20 100
LIST OF PROGRAMS:
1. Implementation of Stack and Queue – Operations and Applications.

2. Implementation of different searching algorithms.
3. Implementation of different sorting algorithms.
4. Problem solving using Divide and Conquer technique.
5. Problem solving using Dynamic Programming technique.
6. Problem solving using Greedy technique.
7. Problem solving using Backtracking technique.
8. Problem solving using disjoint-set data structure operations.
9. Problem solving using Branch and Bound technique.
10.Problem solving for the Maximum Flow problem.
11.Implementation of Graph Traversal algorithms – Breadth-First-Search
(BFS) and Depth- First-Search (DFS).
12. Implementation of Minimum Spanning Tree construction algorithms – Kruskal and
Prim.
13. Implementation of different String-Matching algorithms.
14. Problem solving for the Shortest Path problem using different algorithms.
15. Problem solving using Approximation algorithms.
Course Outcomes:
CO1: Design algorithms using appropriate design techniques (brute-force, greedy, dynamic
programming, etc.).
CO2: Implement a variety of algorithms such assorting, graph related, combinatorial, etc., in
a high-level language.
CO3: Analyze and compare the performance of algorithms using language features.
CO4: Apply and implement learned algorithm design techniques and data structures to solve
real- world problems.

COMPLETE Syllabus

Uploaded by

Copyright:

Available Formats

COMPLETE Syllabus

Uploaded by

Document Information

Original Title

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

COMPLETE Syllabus

Uploaded by

Copyright:

Available Formats

GITA AUTONOMOUS COLLEGE

TWO-YEAR POST-GRADUATE PROGRAM

Program Educational Objectives (PEOs)

Program Specific Outcomes (PSOs)

Internal Evaluation Scheme

Practical/Sessional Evaluation Scheme

Practical and its assessments:

Teacher’s Assessment Written Assessment Total

UNIT – I (08 hours)

UNIT – II (08 hours)

UNIT – III (08 hours)

UNIT – IV (08 hours)

UNIT – V (08 hours)

1. E. Balagurusamy, Programming in ANSI ‘C’, 8th Edition, Tata McGraw Hill,2019.

1st COMPUTER ORGANIZATION AND L-T-P

Teacher’s Assessment Written Assessment Total

UNIT – I (08 hours)

UNIT – II (08 hours)

UNIT – III (08 hours)

UNIT – IV (08 hours)

Input-Output organization: Peripheral Devices, I/O output interface, Asynchronous data

Memory Organization: Memory Hierarchy, Main Memory, Cache Memory.

UNIT – V (08 hours)

1. Hamacher, Computer Organization, 5th Edition, Mc Graw Hill Education,2011.

Teacher’s Assessment Written Assessment Total

UNIT-I (08 hours)

UNIT-II (08 hours)

UNIT-III (08 hours)

UNIT-IV (08 hours)

UNIT-V (08 hours)

1. C. L. Liu, D. P. Mohapatra, Discrete Mathematics: A Computer Oriented Approach,

1. B. Kolman, R. C. Busby, S. Ross, “Discrete Mathematical Structures”, Prentice Hall of

Teacher’s Assessment Written Assessment Total

UNIT – I (06 hours)

UNIT – II (08 hours)

UNIT – III (10 hours)

UNIT-IV (08 hours)

UNIT-V (08 hours)

1. R. Elmasri and S. B. Navathe, Fundamentals of Database Systems, Pearson Education,

Teacher’s Assessment Written Assessment Total

UNIT-II (08 hours)

UNIT-III (08 hours)

UNIT-IV (08 hours)

UNIT-V (08 hours)

1. Silberschatz& Galvin, Operating system concepts, 9th Edition, Wiley,2018.

1. P. C. Bhatt, An Introduction to Operating Systems: Concepts & Practice, 4th

1st PERSONALITY AND SOFTSKILL L-T-P

Teacher’s Assessment Written Assessment Total

UNIT-I (08 Hours)

UNIT-II (08 Hours)

UNIT-III (08 Hours)

UNIT-IV (08 Hours)

UNIT-V (08 Hours)

1. Real Writing with Readings by Susan Anker

Teacher’s Assessment Written Assessment Total

UNIT-I (08 Hours)

UNIT-II (08 Hours)

UNIT-III (08 Hours)

UNIT-IV (08 Hours)