INTERNET AND WORLD WIDE WEB:
6. XML 7. PHP
62 Branch: Computer Science and Engineering
Title DISTRIBUTED SYSTEMS Credits 4
Code CSE612 Semester: 6 L T P 3 1 0
Operating System , Computer Networks Contact Hours
45
Time 3 Hours
Objectives 1. To introduce distributed systems, their architecture, types and enabling technologies 2. To make them understand how communication takes place in a distributed
environment
3. To introduce issues related to process execution, naming and security in distributed systems
4. To make them understand distributed systems by studying existing systems
5. To make them familiar with the design and implementation issues of distributed conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
SECTION-A Hrs
Introduction to Distributed Systems
Definition of distributed systems, their objectives, types, architecture, self management in distributed systems, introduction to XML, SOAP, service oriented architecture.
6
Communication
Interprocess communication, Remote Procedure Call (RPC), Remote Method Invocation (RMI), Remote Object Invocation, Message Oriented Communication.
6
Processes
Introduction to threads, threads in distributed and non distributed systems, virtualization, client side software, design issues for servers, software agents.
6
Naming
General issues with respect to naming, flat naming, structured naming, name resolution, implementation of a name space, domain name system, X.500 name space.
5
SECTION-B Hrs
Security
Introduction to security in distributed systems, general issues in authentication and access control, security management: key management, secure group management,
6
63 authorization management; examples: kerberos, x.509 certificates.
Distributed Object-based Systems
Introduction to distributed object based systems, overview of CORBA and DCOM and their comparison.
6
Distributed File Systems
Introduction to distributed file systems, their examples: SUN network file system, CODA file system, comparison of distributed file systems.
5
Document-based Systems
Introduction to document-based systems, their examples, World Wide Web (WWW), LOTUS NOTES, comparison of WWW and LOTUS NOTES.
5
After studying this course, students will be able to
1. Differentiate between a distributed and a network system and how they relate with each other
2. Understand how communication takes place among different communicating parties in a distributed environment
3. Understand how process execution in distributed systems is different from process execution in non-distributed systems
4. Design and implement a name space
5. Identify security risks of distributed systems and their handling mechanisms 6. Understand and design distributed object based systems
7. Understand and design distributed file systems 8. Understand and design document based systems
64 Branch: Computer Science and Engineering
Title Computer Graphics Credits 04
Code CSE 613 Semester: - 6th L T P 3 1 0
Max.
Marks
External: - 50 Internal: - 50 Elective N
Pre-requisites C++, basic understanding of linear algebra and calculus. Contact Hours
45
Time 3 Hours
Objectives This course offers a good understanding of computer graphics concepts and prepares the students to be in a position to understand the working principle of different Video display monitors. The detailed description of graphics based algorithms enables students to draw the various geometric shapes as well as to perform 2-D & 3-D transformations. This course further discusses the application of computer graphics concepts in the development of various applications. The detailed objectives of this course as follows:
· Application areas of Computer Graphics
· Working of CRT and LCD based monitors
· Drawing of geometric output primitives
· 2-D transformation and viewing system
· 3-D transformation and viewing system
· Splines curve, their types and representation
· Computer Animations, Classification of visible surface detection methods.
Note for Examiner
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
SECTION-A Hrs
Overview of Graphics Systems:
Video Display Devices, Direct View Storage Tubes, Flat Panel Displays: Emissive and NonEmissive Displays; Plasma Panel, Thin Film Electroluminescent and Liquid Crystal Displays, Color Display Techniques: Shadow Mask and Beam-penetration Methods, Three Dimensional Viewing Devices, Raster Scan Systems, Display Processor, Random Scan
Systems, Co-ordinate Representations, Screen Coordinates. Language Basics 7
Output Primitives:
Points and Lines, Line Drawing Algorithms: DDA Algorithm, Bresenham’s Line Algorithm, Circle Generating Algorithm: Mid point circle algorithm, Ellipse Generating Algorithms: mid point ellipse algorithm, Pixel Addressing and Object Geometry, Boundary Fill Algorithms, Flood Fill Algorithms, Character Generation, Line, Area-Fill and Character Attributes.
7
Two Dimensional Geometric Transformations and Viewing:
Basic Transformations: Translation, Rotation and Scaling, Matrix Representations, Composite Transformations, Viewing Pipeline, Window to Viewport Coordinate Transformation, Clipping Operations: Line, Polygon, Curve and Text Clipping.
8
SECTION-B Hrs
Three Dimensional Concepts, Transformations and Viewing:
Three Dimensional Display Methods, Three Dimensional Transformations; Three 8
65 Dimensional Viewing Pipeline; Viewing Coordinates; Specifying the View Plane,
Projections: Parallel Projections, Perspective Projections.
Splines and Curves:
Curved Lines and Surfaces, Spline Representations, Cubic Splines, Bezier Curves and their properties, B-Spline Curves.
8
Visible Surface Detection Methods:
Classification of Visible Surface Detection Methods, Back Face Detection, Depth Buffer, A-Buffer, Scan Line and Depth-Sorting Methods, Wireframe Methods, Concepts of Computer Animation, Design of Animation Sequences.
7
Suggested
Books 1. Donald Hearn, M.P. Baker : Computer Graphics C Version, Second Edition, Pearson Education.
References:
1. J.D. Foley, A. van Dam, S.K. Feiner, J.F. Hughes: Computer Graphics:
principles and practice, Second Edition, Pearson Education.
2. Z. Xiang, R.A. Plastock : Computer Graphics, Second Edition, Schaum’s Outlines, Tata McGraw-Hill.
3. N. Krishnamurthy: Introduction to Computer Graphics, Tata McGraw-Hill.
4. David F. Rogers, James Alan Adams : Mathematical Elements for Computer Graphics,
Tata McGraw-Hill.
5. S. Harrington: Computer Graphics: A Programming Approach, Tata McGraw-Hill.
Course Outcomes
On successful completion of this course, the student should be able to:
1. Understand the basic principles and application areas of computer graphics.
2. To study and compare the performance of video display monitors based on CRT and Flat Panel displays.
3. To draw the geometric shapes (lines, curves, circle, polygon etc) based on underlying algorithms and mathematical approach.
4. To study the use of graphics transformations in 2-D and 3-D system, various polygon rendering methods that can be deployed in real world scenario.
66 Branch: Computer Science and Engineering
Title COMPUTER GRAPHICS (Practical) Credits 02
Code CSE 663 Semester: - 6th L T P 0 0 3
Max.
Marks
50 Elective N
Time 3 Hours
Note Practical should be covered based on the following directions:
List 1. Introduction to graphics programming in C/C++.
2. Initializing graphics system. Basic graphics functions.
3. Drawing lines, circles, ellipses and other common objects. 30 4. Boundary Fill, Flood Fill and other region filling algorithms.
5. Two dimensional transformations (Translation, Rotation, Scaling Reflection, Shear) on different objects.
6. Clipping algorithms.
7. Programs related to splines and curves, animation sequences.
67 Branch: Computer Science and Engineering
Title Artificial Intelligence Credits 4
Code CS 614 Semester: - 6th L T P 3 1 0
Max.
Marks
External: 50 Internal: 50 Elective N
Pre-requisites Discrete Structures & Computational Logic Contact Hours
45 Time 3 Hours Objectives · To introduce the AI techniques to solve problems and search strategies to find
optimal solution paths from start to goal state.
· To introduces different knowledge representation methods in AI Programs.
· To introduce different design techniques for Game Playing Programs.
· To introduce the AI Agents their design, planning and learning techniques.
· To introduce the natural language processing and expert systems.
Note for Examiner
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
SECTION-A Hrs
Introduction:
Artificial Intelligence and its applications, Artificial Intelligence Techniques, criteria of success, Intelligent Agents, Nature and structure of Agents, Learning Agents
6
Problem solving techniques:
State space search, control strategies, heuristic search, problem characteristics, production system characteristics., Generate and test, Hill climbing, best first search, A* search, Constraint satisfaction problem, Mean-end analysis, Min-Max Search, Alpha-Beta Pruning, Additional refinements, Iterative Deepening
9
Knowledge representation:
Mapping between facts and representations, Approaches to knowledge representation, procedural vs declarative knowledge, Forward vs. Backward reasoning, Matching, conflict resolution, Non-monotonic reasoning, Default reasoning, statistical reasoning, fuzzy logic Weak and Strong filler structures, semantic nets, frame, conceptual dependency, scripts.
8
SECTION-B