PUNJABI UNIVERSITY, PATIALA

OUTLINES OF TESTS,
SYLLABI AND COURSES OF READING

FOR

M. Sc. (IT)
(SEMESTER SYSTEM)
SECOND YEAR (Semester III & IV)
(2017-18 and 2018-19 Sessions)

(As per RUSA Guidelines)

PUNJABI UNIVERSITY,
PATIALA – 147 002

1
 SYLLABI, OULINES OF PAPERS AND TESTS

M.Sc. (IT) Semester III

(2017-18 and 2018-19 Sessions)

Code No. Title of the Paper Lecture Univ. Int. Time

Per week Exam. Ass. Total
Marks Marks Allowed
MS-211 Web Technology 5 70 30 3 Hrs
MS-212 Java Programming 5 70 30 3 Hrs
MS-213 Software Engineering 5 70 30 3 Hrs
MS-214 Computer Networks 5 70 30 3 Hrs
MS-215 Programming Lab-IV 8 70 30 3 Hrs
(Web Technology)
MS-216 Programming Lab-V 8 70 30 3 Hrs
(Java Programming)

M.Sc. (IT) Semester IV

(2017-18 and 2018-19 Sessions)

Code Semester System-IV Lecture Univ. Int. Time

Per week Exam. Ass. Total
No.
Marks Marks Allowed
MS-221 Computer Graphics 5 70 30 3 Hrs
MS-222 Linux Administration 5 70 30 3 Hrs
MS-223 Modern Information Systems 5 70 30 3 Hrs
MS-224 Artificial Intelligence 5 70 30 3 Hrs
MS-225 Programming Lab-VI 8 70 30 3 Hrs
(Computer Graphics)
MS-226 Programming Lab-VII 8 70 30 3 Hrs
(LINUX Administration)

CONTINUOUS ASSESSMENT (THEORY PAPERS)

1. Two tests will be conducted during the : 60% of the marks allotted for
Semester. Both the tests will be Continuous Assessment
considered for assessment.
2. Assessment/Quizes : 20% of the marks allotted for
Continuous Assessment
3. Attendance : 10% of the marks allotted for
Continuous Assessment.
4. Class Participation and behavior : 10% of the marks allotted for
Continuous Assessment.

2
 LTPC
4 1 0 5

MS-211 : Web Technology

Maximum Marks: 70 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A
Introductory: Internet Basics: Networks, Protocols, TCP/IP, Internet Addresses, Ports,
Sockets, Name Resolution, Firewalls, Protocol Tunneling, Proxy Servers, Internet Standards,
governing the web HTTP, MIME, Inside URLs, Web applications, Overview of
clients/servers web communication, comparison of web servers, Common Gateway Interface
CGI.
Web Page Designing: Introduction to markup languages; HTML: list, table, images, frames,
forms, pages style sheets CSS; XML: DTD, XML Namespaces, XML schemes, Presenting
XML with CSS and XSLT, XML-DOM, What is XHTML?

SECTION B
Client Side Scripting: Java script: Introduction, documents, forms, statements, functions,
objects; Event and event handling; Browsers and the DOM, JQuery: Syntax, Selectors,
Events and AJAX methods.
Server Side Programming: PHP: Introduction, requirements, PHP syntax, data type,
variables, strings, operators, if-else, control structure, switch, array, function, file handling,
form, sending email, file upload, session/state management, error and exception, PHP
Database for dynamic Web pages.
Introduction to Servlets: Servlet Basic Servlet Structure, Servlet Lifecycle, Servlet APIs.
Writing thread safe Servlets. Setting Cookies and Session Management with Servlet API.

Reference Books :

1. Jeffrey C Jackson, “Web Technology – A computer Science perspective”, Persoson

Education, 2007.
2. Chris Bates, “Web Programming – Building Internet Applications, “Wiley India, 2006.
3. Xavier, C, “ Web Technology and Design” , New Age International
4. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication.
5. Ramesh Bangia, “Internet and Web Design” , New Age International
6. Bhave, “Programming with Java”, Pearson Education
7. Ullman, “PHP for the Web: Visual QuickStart Guide”, Pearson Education
8. Deitel, “Java for programmers”, Pearson Education
9. Dustin R. Callaway, “Inside Servlets” Pearson Education.

3
 LTPC
4 1 0 5
MS-212 : Java Programming

Maximum Marks: 70 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A

Introduction to Java, Why java is important to the Internet, Object Oriented Programming,
Data types, Variables, Arrays, the Simple types, Floating Point Types, Operators, Arithmetic
Operators. The Bit wise operators, Relational Operator's, Boolean, Logical Operators,
Control Statements.
Introducing Classes : Class fundamentals, declaring objects, Assigning object Reference,
Variables, Introducing Methods, Constructors, this keyword, Garbage collection,
Overloading Using Objects and parameters, Argument Passing, Returning Objects,
Recursion, Access Control, Static, Nested & Inner Classes. Exploring String class using
command line Arguments. Inheritance.

SECTION B

Packages : Defining a package, CLASSPATH, Access protection, Importing Packages,

Defining an interface, Implementing Interface. Exception handling fundamentals, Exception
types, using try & catch, throw, throws, Java's Built in Exceptions, Creating your own
Exception subclasses.
Threading, Multithreading, Applets, Event handling, Introduction of AWT.

Reference Books :

1. Patrick Naughton and Herbert Schildt, “The Complete Reference Java 2”, Tata McGraw
Hill, 1999.
2. Lemay, L. : Teach yourself Java in 21 days, Tech.
3. Griffith : 1001 Java Programming Tips.
4. Sulalman : Java Programmers Library.

4
 LTPC
4 1 0 5

MS-213 : Software Engineering

Maximum Marks: 70 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A

Software Engineering : History, Definition, Goal; The role of the Software Engineer, The
Software Life Cycle, The relationship of Software Engineering to other areas of Computer
Science, Classification of Software Qualities, Representative Qualities, Software process
models: Waterfall model, prototyping, spiral; Tools and techniques for process modeling,
Management of software engineering management functions, project planning and
organization.
Requirement Analysis: The requirement process, types of requirements, Characteristics and
components of SRS, Data flow Diagrams, Data Dictionary, UML diagrams for specifying
behaviors ,metrics, verification of SRS.
Design and Software architecture: The Software design activity and its objectives,
Abstraction, Modularity, Coupling-Cohesion criteria, Object-Oriented Design: generalization
and specialization, associations and aggregations.

SECTION B

Coding: Programming standards and procedures, programming guidelines, documentation,

and Code verification techniques.
Verification and validation: Approaches to verification, testing goals, principles,
Equivalence class partitioning, Boundary value analysis, mutation testing, graph based
testing, cyclomatic complexity, test planning ,automated testing tools, features of Object-
Oriented testing.
Software maintenance: The nature of maintenance, maintenance problems, maintenance
techniques and tools.
Software re-engineering, reverse engineering, forward engineering: forward Engineering for
Object-oriented and client/server architecture, Building blocks for CASE, CASE tools and
applications.

Reference Books :

1. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli, “ Fundamentals of Software

Engineering”, 2nd edition Pearson Education. 2003.
2. Shari Lawrence Pfleeger, “ Software Engineering : Theory and Practice”, 2nd edition,
Pearson Education, 2003.
5
3. P.Jalota, “An Integrated Approach to SoftwareEngineering”, Narosa Publications.
4. Roger.S.Pressman,” SoftwareEngineering-A practitioner’s Approach”, 3rd
edition,McGraw-Hill.

6
 LTPC
4 1 0 5

MS-214 : Computer Networks

Maximum Marks: 70 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A
Computer networks: uses of computer networks, Goals and applications of networks,
computer network structure and architecture, reference models: OSI model, TCP/IP model,
Comparison of TCP/IP and OSI models, Introduction to Novell Netware, and ARPANET.
Medium Access Sublayer : Static and dynamic channel allocation for LAN and MAN
ALOHA Protocols, LAN Protocols : CSMA, CSMA/CD, Collision Free protocol, BRAP,
MLMA, Binary countdown, Limited contention protocol, Urn Protocol, Adaptive tree walk
protocol.
Networking and Internetworking devices: Repeater, bridges, routers, gateways, switches.

SECTION B

High speed LAN: FDDI, Fast Ethernet, HIPPI, Fiber channel.

LAN IEEE 802.x standards.
Routing: Static vs. Dynamic Routing, various Routing Algorithms.
Congestion Control: Causes of Congestion, Various Congestion Control Strategies and
Algorithms
Mobile telephone, mobile telephone switching office.
Internet protocols: Principles of Internetworking, connectionless internetworking, Internet
protocols, IPv6.
Network Security: Security requirements and attacks, encryption Public key encryption and
digital Signatures. distributed applications: SNMP, SMTP, HTTP.

Reference Books :

1. A.S. Tannenbaum, “Computer Networks", 3rd Edition, Prentice Hall, 1999.

2. Data Communications & Networking by Forouzan, Tata McGraw Hills.
3. D.E. Cormer," Computer Networks and Internet”, 2nd Edition, Addison Wesley
Publication, 2000.
4. D.E. Cormer and D.L. Stevens," Inter-networking with TCP-IP: Design,
Implementation and Internals", Vol. II, Prentice Hall, 1990.
5. D. Bertsekas and R.Gallagar, “Data Networks”, 2nd Edition, Prentice-Hall,
1992.
6. Stevens W.R.," UNIX Network Programming," Prentice Hall, 1990.

7
 LTPC
0 0 88

MS-215 : Programming Lab-IV (Web Technology)

Maximum Marks: 100* Max. Time: 3 Hrs.

Minimum Pass Marks: 35% Practical sessions to be conducted: 60-70

This laboratory course will mainly comprise of exercise based on subject MS-211 Web
Technology.

*Maximum Marks for Continuous Assessment: 30

Maximum Marks for University Examination: 70

8
 LTPC
0 0 88

MS-216 Programming Lab-V (Java Programming)

Maximum Marks: 100* Max. Time: 3 Hrs.

Minimum Pass Marks: 35% Practical sessions to be conducted: 60-70

This laboratory course will mainly comprise of exercise based on subject MS-212 Java
Programming.
.
*Maximum Marks for Continuous Assessment: 30

Maximum Marks for University Examination: 70

9
 LTPC
4 1 0 5
MS 221 : Computer Graphics

Maximum Marks: 70 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A

Introduction to computer Graphics systems, components of interactive computer graphics

system, Application areas.
Video Display Devices: Refresh cathode -ray tube, raster scan displays, random scan
displays, colour CRT-monitors, direct view storage tube, flat-panel displays, 3-D viewing
devices, virtual reality, raster scan systems, random scan systems, graphics monitors and
workstations.
Scan conversion algorithms for line, circle and ellipse, Bresenham’s algorithms, area filling
techniques, character generation.
2-dimensional Graphics: Cartesian and Homogeneous co-ordinate system, Geometric
transformations (translation, Scaling, Rotation, Reflection, Shearing), Composite
transformations, affine transformation, Two dimensional viewing transformation and clipping
(line, polygon and text).

SECTION B

3-dimensional Graphics: Geometric transformations (translation, Scaling, Rotation,

Reflection, Shearing), Composite transformations, Mathematics of Projections (parallel &
perspective). 3-D viewing transformations and clipping.
Hidden line and surface elimination algorithms, z-buffer, scan-line, sub-division, Painter's
algorithm.
Illumination Models: Diffuse reflection, Specular reflection, refracted light, texture surface
patterns, Halftoning, Dithering.
Surface Rendering Methods: Constant Intensity method, Gouraud Shading, Phong Shading.

Reference Books :

1. D. Hearn and M.P. Baker, “Computer Graphics”, PHI New Delhi; Second Edition,
1995.
2. J.D. Foley, A.V. Dam, S.K. Feiner, J.F. Hughes,. R.L Phillips, ”Introduction to
Computer Graphics”, Addison-Wesley Publishing company, N.Y.; Second
Edition,1994.
3. R.A. Plastock and G. Kalley, “Computer Graphics”, McGraw Hill, 1986.
LTPC

10
 4 1 0 5
MS-222 : LINUX Administration

Maximum Marks: 80 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A
Introduction: Overview of Linux, Linux's History, Advantages of Linux, Minimum System
Requirements; Installing Linux: Choosing Text or Graphics Installation, Setting up your
Hard Drive, Understanding the Swap Space, Creating the Linux File-system partition, Setting
up the mouse, root password and Ethernet, Configuration X, Selecting packages to Install,
Creating the Boot Disk. Using LILO boot manager: Installing LILO, LILO make-file,
Updating LILO, Removing or Disabling LILO, Troubleshooting LILO. The Boot Process,
Startup Scripts, Shutdown, Halt and reboot, Creating a New Login, Virtual Terminals,
Running as root.
Basic Linux Commands : How Linux Commands Work, Command Options & Parameters,
Input and Output Redirection, Mian pages, Wildcards : * and ?, Environment Variables, The
process status Commands : ps, termination command : kill, the su command, the grep
command.
Linux File System : Common types of files, filenames, Inodes, The root directory, How
directories are named, Navigating the Linux file System : pwd command, Absolute and
relative filenames; cd command, Creating and Deleting files : Cat, Creating Directories,
Moving and Copying files, Moving Directories, Removing files and directories, Important
directories in the Linux file System : / , /home, /bin, /usr, /usr/bin, /var/spool, /dev, /sbin, /etc.
File and Directory ownership, Groups, Changing group ownership, File Permissions,
UMASK Setting, Changing File Permission, Changing directory permissions; Bash : What is
Shell ? How the Shell gets Started, The most common Shells;

SECTION B
Shell Scripting: Creating and Executing Shell Programs, Using variables : Assigning a value
to a variable, Accessing the value of a variable, Positional Parameters and other Built-In Shell
Variables; Special Characters, Conditional Statements : if Statement , case Statement;
Iteration Statements : for Statement, while Statement, until Statement, shift Command, select
Statement, repeat Statement, Functions.
Editing and Typesetting : Text Editors vi, The vi Editor, Starting vi, vi modes, Inserting
Text, Quitting vi, Moving the Cursor, Deleting Text, Copying and Moving Text, Searching
and Replacing Text, Setting Preferences.
Configuring the X Window: Xfree86 Software Distribution, Choosing an X Server,
Installing Xfree86 Manually, Installing Xfree86 using a Script, Path Environment Variable;
Configuring Xfree86; The xconfig and XF86Config Files in Detail: Pathnames, Keyboard
Setting, Mouse Definition, Monitor Model, Video Cards, The Xfree86 Server, Testing
Xfree86 Configurations, The .xinitrc File.

11
Linux for System Administrators: System Administration Basics, The root Account,
Starting and Stopping the System, Booting from a Floppy, Using LILO to Boot, Shutting
Down Linux; Mounting File Systems : Mounting a Floppy, CD-ROM, Creating a New file
System, Un-mounting file Systems, Backup and restore: Compressing files with gzip, Using
tar and cpio; Setting up your System : Setting the System Name, Using a Maintenance Disk,
Forgetting the root Password, Setting the Login Message.
Networking & Network Services: What is TCP/IP? IP Address, Ports, Sockets, Subnets,
Routing, Hardware Requirements, Configuring the Network, Configuration Files, Testing and
Troubleshooting, The netstart Command, ping, traceroute, Mail, News, NFS, www, FTP,
Telnet, DNS.
Network Security: Firewalls.

REFERENCES:
1. Tim Parker : Linux Unleashed Third Edition, Techmedia, 1999.
2. Tackett, J : Special Edition using LINUX, PHI.
3. Norton, P. : Complete guide to LINUX, Techmedia.
4. Komarinski, M : LINUX System Administration Handbook, AW.
5. SUMITABHA DAS : UNIX Concepts & Application 2nd Edition, Tata McGraw-
Hill

12
 LTPC
4 1 0 5

MCA-223: Modern Information Systems

Maximum Marks: 70 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A

Introduction to Systems and Basic Systems Concepts, Types of Systems, Information

Systems: Definition and Characteristics, Types of Information, Role of Information in
Decision Making, Types of an Information system: Operations Support Systems and
Management Support Systems, Comparison of EDP/MIS/DSS.
An overview of Management Information System: Definition and Characteristics,
Components of MIS, Frame Work for Understanding MIS: Robert Anthony’s Hierarchy of
Management Activity, Information requirements and Levels of Management, Simon’s Model
of decision- Making.

SECTION B

Functional Information Systems: A Study of Marketing, Personnel, Financial and Production

information systems, Input transaction documents, applications and reports of Marketing,
Personnel, Financial and Production information systems. Models for functional information
systems.
Concept of Knowledge: Definition and characteristics of knowledge, Difference between
data, information and knowledge, Knowledge versus experience. Types of knowledge:
Explicit and Tacit knowledge. Nonaka and Takeuchi theory of knowledge creation:
Socialization, Externalization, Combination and Internalization (SECI) Model. Introduction
to knowledge management and knowledge management systems. The process of knowledge
management: Creation/ capture, storage and retrieval, transfer and application.

Text Books :

1. D.P. Goyal, “Management Information Systems: Managerial perspectives”, Macmillan

India Ltd.

Reference Books :

1. J. Kanter, Management information Systems, Prentice Hall of India.

13
2. Gordon B. Davis & M.H. Olson, Management Information Systems: Conceptual
Foundation, structure & Development, McGraw Hills Publishing.
3. Robert G. Murdick & Joel E. Ross & James R. Claggett, Information Systems for Modern
Management, Prentice Hall of India.
4. W. S. Jawadekar, Management Information Systems, Tata McGraw Hill Publishing.
5. Bryan Bergeron, Essentials of Knowledge Management, John Wiley and Sons.
6. Infosys Campus Connect Foundation Program Volume 1 – 3, Education & Research
Department, Infosys Technologies Ltd, Bangalore.

14
 LTPC
4 1 0 5

MS- 224 : Artificial Intelligence

Maximum Marks: 70 Maximum Time: 3 Hrs.

Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three Sections: A, B and C. Sections A and B will have
four questions each from the respective section of the syllabus and will carry 10.5 marks for
each question. Section C will consist of 7-15 short answer type questions covering the entire
syllabus uniformly and will carry a total of 28 marks.
B) INSTRUCTIONS FOR THE CANDIDATES
1. Candidates are required to attempt five questions in all, selecting two questions each from
Section A and Section B and compulsory question of Section C.
2. Use of non-programmable scientific calculator is allowed.

SECTION A

Introduction to AI : Definition, Nilsson's Onion Model explaining basic Elements of AI and

AI application Areas.
Logical Reasoning: Introduction to Prepositional Logic: Syntax, Semantics, Inference
methods in Prepositional Logic. Introduction to Predicate Logic: Syntax, Semantics of
Predicate Logic, Clausal form, Resolution, Unification, Inference Mechanisms.
Knowledge Based Systems : Meaning of Knowledge, Types of Knowledge, Components of
Knowledge Base System. Knowledge Representation : Approaches to Knowledge
representation, Issues in Knowledge representation, Knowledge representation using rules.
Semantic Nets, Frames, Conceptual Dependencies, Scripts, CYC. Knowledge Acquisition :
Definition, General Learning Model, Types of Learning, Factors affecting Learning.
Knowledge organization & Manipulation: Introduction, Issues in organization and
manipulation.

SECTION B

Dealing with uncertainty: Symbolic reasoning under uncertainty-Introduction and logics for
Non-monotonic reasoning, Implementation issues.
Prolog Programming : Features of Prolog, Elementary Data Types, Compound objects in
Prolog, Writing simple program in Prolog, Understanding Default flow control of the Prolog
Program, Controlling Program Flow with cut and fail, List Manipulation, String
manipulation, Arithmetic operators, Input /Output statement.
Expert systems : Basic Components & architecture of Expert systems, representing and
using domain knowledge, ES-Shells.
Applications of AI : Game Playing-The minmax Search Procedure, Adding Alpha-beta
Cutoff’s Planning-Overview, Components of Planning System, Natural Language processing
: Overview, Syntactic processing, Semantic analysis, Morphological, Discourse and
Pragmatic processing.

Reference Books :-

1. E. Rich and K. Knight, "Artificial Intelligence", Tata McGraw Hill.

2. E. Charnaik and D. McDermott, "Introduction to Atificial Intelligence", Addison-
Welsley Publishing Company.

15
3. Dan W. Patterson, "Introduction to Artificial Intelligence and Expert Systems",
PHI.
4. W.F. Clofisin and C.S. Melifish, "Programming n PROLOG", Narosa Publishing
Co.
5. Sanjiva Nath, "Turbo PROLOG", Galgotia Publications Pvt. Ltd.

16
 LTPC
0 0 88

MS-225 : Programming Lab-VI (Computer Graphics)

Maximum Marks: 100* Max. Time: 3 Hrs.

Minimum Pass Marks: 35% Practical sessions to be conducted: 60-70

This laboratory course will mainly comprise of exercise based on subject MS-221:
Computer Graphics.
.
*Maximum Marks for Continuous Assessment: 30

Maximum Marks for University Examination: 70

17
 LTPC
0 0 88

MS-226 : Programming Lab-VII (LINUX Administration)

Maximum Marks: 100* Max. Time: 3 Hrs.

Minimum Pass Marks: 35% Practical sessions to be conducted: 60-70

This laboratory course will mainly comprise of exercise based on subject MS-222 :
LINUX ADMINISTRATION.
.
*Maximum Marks for Continuous Assessment: 30

Maximum Marks for University Examination: 70

18