Está en la página 1de 10

W.e.f.

Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 441

Subject Name: Compiler Design

3.5

Time: 3 Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Describe the design of a compiler and the phases of program translation from source code to executable code
and the files produced by these phases.
ii) Explain lexical analysis phase and its underlying formal models such as finite state automata, push-down
automata and their connection to language definition through regular expressions and grammars.
iii) Explain the syntax analysis phase and identify the similarities and differences among various parsing
techniques and grammar transformation techniques.
iv) Use formal attributed grammars for specifying the syntax and semantics of programming languages.
v) Identify the effectiveness of optimization and explain the differences between machine-dependent and
machine- independent translation.
vi) Use the powerful compiler generation tools such as Lex and YACC.

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Compilers and Translators: Structure of a compiler, different states in the construction of a compiler, Design of
lexical analyzer.
Basic Parsing Techniques: Parsers, Shift-reduce parsing, Operator-precedence parsing, Top-down parsing,
Predictive parsers, LR parsers, Canonical collection of LR (0) items, Construction of SLR parsing tables,
Construction of canonical LR parsing tables, Constructing LALR parsing tables using LR (1) items.

Unit II
Syntax-Directed Translation: Syntax-directed translation schemes, implementation of syntax directed translators,
intermediate code, postfix notation, Three address code, Quadruples and triples, Translation of assignment
statements, Boolean expressions, Control statements.
Symbol Tables: The contents of a symbol table, Data structures for symbol tables representing scope information.

Unit III
Run Time Storage Administration: Implementation of a simple stack allocation scheme, implementation of
block structured languages, Storage allocation in block structured languages.
Error Detection And Recovery: Error, Lexical-phase errors, Syntactic-phase errors, Semantic errors.

Unit IV
Code Optimization: The principle sources of optimization, Loop optimization, DAG representation of basic
blocks, Value number and algebraic laws, Global dataflow analysis.
Code Generation: Object programs, Problems in code generation, Machine model, Single code generator,
Register allocation and assignment, Peephole optimization.

Text Books:
1. Principles of Compiler Design by A. V. Aho and J. D. Ullaman, Addison Wesley.
2. System Programming by J. Donovan, TMH.

Reference Books:
1. Compiler construction Principles and Practice by D.M. Dhamdhere, Mc Milan India.
2. Compiler Construction for digital computer by David Grics.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 443

Subject Name: Adhoc Networks

3.5

Time: 3 Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Analyze algorithms and to determine algorithm correctness and time efficiency class.
ii) Master a variety of advanced abstract data type (ADT) and data structures and their implementations.
iii) Master different algorithm design techniques (brute-force, divide and conquer, greedy etc.).
iv) Apply and implement learned algorithm design techniques and data structures to solve problems.
v) Analyze worst-case running times of algorithms using asymptotic analysis.

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Fundamentals: Fundamentals of Wireless Communication Technology, The Electromagnetic Spectrum, Radio
Propagation Mechanisms, Characteristics of the Wireless Channel, IEEE 802.11a-b Standard, Origin of Ad hoc
Packet Radio Networks, Technical Challenges, Architecture of PRNETs, Components of Packet Radios, Ad hoc
Wireless Networks, What is an Adhoc Network? Heterogeneity in Mobile Devices, Wireless Sensor Networks,
Traffic Profiles, Types of Adhoc Mobile Communications, Types of Mobile Host Movements, Challenges
Facing Adhoc Mobile Networks, Adhoc wireless Internet.

Unit II
Adhoc Routing Protocols: Introduction, Issues in Designing a Routing Protocol for Adhoc Wireless
Networks, Classifications of Routing Protocols, Table-Driven Routing Protocols, Destination Sequenced Distance
Vector (DSDV), Wireless Routing Protocol (WRP), Cluster Switch Gateway Routing (CSGR), Source-Initiated
On-Demand Approaches, Ad hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing
(DSR), Temporally Ordered Routing Algorithm (TORA), Signal Stability Routing (SSR), Location-Aided
Routing (LAR), Power-Aware Routing (PAR), Zone Routing Protocol (ZRP).

Unit III
Multicasting in Adhoc Networks: Introduction, Issues in Designing a Multicast Routing Protocol,
Operation of Multicast Routing Protocols, An Architecture Reference Model for Multicast Routing Protocols,
Classifications of Multicast Routing Protocols, Tree-Based Multicast Routing Protocols, Mesh-Based Multicast
Routing Protocols, Summary of Tree and Mesh based Protocols, Energy-Efficient Multicasting, Multicasting with
Quality of Service Guarantees, Application-Dependent Multicast Routing, Comparisons of Multicast Routing
Protocols.

Unit IV
Transport Layer Security Protocols: Introduction, Issues in Designing a Transport Layer Protocol for Adhoc
Wireless Networks, Design Goals of a Transport Layer Protocol for Adhoc Wireless Networks, Classification
of Transport Layer Solutions, TCP over Adhoc Wireless Networks, Other Transport Layer Protocols for Ad hoc
Wireless Networks, Security in Adhoc Wireless Networks, Network Security Requirements, Issues and
Challenges in Security Provisioning, Network Security Attacks, Key Management, Secure Routing in Adhoc
wireless networks.

Text Books / Reference Books:


1. Adhoc Wireless Networks Architectures and Protocols by C. Siva Ram Murthy and B. S. Manoj, PHI.
2. Adhoc Mobile Wireless Networks Protocols and Systems by C. K. Toh, PHI.
3. Ad Hoc Networking by Charles E. Perkins, Addison Wesley.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 445

Subject Name: Computer Graphics

3.5

Time: 3 Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Understand contemporary graphics principles and graphics hardware.
ii) Understand and demonstrate geometrical transformations.
iii) Understand and demonstrate 2D image processing techniques.
iv) Understand and demonstrate 3D image processing techniques.
v) Understand and demonstrate computer graphics animation.
vi) Create interactive graphics applications in C using one or more graphics application programming interfaces.
NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Introduction to Computer Graphics: Computer Graphics Applications, Computer Graphics hardware and
software, Two dimensional Graphics p r i m i t i v e s , Points and Lines, Point plotting Techniques (Coordinate
system, Increment method), Line drawing algorithm (DDA), Bresenhams circle drawing algorithm using polar
coordinates, Mid point circle drawing algorithms, Filled area algorithm (Scan line, Polygon filling algorithms,
Boundary filled algorithms).
Point & Positioning Devices: Light pen, Mouse, Tablet, Input technique, Positioning technique and character
recognition.

Unit II
Two Dimensional Viewing: Viewing pipeline, Window to view port transformation, Window to view port
Mapping.
Clipping: Point & line clipping algorithm, 4 bit code algorithm, Cohen-Sutherland line clipping algorithms,
Liang-Barsky line clipping algorithms, Polygon clipping (Sutherland-Hodge land Polygon clipping algorithm),
Curve clipping, Text clipping.

Unit III
Three Dimensional Viewing: Viewing pipeline, viewing coordinates, Projection (Parallel, perspective).
Two D i m e n s i o n a l G e o m e t r i c T r a n s f o r m a t i o n s : Transformations, Translation, Scaling,
Rotation, Other Transformations such as Reflection, shear, Homogenous Coordinate System.
Raster Graphics: Raster Graphics fundamental, Solid Area, Scan Conversion, Interactive Raster Graphics and
Raster Graphics System.

Unit IV
Representation of 3-D Curves and Surfaces: Curved lines and surfaces, Spline representations, interpolation
and approximation splines, parametric continuity conditions.
Bezier curves and surfaces: Bezier curves, properties of Bezier curves, Bezier surfaces, B-spline curves and
surfaces.
Hidden Surfaces Removal: Hidden surface elimination, Depth buffer algorithm, Scan line coherence
algorithm, Priority algorithm.

Text Books:
1. Computer Graphics by Hern & Baker, PHI, New Delhi.
2. Computer Graphics Principles and Practice by Foley, Van Dam, Feiner and Hughes, Addison-Wesley Pub.
Company.
3. Computer Graphics, Schaums Outline Series, MGH Publications, New Delhi.
4. Principles of Computer Graphics by Rogers, MGH Publications, New Delhi.

Reference Books:
1. Computer Graphics - A Programming Approach, Harrington.
2. Graphics Programming with C by Yashwant Kanetkar, BPB Publications, New Delhi.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 461

Subject Name: Neural Networks

3.5

Time: 3 Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Describe the relation between real brains and simple artificial neural network models.
ii) Explain and contrast the most common architectures and learning algorithms for Multi-Layer Perceptrons,
Radial-Basis Function Networks, Committee Machines and Kohonen Self-Organizing Maps.
iii) Discuss the main factors involved in achieving good learning and generalization performance in neural network
systems.
iv) Identify the main implementation issues for common neural network systems.
v) Evaluate the practical considerations in applying neural networks to real classification and regression problems.
vi) Explain the function of artificial neural networks of the Back-prop, Hopfield, RBF and SOM type.
NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Introduction: Concepts of neural networks, Characteristics of Neural Networks, Historical Perspective and
Applications of Neural Networks.
Fundamentals of Neural Networks: The biological prototype, Neuron concept, Single layer Neural Networks,
Multi-Layer Neural Networks, terminology, Notation and representation of Neural Networks, Training of Artificial
Neural Networks, Representation of perceptron and issues, perceptron learning and training, Classification, Linear
Separability.

Unit II
Hopfield Nets: Structure, Training and applications, Stability.
Back propagation: Concept, Applications and Back Propagation Training Algorithms.
Counter Propagation Networks: Kohonan Network, Grossberg Layer & Training, Applications of counter
propagation, Image classification.

Unit III
Bi-directional Associative Memories: Structure, retrieving a stored association, Encoding associations,
memory capacity.
ART: ART architecture, ART classification operation, ART implementation and characteristics of ART, Image
Compression Using ART.

Unit IV
Applications: Applications of Artificial Neural Networks to Function Approximation, Regression, Classification,
Blind Source Separation, Time Series and Forecasting.

Text Books / Reference Books:


1. Neural Networks in Computer Intelligence by Li Min Fu, McGraw-Hill, Inc.
2. Neural Computing Theory and Practice by Philip D. Wasserman, ANZA Research Inc.
3. An introduction to Genetic Algorithms by Melaine Mitchell, PHI.
4. Fundamentals of Artificial Neural Networks by M. H. Hassun, PHI.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 463

Subject Name: Software Testing

3.5

Time: 3Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Apply software testing skills and engineering methods.
ii) Design and conduct a software test case for a software testing project.
iii) Test how the software reacts under repeated execution of the same operations.
iv) Identify the needs of software test automation and define and develop a test tool to support test automation.
v) Design functional and boundary test cases and execute program.
vi) Devise and document a test strategy plan.
NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Introduction: Terminology, design for testability, objectives, principles, purpose of testing.
Testing Limitations: Theoretical foundations, impracticality of testing all data, impracticality of testing all paths,
No absolute proof of correctness.
Role of V&V in Software Evolution: Types of Products, requirements, specifications, designs,
implementations, changes, V&V objectives, correctness, consistency, necessity, sufficiency, performance.

Unit II
Testing Techniques and Strategies: Software technical reviews, Software testing, Levels of testing- module,
integration, system, regression, Testing techniques and their applicability-functional testing and analysis, structural
testing and analysis, error-oriented testing and analysis, hybrid approaches, integration strategies, transaction flow
analysis, stress analysis, failure analysis, concurrency analysis, performance analysis.

Unit III
Flow Graphs and Path Testing: Path Testing Basics, Path Predicates, Application of Path Testing.
Transaction Flow Testing: Generalizations, Transaction Flows, Transaction-Flow testing techniques,
Implementation Comments.
Data Flow Testing: Basics, Data flow model, Data flow testing strategies, Applications.

Unit IV
Software Testing and Regular Expression: Path products, path sums, Loops, Reduction procedure,
Applications, Approximate number of paths, The mean processing time of any routine, Regular expression and
Flow-anomaly detection, Formal language and its use for software testing.

Text Books / Reference Books:


1. Software Testing Techniques by Boris Beizer, John Wiley & Dreamtech.
2. Effective Methods for Software Testing by William Perry, John Wiley & Sons, Inc.
3. Foundations of Software Testing by Aditya P. Mathur, Pearson Education.
4. The Art of Software Testing by Glenford J. Myers, Wiley India Pvt. Ltd.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 473

Subject Name: ERP System

3.5

Time: 3Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Understand the application of internet for enterprises.
ii) Understand working of transactions in e-commerce environment.
iii) Identify various modules of ERP system.
iv) Understand the implication of ERP system on business organizations.
NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Introduction and Concepts: Networks and Commercial Transactions, Internet and other novelties,
networks and electronic transactions today, Model for commercial transactions, Internet environment,
Internet advantage, Worlds Wide Web and other Internet Sales venues, Online commerce solutions.
ERP-an Enterprise Perspective: Production finance, Personnel disciplines and their relationships, Transiting
environment, MIS Integration for disciplines, Information / workflow, Network Structure, Client Server Integrator
System, Virtual Enterprise.

Unit II
ERP Resource Management Perspective: Functional and Process of Resource, Management, Introduction to
basic Modules of ERP System, HRD, Personnel Management, Training and Development, Skill Inventory, Material
Planning and Control, Inventory, Forecasting, Manufacturing, Production Planning, Production Scheduling,
Production Control, Sales and Distributions, Finance, Resource Management in global scenario.

Unit III
ERP Information System Perspective: Functional to OLAP (Online Analysis and Processing), TP,
OAS, KBS, MRP, BPR, SCM, REP, CRM and Information Communication Technology.
Unit IV
ERP Key Managerial Issues: Concept Selling, IT Infrastructure, Implication of ERP System on business
organization, Critical success factors in ERP System, ERP culture implementation issues, resistance to
change, ERP Selection issues, Return on Investment, Pre and post implementation issues.
Text Books:
1. Frontiers of Electronics Commerce by Ravi kalakota, Andrew Whinston, Addison Wesley.
2. Enterprise Resource Planning Concepts and practice by V.K. Garg and N.K. Venkita Krishna, PHI.
3. Enterprise Resource Planning by Ravi Shankar & S. Jaiswal, Galgotia.

Reference Books:
1. Enterprise Resource Planning by Alexis Leon, Second Edition, TMH.
2. ERP text & Cases by Rajesh Ray, TMH.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 467

Subject Name: Cyber Security

3.5

Time: 3Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Understand cyber-attack.
ii) Understand types of cyber laws.
iii) Identify and understand how to protect them self and ultimately society from such attacks.
iii) Work with some web tools used in cyber security.
NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Introduction to Cyber Crime and Law: Cyber Crimes, Types of Cyber Crime, Hacking, Attack vectors,
Cyberspace and Criminal Behavior, Clarification of Terms, Traditional Problems Associated with
Computer Crime, Introduction to Incident Response, Digital Forensics, Computer Language, Network
Language, Realms of the Cyber world, A Brief History of the Internet, Recognizing and Defining
Computer Crime, Contemporary Crimes, Computers as Targets, Contaminants and Destruction of Data,
Indian IT ACT 2000.
Introduction to Cyber Crime Investigation: Firewalls and Packet Filters, password Cracking, Key
loggers and Spyware, Virus and Warms, Trojan and backdoors, Steganography, DOS and DDOS attack,
SQL injection, Buffer Overflow, Attack on wireless Networks
Unit II
Systems Vulnerability Scanning: Overview of vulnerability scanning, Open Port / Service
Identification, Banner / Version Check, Traffic Probe, Vulnerability Probe, Vulnerability Examples,
OpenVAS, Metasploit.
Networks Vulnerability Scanning: Netcat, Socat, Understanding Port and Services tools, Datapipe,
Fpipe, WinRelay, Network Reconnaissance-Nmap, THC-Amap and System tools, Network Sniffers and
Injection tools, Tcpdump and Windump, Wireshark, Ettercap, Hping Kismet.
Unit III
Network Defense tools: Firewalls and Packet Filters, Firewall Basics, Packet Filter Vs Firewall, How a
Firewall Protects a Network, Packet Characteristic to Filter, Stateless Vs Stateful Firewalls, Network
Address Translation (NAT) and Port Forwarding, the basic of Virtual Private Networks, Linux Firewall,
Windows Firewall.
Snort: Introduction, Detection System.
Unit IV
Web Application Tools: Scanning for web vulnerabilities tools (Nikto, W3af), HTTP utilities (Curl,
OpenSSL and Stunnel), Application Inspection tools (Zed Attack Proxy, Sqlmap), DVWA, Webgoat,
Password Cracking and Brute-Force Tools (John the Ripper, L0htcrack, Pwdump, HTC-Hydra).
Text Books:
1. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives by Nina and Sunit,
Wiley.
2. Anti-Hacker Tool Kit (Indian Edition) by Mike Shema, McGraw Hill.
3. Cyber Law: The law of the Internet by Jonathan Rosenoer, Springer, 1997.
4. Cyber Security Essentials by James Graham, Richard Howard, Ryan Olson, CRC Press.

Reference Books:
1. The Law and Economics of Cyber Security by M. F. Grady, F. P. Thomas, R. Peltier, Cambridge Uni. Press.
2. Computer Forensics and Investigations by Nelson Phillips and Enfinger Steuart, Cengage Learning.
3. Cybercrime by Bernadette H Schell, Clemens Martin, ABC-CLIO Inc, California.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 469

Subject Name: Data Warehousing and Data Mining

3.5

Time: 3Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Understand operational database, warehousing and multidimensional need of data base to meet industrial needs.
ii) Identify and understand the components of warehousing.
iii) Identify and understand the data extraction and transformation techniques.
iv) Identify and understand the Business analysis, query tools and application, OLAP etc.
v) Introduce with and gain knowledge about data mining, decision tree, neural networks and clustering.
NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Data Warehousing: Definition, usage and trends, DBMS Vs Data warehouse, data marts, metadata,
Multidimensional data mode, data cubes, Schemas for Multidimensional database: stars, snowflakes and fact
constellations, Data warehouse process & architecture, OLTP Vs OLAP, ROLAP Vs MOLAP, types of
OLAP, servers, 3-Tier data warehouse architecture, Distributed and virtual data warehouses, data warehouse
manager.

Unit II
Data Mining: Definition & task, KDD versus Data mining, Data mining techniques, Tools and applications, Data
mining query languages, Data specification, specifying knowledge, Hierarchy specification, pattern presentation &
visualization specification.

Unit III
Data Mining techniques: Association rules, Clustering techniques, Decision tree knowledge discovery through
Neural Networks & Generic Algorithm, Rough Sets, Support Victor Machines and Fuzzy techniques.

Unit IV
Mining Complex Data objects: Spatial databases, Multimedia databases, Time series and sequence data,
mining text Databases and mining World Wide Web.

Text Books:
1. Data warehousing in Real World by Sam Anahory & Dennis Murray; Pearson.
2. Data Mining-Concepts & Techniques by Jiawei Han & Micheline Kamber, Morgan kaufmann.
3. Data Mining Techniques by Arun Pujar, University Press, Hyderabad.

Reference Books:
1.
2.
3.
4.
5.
6.
7.

Data Mining by Pieter Adriaans & Dolf Zantinge, Pearson Education.


Data Warehousing, Data Mining and OLAP by Alex Berson, McGraw Hill.
Data Warehousing System by Mallach, McGraw Hill.
Building the Data Warehouses by W.H. Longhman, C.Klelly, John Wiley & Sons.
Developing the Data Warehouses by W.H. Longhman, C.Klelly, John Wiley & Sons.
Managing the Data Warehouses by W.H. Longhman, C.Klelly, John Wiley & Sons.
Decision support Systems & Data Warehouses by B. Ravindernath, New Age International Publishers, Delhi.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 471

Subject Name: Big Data and Analytics

3.5

Time: 3Hrs.

External Marks: 60 Internal Marks: 40 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i) Understand concept of big data and its applications for industrial purpose.
ii) Understand Hadoop & its features.
iii) Set up Hadoop clusters.
iv) Work with various tools.
NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all selecting at least one question from each unit. Each
question shall carry equal marks.

Unit I
Digital Data: Types of Digital Data, Structured, Semi-Structured, Unstructured.
Big Data: Introduction to Big Data Platform, Challenges of Conventional Systems, Big Data Analytics, Analytics
1.0, Analytics 2.0, Analytics 3.0, Traditional BI Vs Big Data Environment, Big Data technology Landscape,
NoSQL Databases, NoSQL Vs RDBMS, New SQL.

Unit II
Streams Concepts: Stream Data Model and Architecture, Stream Computing, Sampling Data in a
Stream, Filtering Streams, Counting Distinct Elements in a Stream.
Hadoop: History of Hadoop, Hadoop 1.0 Vs Hadoop 2.0, The Hadoop Distributed File System,
Components of Hadoop, Analyzing the Data with Hadoop.
Unit III
Setting up a Hadoop Cluster: Cluster specification, Cluster Setup and Installation, Hadoop
Configuration, Security in Hadoop, Administering Hadoop, HDFS, Monitoring & Maintenance Hadoop,
Benchmarks Hadoop in the cloud.
Unit IV
Interacting with Hadoop Eco System: Hive, Pig, HBASE, Sqoop, Business Intelligence on Hadoop.
Text Books:
1. Hadoop: The Definitive Guide by Tom White, 3rd ed., Oreilly Media, 2012.
2. Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming Data by Chris Eaton,
Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos, McGraw-Hill Publishing, 2012.
Reference Books:
1. Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced
Analytics by Bill Franks, John Wiley & Sons.
2. Making Sense of Data by Glenn J. Myatt, John Wiley & Sons.
3. Big Data Glossary by Pete Warden, OReilly, 2011.

W.e.f. Jan 2016 (For Batch 2013-2017 only)

Subject Code: CO 447

Subject Name: Computer Graphics (Pr.)

1.0

Time: 3Hrs.

External Marks: 40 Internal Marks: 60 Total Marks: 100

Course Outcome: After completion of this course, students will be able to:
i)
ii)
iii)
iv)
v)

Understand the basic concepts of computer graphics.


Design scan conversion problems using C++ programming.
Apply clipping and filling techniques for modifying an object.
Understand the concepts of different type of geometric transformation of objects in 2D and 3D.
Understand the practical implementation of modeling, rendering, viewing of objects in 2D.

List of Practical
Experimental work will be based upon the course Computer Graphics (CO 445).

Subject Code: CO 481 / 483 / 485

Subject Name: Elective-II (Pr.)

1.0

Time: 3 Hrs.

External Marks: 40 Internal Marks: 60 Total Marks: 100

List of Practical
Experimental work will be based upon the course Elective-II (Neural Networks CO 461 / 463 / 473).

Subject Code: CO 451

Subject Name: Project-II

3.0

Internal Marks: 100 Total Marks: 100


The students are required to develop a project during semester and final evaluation will be entirely based upon
his/her project work.

Subject Code: CO 453

Subject Name: Seminar-II

0.5

Internal Marks: 100 Total Marks: 100


The student will give presentation on the topic assigned by the concerned teacher and will also submit a bound
report of seminar for evaluation purpose.

Subject Code: CO 455

Subject Name: Industrial Training

4.0

Internal Marks: 100 Total Marks: 100


Students of the department will go for industrial training just after completion of the 6th semester duration of
training will be 4-6 week period. Students are free to take training in their desired area but they must choose
technical area for the training. At the end of the training students are required to submit one bounded report of
the training work performed at their work of place within one month of completion of the training to the
department. This report will be presented in the form of the seminar in class. Duration of presentation may be of
30-60 minutes.

También podría gustarte