Kurukshetra University, Kurukshetra

(Established by the State Legislature Act XII of 1956)

(‘A+’ Grade, NAAC Accredited)

 

||     योगस्थ:  कुरु कर्माणि     ||

समबुद्धि व योगयुक्त होकर कर्म करो

(Perform Actions while Stead fasting in the State of Yoga)

 

 

Scheme of Examination and Syllabus of

Master of Science (M.Sc.) Computer Science(Software)(CBCS) in Phased Manner

 

DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS

 

CBCS CURRICULUM (2020-21)

Program Name: Master of Science (M.Sc.)Computer Science (Software)(CBCS)

(For the Batches Admitted From 2020-2021)

DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS

KURUKSHETRA UNIVERSITY, KURUKSHETRA

 

VISION

Pursue conducive advancement towards nurturing globally competent and ethically conscientious professionals and entrepreneurs in agile computing technologies and allied spheres for unceasing evolution of Nations IT affiliated commercial and research endeavours.

 

MISSION

Thrive to establish a strong foundation for technical competency in spheres concordant to software oriented design and development. Nurture skills and competency for administering expertise gained in computing discipline to a wide horizon of interdisciplinary application domains, thus supporting sustainable development of the society. Habituate the students to strive for technological innovations and successful endeavours ethically, supported by sustained learning continuance and problem solving proficiency that may promote nations welfare in terms of economic acceleration leading to the growth of society.

 

NAME OF THE PROGRAMME: MASTER OF SCIENCE

                                                                        (COMPUTER SCIENCE (SOFTWARE))

DURATION                          :TWO YEARS

 

PROGRAMME OUTCOMES (POs)

PO1

Knowledge Capable of demonstrating comprehensive disciplinary knowledge gained during course of study.

PO2

Research Aptitude Capability to ask relevant/appropriate questions for identifying, formulating and analyzing the research problems and to draw conclusion from the analysis.

PO3

Communication Ability to communicate effectively on general and scientific topics with the scientific community and with society at large.

PO4

Problem Solving Capability of applying knowledge to solve scientific and other problems.

PO5

Individual and Team Work Capable to learn and work effectively as an individual, and as a member or leader in diverse teams, in multidisciplinary settings.

PO6

Investigation of Problems Ability of critical thinking, analytical reasoning and research based knowledge including design of experiments, analysis and interpretation of data to provide conclusions.

PO7

Modern Tool usage Ability to use and learn techniques, skills and modern tools for scientific practices.

PO8

Science and Society Ability to apply reasoning to assess the different issues related to society and the consequent responsibilities relevant to the professional scientific practices.

PO9

Life-Long Learning Aptitude to apply knowledge and skills that are necessary for participating in learning activities throughout life.

PO10

Ethics Capability to identify and apply ethical issues related to one’s work, avoid unethical behaviour such as fabrication of data, committing plagiarism and unbiased truthful actions in all aspects of work.

PO11

Project Management Ability to demonstrate knowledge and understanding of the scientific principles and apply these to manage projects.

 

 

PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO1

Provide exposure to the hardware and software environment of computer systems along with a comprehensive strengthening of computational expertise in programming languages and open source platforms.

PSO2

Enhance competency in designing and modeling software based applications with enrichment of proficiency in software design skills. 

PSO3

Strengthen technical skills and professional expertise in adopting contemporary trends and technological developments for the application of innovative approaches and propositions to real-world problem scenario.

PSO4

Inspire pursuance of skillful expertise for careers in Commercial/ Government Sectors, Academics/ Consultancy/ Research and Development for technological innovations, and collateral fields related to Computer Science and Information Technology.

KURUKSHETRA
UNIVERSITY, KURUKSHETRA

 

SCHEME
OF EXAMINATION FOR MASTER OF SCIENCE

(COMPUTER
SCIENCE (SOFTWARE))

CHOICE
BASED CREDIT SYSTEM (CBCS)

 

W.
E. F. ACADEMIC SESSION 2020-21 IN PHASED MANNER

Paper Code

Nomenclature of Paper

Credits

Workload Per Week (Hrs.)

Exam Time (Hrs.)

External Marks

Internal Marks

Total Marks

Pass Marks

Max.

Pass

First Semester

MS-20-11

Web Engineering

4

4

3

75

30

25

100

40

MS-20-12

Advanced Database Systems

4

4

3

75

30

25

100

40

MS-20-13

Linux and Shell Programming

4

4

3

75

30

25

100

40

MS-20-14

Discrete Mathematical Structures

4

4

3

75

30

25

100

40

MS-20-15

S/W Lab – I Based on MS-20-11 and MS-20-12

2.5

5

3

100

40

100

40

MS-20-16

S/W Lab – II Based on MS-20-13

2.5

5

3

100

40

100

40

Total

21

26

 

500

200

100

600

240

Second Semester

MS-20-21

Data Structures and Algorithms

4

4

3

75

30

25

100

40

MS-20-22

Programming in Java

4

4

3

75

30

25

100

40

MS-20-23

Object Oriented Analysis and Design using UML

4

4

3

75

30

25

100

40

MS-20-24

Data Communication and Computer Networks

4

4

3

75

30

25

100

40

MS-20-25

S/W Lab – III Based on MS-20-21

2.5

5

3

100

40

100

40

MS-20-26

S/W Lab – IV Based on MS-20-22

2.5

5

3

100

40

100

40

*OE-20-27

Open Elective Based on MOOCs (The selected course should not be directly related with Computer Science) Or As Per University Guidelines

2

2

3

35

14

15

50

20

Total

23

28

 

535

214

115

650

260

Third Semester

MS-20-31

Data Mining and Analytics using R

4

4

3

75

30

25

100

40

MS-20-32

Computer Graphics and Animation

4

4

3

75

30

25

100

40

MS-20-33

Elective-I

4

4

3

75

30

25

100

40

MS-20-34

Elective-II

4

4

3

75

30

25

100

40

MS-20-35

S/W Lab – V Based on MS-20-31

2.5

5

3

100

40

100

40

MS-20-36

S/W Lab – VI Based on MS-20-32

2.5

5

3

100

40

100

40

**MS-20-37

Summer Training / Internship

8

Viva Voce

150

60

50

200

80

*OE-20-38

Open Elective Based on MOOCs ( The selected course should not be directly related with Computer Science ) Or As Per University Guidelines

2

2

3

35

14

15

50

20

Total

31

28

 

685

274

165

850

340

Elective – I

MS-20-33(i)

Compiler Design

4

4

3

75

30

25

100

40

MS-20-33(ii)

Advanced Computer Architecture

4

4

3

75

30

25

100

40

MS-20-33(iii)

Principles of Programming Languages

4

4

3

75

30

25

100

40

Elective – II

MS-20-34 (i)

Mobile Computing

4

4

3

75

30

25

100

40

MS-20-34 (ii)

Theory of Computation

4

4

3

75

30

25

100

40

MS-20-34(iii)

Artificial Intelligence

4

4

3

75

30

25

100

40

Fourth Semester

MS-20-41

Mobile Application Development

4

4

3

75

30

25

100

40

MS-20-42

Machine Learning using Python

4

4

3

75

30

25

100

40

MS-20-43

Elective-III

4

4

3

75

30

25

100

40

MS-20-44

Elective-IV

4

4

3

75

30

25

100

40

MS-20-45

S/W Lab–VII Based on MS-20-41

2.5

5

3

100

40

100

40

MS-20-46

S/W Lab-VIII Based on MS-20-42

2.5

5

3

100

40

100

40

Total

21

26

 

500

200

100

600

240

Grand Total

96

108

 

2220

888

480

2700

1080

Elective – III

MS-20-43 (i)

Cryptography and Network Security

4

4

3

75

30

25

100

40

MS-20-43 (ii)

Big Data and Pattern Recognition

4

4

3

75

30

25

100

40

MS-20-43(iii)

Cyber Security and Blockchain Technology

4

4

3

75

30

25

100

40

Elective – IV

MS-20-44 (i)

Optimization Techniques

4

4

3

75

30

25

100

40

MS-20-44 (ii)

Soft Computing

4

4

3

75

30

25

100

40

MS-20-44(iii)

Cloud Computing and IoT

4

4

3

75

30

25

100

40

*Note 1: In addition to the credits earned by compulsory and elective courses, every student has to earn 2

            more credits by selecting an open elective/MOOC course during second and third semester.

 

**Note 2: Summer Training / Internship will be held immediately after 2nd Semester Examination and will be

            having a minimum duration of 45 days and maximum duration of 60 days. Students have to submit

            the Summer Training / Internship Report latest by 30th August. Evaluation of the Report and Viva-

                  Voce shall be held during 3rd Semester. The Evaluation and Viva-Voce shall be held by one

                  External and one Internal examiner.

 

Note 3: The credits for the first year are44(21+23) and for the second year are 52(31+21). Total credits of the

            courseshall be 44+52 = 96.

 

Note 4: For the purpose of computation of work-load the following mechanism shall be adopted:

­   1 Credit = 1 Theory period of one hour duration.

­   1 Credit = 1 Practical period of two hour duration.

 

Note 5: Evaluation procedure for internal assessment marks:

Two Mid Term Examinations should be conducted by the concerned teacher each of 10 marks. Five

marks may be given by the concerned teacher on the basis of performance during the course (puzzles/

assignments/ interactions/ attendance etc).

 

 

Note 6: Size of groups in all practical courses should not be more than thirty students.


MS-20-11: Web Engineering

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30(i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40(i.e. 40%)

Instructions to paper setter for End semester examination:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives: The objective of this course is to provide fundamentals concepts of Web Services, JavaScript and lays foundations for the advanced studies in the area of web services.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-11.1

design web pages using HTML5 and CSS;

MS-20-11.2

understand objects and data validation in JavaScript;

MS-20-11.3

build Dynamic website using server sidePHP Programmingand Databaseconnectivity;

MS-20-11.4

create web applications with Ajax.

CO-PO Mapping Matrix for Course Code: MS-20-11

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-11.1

3

1

2

3

2

3

3

1

2

2

2

MS-20-11.2

3

1

2

3

2

3

3

1

2

2

2

MS-20-11.3

3

1

2

3

2

3

3

1

2

2

2

MS-20-11.4

3

1

2

3

2

3

3

1

2

2

2

Average

3

1

2

3

2

3

3

1

2

2

2

CO-PSO Mapping Matrix for Course Code: MS-20-11

COs

PSO1

PSO2

PSO3

PSO4

MS-20-11.1

3

3

2

3

MS-20-11.2

3

3

2

3

MS-20-11.3

3

3

2

3

MS-20-11.4

3

3

2

3

Average

3

3

2

3

               

 

Unit – I

Introduction: Web browsers and its functions, web optimizations; Static page design; designing static web pages with HTML5.0-HTML basic, multimedia, Graphics, Form tags, CSS 2.0 concept and its properties & CSS 3.0 properties i.e. borders, backgrounds, fonts, text effects, Buffering, Weblog, Web Cache Poisoning.

Unit – II

JavaScript: Document Object Model (DOM), Obtaining user inputs, memory concepts, Operators, Control Structures, Looping constructs, break, continue statements, Programmer defined functions, Scoping rules, Recursion and iteration, Array declaration and allocation, passing arrays to function, Objects: String, Date, Boolean, Window, document; using cookies, form validation in Java Script, Handling Events Using JavaScript.

Unit – III

PHP: Installing and Configuring MySQL and PHP, Basic Security Guidelines, Variables, Data Types, Operators and Expressions, Constants, Flow Control Functions; Switching Flow, Loops, Code Blocks and Browser Output, Objects, Strings Processing, Form processing, Connecting to database, cookies, Session, dynamic contents.

Unit – IV

Introduction to AJAX: Exploring different web technologies, Creating a simple AJAX application, Interacting with the Web Server Using the XMLHttpRequest Object, Create an XMLHttpRequest Object, Interact with the Web Server. Differentiating AJAX and Non-AJAX application.

Search engine optimization for individual web pages: header entries, tags, selection of URL, alt tags, Search engine optimization for entire website: Hyperlinks and link structure, page rank of Google, click rate, residence time of website

Text Books:

1.      Deitel H.M., Deitel P.J., Internet & World Wide Web: How to program, Pearson Education.

2.      Kogent Learning, Web Technologies: HTML, JavaScript, PHP, Java, JSP, XML, AJAX – Black Book, Wiley India Pvt. Ltd.

Reference Books:

1.      Boronczyk, Naramore, Beginning PHP, Apache, MySQL Web Development, Wiley India Pvt. Ltd.

2.      Thomas Powell, Ajax: The Complete Reference.

3.      Maro Fischer, Website Boosting: Search Engine, Optimization, Usability, Website Marketing, Firewall Media, New Delhi.

MS-20-12: Advanced Database Systems

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30(i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40(i.e. 40%)

Instructions to paper setter for End semester exam:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives:The objective of this course is to provide an in- depth knowledge of SQL and PL/SQL to design database for an organization. This course focuses on advance topics of the database including EER model, object oriented database, and emerging concepts of database.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-12.1

review the fundamental aspects of database along with EER model;

MS-20-12.2

get the practical exposure to SQL and PL/SQL to implement database management system in an organization;

MS-20-12.3

learn normalization and concurrency control techniques;

MS-20-12.4

acquire knowledge of different kind of emerging databases in real life scenario.

CO-PO Mapping Matrix for the Course Code : MS-20-12

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-12.1

3

3

3

3

2

2

1

3

2

2

3

MS-20-12.2

3

2

3

1

3

2

3

3

2

2

1

MS-20-12.3

3

2

2

3

2

2

2

1

3

2

2

MS-20-12.4

2

3

3

2

3

1

3

3

3

2

3

Average

2.75

2.5

2.75

2.25

2.5

1.75

2.25

2.5

2.5

2

2.25

CO-PSO Mapping Matrix for the Course Code : MS-20-12

COs

PSO1

PSO2

PSO3

PSO4

MS-20-12.1

3

3

3

3

MS-20-12.2

2

2

2

2

MS-20-12.3

3

3

2

3

MS-20-12.4

2

3

1

2

Average

2.5

2.75

2

2.5

Unit – I

Database System Concepts and Architecture: Three – Schema Architecture and Data Independence, Entity Relationship Model: Entity Types, Entity Sets, Attributes & keys, Relationships Types & instances ER Diagrams, Naming conventions and Design Issues. Relational Model Constraints, Enhanced Entity Relationship Model: Subclasses, Super classes, Inheritance, Specialization and Generalization.

Unit – II

SQL: Data Definition and Data Types, DDL, DML, and DCL, Join Operations, Views & Queries in SQL, Specifying Constraints & Indexes in SQL. PL/SQL: Architecture of PL/SQL, Basic Elements of PL/SQL, PL/SQL Transactions, Cursors and Triggers. Relational Algebra: Unary and Binary Relational Operations.

Unit – III

Functional Dependencies, Normal Forms Based on Primary Keys- (1NF, 2NF, 3NF, BCNF), Multi-valued Dependencies, 4 NF, Join dependencies, 5 NF, Domain Key Normal Form. Query Processing and Optimization, Introduction to Transaction Processing, and Desirable Properties of Transactions, Concurrency Control Techniques, Database Backup and Recovery.

Unit – IV

Overview Object Oriented Database Model, Databases for Advance Applications: Architecture for Parallel Database and Distributed Database, Active Database Concept and Triggers, Temporal Databases Concepts, Spatial and Multimedia Databases, Geographical Information System, Mobile Databases, Web Databases, XML Schema, XML Query.

Text Books:

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

2. Jules J. Berman, Principles of Big Data, Elsevier India.

Reference Books:

1. Date C.J., An Introduction to Database Systems, Pearson Education.

2. Hector G.M., Ullman J.D., Widom J., Database Systems: The Complete Book, Pearson Education.

3. Silberschatz A., Korth H., Sudarshan S., Database System Concepts, McGraw Hill.

MS-20-13: Linux and Shell Programming

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30(i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40(i.e. 40%)

Instructions to paper setter for End semester examination:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives: The objectives of this course are to provide the in-depth coverage of various concepts of Linux. Linux administration is an essential course for the students.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-13.1

understand the basic concepts and commands of Linux;

MS-20-13.2

understand the file management and process manipulation in Linux;

MS-20-13.3

understand the C environment under Linux and do the system administration andcommunication in Linux;

MS-20-13.4

developshell programs in Linux.

CO-PO Mapping Matrix for Course Code: MS-20-13

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-13.1

3

2

3

3

3

2

1

1

3

1

2

MS-20-13.2

3

2

3

3

3

2

1

1

3

1

2

MS-20-13.3

3

2

3

3

3

2

2

1

3

1

2

MS-20-13.4

3

2

3

3

3

3

2

1

3

1

2

Average

3

2

3

3

3

2.25

1.5

1

3

1

2

 

CO-PSO Mapping Matrix for Course Code: MS-20-13

COs

PSO1

PSO2

PSO3

PSO4

MS-20-13.1

3

2

3

2

MS-20-13.2

3

2

3

2

MS-20-13.3

3

2

3

3

MS-20-13.4

3

2

3

3

Average

3

2

3

2.5

 

Unit – I

Introduction: History, Basic features, architecture, distributions. Installing Linux, Logging in / Logging out.

File System: Introduction to files, Organization, Assessing File systems, Structure – boot block, super block, inodeblock, data block.

Basic and Advanced Commands: Directory oriented commands, File oriented commands, File access permissions: chmod, umask, chgrp, groups. General purpose commands.

Unit – II

File management and Compression: Computer devices, Disk related commands: dd, du, df, dfspace, fdisk, compressing and uncompressing files.

Manipulating Processes and Signals:Basics, process states and transitions, zombie and orphan processes, process oriented commands. Handling foreground and background jobs. Process scheduling using cron, crontab, at, batch. Changing priority. Signal generation and Handling.

System calls:  Files related system calls for opening, creating, reading,  writing, relocating file descriptors, closing, duplicating file descriptors, linking, unlinking, accessing file status information, checking permissions, changing ownership, groups and permissions of files. Process related system calls: exec, fork, wait, exit.

Unit – III

System Administration: Booting and shutting down process. Creating, mounting and unmounting file systems. Managing User accounts: creating, modifying & deleting user accounts and groups.

Networking Tools: Communication oriented commands. ping, nslookup, telnet, arp, netstat, route, ftp, trivial file transfer protocol, finger, rlogin.

C language compiler, the make command and makefiles, general debugging techniques, debugging with gdb.

Unit – IV

Pipes and filters: Connecting processes with pipes, redirecting input and output. Filters: sort, grep, egrep, fgrep, uniq, more, pr, cut, paste, tr.

Shell Programming: Shell meaning & types; Introduction to shell scripting, shell variables, exporting shell variables, Escape mechanisms, Shell meta characters, read command, conditional statements, looping and case statements, expr statement, command line arguments, sleep and basename commands, Bourne Shell Commands, string handling, arrays, shell functions, shell programs to automate system tasks.

Text Books:

1. Harwani B.M., Unix and Shell Programming, Oxford University Press.

2. Goerzen John, Linux Programming Bible, IDG Books, New Delhi.

Reference Books:

1. Matthew Neil, Stones Richard, Beginning Linux Programming, Wiley India Pvt. Ltd.

2. Christopher Negus, Linux Bible, Wiley India Pvt. Ltd.

3. Das Sumitabha, You UNIX – The Ultimate Guide, Tata McGraw Hill

4. Richard Peterson, Linux – The Complete Reference, Tata McGraw Hill

MS-20-14: Discrete Mathematical Structures

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30 (i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40 (i.e. 40%)

Instructions to paper setter for End semester exam:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives:The objective of this course is to provide in-depth coverage of discrete mathematical structures. It focuses on learning about sets, logics, analysis techniques, and graphs and their use in the field of computer science.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-14.1

understand the basic concepts of sets, function and relations;

MS-20-14.2

understand logics and counting principles;

MS-20-14.3

understand the lattices, Boolean algebra and their use in computer science;

MS-20-14.4

design and understand the working with graphs and trees.

CO-PO Mapping Matrix for the Course Code : MS-20-14

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-14.1

3

2

1

1

2

2

1

2

2

1

2

MS-20-14.2

3

3

1

3

1

3

1

2

3

1

2

MS-20-14.3

3

1

1

2

1

2

1

1

2

1

2

MS-20-14.4

3

2

1

2

1

2

1

1

2

1

2

Average

3

2

1

2

1.25

2.25

1

1.5

2.25

1

2

CO-PSO Mapping Matrix for the Course Code : MS-20-14

COs

PSO1

PSO2

PSO3

PSO4

MS-20-14.1

2

2

2

3

MS-20-14.2

2

3

3

3

MS-20-14.3

3

3

3

3

MS-20-14.4

3

2

2

3

Average

2.5

2.5

2.5

3

Unit – I

Set Theory: Basic Set Theory, Operations on Sets, Algebra of sets, Venn Diagrams.

Relations: Binary Relations, Complement of relations, Inverse of relations, Composite relations, Properties, Equivalence, Partial Order and Total order relations.

Functions: Functions on Set, Domain, Co-domain, Representation of Functions, Types, Identity and Inverse Functions, Composition of Functions.

Unit – II

Propositional Calculus: Propositional logic, Equivalences, Predicates, Quantifiers, Nested Quantifiers, Rules of Inference, Normal Forms, Proofs: Methods, Strategy.

Counting: Pigeonhole Principle, Inclusion-Exclusion Principle, Permutations and Combinations, Binomial Coefficients, Counting Principles.

Unit – III

Advanced Counting Techniques: Recurrence Relations, Solving Recurrence Relations

Lattices and Boolean algebra: Lattices, Hasse Diagram, Principle of Duality, Types of Lattices, Special Lattices, Boolean Expression, Equivalent circuits, Dual, Normal Forms.

Unit – IV

Graphs: Introduction, Terminology, Types of Graphs, Representation of Graphs, Paths and Circuits, Cut-set and Cut – Vertices, Graph Isomorphism, Homomorphism, Connectivity, Bipartite Graphs, Subgraphs, Operations on Graphs, Euler and Hamiltonian Graphs, Shortest Path Problem, Planar & Dual Graphs, Coloring.

Tree: Tree Notations, Properties of tree, Types of Tree, Operations, Minimum Spanning Tree (MST).

Text Books:

1.      Kenneth G. Rosen, Discrete Mathematics and Its Applications, Tata McGraw Hill.

2.      Koshy T., Discrete Mathematics with Applications, Elsevier India.

Reference Books:

1.      Eric Gosett, Discrete Mathematics with proof, Wiley India Pvt. Ltd.

2.      Seymour Lipshutz, Schaum Outlines of Discrete Mathematics, Tata McGraw-Hill.

3. Kenneth Ross, Discrete Mathematics, Pearson Educations India.

MS-20-21: Data Structures and Algorithms

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30 (i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40 (i.e. 40%)

Instructions to paper setter for End semester exam:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives:The objective of this course is to provide in-depth coverage of advanced data structures and algorithm design techniques. It focuses on learning about analysing and designing algorithms to solve a problem and learn to find the asymptotic efficiency of an algorithm.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-21.1

analyse worst-case running times of algorithms using asymptotic analysis;

MS-20-21.2

understand the basic and advanced data structures and to implement them;

MS-20-21.3

understand and implement various techniques for problem solving;

MS-20-21.4

identify the type of problem and solving using appropriate technique.

CO-PO Mapping Matrix for the Course Code : MS-20-21

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-21.1

3

3

1

3

1

3

2

3

3

1

2

MS-20-21.2

3

2

1

3

1

3

2

3

3

1

2

MS-20-21.3

3

3

1

3

3

3

2

3

3

1

3

MS-20-21.4

3

2

1

3

3

3

2

3

3

1

3

Average

3

2.5

1

3

2

3

2

3

3

1

2.5

CO-PSO Mapping Matrix for the Course Code : MS-20-21

COs

PSO1

PSO2

PSO3

PSO4

MS-20-21.1

2

3

2

3

MS-20-21.2

2

3

2

3

MS-20-21.3

2

3

3

3

MS-20-21.4

2

3

3

3

Average

2

3

2.5

3

Unit – I

Introduction to Data Structures: Classification of Data Structures, Arrays.

Stacks & Queues: Representation of Stacks, Stack Operations, Applications, Queues, Operations on Queues, Circular Queues, Dequeue, Priority Queues, Applications.

Introduction to Algorithms: Role of algorithms in computing, Complexity of algorithms, analysing algorithms, designing algorithms, asymptotic notations.

Unit – II

Linked Lists: Introduction, Types, and Operations (Insertion, Deletion, Traversal, Searching), Applications, Dynamic Memory Management, and Implementation of Linked Representations.

Trees: Binary Tree Traversals, Threaded Binary Trees, Binary Search Trees and Operations, AVL Trees, Heap, M-way Search Trees, B-Trees, B+ Trees, Applications.

Unit – III

Divide and Conquer: Solving recurrence equations: back substitution method, recursion tree method, master’s theorem.

Analysis of heap sort and quick sort; Counting sort, Radix sort, Bucket sort, Lower bounds for sorting.

Dynamic Programming (DP): Elements of DP, Matrix chain multiplication, Longest common subsequence, optimal binary search trees.

Unit – IV

Greedy Techniques (GT): Elements of GT, Activity selection problem, Huffman codes, Knapsack Problem.

Graph Algorithms: Negative weight cycle, Bellman-Ford algorithm. All Pairs Shortest Path.

Maximum Flow: Flow network, Ford-Fulkerson method.

Strings: Storage of strings, Naive string-matching algorithm, Rabin-Karp algorithm, String matching with finite automata, Knuth-Morris-Pratt algorithm

Text Books:

1.      G.A.V Pai, Data Structures and Algorithms, McGraw-Hill.

2.      Cormen, Leiserson, Rivest, Introduction to Algorithms, PHI India.

Reference Books:

1.      Neapolitan R., Foundations of Algorithms, Jones and Bartlett Learning. 

2.      Seymour Lipschutz, Data Structures, McGraw-Hill, Schaum’s Outlines, New Delhi.                                                                                                                            

3. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, Data Structures and Algorithms, Pearson Education.

MS-20-22: Programming in JAVA

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30(i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40(i.e. 40%)

Instructions to paper setter for End semester exam:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives:The course aims is to equip the students with JAVA programming language concepts with object-oriented programming principles.In this course student will be able tolearn the basic syntax and semantics of the Java language and programming environment, build robust applications using Java’s object-oriented features, implement the interface, Packages and inheritance, understand exceptional handling and multi-threading concepts and implementation using Applets, AWT and Event Handling and concepts of JAVA beans, Swing.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-22.1

learn the basic features of Java;

MS-20-22.2

develop program using different concepts of OOPs;

MS-20-22.3

develop programming using Java I/O stream classes;

MS-20-22.4

design and Implement Graphics programming using Applet, AWT and Layouts.

CO-PO Mapping Matrix for Course Code: MS-20-22

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-22.1

3

1

3

3

3

2

1

2

3

1

2

MS-20-22.2

3

2

3

3

3

2

2

2

3

2

2

MS-20-22.3

2

2

3

3

3

2

2

2

3

2

2

MS-20-22.4

3

3

3

3

3

2

1

2

3

1

2

Average

2.75

2

3

3

3

2

1.5

2

3

1.5

2

CO-PSO Mapping Matrix for Course Code: MS-20-22

Cos

PSO1

PSO2

PSO3

PSO4

MS-20-22.1

3

2

2

3

MS-20-22.2

3

3

2

3

MS-20-22.3

3

3

2

3

MS-20-22.4

3

3

2

3

Average

3

2.75

2

3

               

 

UNIT – I

Introduction to Java: Importance and features of Java, Java virtual machine, Byte code, JDK, Keywords, constants, variables and Data Types, Operators and Expressions, Decision Making, Branching and Looping, jump statements: break, continue, and return. Introducing classes, objects and methods: defining a class, adding variables and methods, creating objects, constructors, class inheritance. Arrays and String: Creating an array, one and two dimensional arrays, string array and methods.

UNIT – II

Packages and interfaces, Exception Handling: Fundamentals exception types, uncaught exceptions, throw exception, built in exception, creating your own exceptions, Multithreaded Programming: Fundamentals, Java thread model: synchronization, messaging, thread classes, Runnable interface, inter thread Communication, suspending, resuming and stopping threads. 

UNIT – III

I/O Streams: String and String Buffer classes, Wrapper classes: Basics types, using super, Multilevel hierarchy abstract and final classes. Input/Output Programming: Basics, Streams, Byte and Character Stream, predefined streams, Reading and writing from console and files. 

UNIT –IV

Event Handling: Different Mechanism, the Delegation Event Model, Event Classes, Event Listener Interfaces, Adapter and Inner Classes, Working with windows, Graphics and Text, using AWT controls, Layout managers, handling Image, animation, sound and video, Beans: Introduction to Java Beans.

Text Books:

1. E. Balaguruswamy, Programming with JAVA- A Primer, Tata Mc-Graw Hill.

2. Patrick Naughton, Herbert, Schild, The Complete reference Java 2, Tata Mc-Graw Hill.

Reference Books:

1. Patrick Nieaneyer and Joshna Peck, Exploring Java, O, Reilley.

2. Hareliy Hahn, Teacher the Internets, P.H.I.

3. Barry Boone, William Stanck, Java 2 exam Guide, Tata Mc-Graw Hill.

MS-20-23: Object Oriented Analysis and Design Using UML

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30(i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40(i.e. 40%)

Instructions to paper setter for End semester examination:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives: To understand the concepts of UML and its applications for class modeling, state modeling, use case modeling, interactionmodeling, activity modeling etc. and to analyse & design software systems using object-oriented approach.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-23.1

understand basics of  modeling and fundamentals of UML such as things, relationships, diagrams, extensibility mechanisms and views;

MS-20-23.2

to practically apply knowledge of class modeling and state modeling using object-oriented analysis and design methods with a clear emphasis on UML;

MS-20-23.3

to practically apply knowledge of use case modeling, interaction modeling and activity modelingusing UML;

MS-20-23.4

have a working ability and grasping attitude to analyse and design software systems based on object-oriented thinking using UML.

 

CO-PO Mapping Matrix for Course Code: MS-20-23

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-23.1

3

2

3

3

3

2

2

2

3

1

2

MS-20-23.2

3

2

3

3

3

2

2

2

3

1

2

MS-20-23.3

3

2

3

3

3

2

2

3

3

1

2

MS-20-23.4

3

2

3

3

3

2

3

3

3

1

3

Average

3

2

3

3

3

2

2.25

2.5

3

1

2.25

 

CO-PSO Mapping Matrix for Course Code: MS-20-23

COs

PSO1

PSO2

PSO3

PSO4

MS-20-23.1

2

3

3

3

MS-20-23.2

2

3

3

3

MS-20-23.3

2

3

3

3

MS-20-23.4

2

3

3

3

Average

2

3

3

3

 

Unit – I

ModelingasaDesignTechnique: Principles of modeling, abstraction,encapsulation,modularity,hierarchy,typing,concurrency, persistence ofobjects,purposeofmodeling

UML:Principlesofmodeling,UMLthings–structural,behavioral,grouping, annotational.Relationshipsin UMLdependency,association,generalization,realization.OverviewofUML diagrams, Mechanisms in the UML– specifications, adornments, common divisions, Extensibility mechanisms – stereotypes, tagged values, constraints,  UML profiles, UML views.

Unit – II

Class Modeling:Object &Class, Links &Associations, Generalization &Inheritance,Association Ends – scope, visibility, Multiplicity,Rolenames,Ordering,bags & sequences, Qualified association,Aggregation,association attributes &association classes, propagation of operations,Abstractclass, Metadata, reification, Constraints, derived data, packages, elements of class diagrams, constructingclassdiagrams.

StateModeling:Events,States,Transitions & Conditions, Activity Effects, Do-Activities, Entry & Exit Activities, CompletionTransitions, Sending Signal,Elements of Statediagrams,Nestedstatediagrams, signalgeneralization, concurrency, constructing state diagrams.

Unit – III

Use Case modeling: Actors, Use Cases, relationships – between actors, between use cases and between actor and use case, elements of use case diagram, constructing use case diagrams.

Interaction Modeling: Elements of sequence diagram and communication diagram, constructing sequence diagram and communication diagram

Activity Modeling: Elements of activity diagram, constructing activity diagram

Unit – IV

SystemAnalysis&design:Systemdevelopmentstages,systemconception,analysis, domainclassmodel, domain state model,iteratingthe analysis.

Applicationinteraction model, application class model, application state model, addingoperations

SystemDesign:estimatingperformance,makeareuseplan,organizethesystemintosubsystem,identifying concurrency, allocating subsystems to processors and tasks, management of data stores, handling global resources, choosing software control strategies, handling boundary conditions, setting tradeoff priorities, selectingan architectstyle.

Class Design: bridging gap, realize use cases with  operations, designing  algorithms, design optimization, adjustmentofinheritance.

Text Books:

1.        GradyBooch,JamesRumbaugh,IvarJacobson,TheUnifiedModelingLanguageUserGuide, Pearson education.

2.        M. Blaha,J. Rumbaugh, ObjectOrientedModelingand Design with UML, Pearson Education.

Reference Books:

1.        J.Rumbaugh,M.Blaha,W.Premerlani,F.Eddy,W.Lorensen,ObjectOrientedModelingandDesign, Prentice HallofIndia.

2.        Satzinger,Jackson, Burd,ObjectOrientedAnalysis& Design withthe UnifiedProcess,Thomson.

3.        GradyBooch, ObjectOrientedAnalysis & Design, Pearson Education.

MS-20-24  Data Communication and Computer Networks

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30(i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40(i.e. 40%)

Instructions to paper setter for End semester examination:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives:

Provide an in-depth coverage of various concepts, components, and technologies of Computer Networks and Data Communication.  Provide the architectural overview of the Internet. Enable the  exposure of  students to the current trends in wired and wireless communication technologies and real-world networking scenario

Course Outcomes: At the end of this course, the student will be able to:

MS-20-24.1

characterize various types of computer networks and standards along with an insight into the principles of networking by using protocol layering of the Internet and the TCP/IP protocol suite;

MS-20-24.2

comprehend the notion of data communication and its related functional components and aspects;

MS-20-24.3

understand design issues related to Local area Networks and get acquainted with the prevailing wired and wireless LAN  technology standards;

MS-20-24.4

get versed with the routing, addressing, congestion control, and security issues in Networks and the Internet architecture.

CO-PO Mapping Matrix for Course Code: MS-20-24

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

MS-20-24.1

3

1

3

3

2

1

1

2

3

1

MS-20-24.2

3

1

3

3

2

2

1

2

3

2

MS-20-24.3

3

2

3

3

2

2

2

2

3

2

MS-20-24.4

3

3

3

3

2

2

2

2

3

2

Average

3

1.75

3

3

2

1.75

1.5

2

3

1.75

CO-PSO Mapping Matrix for Course Code: MS-20-24

COs

PSO1

PSO2

PSO3

PSO4

MS-20-24.1

1

1

1

3

MS-20-24.2

1

1

3

3

MS-20-24.3

1

2

3

3

MS-20-24.4

1

2

3

3

Average

1

1.5

2.5

3

Unit – I

Network Characterization: Goals and Applications; Categorization according to Size,  Purpose, Design issues & Transmission Technologies; Network Architecture and Service Models; Design issues for the Layers; Reference Models: OSI and TCP/IP; Functions of  layers and protocols of TCP/IP; Comparison of  OSI & TCP/IP ; Data Transmission using TCP/IP.

Networking Models & Applications: Centralized, Decentralized, and Distributed; Client-Server and Peer-to-Peer; File sharing & Web- based; Content Distribution Networks.

Introduction to Example Networks: The Internet and its Conceptual View ; Applications of Internet; Accessing The Internet; Connection-Oriented Networks: X.25, Frame Relay and ATM.

Unit – II

Data Communication Concepts & Components:  Digital and Analog Data and Signals, Asynchronous and Synchronous transmission; bit rate & baud, bandwidth& Channel Capacity; Nyquist Bit Rate, Shannon Capacity; Network Performance Parameters; Transmission Impairment.

Connecting Devices & Transmission Media: Network Interface Cards, Connectors, Hubs, Transceivers & Media Connectors; Link-Layer Switches, Bridge, Routers, Gateways, Virtual LANs; Guided Transmission Media; Wireless transmission; Satellite communication.

Data Encoding & Modulation Techniques:  NRZ, NRZ-I, Manchester and Differential Manchester encoding; 4B/5B ; Pulse Code Modulation & Delta Modulation; Digital to Analog encoding.

Switching and Bandwidth Utilization:  Methods of Switching; Virtual Circuit & Datagram Networks; Multiplexing; Spread Spectrum.

Wired Networks and the Local Loop: Telephone Networks; Modems; Broadband and ADSL;  ADSL Versus Cable;  Hybrid Fiber-Coaxial Network ; Fiber-to-the-Home Broadband.

Unit – III

Data Link Layer: Communication at the Data Link Layer; Nodes and Links; Link Layer Addressing; Examples of Data Link layer protocols.

Design Issues: Framing techniques: Byte Oriented and Bit Oriented Protocols;  Error Detection and Correction;  Sliding Window Flow Control Protocols.

Media Access Control:  Random Access: Aloha, CSMA , CSMA/CD; Collision free protocols with Controlled Access; Limited Contention Protocols;  Wavelength Division Multiple access for Fiber-Optic Data Communication.

IEEE LAN standards: Ethernet (Physical specifications, Encoding, Frame Format & MAC protocol);  Binary Exponential Backoff algorithm; Token Ring and FDDI.

Introduction to Wireless Networks: IEEE 802.11 Wireless LAN; Wi-Max; Wireless LAN Protocol: MACA; Bluetooth and other wireless PAN technologies; Cellular Networks: Generations.

Unit – IV

Transport layer: Addressing, Services and Protocols; TCP and UDP services & header formats.

Network Layer: Services,   Routing Algorithms: Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Multi Cast Routing, Routing for Mobile hosts.

Network Layer in TCP/IP:  Basic characteristics of IP protocol; addressing and header format of IPv4; IPv6.

Congestion Control  & Quality of Service:  General Principals; Congestion control in Virtual – Circuit Subnets; Congestion Control in Datagram Subnets: Choke packets, Load Shedding; Random Early Detection, Jitter Control; Over provisioning, Buffering, Traffic Shaping, Leaky Bucket, Token Bucket, Resource Reservation, Admission Control, Packet Scheduling.

Network Security: Security Goals; Attacks; Cryptography; Confidentiality: Symmetric-Key and Asymmetric –Key Ciphers; Message Integrity & Authentication; Digital Signature; Certificates; IPSec; Firewalls; SSL.

Text Books:

1.      Andrew S. Tanenbaum, Computer Networks, PHI.

2.      Behrouz A Forouzan, Data   Communications   and   Networking, Mc-Graw Hill Education.  

Reference Books:

1.      Michael A. Gallo, William M. Hancock, Computer Communications and Networking Technologies –       CENGAGE learning.

2.      William Stallings, Data and Computer Communications, PHI.

MS-20-31: Data Mining and Analytics using R

Type: Compulsory

Course Credits: 04

Contact Hours: 4 hours/week

Examination Duration: 3 Hours

Mode: Lecture

External Maximum Marks: 75

External Pass Marks: 30(i.e. 40%)

Internal Maximum Marks: 25

Total Maximum Marks: 100

Total Pass Marks: 40(i.e. 40%)

Instructions to paper setter for End semester examination:

Total number of questions shall be nine.  Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.

Course Objectives: The objective of this course is to provide the in- depth coverage of data mining and analytics aspects along with its implementation in R programming language.

Course Outcomes (COs)

At the end of this course, the student will be able to:

MS-20-31.1

understand the fundamental concepts of data warehousing and data mining;

MS-20-31.2

learn data mining techniques for prediction/ forecasting;

MS-20-31.3

acquire knowledge of variety of data and analytical strategies;

MS-20-31.4

to implement data mining techniques in R to perform analytical operations.

 

CO-PO Mapping Matrix for Course Code: MS-20-31

COs

PO1

PO2