M - SC - (IT) Batch 2019 (10-06-2020)
M - SC - (IT) Batch 2019 (10-06-2020)
By
Department of Academics
IK Gujral Punjab Technical
University
Page 1 of 82
Eligibility: All those candidates who have passed any recognized bachelor’s degree of
minimum three years duration with Mathematics / Statistics / Business Mathematics /
Business Statistics / Quantitative Techniques / Computer Science/ Information
Technology as compulsory / Optional / additional paper as one of the subjects either at
10+2 or at graduation level. OR PGDCA / BCA / B.Sc. (IT)
or
Eligibility: All those candidates who have passed PGDCA or equivalent with 50%
Marks (45% marks in case of candidate belonging to Reserved Category) in aggregate
from a University recognized by UGC.
Page 2 of 82
5. Modern Tool Usage: Create, select, adapt and apply appropriate techniques,
resources, and modern computing tools to computing activities, with an
understanding of the limitations.
7. Life-long Learning: Recognize the need, and have the ability, to engage in
independent learning for continual development as a computing professional.
Page 3 of 82
First Semester
Course Course Type Course Title Load Allocations Marks Distribution Total Credits
Code L T P Internal External Marks
PGCA1901 Core Theory Mathematics 4 0 0 30 70 100 4
PGCA1902 Core Theory Fundamentals of 4 0 0 30 70 100 4
Computer and
Programming in Python
PGCA1903 Core Theory Operating System 4 0 0 30 70 100 4
Page 4 of 82
Course Course Type Course Title Load Allocations Marks Distribution Total Credits
Code Marks
L T P Internal External
PGCA1909 Core Theory Web Technologies 4 0 0 30 70 100 4
PGCA1910 Core Theory Computer Networks 4 0 0 30 70 100 4
PGCA1911 Core Theory Object Oriented 4 0 0 30 70 100 4
Programming using
C++
PGCA1912 Core Theory Software Engineering 4 0 0 30 70 100 4
PGCA1913 Core Theory Data Structures 4 0 0 30 70 100 4
PGCA1914 Core Web Technologies 0 0 4 70 30 100 2
Practical/Laboratory Laboratory
PGCA1915 Core Object Oriented 0 0 4 70 30 100 2
Practical/Laboratory Programming using
C++ Laboratory
PGCA1916 Core Data Structures 0 0 4 70 30 100 2
Practical/Laboratory Laboratory
TOTAL 20 0 12 360 440 800 26
Third Semester
Course Course Type Course Title Load Allocations Marks Distribution Total Credits
Code L* T* P Internal External Marks
PGCA1917 Core Theory Discrete Structures & 4 0 0 30 70 100 4
Optimization
PGCA1919 Core Theory Computer Graphics 4 0 0 30 70 100 4
PGCA1921 Core Theory E- Commerce & Digital 4 0 0 30 70 100 4
Marketing
PGCA1937 Core Theory Cloud Computing 4 0 0 30 70 100 4
PGCA1923 Core Practical/ Computer Graphics 0 0 4 70 30 100 2
Laboratory Laboratory
PGCA1938 Core Practical/ Cloud Computing 0 0 4 70 30 100 2
Laboratory Laboratory
PGCA1949 Minor Project 0 0 8 140 60 200 4
TOTAL 16 0 16 400 400 800 24
Page 5 of 82
Course Course Type Course Title Load Allocations Marks Distribution Total Credits
Code L* T* P Internal External Marks
PGCA1939 Core Theory Java Technologies 4 0 0 30 70 100 4
Elective – I 4 0 0 30 70 100 4
Elective – II 4 0 0 30 70 100 4
PGCA1940 Core Practical/ Java Technologies 0 0 4 70 30 100 2
Laboratory Laboratory
Elective – II 0 0 4 70 30 100 2
Laboratory
PGCA1950 Major Project 0 0 16 280 120 400 8
Elective – I
Course Code Course Title
PGCA1927 Theory of Computation
PGCA1932 Information Security & Cyber
Law
PGCA1941 Data Warehousing and Data
Mining
PGCA1942 Business Intelligence
Total Credits: 98
Total Marks:3250
Page 6 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 1st Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Course Outcomes: After studying this course, students will be able to:
Page 7 of 82
22 hours
Matrices : Matrices Introduction, Objectives, Meaning, Types of Matrix
(Row Matrix, Column Matrix, Rectangular Matrix, Square Matrix, Diagonal
Matrix, Scalar Matrix, Unit Matrix, Triangular Matrix, Null Matrix,
Comparable Matrix, Equal Matrix) Algebra of Matrices (Scalar
Multiplication, Negative of Matrix, Addition of Matrix, Difference of two
Matrix, Multiplication of Matrices, Transpose of a Matrix).
Text Books:
1. Discrete Mathematics and Its Applications by Kenneth H. Rosen, Mc Graw Hill, 6th
Edition.
2. College Mathematics, Schaum’s Series, TMH.
Reference Books:
1. Elementary Mathematics, Dr. RD Sharma
2. Comprehensive Mathematics, Parmanand Gupta
3. Elements of Mathematics, ML Bhargava
Page 8 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 1st Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes:
CO# Course outcomes
CO1 Learn the functional units and classify types of computers, how they process
information and how individual computers interact with other computing systems and
devices.
CO2 Understand an operating system and its working, and solve common problems related
to operating systems
CO3 Familiar with Python environment, data types, operators used in Python.
CO5 Compare and contrast Python with other programming languages.
CO6 Learn the use of control structures and numerous native data types with their
methods.
CO7 Design user defined functions, modules, and packages.
CO8 Identify and handle the exceptions in programs through appropriate exceptions
handling methods
Devices: Input and output devices (with connections and practical demo),
keyboard, mouse, joystick, scanner, OCR, OMR, bar code reader, web
camera, monitor, printer, plotter.
Page 9 of 82
Part-B
Page 10 of 82
Text Books:
1. www.sakshat.ac.in
2. https://swayam.gov.in/course/4067-computer-fundamentals
---------------------------------------------------------------------------------------------------------------------------------------------
Page 11 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 1st Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: core
Course Outcomes: After completing this course, students will be able to:
CO# Course outcomes
CO1 Identify the role of different components of operating systems.
CO2 Implement various strategies for task management in operating systems.
CO3 Explain various implementation issues in operating systems.
CO4 Discuss how various resource managements are implemented in operating systems.
Part-B 22 hours
Case Studies:
LINUX Operating System and Windows Operating System.
* These cases studies can be taken as part of tutorial and assignment work. Case
studies will not be considered while setting up the end semester examination.
Text Books:
Reference Books:
Page 13 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 1st Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes:
CO# Course outcomes
CO1 Understand the basic concepts of RDBMS.
CO2 Formulate, using SQL, solutions to a broad range of query and data update problems.
CO3 Demonstrate an understanding of normalization theory and apply such knowledge to
the normalization of a database.
CO4 Apply the concept of Transaction Management in RDBMS.
SQL: Types of SQL (DCL- DDL- DML)- SQL Data Definition, Basic
Structure of SQL Queries, Additional Basic Operations, Set Operations, Null
Values, Aggregate Functions, Nested Subqueries, Modification of the
Page 14 of 82
Part B 22 hours
Text Books:
Reference Books:
Page 15 of 82
Program: M.Sc.(IT) L: 3 T: 0 P: 0
Branch: Computer Applications Credits: 3
Semester: 1st Contact hours: 33 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Ability Enhancement
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes:
CO# Course outcomes
CO1 The objective of the course is to help the students become the independent users of
English language.
CO2 Students will acquire basic proficiency in reading & listening, comprehension, writing
and speaking skills.
CO3 Students will be able to understand spoken and written English language, particularly
the language of their chosen technical field.
CO4 They will be able to converse fluently.
CO5 They will be able to produce on their own clear and coherent texts.
Part B 16 Hours
Text Books:
1. Vandana R Singh, The Written Word, Oxford University Press, New Delhi.
2. K K Ramchandran, et al Business Communication, Macmillan, New Delhi.
3. Swati Samantaray, Business Commnication and Commnicative English, Sultan
Chand, New Delhi.
4. S.P. Dhanavel English and Communication Skills for Students of Science and
Engineering (with audio CD).
---------------------------------------------------------------------------------------------------------------------------------------------
Page 17 of 82
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: - Maintain practical note book as per the
instructions given by the instructor.
Course Outcomes:
CO# Course outcomes
CO1 Solve simple to advanced problems using Python language.
CO2 Develop logic of various programming problems using numerous data types and
control structures of Python.
CO3 Implement different data structures using Python.
CO4 Implement modules and functions using Python.
CO5 Design and implement the concept of object oriented programming structures.
CO6 Implement file handling
Page 18 of 82
Page 19 of 82
Reference Books:
Page 20 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 2
Semester: 1st Contact hours: 4 hours per week
Internal max. marks: 70 Theory/Practical: Practical
External max. marks: 30 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Assignments:
Page 21 of 82
Reference Books:
1. SQL, PL/SQL The Programming Language of Oracle, Ivan Bayross, 4th Revised
Edition, 2009, BPB Publications;
2. Oracle PL/SQL Programming, Steven Feuerstein and Bill Pribyl, 5th Edition,
2009, O'Reilly Media;
3. Database System Concept, Abraham Silberschatz, Henry F. Korth and S.
Sudarshan, Sixth Edition, 2013, McGraw-Hill.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 22 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 2
Branch: Computer Applications Credits: 1
Semester: 1st Contact hours: 2 hours per week
Internal max. marks: 30 Theory/Practical: Practical
External max. marks: 20 Duration of end semester exam (ESE): 3hrs
Total marks: 50 Elective status: Ability Enhancement
Prerequisite: --
Co requisite: --
Additional material required in ESE: --
Course Outcomes:
CO# Course outcomes
CO1 The objective of the course is to help the students become the independent users of
English language.
CO2 Students will acquire basic proficiency in listening and speaking skills.
CO3 Students will be able to understand spoken English language, particularly the language
of their chosen technical field.
CO4 They will be able to converse fluently
CO5 They will be able to produce on their own clear and coherent texts.
Assignments:
Interactive practice sessions in Language Lab on Oral Communication
1. Listening Comprehension
2. Self-Introduction, Group Discussion and Role Play
3. Common Everyday Situations: Conversations and Dialogues
4. Communication at Workplace
5. Interviews
6. Formal Presentations
Text Books:
Page 23 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 2nd Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: Student must have the basic knowledge of any text editor like Notepad,
Notepad++ and Edit plus etc.
Co requisite: Student must know the background of Markup Language.
Additional material required in ESE:
➢ Demonstration of the website of college/ specific department/specific cells etc.
will be presented by the students during the final practical.
➢ Developed Website/s must be made online by the student/s.
➢ Printouts of the Main Page of the website must be arranged on Practical file
during daily lab work and must be submitted in the final examinations.
Course Outcomes: After studying this course, students will be able to:
CO# Course Outcomes
CO1 Understand the basics of Internet and Web Services.
CO2 Describe and differentiate Programming Language and Markup Language.
CO3 Connect various web pages and web sites together.
CO4 Capture user input from the remote users.
CO5 Learn connectivity concepts of Front End and Back End.
Page 24 of 82
Basic Formatting Tags: HTML Basic Tags, Text Formatting (Paragraph Breaks,
Line Breaks), Emphasizing Material in a Web Page (Heading Styles, Drawing
Lines), Text Styles (Bold, Italics, Underline), Other Text Effects (Centering
(Text, Images etc.), Spacing (Indenting Text), HTML Color Coding.
Lists
Tables: Introduction (Header, Data rows, The Caption Tag), Using the Width
and Border Attribute, Using the Cell padding Attribute, Using the Cell spacing
Attribute, Using the BGCOLOR Attribute, Using the COLSPAN and
ROWSPAN Attributes
Tag.
Part-B
Page 25 of 82
Text Books:
1. Internet for EveryOne: Alexis Leon, 1st Edition, Leon Techworld, Publication,
2009.
2. Greenlaw R; Heppe, “Fundamentals of Internet and WWW”, 2nd Edition, Tata
McGraw-Hill, 2007.
3. RajKamal, “Internet& Web Technologies”,edition Tata McGraw-Hill
Education.2009.
4. Chris Payne, “Asp in 21 Days”, 2nd Edition, Sams Publishing, 2003 PDCA.
5. A Beginner's Guide to Html Http://www.Ncsa.Nine.Edit/General/Internet/W
ww/Html.Prmter
1. https://www.tutorialspoint.com/html/html_tutorial.pdf
2. https://www.w3schools.com/js/
3. https://www.w3schools.com/html/
4. https://www.cs.uct.ac.za/mit_notes/web_programming.html
5. http://www.pagetutor.com/table_tutor/index.html
---------------------------------------------------------------------------------------------------------------------------------------------
Page 26 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 2nd Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Medium Access Sublayer: Static and dynamic channel allocation for LAN
and MAN ALOHA Protocols, LAN Protocols: CSMA, CSMA/CD,
Collision Free protocol
Text Books:
1. A.S. Tannenbaum, “Computer Networks", 3rd Edition, Prentice Hall, 1999.
2. Data Communications & Networking by Forouzan, Tata McGraw Hills.
Reference Books:
1. D.E. Cormer," Computer Networks and Internet”, 2nd Edition, Addison Wesley
Publication, 2000.
2. D. Bertsekas and R.Gallagar, “Data Networks”, 2nd Edition, Prentice-Hall, 1992.
3. Stevens W.R.," UNIX Network Programming," Prentice Hall, 1990.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 28 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 2nd Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes:
CO# Course outcomes
CO1 Understand Object oriented approach for finding solutions to various problems with
the help of C++ language.
CO2 To understand Object oriented approach for finding Solutions to various problems
with the help of C++ language.
CO3 Create computer based solutions to various real-world problems using C++
Part B
Text Books:
Reference Books:
1. www.sakshat.ac.in
Page 30 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 2nd Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks: 70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes:
CO# Course outcomes
CO1 Aware about the engineering approach to analysis, design and built the software
CO2 Understand the phases and activities involved in the software life cycle models
CO3 Analyse problems, and identify and define the computing requirements appropriate to
its solution.
CO4 Apply design and development principles in the construction of software systems of
varying complexity
CO5 Apply current techniques, skills, and tools necessary for computing practice.
CO 6 Apply various testing techniques to test a software
CO7 Measure various characteristics of software.
CO8 Compare and choose between maintenance and reengineering of software, when there
is requirement to make changes in the software.
Part B 22 hours
Text Books:
1. Software Engineering–A Practitioner’s Approach, Roger S. Pressman and Bruce
R. Maxim, Eighth Edition, 2015, McGrawHill.
Reference Books:
1. An Integrated Approach to Software Engineering, Pankaj Jalota, Third Edition,
2005, Narosa Publishing House;
2. Software Engineering, Ian Sommerville, Ninth Edition, 2011, Addison-Wesley.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 32 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 2nd Contact hours: 44 hours
Internal max. marks: 30 Theory/Practical: Theory
External max. marks:70 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
General List and Trees: list and it’s contiguous implementation, it’s
drawback; singly linked list-operations on it; doubly linked list-operations on
it; circular linked list; linked list using arrays. Tree definitions-height, depth,
order, degree, parent and child relationship etc; Binary Trees- various
theorems, complete binary tree, almost complete binary tree; Tree traversals-
preorder, in order and post order traversals, their recursive and non recursive
implementations; expression tree- evaluation; linked representation of binary
tree-operations. Threaded binary trees; forests, conversion of forest into tree.
Heap-definition.
Page 33 of 82
Text Books
Reference Books:
1. Horowitz & Sawhaney: Fundamentals of Data Structures, Galgotia Publishers.
2. Yashwant Kanetkar, Understanding Pointers in C, BPB Publications.
3. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, Galgotia Pub.
Pvt. Ltd., 1998.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 34 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 2
Semester: 2nd Contact hours: 4 hours per week
Internal max. marks: 70 Theory/Practical: Practical
External max. marks: 30 Duration of End Semester Exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: Students must have the knowledge of editors like Notepad etc. and basic
understanding of Scripting Language/s.
Co requisite: Knowledge of Networking, Internet, Client Server concepts, Static &
Dynamic environment of the websites etc.
Additional material required in ESE:
➢ Demonstration of the website of college/ specific department/specific cells etc.
will be presented by the students during the final practical.
➢ Developed Website/s must be made online by the student/s.
➢ Printouts of the Main Page of the website must be arranged on Practical file
during daily lab work and must be submitted in the final examinations.
Course Outcomes: After studying this course, students will be able to:
CO# Course Outcomes
CO1 Understand Static and Dynamic concepts of web designing.
CO2 Develop ability to retrieve data from a database and present it online.
CO3 Design web pages that apply various dynamic effects on the web site.
CO4 Solve complex and large problems using Scripting Language & Markup Language.
Reference Books:
1. https://www.w3schools.com/html/html_examples.asp
2. https://www.cs.uct.ac.za/mit_notes/web_programming.html
---------------------------------------------------------------------------------------------------------------------------------------------
Page 36 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 2
Semester: 2nd Contact hours: 4 hours per week
Internal max. marks: 70 Theory/Practical: Practical
External max. marks: 30 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes:
CO# Course outcomes
CO1 To learn programming from real world examples.
CO2 To understand Object oriented approach for finding solutions to various problems with
the help of C++ language.
CO3 To create computer based solutions to various real-world problems using C++
CO4 To learn various concepts of object oriented approach towards problem solving
Assignments:
Note: The instructor needs to give an overview of Editor for C++.
Write programs in C++
1. To display input values using cin and cout statement with formatting.
2. To display prime, even and odd numbers
3. To display Fibonacci Series of ‘n’ numbers.
4. To input marks and display result using nested if statement.
5. to find the factorial of a number using interactions and recursion.
6. To display days of week using SWITCH statement.
7. To find largest and smallest number from three elements.
8. To display the address and the content of a pointer variable.
9. Using reference variables as arguments to swap the values of pair of integers.
10. To add all ODD numbers between 10 to 100 and divisible by given number ‘n’.
11. To find number is palindrome.
Write programs in C++ using Strings
12. To sort the names in ascending order
13. To copy the contents of one string to another string.
Write programs in C++ using array
14. To sort the elements (integers) in ascending order
Page 37 of 82
Reference Books:
Page 38 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 2
Semester: 2nd Contact hours: 4 hours per week
Internal max. marks: 70 Theory/Practical: Practical
External max. marks: 30 Duration of end semester exam (ESE): 3hrs
Total marks: 100 Elective status: Core
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -na-
Course Outcomes:
CO# Course outcomes
CO1 Student will be able to apply appropriate constructs of Programming language, coding
standards for application development
CO2 Students will be able to programming skills for solving problems.
CO3 Select appropriate searching and/or sorting techniques for application development.
CO4 Students will be able to learn graphs and its techniques.
15 19 10 7 17 16
6 Write programs for finding the element in the array using the binary search method using
iteration and recursion concepts.
7 Write a program to create a link list and perform operation such as insert, delete, update
and reverse.
8 Write a program to insert value in a Linear Array at Specified Position.
9 Write a program to swap two number using calls by value and call by reference.
10 Write a C program to simulate the working of a circular queue of integers using an array.
Provide the following operations, Insert, Delete.
11 Write a program to sort elements using Merge Sort method.
Page 39 of 82
Reference Books:
Page 40 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 3rd Contact hours: 44 hours
Theory/Practical: Theory Percentage of numerical/design problems: --
Internal max. marks: 30 Duration of end semester exam (ESE): 3hrs
External max. marks: 70 Elective status: Core
Total marks: 100
Rings and Boolean algebra: Rings, Subrings, Morphism of rings ideals and
quotient rings. Euclidean domains, Integral domains and fields, Boolean
Algebra, Direct product morphisms, Boolean sub-algebra, Boolean Rings,
Application of Boolean algebra (Logic Implications, Logic Gates, Karnaugh
map)
Page 41 of 82
Text Books:
1. Discrete Mathematics (Schaum series), Lipschutz (McGraw Hill).
2. Applied Discrete Structures for Computer Science, Alan Doerr and Kenneth
Levarseur (Creative Commons) 2012.
Reference Books:
1. Discrete Mathematics and its Applications, Kenneth H Rosen.(McGraw Hill)
2. Discrete Mathematics and Graph Theory, Sartha, (Cengage Learning)
3. Elements of discrete mathematics. C L Liu (McGraw Hill)
---------------------------------------------------------------------------------------------------------------------------------------------
Page 42 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 3rd Contact hours: 44 hours
Theory/Practical: Theory Percentage of numerical/design problems: --
Internal max. marks: 30 Duration of end semester exam (ESE): 3hrs
External max. marks: 70 Elective status: Core
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Page 43 of 82
Text Books:
1. D. Hearn and M.P. Baker, “Computer Graphics”, PHI/Pearson Education.
2. Zhigand Xiang, Roy Plastock, “Computer Graphics”, Tata Mc-Graw Hill.
Reference Books:
1. C. Foley, VanDam, Feiner and Hughes, “Computer Graphics Principles &
Practice”, Pearson Education.
2. Amarendra N Sinha, Arun D Udai, “Computer Graphics”, Tata Mc-Graw Hill.
3. Rogers, Adams, “Mathematics Elements for Computer Graphics”, Tata Mc-Graw
Hill.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 44 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 3rd Contact hours: 44 hours
Theory/Practical: Theory Percentage of numerical/design problems: --
Internal max. marks: 30 Duration of end semester exam (ESE): 3hrs
External max. marks: 70 Elective status: Core
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Text Books:
1. Whitley, David, “E-Commerce Strategy, Technologies and Applications”,
Tata McGraw Hill.
2. Laudon and Traver, “E-Commerce: Business, Technology & Society”,
Pearson Education
3. Damian Ryan, Calvin Jone. Kogan Page; “Understanding Digital Marketing:
Marketing Strategies for Engaging the Digital Generation”.
Reference Books:
1. Seema Gupta, Digital Marketing, McGraw Hill
2. Puneet Singh Bhatia, Fundamentals of Digital Marketing First Edition,
Publication Pearson.
3. Shivani Karwal, “Digital Marketing Handbook: A Guide to search Engine
Optimization, Pay Per Click Marketing, Email Marketing and Content
Marketing”, CreateSpace Independent Publishing Platform, 1st edition.
4. Ian Dodson, The Art of Digital Marketing: The Definitive Guide to
Creating Strategic, Targeted and Measurable Online Campaigns,
Publication Wiley India Pvt Ltd.
5. Venakataramana Rolla, “Digital Marketing Practice guide for SMB: SEO,
SEM and SMM”, CreateSpace Independent Publishing Platform, First
edition.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 46 of 82
Prerequisite:
Co requisite:
Additional material required in ESE:
Course Outcomes: Students will be able to
CO# Course outcomes
Part A
Overview of Computing Paradigm: Recent trends in 22 hours
Computing -Grid Computing, Cluster Computing, Distributed
Computing, Utility Computing, Cloud Computing.
Introduction to Cloud Computing: Vision of Cloud
Computing, Defining a Cloud, Cloud Reference Model,
Deployment Model, Characteristics, Benefits of Cloud
Computing, Challenges ahead. Cloud computing vs. Cluster
computing vs. Grid computing.
Migrating into a Cloud: Introduction, Broad approaches to
Migrating into the Cloud, The Seven-Step Model of Migration
Into a Cloud.
Virtualization: Introduction, Characteristics of Virtualized
environment, Taxonomy of Virtualization techniques,
Virtualization and Cloud Computing, Pros and Cons of
Page 47 of 82
Part B
SLA Management in Cloud Computing: Inspiration, 22 hours
Traditional Approaches to SLO Management, Types of SLA,
Life Cycle of SLA, SLA management in Cloud. Automated
Policy-based management.
Securing Cloud services: Cloud Security, Securing Data-
Brokered Cloud Storage Access, Storage location and tenancy,
Encryption, Auditing and compliance.
Cloud Storage: Provisioning Cloud Storage, Virtual storage
containers, Cloud Storage Interoperability (CDMI, OCCI),
Database Storage, Resource Management,
Advance Topics in Cloud: Energy Efficiency in cloud, Market
Oriented Cloud Computing, Federated Cloud Computing,
Mobile Cloud Computing, Fog computing, BigData Analytics,
Basics of IoT.
Cloud Platforms in Industry: Amazon Web Services-Compute
Services, Storage Services, Communication Services,
Additional Services. Google AppEngine-Architecture and Core
Concepts, Application Life Cycle. Cost Model. Microsoft
Azure-Azure Core Concepts, SQL Azure, Windows Azure
Platform Appliance.
Text Books:
1. Mastering Cloud Computing, Rajkumar Buyya, Christian Vecchiola, and
Thamarai Selvi, Tata McGraw Hill, ISBN-13: 978-1-25-902995-0, New Delhi,
India,Feb 2013.
2. Cloud Computing Bible, Barrie Sosinsky, Wiley India Pvt. Ltd, ISBN-13: 978-
81-265-2980-3,New Delhi, India, 2011.
3. Cloud Computing: Principles and paradigms, Raj Kumar Buyya, James
Broberg, Andrezei M.Goscinski, Wiley India Pvt. Ltd, ISBN-13: 978-81-265-
4125-6,New Delhi, India, 2011
Reference Books:
1. Cloud Computing For Dummies, Fern Halper, Hurwitz, Robin Bloor, Marcia
Kaufman, Wiley India Pvt. Ltd, ISBN-13: 978-0-47-0597422, New Delhi,
India, 2011.
2. Dr. Saurabh Kumar, Cloud Computing: Insights Into New-Era Infrastructure,
Wiley India Pvt. Ltd, ISBN-13: 978-8-12-6528837, New Delhi, India, 2011.
Page 48 of 82
---------------------------------------------------------------------------------------------------------------------------------------------
Course Code: PGCA1923
Course Name: Computer Graphics Laboratory
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 4
Semester: 3rd Contact hours: 4 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 70 Duration of end semester exam (ESE): -
External max. marks: 30 Elective status: Core
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
2. Write a program for creating a simple two-dimensional shape of any object using
lines, circle, etc.
3. Using different graphics functions available for text formatting, write a program for
displaying text in different sizes, different colors, font styles.
4. Implement the DDA algorithm for drawing line (programmer is expected to shift the
origin to the center of the screen and divide the screen into required quadrants)
Page 49 of 82
Text Books:
1. Zhigang Xiang, Roy A. Plastock, “Schaum’s Outline of Computer Graphics
2/E”, 2nd Edition, Tata Mc-Graw Hill
2. Yashavant Kanetkar, “Graphics under C”, BPB Publications.
Reference Books:
1. C. Foley, VanDam, Feiner and Hughes, “Computer Graphics Principles &
Practice”, Pearson Education.
2. Amarendra N Sinha, Arun D Udai, “Computer Graphics”, Tata Mc-Graw Hill.
3. Rogers, Adams, “Mathematics Elements for Computer Graphics”, Tata Mc-Graw
Hill.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 50 of 82
Page 51 of 82
---------------------------------------------------------------------------------------------------------------------------------------------
Course Code: PGCA1949
Course Name: Minor Project
Program: M.Sc.(IT) L: 0 T: 0 P: 8
Branch: Computer Applications Credits: 4
rd
Semester: 3 Contact hours: 8 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 140 Duration of end semester exam (ESE): -
External max. marks: 60 Elective status: Core
Total marks: 200
Page 52 of 82
---------------------------------------------------------------------------------------------------------------------------------------------
Course Code: PGCA1939
Course Name: Java Technologies
Page 53 of 82
Control Statements: Decision making statements (if, if-else, nested if, else
if ladder, switch, conditional operator), Looping statements (while, do-while,
for, nested loops), Jumping statements (Break and Continue).
Part B 22 Hours
Exception Handling: Introduction, Try and Catch Blocks, Multiple Catch,
Nested Try, Finally, Throw Statement, Built-In Exceptions
Page 54 of 82
Text Books:
1. Herbert Schildt , “The Complete Reference Java 2” , Tata McGraw -Hill.
2. Balagurusamy: Programming in JAVA, Tata McGraw Hill, 2019.
Reference Books:
1. Grey Cornell and Hortsmann Cay S., “Core Java”, Sun Microsystems Press.
2. The Java Handbook by Patrick Naughton, Michael Morrison Publisher:
Osborne/McGraw-Hill
3. Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley
4. Bert Bates,Kathy Sierra ,”HeadFirst Java”, O’Reilly Media.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 55 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 4
Semester: 4th Contact hours: 4 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 70 Duration of end semester exam (ESE): -
External max. marks: 30 Elective status: Core
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes: Students will be able to:
CO# Course outcomes
CO1 Implement object oriented concepts using classes and objects.
CO2 Solve computational problems while working with multiple data types, control
structures and function.
CO3 Design and code solutions to complex problems using concepts of multithreading,
packages, interfaces and exception handling.
CO4
Text Books:
1. Herbert Schildt , “The Complete Reference Java 2” , Tata McGraw -Hill.
2. Balagurusamy: Programming in JAVA, Tata McGraw Hill, 2019.
Reference Books:
1. Grey Cornell and Hortsmann Cay S., “Core Java”, Sun Microsystems Press.
2. The Java Handbook by Patrick Naughton, Michael Morrison Publisher:
Osborne/McGraw-Hill
3. Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley
4. Bert Bates,Kathy Sierra ,”HeadFirst Java”, O’Reilly Media.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 57 of 82
Prerequisite: NA
Co requisite: NA
Additional material required in ESE: NA
Course Outcomes: Students will be able to
CO# Course outcomes
CO1 Use basic concepts of formal languages of finite automata techniques.
CO2 Design Finite Automata’s for different Regular Expressions and Languages.
CO3 Construct context free grammar for various languages.
CO4 Solve various problems of applying normal form techniques, push down
automata and Turing Machines.
CO5 Solve computational problems regarding their computability and complexity
and prove the basic results of the theory of computation.
Part A
Formal Language, Non-Computational Problems, Diagonal 22 hours
Argument, Russels’s Paradox.
Theory of Automata: Deterministic Finite Automaton (DFA),
Non-Deterministic Finite Automaton (NDFA), Equivalence of
DFA and NDFA, Mealy and Moore Models, Minimization of
Finite Automata.
Regular Sets and Regular Grammars: Regular Languages,
Regular Grammars, Regular Expressions, Properties of Regular
Language, Pumping Lemma, Non-Regular Languages, Lexical
Analysis.
Context Free Language: Properties of Context Free Language,
Chomsky Classification of Languages, Context Free Grammar,
Simplification of Context Free Grammar, Chomsky Normal
Form, Greibach Normal Form.
Part B
22 hours
Page 58 of 82
Text Books:
Reference Books:
1. Introduction to Computer Theory, Daniel. I.A. Cohen , John Wiley & Sons.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 59 of 82
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Page 60 of 82
Part B 22 Hours
Text Books:
1. William Stallings, Lawrie Brown, “Computer Security: Principles & Practice”,
3rd Edition, Pearson, 2015.
2. Surya Prakash Tripathi, Ritendra Goel, Praveen Kumar Shukla, “Introduction to
Information Security and Cyber Laws”, Wiley India, 2014.
Reference Books:
1. Christof Paar , Jan Pelzl, “Understanding Cryptography: A Textbook for
Students and Practitioners”, 1st Edition, Springer, 2010
2. William Stallings, “Cryptography and Network Security Principles and
Practices”, 4th Edition, Prentice Hall, 2006.
3. Darren Death, “Information Security Handbook”, Packt Publishing, 2017
Page 61 of 82
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 4th Contact hours: 44 hours
Theory/Practical: Theory Percentage of numerical/design problems: --
Internal max. marks: 30 Duration of end semester exam (ESE): 3hrs
External max. marks: 70 Elective status: Elective
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Part B 22 Hours
Page 62 of 82
Text Books:
1. J.Han and M.Kamber, “Data Mining: Concepts and Techniques”, Publisher Morgan
Kaufmann Publishers
2. K.P. Soman, Shyam Diwakar and V. Aja, “Insight into Data Mining Theory and
Practice”, Eastern Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Eastern Economy
Edition, Prentice Hall of India, 2006.
4. Daniel T.Larose, “Data Mining Methods and Models”, Wiley-Interscience, 2006.
5. Paulraj Ponniah, “Data Warehousing Fundamentals: A Comprehensive Guide for IT
Professionals”, 2001 John Wiley & Sons, Inc. ISBNs: 0-471-41254-6 (Hardback); 0-
471-22162-7 (Electronic).
---------------------------------------------------------------------------------------------------------------------------------------------
Page 63 of 82
Part B 22 Hours
Page 64 of 82
Text Books:
1. R.N. Prasad and Seema Acharya, Fundamentals of Business Analytics, Wiley
India Ltd.
2. Mike Biere, Business Intelligence for the Enterprise, Prentice Hall Professional.
Reference Books:
1. David Taniar, Progressive methods in data warehousing and business
intelligence: concepts and competitive analytics, Idea Group Inc (IGI).
2. Data warehousing: the ultimate guide to building corporate business intelligence,
Birkhäuser.
---------------------------------------------------------------------------------------------------------------------------------------------
Course Code: PGCA1926
Course Name: Artificial Intelligence & Soft Computing
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 4th Contact hours: 44 hours
Theory/Practical: Theory Percentage of numerical/design problems: --
Internal max. marks: 30 Duration of end semester exam (ESE): 3hrs
External max. marks: 70 Elective status: Elective
Total marks: 100
Prerequisite: -NA-
Page 65 of 82
Part B
22 Hours
Introduction: What is Soft Computing? Difference between Hard and Soft
computing, Requirement of Soft computing, Major Areas of
Soft Computing, Applications of Soft Computing.
Page 66 of 82
Fuzzy Systems: Fuzzy Set theory, Fuzzy vs. Crisp set, Fuzzy Relation,
Fuzzification, Minmax Composition, Defuzzification Method, Fuzzy Logic,
Fuzzy Rule based systems, Predicate logic, Fuzzy Decision Making, Fuzzy
Control Systems, Fuzzy Classification.
Genetic Algorithm: History of Genetic Algorithms (GA), Working
Principle, Various Encoding methods, Fitness function, GA Operators-
Reproduction, Crossover, Mutation, Convergence of GA, Bit wise operation
in GA, Multi-level Optimization.
Introduction to Hybrid Systems.
Text Books:
1. Artificial Intelligence-A Modern Approach, Russel and Norvig, Prentice Hall.
2. Artificial Intelligence, Elaine Rich, Kevin Knight and SB Nair, 3 Ed.,Tata
McGraw-Hill.
3. Principles of Soft Computing, S.N. Sivanandam, S.N. Deepa, Wiley India
4. Neural Networks, Fuzzy Logic and Genetic Algorithms: Synthesis &
Applications, S.Rajasekaran, G. A. Vijayalakshami, PHI.
Reference Books:
---------------------------------------------------------------------------------------------------------------------------------------------
Page 67 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 4
Semester: 4th Contact hours: 4 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 70 Duration of end semester exam (ESE): 3hrs
External max. marks: 30 Elective status: Elective
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Assignments:
1. Use logic programming in Python to check for prime numbers.
2. Use logic programming in Python parse a family tree and infer the relationships
between the family members.
3. Python script for building a puzzle solver.
4. Implementation of uninformed search techniques in Python.
5. Implementation of heuristic search techniques in Python.
6. Python script for tokenizing text data.
7. Extracting the frequency of terms using a Bag of Words model.
8. Predict the category to which a given piece of text belongs.
9. Python code for visualizing audio speech signal
10. Python code for Generating audio signals
Create a perceptron with appropriate no. of inputs and outputs. Train it using fixed
11. increment learning algorithm until no change in weights is required. Output the final
weights.
12. Implement AND function using ADALINE with bipolar inputs and outputs.
13. Implement AND function using MADALINE with bipolar inputs and outputs.
14. Construct and test auto associative network for input vector using HEBB rule.
Page 68 of 82
Text Books:
1. Principles of Soft Computing, S.N. Sivanandam, S.N. Deepa, Wiley India
2. Artificial Intelligence with Python, Prateek Joshi, Packt Publishing.
3. Neural Networks, Fuzzy Logic and Genetic Algorithms: Synthesis &
Applications, S.Rajasekaran, G. A. Vijayalakshami, PHI.
Reference Books:
1. Soft Computing: With Matlab Programming, N. P. Padhy, S. P. Simon, Oxford
Higher Education
2. Neuro - Fuzzy & Soft Computing - C. T. Sun, E. Mizutani, J. S. R. Jang, Pearson
---------------------------------------------------------------------------------------------------------------------------------------------
Page 69 of 82
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Text Books:
3. Vijay Madisetti, ArshdeepBahga, Ïnternet of Things, “A Hands on Approach”,
University Press
4. Pethuru Raj and Anupama C. Raman, “The Internet of Things: Enabling
Technologies, Platforms, and Use Cases”, CRC Press
5. Raj Kamal, “Internet of Things: Architecture and Design”, McGraw Hill
6. CunoPfister, “Getting Started with the Internet of Things”, O Reilly Media
Reference Books:
1. Dr. SRN Reddy, RachitThukral and Manasi Mishra, “Introduction to Internet of
Things: A practical Approach”, ETI Labs
2. Jeeva Jose, “Internet of Things”, Khanna Publishing House, Delhi
3. Adrian McEwen, “Designing the Internet of Things”, Wiley.
---------------------------------------------------------------------------------------------------------------------------------------------
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 4
Semester: 4th Contact hours: 4 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 70 Duration of end semester exam (ESE): -
External max. marks: 30 Elective status: Elective
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Course Outcomes: Students will be able to:
CO# Course outcomes
CO1 Understand the concept of Internet of Things and familiarize themselves with the
hardware and software components of IoT.
CO2 Work with sensor generated data and analyze the same.
Page 71 of 82
Text Books:
1. Vijay Madisetti, ArshdeepBahga, Ïnternet of Things, “A Hands on Approach”,
University Press
2. Pethuru Raj and Anupama C. Raman, “The Internet of Things: Enabling
Technologies, Platforms, and Use Cases”, CRC Press
3. Raj Kamal, “Internet of Things: Architecture and Design”, McGraw Hill
4. CunoPfister, “Getting Started with the Internet of Things”, O Reilly Media
Page 72 of 82
---------------------------------------------------------------------------------------------------------------------------------------------
Program: M.Sc.(IT) L: 4 T: 0 P: 0
Branch: Computer Applications Credits: 4
Semester: 4th Contact hours: 44 hours
Theory/Practical: Theory Percentage of numerical/design problems: --
Internal max. marks: 30 Duration of end semester exam (ESE): 3hrs
External max. marks: 70 Elective status: Elective
Total marks: 100
What is Machine Learning, problems, data and tools, types of learning, 22 Hours
performance evaluation measures: accuracy, precision, recall, F measures,
etc. various error metrics, data visualization.
Page 73 of 82
Part B
22 Hours
Bagging, decision trees and random forests, boosting
A more detailed discussion on Decision Tree and Boosting
Clustering, k-means, hierarchical agglomeration, Support Vector Machines,
Principal Component Analysis.
Text Books:
1. Introduction to Machine Learning, Third Edition, Ethem Alpaydin, MIT Press.
2. An Introduction to Statistical Learning, Gareth James, Springer.
Reference Books:
1. Understanding Machine Learning: From Theory to Algorithms, Shai Shalev-
Shwartz, Shai Ben-David, Cambridge University, Press.
2. Introduction to Machine Learning with Python: A Guide for Data Scientists,
Andreas C. Müller, Sarah Guido, O'Reilly Media.
---------------------------------------------------------------------------------------------------------------------------------------------
Page 74 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 2
Semester: 4th Contact hours: 4 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 70 Duration of end semester exam (ESE): 3hrs
External max. marks: 30 Elective status: Elective
Total marks: 100
Prerequisite: -NA-
Co requisite: -NA-
Additional material required in ESE: -NA-
Instructions:
1. Students may develop the assignments in Python/R/Matlab.
2. Standard data sets or assumed data sets may be used for developing ML
programs.
Assignments:
1. Design and evaluate a data model using Linear Regression.
2. Design and evaluate a data model using Logistic Regression.
3. Design and evaluate a data model using KNN.
4. Design and evaluate a data model using K Means Clustering.
5. Design and evaluate a data model using SVM.
6. Design and evaluate a data model using PCA.
7. Design and evaluate a data model using Decision Trees.
8. Design and evaluate a data model using Random Forest.
9. Design and evaluate a data model using Deep Learning.
10. Compare the performance of all the above ML techniques on a similar data set.
Reference Books:
Page 75 of 82
---------------------------------------------------------------------------------------------------------------------------------------------
Course Code: PGCA1947
Course Name: Big Data Analytics
Page 76 of 82
Part B 22 Hours
Text Books:
1. J. Han, M. Kamber, “Data Mining Concepts and Techniques”, Morgan
Kaufmann
2. M. Kantardzic, “Data mining: Concepts, models, methods and algorithms”,
John Wiley & Sons Inc.
Page 77 of 82
---------------------------------------------------------------------------------------------------------------------------------------------
Course Code: PGCA1948
Course Name: Big Data Analytics Laboratory
Program: M.Sc.(IT) L: 0 T: 0 P: 4
Branch: Computer Applications Credits: 2
Semester: 4th Contact hours: 4 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 70 Duration of end semester exam (ESE): -
External max. marks: 30 Elective status: Elective
Total marks: 100
Page 78 of 82
Page 79 of 82
1. Michael Mineli, Michele Chambers, Ambiga Dhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses",
Wiley Publications, 2013.
2. Tom White “ Hadoop: The Definitive Guide” Third Edit on, O’reily Media,
2012.
Reference Books:-
---------------------------------------------------------------------------------------------------------------------------------------------
Page 80 of 82
Program: M.Sc.(IT) L: 0 T: 0 P: 16
Branch: Computer Applications Credits: 8
Semester: 4th Contact hours: 16 hours per week
Theory/Practical: Practical Percentage of numerical/design problems: --
Internal max. marks: 250 Duration of end semester exam (ESE): -
External max. marks: 120 Elective status: Core
Total marks: 400
CO2 Evaluate various development models and Chose best according to requirement
Mentor: Yes Group size: 4-5 students Problem: Some real world Problem
(depending upon problem
size)
End Product: Workable Project in Testing: Extensive Documentation: Must (as per
real situation development model Chosen)
Page 82 of 82