M.Sc. Computer Science Exam Scheme
M.Sc. Computer Science Exam Scheme
Session 2019-20
Exam 2020 and 2021
SCHEME OF EXAMINATION
Semester I
Course Course Name Exam Maximum Marks Minimum Credit L T P
Code Hours Passing Marks
Internal External
Marks Marks
Theory Papers
MCS 101 Mathematics for 3 10 40 13 5 4 1 0
(CC) Computer Science (25%)
60 240 25
Total of Theory (Internal 60 + External 240) 300 108
(36% aggregate)
CC=Core Compulsory
Semester II
Paper Code Paper Name Exam Maximum Marks Minimum Credits L T P
Hours Passing
Internal External Marks
Marks Marks
Theory Papers
MCS 201 Database Management 3 10 40 13 5 4 1 0
(CC) System (25%)
MCS 202 Data Communication 3 10 40 13 5 4 1 0
(CC) and Networking (25%)
MCS 203 Operating System 3 10 40 13 5 4 1 0
(CC) (25%)
MCS 204 PHP 3 10 40 13 5 4 1 0
(CC) (25%)
MCS 205 Combined Practical 6 20 80 25 5 0 0 5
(CC) (25%)
60 240 25
Total of Theory (Internal 60 + External 240) 300 108
(36%
aggregate)
CC=Core Compulsory
Semester III
Paper Code Paper Name Exam Maximum Marks Minimum Credits L T P
Hours Passing
Internal External
Marks
Marks Marks
Theory Papers
MCS 301 Data Structures 3 10 40 13 5 4 1 0
(CC) (25%)
MCS 302 a) Java 3 10 40 13 5 4 1 0
(CE) b) Python (25%)
MCS 303 a) Software Engineering 3 10 40 13 5 4 1 0
(CE) & Research (25%)
Methodology
b) Artificial Intelligence
MCS 304 Combined Practical 6 20 80 25 5 0 0 5
(CC) (25%)
MCS 305 a) Data Analysis 3 10 40 13 5 4 1 0
(EO) Using R (25%)
a) Introduction to
LaTeX
60 240 25
Grand Total (Internal 60 + External 240) 300 108
(36%
aggregate)
CC=Core Compulsory, CE= Core Elective, EO = Elective Open
Semester I
Paper Code:MCS-101
Paper Name: Mathematics for Computer Science
Objective – After successful completion of this course, the student will have the basic
knowledge of Mathematics that is required for better understanding of other computer science
courses.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Note: Non-Scientific Calculator may be allowed in end-semester examination.
Unit – I
Sets: different types of sets, set operations; Basic Counting Principles, Pigeonhole Principle,
Binomial Coefficients, Binomial Theorem, Permutations, Combinations; Matrices: addition,
multiplication; Vectors: Position vector, addition, subtraction and products of vectors.
Unit - II
Mathematical Induction; Logic: Propositions and logical operations, Conditional statements,
Tautologies and Contradictions, Logical Equivalence, quantifiers.
Unit - III
Relations: Representation of Relations, Properties of relations, transitive closure; Ordered
Sets: poset, Properties, Hasse Diagram, Extremal elements of posets ; Functions: Types of
Functions, Asymptotic notations; Co-ordinate Systems: representation of points, straight
lines, standard equation of circles.
Suggested Readings
Paper Code:MCS-102
Paper Name : Internet Programming
Objective - After successful completion of this course, the student will understand, analyze
and apply the role languages like HTML, CSS, JavaScript and protocols in the workings of
web and websites.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Internet Basics: Evolution of Internet, Basic internet terms and applications. ISP, Anatomy of
an e-mail Message, basic of sending and receiving, E-mail Protocol; Mailing List-
Subscribing, Unsubscribing. Introduction to World Wide Web and its work, Web Browsers,
Search Engine, Downloading, Hyper Text Transfer Protocol (HTTP), URL, Web Servers,
FTP, Web publishing- Domain Name Registration, Space on Host Server for Web
Site,Maintain and Updating.
Unit - II
HTML: Elements of HTML & Syntax, Comments, Headings, Paragraph, Span, Pre Tags,
Backgrounds, Formatting tags, Images, Hyperlinks, div tag, List Type and its Tags, Table
Layout, div, frame, Use of Forms in Web Pages. CSS:Introduction to Cascading Style
Sheets, Types of Style Sheets (Inline, Internal and External), using Id andClasses, CSS
properties: Background Properties, Box Model Properties, Margin, Padding, List Properties,
Border Properties, Positioning Properties,
Unit - III
Java Script: Introduction to Client Side Scripting, Introduction to Java Script, Comments,
Variables in JS, Global Variables, Data types, Operators in JS, Conditions Statements (If, If
Else, Switch), Java Script Loops (For Loop, While Loop, Do While Loop), JS Popup Boxes
(Alert, Prompt, Confirm), JS Events, Onload, Onunload, Onsubmit, OnFocus, Onchange
Event, Onblur Event, Onmouseover, Onclick, Ondbclick Events, JS Arrays, Working with
Arrays, JS Objects, Window object, Document object, JS Functions, getElementById,
innerHTML property, inner Text property, form validation, email validation.
Suggested Readings
1. Thomas A. Powell , “HTML: The Complete Reference”, Osborne/McGraw-Hill
2. Deitel, Deitel and Nieto : Internet & WWW. How to program, 2nd Edition,
Pearson Education Asia.
3. E Stephen Mack, Janan Platt : HTML 4.0 , No Experience Required, 1998, BPB
Publications.
4. "HTML Complete" by Sybex, BPB Publications, 2001.
Paper Code:MCS-103
Paper Name : Computer Organization
Objective - After successful completion of this course, the student will understand basic
computer organization, design and micro-operations, understanding of CPU functioning and
computer arithmetic, learning techniques of memory organization and 8085
Microprocessor.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Note: Non-Scientific Calculator may be allowed in end-semester examination.
Unit I
Unit II
Unit III
Intel 8085 Microprocessor:Introduction, ALU, Timing and Control Unit, Register Set, Data
and Address Bus, Addressing modes, Complete Intel 8085 Instruction set, Instruction format,
Opcode and Operand, Word Size, Instruction Cycle, Pin Configuration, Intel 8085 programs.
Suggested Readings
Paper Code:MCS-104
Paper Name : C++ Programming
Objective – After successful completion of this course student will have an understanding for
the concepts of object oriented programming and a practical hand to solve the various
problems using C++ programming language in a professional way.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Unit II
Class: Basics, static data members, Inline Function, Constructors and Destructors: need,
types, usage, Inheritance - need, usage, types, compile time and run time polymorphism,
overloading and overriding, virtual function, friend function, abstract class. Operator
overloading: need, rules, through member function and through friend function.
Unit III
String handling, String class, Templates, Searching and Sorting: Searching: Linear Search,
Binary Search. Sorting: Insertion Sort, Selection Sort, Quick Sort, Bubble Sort, Heap Sort,
Shell Sort, Merge sort, Radix Sort, Counting Sort, Bucket Sort.
Suggested Readings
Paper Code:MCS-201
Paper Name : Database Management System
Objective – The aim of this course is to furnish students with the knowledge about back end
of software systems. After completing this course, the students will be well versed with the
required theoretical and practical aspects of designing, creating and using a database.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Introduction: Charecteristics of database approach, Advantages, Database system
architecture, Overview of different types of Data Models and data independence, Schemas
and instances, Databse languges and interfaces; E-R Model : Entities, Attributes,keys,
Relationships, Roles, Dependencies, E-R Diagram; Normalization: Definition, Functional
dependencies and inference rules, 1NF, 2NF, 3NF and BCNF.
Unit II
Introduction to Relational model, Constraints: Domain, Key, Entity integrity, Referential
integrity; Keys: Primary, Super, Candidate, Foreign; Relational algebra: select, project,
union, intersection, minus, cross product, different types of join , division operations;
aggregate functions and grouping; SQL: Data Types, statements: select, insert, update,delete,
create, alter, drop; views, SQL algebraic operations, nested queries; Stored procedures:
Advantages, Variables, creating and calling procedures, if and case statements, loops,
Cursors, Functions, Triggers.
Unit III
Transactions processing: Definition , desirable properties of transactions, serial and non-
serial schedules ,concept of serialazability , conflict-serializable schedules; Concurrency
Control: Two-phase locking techniques, dealing with Deadlock and starvation, deadlock
prevention protocols, basic timestamp ordering algorithm; Overview of database recovery
techniques; concept of data warehousing.
Suggested Readings
Paper Code:MCS-202
Paper Name : Data Communication and Networking
Objective – After successful completion of this course student will have an understanding of
network, concepts transmission media and realize and compare different LAN topologies,
implement and compare the performance of different Layer protocols and cyber security.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit - I
Data Communication and Networking: Overview, Network Types, LAN Technologies,
Topologies, Models- OSI Model, TCP/IP Stack, Security
Physical Layer: Introduction, Impairments, Performance, Digital Transmission, modes,
digital to digital, analog to digital, Analog Transmission, digital to analog, analog to analog,
Transmission media, Wireless Transmission, Multiplexing, FDM, TDM, CDM, WDM,
Switching techniques: Circuit Switching, Packet switching, Datagram, Virtual circuit
and Permanent Virtual Circuit, Connectionless and connection oriented communication,
Message switching,
Unit - II
Data Link Layer: Introduction, Error detection and Correction, Data Link Control: Line
Discipline- Enq/Ack, Poll/Select, Flow Control : Stop And Wait, Sliding Window, Error
Control : ARQ, Stop and Wait ARQ, Sliding Window ARQ.
Network Layer: Introduction, Network Addressing, Routing, Internetworking, Tunneling,
Packet Fragmentation, Network Layer Protocols, ARP, ICMP, IPv4, IPv6
Transport Layer: Introduction, Function, End to end communication, Transmission Control
Protocol, User Datagram Protocol
Application Layer: Introduction, Client-Server Model, Application Protocols, Network
Services
Unit - III
Cyber Security: definition, cybercrime and information security, cybercriminals,
classification of cybercrime. Cyber offences: categories of cybercrime.
Tools and methods used in cybercrime: phishing, types of phishing, types and techniques
of ID theft, password cracking, keyloggers and spywares, backdoors, steganography, DoS,
SQL Injection.
Cybercrime on mobile and wireless devices: attacks on wireless networks, Authentication
security service, attacks on mobile phones. Cyber Law, The Indian IT Act, Digital Signatures,
Anti- Cybercrime Strategies, Cyberterrorism, Indian ITA 2000.
Suggested Readings
Paper Code:MCS-203
Paper Name : Operating System
Objective – After successful completion of this course, the student will have
fundamental knowledge of internal working of operating system and basic working
knowledge of Linux.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credits: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each
unit of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Introduction to Operating System, layered Structure, Functions, Types; Process: Concept,
Process States, PCB; Threads, System calls; Process Scheduling: types of schedulers, context
switch, CPU Scheduling, Pre-Emptive Scheduling, Scheduling Criteria- CPU Utilization,
Throughput, Turnaround Time, Waiting Time, Response Time; Scheduling Algorithms-
FCFS, SJF, Priority Scheduling, Round Robin Scheduling, MLQ Scheduling, MLQ With
Feedback.
Unit II
Synchronization: Critical Section Problem, Requirements for a solution to the critical section
problem; Semaphores,simple solution to Readers-Writers Problem. Deadlock:
Characterization, Prevention, Avoidance, Banker’s Algorithm, Recovery from Deadlock.
Memory Management: Physical and virtual address space, Paging, Overview of
Segmentation;Virtual Memory Management: Concept,Page Replacement techniques- FIFO,
LRU, Optimal
Unit III
Linux:features of Linux, steps of Installation, Shell and kernel, Directory structure, Users and
groups,file permissions, commands- ls, cat, cd, pwd, chmod, mkdir, rm, rmdir, mv, cp, man,
apt, cal, uname, history etc. ; Installing packages; Shell scripts: writing and executing a shell
script,shell variables, read and expr, decision making (if else,case), for and while loops.
Suggested Readings
Paper Code:MCS-204
Paper Name : PHP
Objective – After successful completion of this course, the student will have Learn the basic
concepts & techniques of php, generate an application based upon the concepts of php and
will learn how to connect a php application with database.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit – I
PHP: Installation of PHP. Building Blocks of PHP: Variables, data types, Operators &
Expressions, Constants, Switching, Flow, Loops. Functions: Meaning, Calling, Defining a
function. Return value from user defined function. Arrays: Creating arrays, Array related
functions.Working with String, Date & Time: Formatting String with PHP, Using Date and
time Functions with PHP. Working with file and Directories.
Unit – II
Forms: Creating simple input Form. Accessing Form input with user defined arrays, HTML
and PHP Code on a single page. Redirecting User. Working with File Upload. Uploading &
Downloading.State management: Using query string(URL rewriting), Using Hidden
field, Using cookies, Using session. Email: Sending Email, Headers. Exception Handling:
Understanding Exception and error, Try, catch, throw
Unit – III
Connecting to the MYSQL: Selecting a database, Adding data to a table, Displaying
returned data on Web pages, Inserting data, Deleting data, Entering and updating data,
Executing multiple queries, executing stored procedures.
Suggested Readings
Paper Code:MCS-301
Paper Name : Data Structures
Objective – This offered course give student an insights into programming structures where
data can be hold by a program during the runtime. After successful of this course, the student
will be able to effectively create and use data structures in the program.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consist of 9 questions (3 questions from
each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit of
syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Algorithm: Efficiency & Analysis Algorithm: Time and Space complexity of Algorithm.
Abstract Data Type: Linked List- Linear, Circular, Two Way List, Basic Operation on
Linked Lists, Application of Linked List.
Unit II
Stack : primitive operations, stack Application- Infix, postfix, prefix and Recursion Array
and Linked Representation of Stack. Queue: Primitive operation, Circular Queue, Priority
Queue, D-queue, Array and Linked Representation of Queue.
Unit III
Trees : Basic terminology, Binary Tree : Representation as Array and link List, Basic
operation, Tree Traversal : Inorder, Preorder, Postorder, Application of Binary Tree. B-tree,
Height Balance Tree (AVL Tree) Graph : Basic Terminology, Directed, Undirected,
Weighted, Representation of Graphs, Graph Traversal : Depth First Traversal, Breadth First
Search.
Suggested Readings
1. Expert Data Strutcture with ‘C’ By R.B Patel (Khana Book Publishing Co.(P))
2. Data structure By Lipschutz (Tata McGraw Hill)
3. Data Structure By Yashvant Kanitkar (BPB)
4. An Introduction to Data Structures with Applications By Jean-Paul Tremblay, Paul
G.Sarerson (Tata McGraw Hill)
5. Data Structure Using C and C++ By Yedidyah Langsam, Moshe J.Augenstein, Arora
M. Tenenbaum (Prentice- Hall India)
Paper Code:MCS-302(a)
Paper Name : Java
Objective – This course is offering the basic concepts & techniques of OOPs with java,
multithreading, exceptions, applets and students will able to generate an application based
upon the concepts of java.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Introduction to java: evolution, features, comparison with C and C++; Java program
structure; tokens, keywords, constants, variables, data types, type casting, statements,
Operators and Expression; Conditional Statements and Loop Statements. Class: syntax,
instance variable, class variables, methods, constructors, overloading of constructors and
methods.
Unit II
Inheritance: types of inheritance, use of super, method overriding, final class, abstract class,
wrapper classes.
Arrays, Strings and Vectors, Packages and Interfaces, visibility controls
Unit III
Errors and Exceptions: Types of errors, Exception classes, Exception handling in java, use
of try, catch, finally, throw and throws. Taking user input, Command line arguments.
Multithreaded Programming: Creating Threads, Life cycle of thread, Thread priority,
Thread synchronization, Inter-thread communication, Implementing the Runable Interface;
Applet: Applet Life Cycle, Applet Tag, Adding Applet to HTML File; Passing Parameters to
Applets, Getting Input From User.
Suggested Readings
1. The Complete reference Java Ninth Edition By Herbert Schildt (Tata McGraw Hill)
2. Beginning Programming with Java For Dummies by Burd, For Dummies; 3 edition
3. Java: A Beginner's Guide, Sixth Edition: A Beginner's Guide by Herbert Schildt,
McGraw-Hill Osborne MediaProgramming in JAVA By E. Balagurusamy (TMH)
4. JAVA 2 programming Black Book By Steven Holzner et al. (Dreamtech Press)
5. Programming in JAVA By E. Balagurusamy (TMH)
Paper Code:MCS-302(b)
Paper Name : Python
Objective – After successful completion of this course, the student will have the
fundamental knowledge of programming in Python and various constructs.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Overview of Programming : Structure of a Python Program, Python Interpreter, Using Python
as calculator, Python shell, Indentation. Identifiers and keywords, data types, Operators.
Creating Python Programs : Input and Output Statements, if-else statements, Loops(while,
for) and Control Statements (continue, break), nested loops.
Unit II
Functions and scoping. Iteration and Recursion, Lambda function, Simultaneous assignment,
Implementing 2-D matrices. Strings and Lists: String as a compound data type, Length,
Traversal, String slices, String comparison, find function, Looping and counting, List values,
Accessing elements, List length, List membership, Lists and for loops, List operations, List
deletion. Cloning lists, Nested lists . Exception handling.
Unit III
Basic File Operations in Python, Object Oriented Programming: Introduction to Classes,
Objects and Methods, Standard Libraries. Tuples, sequences and dictionaries. Overview of
sets, stacks and queues. Overview of : networkx, matplotlib.pyplot, numpy. Applications of
Python in real world.
Suggested Readings
1. T. Budd, Exploring Python, TMH, 1st Ed, 2011
2. Introduction to Computation and Programming Using Python. By John V. Guttag,
MIT Press.
3. Learning Python , Mark Lutz, David Ascher, O’Reilly
Web Resources
1. http://files.swaroopch.com/python/byte_of_python.pdf
2. https://www.cs.uky.edu/~keen/115/Haltermanpythonbook.pdf
3. http://greenteapress.com/thinkpython/thinkpython.pdf
4. Python turorials: https://docs.python.org/3/tutorial/index.html
Paper Code:MCS-303(a)
Paper Name : Software Engineering & Research Methodology
Objective – After completing this course the student will have an understanding of concepts
of software engineering and Research Methodology
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Note: Scientific Calculator may be allowed in end-semester examination.
Unit I
Software : Software Characteristics, Software Process, Process Characteristics, Software
Process Model : Linear Sequential Model, Prototyping Model, Spiral Model, Software
Quality, McCall’s Quality Factors, Software Requirement Analysis and Specification
(SRS) : Need Characteristics and Components.
Unit II
Planning a Software Project: COCOMO Model, Project Monitoring Plan and Risk
Management. Design Principle : Abstraction, Modularity, Cohesion and Coupling, Software
Management : Size Oriented Matrices, Function Oriented Matrices. Testing : Testing
Fundamental, Functional Testing (Black Box), Structural Testing (White Box), Alpha And
Beta Testing, Testing Process : Comparison of Different Testing, Level of Testing.
Unit III
Suggested Readings
Paper Code:MCS-303(b)
Paper Name : Artificial Intelligence
Objective – The proposed course offer students the idea various aspects and applications of
artificial intelligence.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Definition, History, Agents and environment, Defining the problem as a state and space
search, What is Intelligence? Types of Intelligence, Difference between Human and Machine
Intelligence, The Structure of Intelligent Agents. Solving problems by searching: Uninformed
search strategies- Brute-Force, Breadth-First, Uniform-cost search Depth-First, Depth-limited
search,depth-first search, Bidirectional search.Informed (heuristic) search strategies- Greedy
best-first search, A*, AO* Memory-bounded heuristic search.
Unit II
Heuristic functions, local search algorithms- Hill-climbing search, Simulated annealing,
Local beam search. Knowledge Based System: Knowledge, Procedure V/S Declarative
Knowledge, Knowledge Representation: Using Procedural and Predicate Logic, Inference in
First order logic: Unification and Lifting, Forward Chaining, Backward Chaining, Resolution.
Rule based System, Frames, Frames, Scripts, and Semantic Nets.
Unit III
Probabilistic Reasoning, Probability and Byes Theorem, represent knowledge in uncertain
domain, Certainty factors, Baysian Networks, Dempster–Shafer theory, introduction to Fuzzy
logic. Learning: types of learning, decision trees. Expert System: types, architecture.
Introduction to Artificial Neural Networks, Reinforcement learning, Natural Language
Processing, Pattern Recognition and Perception.
Suggested Readings
Paper Code:MCS-305(a)
Paper Name : Data Analysis Using R
Objective - After successful completion of this course, the student will have working
knowledge of R and he/she will be able to do elementary data analysis using R.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Foundations for data analysis-matrices, notion of probability, concept of random variables
and various distributions, mean, variance, covariance, normal distributions, overview of
sampling , hypothesis testing, confidence interval, concept of optimization.
Unit II
installation of R, data editing, use of R as a calculator; functions and assignments. matrix
operations, logical operators, Conditional executions and loops, data management with
sequences, repeats, sorting and ordering, lists, vector indexing, factors; display and
formatting of strings.
Unit III
Working with data frames, Importing data files; Graphics and plots; basic statistical functions
for central tendency, variation, boxplots, skewness and kurtosis, correlations; overview of
using R functions for a simple hypothesis testing, Applications of R .
Suggested Readings:
Paper Code:MCS-305(b)
Paper Name : LaTeX: a document preparation system
Objective - After successful completion of this course, the student will be able to create a
polished document with high typographical quality for research papers/articles.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Installation of the software LaTeX, Structure of LaTeX documents; Special Characters,
Producing equations, Matrices, Tables, itemised lists, hypertext links ;Page Layout –Title,
Abstract , Chapters, Sections, References.
Unit II
Including graphics, images, floating bodies; Producing basic mathematical graphics like line
segments, arrows, circles, ovals, Generating index and bibliography, creating PDF file.
Unit III
Adding a new command; generating spaces ,colored text ; Writing a sample resume, question
paper , article/ research paper; Creating presentation using beamer.
Suggested Readings:
1. LaTeX: A Document Preparation System, By Leslie Lamport, Addison- Wesley.
2. LaTeX Beginner's Guide , by Stefan Kottwitz , Packt Publishing Limited
3. Tobias Oetiker, Hubert Partl, Irene Hyna and Elisabeth Schegle: The Not So Short
Introduction to LaTeX 2e, https://tobi.oetiker.ch/lshort/lshort-a5book.pdf, 2014.
Paper Code:MCS-401(a)
Paper Name : Data Mining
Objective – After successful completion of this course, the student will have the basic
knowledge of concepts including classification, association and clustering.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Note: Scientific Calculator may be allowed in end-semester examination.
Unit I
Data mining Introduction: Definition, Data mining tasks, Data mining as a step of Knowledge
discovery process, Applications of Data mining; Data objects and types of attributes,
Recalling mean, median ,mode and weighted arithmetic mean, Data quality , overview of
data preprocessing.
Unit II
Classification analysis- definition, Overview of various classification techniques; Decision
tree induction- working, examples ,specifying attribute test conditions , Measures of node
impurity, measures for selecting best split; Evaluating the performance of a classifier-
Holdout method, Random subsampling , cross-validation, Bootstrap.
Unit III
Association analysis: support, confidence, association rules, Frequent Item sets; Frequent
itemset generation - Apriori principle , Apriori algorithm and examples, FP growth algorithm
and examples; Closed and maximal frequent itemsets. Cluster analysis: Definition , overview
of basic clustering methods, Density based methods-DBSCAN.
Suggested Readings
1. Data Mining: Concepts and Techniques, 3rd edition, Jiawei Han and Micheline Kamber
2. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Pearson
Education.
3. Data Mining: A Tutorial Based Primer, Richard Roiger, Michael Geatz, Pearson Education
2003.
4. Introduction to Data Mining with Case Studies, G.K. Gupta, PHI 2006
5. Insight into Data mining: Theory and Practice, Soman K. P., DiwakarShyam, Ajay V., PHI
2006
6. Data Mining:: Practical Machine Learning Tools and Techniques (Morgan Kaufmann
Series in Data Management Systems) by Witten, Frank, Hall
Paper Code:MCS-401(b)
Paper Name : Computer Graphics & Multimedia
Objective – After successful completion of this course, the student will have the
fundamental knowledge of computer graphics , multimedia and working knowledge of
Blender tool.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Note: Non-Scientific Calculator may be allowed in end-semester examination.
Unit I
Basic elements of Computer Graphics, Graphics display devices, Applications of Computer
Graphics, Raster and random scan; Color Models :RGB, CMY, HSV; Graphics Standard :
openGL; Scan Conversion: DDA line algorithm, Mid-point circle Algorithm. 2D
Transformation: Translation, Rotation, Scaling, Homogenous Co-ordinates and Matrix
Representation of 2D Transformation, Composite Transformation.
Unit II
3D Graphics: Matrix Representation of 3D transformations, Translation, Rotation, Scaling,
Composite Transformation. Overview of concepts:Clipping, orthographic and parallel
projection, hidden surface removal, lighting , transparency, modelling and texturing,
rendering ; Animations : Principles of animations ,keyframing,concept of 2D and 3D
animation .
Unit III
Blender: GUI Interface, Selecting,rotating and Translating Objects, Using Snap to move
objects precisely, Creating mesh primitives and extrusions, Subdividing meshes, Creating a
simple creature, Joining mesh objects and stitching vertices , Organizing a scene with layers,
groups, and hierarchies, Assigning glossy and reflective materials to objects, Creating bump
maps, Creating sky and ambient light, Understanding ambient occlusion, Adding motion blur
and depth of field, Editing animation in the Graph Editor, Building and animating a simple
character.
Suggested Readings
1. Computer Graphics (Principles and Practice) by Foley, van Dam, Feiner and Hughes,
Addisen Wesley (Indian Edition)
2. Computer Graphics by D Hearn and P M Baker, Printice Hall of India (Indian Edition).
3. Mathematical Elements for Computer Graphics by D F Roger.
4. Introduction to Computer Graphics By Krihsnamurthy N (Tata McGraw Hill
5. Theory and Problems of Computer Graphics (Schaum's Outline) By Zhigang X. and
Plastock Ra. (Tata McGraw Hill)
Web Resources
1. https://www.cs.duke.edu/brd/Teaching/Previous/Animation/animation.html
2. http://zikky.lecturer.pens.ac.id/Produksi 3D untuk Designer/Beginning Blender-book.pdf
3.http://www.blenderhd.com/wp-content/uploads/2015/08/BeginnersGuideToBlender.pdf
4. https://people.sc.fsu.edu/~gerlebacher/gd/blender/blender/blender_noob_to_pro.pdf
Paper Code:MCS-402(a)
Paper Name : Android Programming
Objective – This offered course give students the basic concepts & techniques of Android
Programming with java and they will able to generate a mobile app based upon the
concepts of android.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit -I
java ( Exception handling & Packages & interfaces & JVM & .jar file extension & Multi
threading. Database(DML&DDL) , What is Android & Setting up development environment
& various editors. Application Structure ( AndroidManifest.xml , uses-permission & uses-sdk
, Resources & R.java , Assets & Layouts &Drawable Resources , Activities and Activity
lifecycle.
Unit - II
Eclipse editor :(Menu , Option menu , Context menu , Sub menu , menu from xml , menu by
code). SQLite Programming , SQLiteOpenHelper , SQLiteDatabse. Adapters and Widgtes (
Adapters:- a. ArrayAdapters b. BaseAdapters , ListView and ListActivity , Custom listview ,
GridView using adapters , Gallery using adapters).
Unit - III
Suggested Readings
1. Android Programming for Beginners by John Horton Publisher: Packt Publishing
2. Learn Java for Android Development (2nd edition) by Jeff Friesen Publisher: Apress
3. Android application development for java programmers. By James C. Sheusi.
Publisher: Cengage Learning, 2013.
Paper Code:MCS-402(b)
Paper Name : Advanced Web Programming
Objective – This offered course give students the basic concepts & techniques of OOPs with
C# and make the able togenerate a web application based upon the concepts of ASP.NET
with C# and database connectivity.
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit -I
Basic of the .NET framework: .NET Architecture, managed code, assemblies, clr, execution
of assemblies code, il, jit, net framework class library, common type system, common
language specification. Overview C#, similarities and differences from JAVA, Structure of
C# program. Language features- Type system, boxing and Unboxing, flow controls, Classes,
Properties, Indexers, Constructors, Inheritance, Interfaces, Delegates.
Unit -II
Understanding ASP.NET Controls: Web forms, Buttons, Text Box, Labels, Checkbox, Radio
Buttons, List Box etc. Running a web Application, creating a multiform web project, Form
Validation Controls- Required Field, Compare, Range. Calendar Control, Ad Rotator
Control, State Management-View State, Session State, Application State.
Unit -III
Architecture Of ADO.NET, Connected and Disconnected Database, Create Connection Using
ADO.NET Object Model, Connection Class, Command Class, DataReader Class, Data
adapter Class, Dataset Class. Display Data on Bound Controls and Gridview. Database
Accessing on Web Applications: Insert records in database, delete and update records from
database, Display a particular record and all records on web form.
Suggested Readings
Paper Code:MCS-403(a)
Paper Name : Cloud Computing
Objective – After completing this course the student will have an understanding of key
aspects of cloud computing
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
Introduction to Cloud Computing, Services provided by cloud-SaaS, PaaS, IaaS, DaaS etc.
Functioning of cloud computing, Advantages, Disadvantages, Applications, Cloud Service
Providers- Amazon AWS, Google App Engine, Microsoft, VMware. Virtualization concepts,
Objectives, Types of Virtualization & its benefits, Introduction to Various Virtualization OS
(Hypervisor). Virtualization for Enterprises
Unit II
Designing and Implementing a Data Center-Based Cloud, Industry and International
Standards for Cloud Implementation, Building private cloud using open source tools,
Integration of Public and Private Cloud. Private, Public & Hybrid Clouds, their Advantages
& Disadvantages, On Premises and Off Premises Cloud services, installing a Cloud service.
Unit III
Cloud Security issues - Infrastructure Security, Network level security, Host level security,
Application level security, Data privacy and security Issues, Jurisdictional issues raised by
Data location, Access Control, Trust, Reputation, Risk and Authentication in cloud
computing
Suggested Readings
1. Cloud Computing Concepts Technology and Architecture by Thomas Erl, Prentice Hall
2. Cloud Computing principles and paradigms by Rajkumar Buyya, James Broberg and
Andrzej Goscinski, John Wiley and Sons, Inc. Publication
3. Cloud Computing Theory and Practice by Dan C. Marinescu, Morgon Kaufman
Publication
Paper Code:MCS-403(b)
Paper Name : Internet of Things
Objective – The objective of this course is to introduce basic concepts of IOT and its
applications
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13
Credit: 5
The question paper contains 3 sections. Section-A consists of 10 questions (at least 3
questions from each unit of syllabus). Section-B will consists of 9 questions (3 questions
from each unit of syllabus). Section-C will consist of 6 questions (2 questions from each unit
of syllabus). The word limit of part A, B and C are 50, 200 and 500 respectively
Unit I
M2M to IoT : Introduction, Market Prespective, Architectural Overview. M2M to IOT
Technology- Devices and gateways, Local and wide area networking, Data management,
Business processes in IoT, IoT analytics, Knowledge management, IOT Architecture,
Architecture Reference Model, Real world design constraints.
Unit II
IOT Use Cases- Asset Management, Industrial Automation- Service-oriented architecture-
based device integration, SOCRADES: realizing the enterprise integrated Web of Things,
IMC-AESOP: from the Web of Things to the Cloud of Things, Commercial Building
Automation- Introduction, Case study: phase one-commercial building automation today,
Case study: phase two- commercial building automation in the future.
Unit III
Internet of Things Privacy, Security and Governance Introduction, Overview of Governance,
Privacy and Security Issues, Contribution from FP7 Projects, Security, IOT and Smart Cities,
Privacy and Trust in IoT-Data-Platforms for Smart Cities, First Steps Towards a Secure
Platform, Smartie Approach. Data Aggregation for the IoT in Smart Cities, Security
Suggested Readings
Paper Code:MCS-405
Paper Name : Project
Scheme of Examination
Maximum Marks: 50 Duration: 3 Hours
Minimum Passing Marks: 13