SETH JAI PARKASH MUKAND LAL INSTITUTE OF ENGINEERING & TECHNOLOGY, RADAUR

JMIT

Academic Calendar

Session 2015-16

Fourth Semester

Name ………...……………………………………….

Roll No …………………………………………………

Department of Computer Science and Application’s (MCA Deptt.)

CONTENTS

Sr. No. Subject Code Contents

1. MCA-IV SCHEME OF EXAMINATION FOR MCA-IV SEMESTER

2. MCA-14-41 PROGRAMMING IN JAVA

3. MCA-14-42

ADVANCED COMPUTER ARCHITECTURE

4. MCA-14-43 DATA WAREHOUSING AND MINING

5. MCA-14-44 COMPUTER GRAPHICS

6. MCA-14-45 ELECTIVE

7. MCA-14-46 S/W LAB–VII BASED ON MCA-14-41

8. MCA-14-47 S/W LAB-VIII BASED ON MCA-14-44

9. MCA-14-48 SEMINAR

SCHEME OF EXAMINATIONFOR MASTER OF COMPUTER APPLICATIONS (Three Year Programme) SEMESTER-IV

Semester – IV Paper No. Title of the Paper Duration

Of Exam Maximum Marks Total Theory Sessional*

MCA-14-41 PROGRAMMING IN JAVA 3 Hours 80 20 100

MCA-14-42

ADVANCED COMPUTER ARCHITECTURE 3 Hours 80 20 100

MCA-14-43 DATA WAREHOUSING AND MINING 3 Hours 80 20 100

MCA-14-44 COMPUTER GRAPHICS 3 Hours 80 20 100

MCA-14-45 ELECTIVE 3 Hours 80 20 100

MCA-14-46 S/W LAB–VII BASED ON MCA-14-41 3 Hours 100

MCA-14-47 S/W LAB-VIII BASED ON MCA-14-44 3 Hours 100

MCA-14-48 SEMINAR 20

Total 720

MCA-14-41 PROGRAMMING IN JAVA Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Features of Java, Data types, operators & expressions, control structures, arrays, Classes, objects & methods, constructors, garbage collection, access qualifiers, string handling – string operations, character extraction, string comparison, searching and modifying strings, StringBuffer, packages and interfaces, Wrapper classes.

UNIT – II Inheritance: single and multilevel inheritance, method overriding, abstract class, use of super and final keywords. Exception Handling: Exception types, uncaught exceptions, multiple catch clauses, nested try statements, built-in exceptions, creating your own exceptions. Multithreading: Java thread model, creating multiple threads, thread priorities, synchronization, interthread communication, suspending, resuming and stopping threads.

UNIT – III

Applets: Local & Remote Applets, Applet Architecture, Passing Parameters to Applets, Applet Graphics, Adapter Class. I/O Streams: Console I/O – reading console input, writing console output, Files I/O – Byte Streams, Character Streams, Collection Interfaces & Classes, Delegation Event Model

UNIT – IV AWT Classes: Window fundamentals, working with graphics, working with color & fonts. AWT controls,layout managers & working with menus, JFrames.Swing Classes, Java Beans, Servlet classes & Life Cycle. Text Books: 1. Herbert Schildt, The Complete Reference Java 2, Fourth Edition, Tata McGraw Hill-2001 2. Liang Y.Daniel, Introduction to Java Programming (7th Edition), 2009, Pearson Education. Reference Books: 1. Steven Holzner, Java 1.2, BPB-1998 2. E. Balaguruswami, Programming with Java - Second Edition, Tata McGraw Hill-1998. 3. Mughal K.A., Rasmussen R.W., A Programmer’s Guide to Java Certification, Addison-Wesley, 2000

LECTURE PLAN MCA 14-41

LECTURES TOPICS 1. The JAVA programming language and its characteristics 2. Java run- time environment; Java compiler 3. Java developers kit running Java applications and Java applets 4. Data types, scalar data types 5. Operators & Expressions 6. Control structures 7. Class, objects & methods 8. Constructors, Finalizer 9. garbage collection, access qualifiers 10. Visibility controls 11. Array 12. String, Vectors 13. Inheritance – single and multilevel inheritance, method overriding 14. abstract class, use of super and final keywords, wrapper class 15. Interfaces 16. Packages 17. Multithreading- Java thread model, creating multiple threads, 18. thread priorities, , interthread communication, 19. Suspending, resuming and stopping threads. 20. Applet programming.-: Local & Remote Applets, Applet Architecture, 21. Passing Parameters to Applets ,Defining and throwing exceptions 22. Exception types, uncaught exceptions, multiple catch clauses 23. Nested try statements, built-in exceptions 24. Creating your own exceptions and chained exceptions 25. I/O streams: Introduction and basics of stream classes 26. Byte stream 27. Character stream 28. Data streams 29. String Tokenizer class, String tokenizers. 30. Delegation Event Model 31. Collection interfaces 32. Collection classes 33. AWT classes : window fundamentals and working with graphics 34. AWT classes : working with colors and fonts 35. AWT controls

36. Layout managers 37. Menus. 38. Swing Classes 39. Java Beans, 40. Servlet classes & Life Cycle

TUTORIAL NO 1

1 (a) Java is termed both as portable and platform independent. How and why?

b) Differentiate between String and String Buffer Class. 2 (a) Write a short note on wrapper classes.

(b) What i s a package? Explain the procedure to create a user-defined package with the help of an example.

c) Differentiate between interface and class.

3. a) Write a program in java to sort a given list of strings. b) Discuss the various data types in Java. 4. Explain the scope and purpose of various types of access qualifiers in Java. 5 a) How did Internet evolve, what are its various services? How it differs from WAN? Discuss its Topologies and Protocols. b) Compare FTP TELNET, USENET, and NNTP and search Engine. Which one is best?

TUTORIAL NO 2

1. a) Differentiate between abstract, final and static keyword.

b) Differentiate between the key-.words throw and throws.

2. What do you understand by multithreading? How it can be achieved in Java ?

Explain life-cycle of a thread. How interthread communication can take place in

Java? Explain with appropriate examples.

3. . . (a) How can you create and use a user-defined exception? Explain with the help of

an example.

(b) Explain various types o f inheritances with the h e l p o f examples. 4. How JAVA differ from C and C++? Explain various components of JDK and API 5. Compare Multiple and Multilevel and hybrid Inheritance? What are the practical situations where Multiple and multilevel inheritances can be used? Write program to find the area of rectangle using (i) Function overloading (ii) function over-riding (iii) Inheritance

TUTORIAL NO 3

1. a) Discuss Applet life-cycle in brief.

b) What is the purpose of Stream Tokenizer class? 2. (a) What is delegation event model? Explain in brief: Write a program to handle various mouse

events.

(b) Name and explain various interfaces and classes in the collection framework in brief.

3. Differentiate between character stream and byte stream. Write a program in Java to read the contents of a file and encrypt them and store the encrypted data in another tile. The

n a me of the input and output tilename must be inputted through command line arguments. If

the name of tbe input tilename is not valid appropriate error message must be displayed.

4. What are the applications of Exception handling features of JAVA by taking example to Handle Your own exception. 5. How can we pass parameters to an applet at nm time?

TUTORIAL NO 4

1. a) Draw the class hierarchy for AWT windows. Also explain in brief the purpose of each Class in the hierarchy. b) List any three swing c l as s and write down the constructors of each. 2. (a) What is a servlet? Discuss its life-cycle. Explain the procedure to create and compile a

simple Servlet.

(b) What is a Java.bean? Write its major advantages.

3. (a) Write a program to create a smiley face using graphics.

(b) Write a program to create a grid with the help of Grid Layout and till the grid with

numbers from 1 to 15.

4. Write Java Applet code to demonstrate (i) Layout Mangers (ii) Stream buffer (iii) Action Listener.

5 Design a Applet code in Java to display Prime numbers (from 1 to 100) in a Text Field while Pressing Button “CLICK”.

MCA-14-42 ADVANCED COMPUTER ARCHITECTURE

Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Computational Model: Basic computational models, evolution and interpretation of computer architecture, concept of computer architecture as a multilevel hierarchical framework. Classification of parallel architectures, Relationships between programming languages and parallel architectures Parallel Processing:: Types and levels of parallelism, Instruction Level Parallel (ILP) processors, dependencies between instructions, principle and general structure of pipelines, performance measures of pipeline, pipelined processing of integer, Boolean, load and store instructions, VLIW architecture, Code Scheduling for ILP-Processors - Basic block scheduling, loop scheduling, global scheduling

UNIT – II Superscalar Processors: Emergence of superscalar processors, Tasks of superscalar processing – parallel decoding, superscalar instruction issue, shelving, register renaming, parallel execution, preserving sequential consistency of instruction execution and exception processing, comparison of VLIW & superscalar processors Branch Handling: Branch problem, Approaches to branch handling – delayed branching, branch detection and prediction schemes, branch penalties and schemes to reduce them, multiway branches, guarded execution

UNIT – III MIMD Architectures: Concepts of distributed and shared memory MIMD architectures, UMA, NUMA, CCNUMA & COMA models, problems of scalable computers. Direct Interconnection Networks: Linear array, ring, chordal rings, star, tree, 2D mesh, barrel shifter, hypercubes.

UNIT – IV

Dynamic interconnection networks: single shared buses, comparison of bandwidths of locked, pended & split transaction buses, arbiter logics, crossbar, multistage networks – omega, butterfly Cache coherence problem, hardware based protocols – snoopy cache protocol, directory schemes, hierarchical cache coherence protocols, software based protocols. Text Books: 1. Sima, Fountain, Kacsuk, Advanced Computer Architecture, Pearson Education, 2006. 2. D. A. Patterson and J. L. Hennessey, Computer Architecture – A Quantitative Approach, Fifth Edition, Morgan Kaufmann, 2012. Reference Books: 1. Kai Hwang, Advanced Computer Architecture, Tata McGraw Hill, 2005 2. Nicholas Carter, Computer Architecture, McGraw Hill, 2006 3. Harry F. Jordan, Gita Alaghband, Fundamentals of Parallel Processing, Pearson Education, 2003.

LECTURE PLAN MCA-14-42

LECTURES TOPICS 1 Computational model 2 Evolution of computer architecture 3 Process, thread 4 Concurrent and parallel execution 5 Types and levels of parallelism 6 Classifications of parallel architectures. 7 Relationships between languages and parallel architectures 8 Dependencies between instructions 9 Principles of Pipelining 10 Pipelined instruction processing 11 Synchronous & asynchronous pipeline 12 Linear Pipeline-clocking & timing control 13 Speedup, efficiency & throughput 14 Non linear pipeline- reservation table 15 Latency analysis, collision free scheduling 16 Internal data forwarding 17 Structure, data dependencies 18 Pipeline stalling 19 In-order issue, out of order issue 20 VLIW architecture 21 Branch handling- delayed branching 22 Branch processing, multiway branching 23 Guarded execution. 24 Code scheduling- basic block scheduling 25 Loop scheduling, global scheduling. 26 Dynamic interconnection networks- shared path 27 Switching networks- crossbar & multistage networks 28 Cache coherence problem 29 Hardware based cache coherence protocol-Snoopy cache protocol 30 Directory scheme, scalable coherent interface 31 Hierarchical cache coherence protocol 32 UMA, NUMA 33 CC-NUMA and COMA multiprocessors. 34 Hardware implementation and algorithms for addition and subtraction with Signed-magnitude data 35 Hardware implementation and algorithms for addition and subtraction with Signed 2’s complement data, 36 Multiplication for signed-magnitude data, Booth multiplication algorithm,

array multiplier, 37 Division for signed magnitude data, divide overflow. 38 Hardware implementation and algorithms for floating point addition,

subtraction, multiplication and division. 39 Hardwired Control – classical method 40 One-hot method 41 Micro programmed Control – basic concepts and structure of a micro

Programmed control unit 42 Horizontal versus Vertical microinstruction format 43 Microinstruction addressing.

TUTORIAL SHEET-1

1. Distinguish between the following concept :

(a) Data-driven and Demand-driven Execution Control.

(b) Procedural and Declarative description of problems.

(c) Abstract and Concrete architectures.

(d) Concurrent and Data-parallel languages.

(e) Vector and SIMD computers.

2. (a) What are flow dependency and control dependency? How do they affect pipeline

processing? Explain with the help of space-time diagrams.

(b) Define the following terms associated with the synchronous pipeline:

Clock Cycle, Clock Skewing, Speed-up factor and Efficiency.

3. Consider the following three-stage pipeline reservation table :

(a) What are the forbidden latencies?

(b) Draw the state transition diagram.

(c) List all the simple cycles and greedy cycles.

(d) Determine the optimal constant latency cycle and the minimal average latency.

(e) Let the pipeline clock period be 20 ns. Determine the throughput of the pipeline.

4. a) Derive and algorithm in flow chart form for the restoring method of fixed-point binary division. Explain how division by aero and divide overflow conditions are handled. Also describe the necessary hardware needed to implement this algorithm.

b) Derive and algorithm in flow chart form and adding and subtracting two floating

point binary numbers. 5. a) What is the purpose of Control unit? Explain the classical method of hardwired

control design b) What is Micro programmed control unit? Explain microinstruction addressing

scheme. TUTORIAL SHEET-2

1. a) What is Instruction level parallelism (ILP)? Explain loop-scheduling technique used in ILP processors.

b) Explain true and false data dependencies with examples. Also explain how you can remove false dependencies.

2 a) Explain the following: Scalar pipeline, Dynamic pipeline, Super pipeline and Speed up factor of the pipeline.

b) Explain the concept of computer architecture as a multilevel hierarchical framework. 3. (a) What is superscalar pipeline? What are the factors that affect superscalar?

Pipeline processing? Explain.

(b) Compare and contrast VLIW and superscalar processor.

4. (a) Explain software pipelining and global code scheduling techniques. Which one is better

and why?

(b) How can you minimize the loss incurred due to mispredictions in branch processing?

5. Distinguish between the following:

(a) Aligned and Non-aligned issue.

(b) Precise and Imprecise consistency models.

(c) Static and Dynamic branch prediction techniques.

TUTORIAL SHEET-3

1. What are Write through (WT) and Copy Back (CB) approaches to design Cache memory?

Discuss relative advantages and disadvantages of these approaches.

2. What are three generations of buses used in multiprocessor systems? Compare their read

and write bandwidths using time-space diagrams

3. a) What is Superscalar processor? Why superscalar issue is more complex than scalar issue? Explain blocking and shelved issue, in-order and out-of-order issue. b) How can you preserve sequential consistency of execution of instruction? Explain. 4. a) What is branch penalty? How is it introduced? Explain with an example. Discuss different ways to reduce branch penalty. b) What are implicit, static and dynamic branch prediction schemes? Explain one method in each Category. 5. Answer the following question in brief:

a) Compare horizontal and vertical microinstruction formats. b) Why Booth’s multiplication is faster? c) What are disadvantages of VLIW architecture? d) Differentiate between Vector computer and SIMD computer.

TUTORIAL SHEET-4

1. How do you classify distributed shared memory MIMD computers? Explain any one of

them in detail.

2. What is Cache coherence problem? Discuss Snoopy cache coherence protocol.

3. a) What are three generations of buses used in multiprocessor systems? Compare their

read and write bandwidths. b) What is Bus arbiter? Explain daisy chain based centralized arbiter. Discuss its

advantages and disadvantages. 4. a) What is Cache coherence problem in multiprocessor system? Discuss S/W based

protocol to solve this problem. b) What are memory and synchronization latencies in multicomputers? How can you

reduce these latencies? Explain. 5. a) What is the purpose of pre-decode unit in a superscalar processor?

b) Discuss any two techniques to detect branch early. c) Distinguish between Write-update and Write-invalidate policy of cache

coherence.

MCA-14-43 DATA WAREHOUSING AND MINING Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Data Warehouse: Basic concepts, The Data Warehouse - A Brief History, Characteristics, Difference between Operational Database Systems and Data Warehouse, Architecture for a Data Warehouse, Fact and Dimension Tables, Data Warehouse Schemas, Data Cube : A Multidimensional Data Model, Data Cube Computation Methods, Typical OLAP Operations, Data Warehouse Design and Usage, Data Warehouse Implementation, Data Generalization by Attribute Oriented Induction.

UNIT – II Data Mining: Introduction: Motivation, Importance, Knowledge Discovery Process, Data Mining Functionalities, Interesting Patterns, Classification of Data Mining Systems, Major issues, Data Objects and Attribute Types. Data Preprocessing: Overview, Data Cleaning, Data Integration, Data Reduction, Data Transformation and Data Discretization. Data Mining Models: Directed Data Mining Models, Directed Data Mining Methodology. Data Visualization. Outliers, Types of Outliers and Challenges of Outlier Detection.

UNIT – III Data Mining Classical Techniques: Statistics – Similarity Models, Steps for Designing Similarity Models, Table Lookup Model. Clustering- Requirement for Cluster Analysis, Clustering Methods- Partitioning

Methods, Hierarchical Methods, Density-Based Methods, Grid-Based Methods, Evaluation of Clustering.Nearest Neighborhood- Memory Based Reasoning, Challenges of Memory Based Reasoning,

UNIT – IV Data Mining Next Generation Techniques: Decision Tree- Decision Tree Induction, Attribute Selection Measures, Tree Pruning. Association Rule Mining- Market Basket Analysis, Frequent Itemset Mining using Apriori Algorithm, Improving the Efficiency of Apriori, Neural Network- Bayesian Belief Networks, Classification by Backpropagation. Data Mining Applications, Data Mining Trends and Tools. Reference Books: 1. J Hanes, M. Kamber, “Data Mining Concepts and Techniques”, Elsevier India. 2. G.S. Linoff, M.J.A. Berry, “Data Mining Techniques”, Wiley India Pvt. Ltd. 3. A. Berson, S.J. Smith, “Data Warehousing, Data Mining & OLAP”, Tata McGraw- Hill.

LECTURE PLAN

MCA-14-43

LECTURES TOPICS

1. The Evolution of Data Warehousing & its Characteristics. 2. Operational Database Systems. 3. Data Warehouse (OLTP & OLAP). 4. Data Marts, Metadata. 5. Multidimensional Data Models. 6. Types of Data & their uses from Tables & Spreadsheets. 7. Cube, Identifying Facts & Dimensions. 8. Designing Fact Tables & Dimension Tables. 9. Designing Data Warehouse Schemas, OLAP Operations. 10. Principles of Data Warehousing & System Processes. 11. Data Warehousing Components. 12. Architecture for a Data Warehouse. 13. Three Tier Data Warehouse Architecture. 14. Steps for the Design & Construction of Data Warehouses. 15. Conceptual Data Architecture & Logical Architecture. 16. Design Techniques. 17. Methods for Implementation of Data Warehouse Systems. 18. Tools for Data Warehousing. 19. Data Mining: Introduction, Motivation & Importance. 20. Knowledge Discovery Process. 21. KDD & Data Mining. 22. Data Mining vs. Query Tools. 23. Kind of Data & Functionalities. 24. Interesting Patterns. 25. Classification of Data Mining Systems. 26. Major Issues from Data Warehousing to Data Mining. 27. Data Preparation, Preprocess & Data Cleaning. 28. Data Integration & Transformation. 29. Data Reduction. 30. Data Mining Primitives, Languages & System Architectures. 31. Concept Description & Overview of Descriptive Data Mining. 32. Predictive Data Mining. 33. Methods for Concept Description. 34. Mining Association Rules & Association Rule Mining. 35. Market Basket Analysis. 36. Types of Association Rules.

37. Methods for Association Rules in Transaction Databases. 38. Relational Databases & Data Warehouses. 39. Methods for Data Classification & Prediction. 40. Application & Tools of Data Mining. 41 Types of data in Cluster Analysis, 42 Major Clustering Methods, Density-based methods, Grid-based methods, 43 Model-based clustering methods, Outlier Analysis.

TUTORIAL SHEET NO. 1 l. Write short notes on the following:

(a) Data Mart

(b) Loose Coupling and Tight Coupling 2. (a) What do you mean by Data Warehouse ? Differentiate between OLTP and

OLAP systems.

(b) What are data cubes? How data Cubes can be framed from tables and spreadsheet?

Draft a cuboids by taking four dimensions time, doctor, patient and disease.

3. Why are operational databases not particularly suited for decision support system? compare OPAP and OLTP systems? How a data warehouse is related to OLAP systems? 4 Describe various steps used for the design and construction of data warehouses. Also discuss methods for the implementation of data warehouse system

TUTORIAL SHEET NO. 2

1. Explain the following: (a) Join and Prune (b) Learning by Observation

2. (a) What do you understand by data mining query language? What are the primitive;

under which a data mining query is defined?

(b) What do you mean by data mining? What are steps of data mining to be followed as

the process of knowledge discovery?

3 (a) Why we preprocess the data? What are the basic methods for filling in the missing

values of a database?

(b) "Attribute-oriented induction generates one or a set of generalized descriptions. How

can these descriptions be visualized?

4. a) Compare various forms of data preprocessing. b) How do we find interesting pattern suing Data mining? What is the criterion for Interestingness? Explain.

TUTORIAL SHEET NO. 3

1. (a) Slice and Dice Operation

(b) Continuous and Categorical Data 2. What is ‘Association Rule’? Discuss various types of association rule. What is meant by

‘Association Rule Mining’? Explain by using a suitable example. 3 Discuss various methods used for ‘data Classification and predication’ 4. Find the frequent item sets using A priori algorithm from the transactional atabf1Se as given

below using candidate generation with a minimum support threshold of2 (20%).

5. (a) Discuss the issues regarding classification and prediction . (b) Explain classification by Back propagation.

TUTORIAL SHEET NO. 4

1. Write short notes on Applications of Data Mining. 2. Give classification of Data mining Systems 3 Write short note on the following: (a) Outlier Analysis (b) Tools for Data mining (c) Item sets (d) Binary Variables. 4. a) Differentiate between Data Matrix and Dissimilar Matrix. Explain the areas where data

mining clustering may be applied.

b). Under which categories clustering methods are classified? Explain partition based clustering in detail. 5 a) Give classification of various clustering methods. Also define K- means algorithm by using an example. b). Write short notes on Mining Association Rule in Transaction Databases.

MCA-14-44 COMPUTER GRAPHICS Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Introduction to Computer Graphics and its applications, Components and working of Interactive Graphics;Video Display Devices: Raster scan and Random Scan displays, Display Processors; Resolution, Aspect Ratio, Refresh CRT, interlacing; Color CRT monitors, LookUp tables, Plasma Panel and LCD monitors Interactive Input and Output Devices: keyboard, mouse, trackball, joystick, light pen, digitizers; image scanners, Touch Panels; Voice systems; printers, plotters; Graphics Software; Coordinate Representations UNIT – II Drawing Geometry: Symmetrical and Simple DDA line drawing algorithm, Bresenham’s line Algorithm; loading frame buffer; Symmetrical DDA for drawing circle, Polynomial method for circle drawing; circle drawing using polar coordinates, Bresenham’s circle drawing; Generation of ellipse; parametric representation of cubic curves, drawing Bezier curves; Filled-Area Primitives: Flood fill algorithm, Boundary fill algorithm, Scan-line polygon fill algorithm

UNIT – III 2-D Transformations: translation, rotation, scaling, matrix representations and homogeneous coordinates, composite transformations, general pivot point rotation, general fixed point scaling, Shearing; Reflection ; Reflection about an arbitrary line; 2-D Viewing: window, viewport; 2-D viewing transformation, zooming, panning; Clipping operations: point and line clipping, Cohen-Sutherland line clipping, mid-point subdivision line clipping, Liang-

Barsky line clipping, Sutherland-Hodgman polygon clipping; Weiler-Atherton polygon Clipping Pointing and positioning techniques; rubber band technique; dragging;

UNIT – IV 3-D Graphics: 3-D modeling of objects, 3D transformation matrices for translation, scaling and rotation, parallel projection: Orthographic and oblique projection; perspective projection; Hidden surface removal: Zbuffer,depth-sorting, area subdivision, BSP-Tree method; Ray casting;Shading: Modelling light intensities, Gouraud shading, Phong shading;Introduction to Animation, Tweening, Morphing, Fractals; Text Books: 1. Donald Hearn, M. Pauline Baker, Computer Graphics, Pearson Education. 2. Foley etc., Computer Graphics Principles & Practice, Pearson Education. Reference Books: 1. D.P. Mukherjee, Fundamentals of Computer Graphics and Multimedia, PHI. 2. Newmann & Sproull, Principles of Interactive Computer Graphics, McGraw Hill. 3. Rogers, Procedural Elements of Computer Graphics, McGraw Hill. 4. Anirban Mukhopadhyay, Arup Chattopadhyay, Introduction to Computer Graphics and Multimedia, Vikas Publications. 5. Zhigang Xiang, Roy Plastock, Computer Graphics, Tata McGraw Hill. 6. Apurva A. Desai, Computer Graphics, PHI. 7. Malay K. Pakhira, Computer Graphics, Multimedia and Animation, PHI

LECTURE PLAN MCA-14-44

LECTURE TOPIC

1. Computer Graphics and its applications 2. Raster scan and Random Scan displays 3. Display processors 4. Display systems-refresh CRTs 5. Grey shades, Interlacing 6. Beam penetration shadow mask monitors 7. look up tables, plasma panel 8. LED and LCD monitors 9. VGA and SVGA resolutions 10. printers, plotters, mouse, digitizing tablet, light pen 11. Touch panels, image scanners, Voice systems, joy stick, track ball 12. Coordinate system, resolution 13. Scan conversion: symmetrical DDA 14. Bresenhams line drawing algorithm 15. Circle drawing using DDA and polar coordinates 16. Bresenhams circle drawing algorithm 17. Generation of ellipse 18. Stack-based seed fill algorithm 19. Scan-line seed fill algorithm 20. Translation, rotation, scaling 21. Mirror reflection; shearing, zooming, panning 22. Input techniques-pointing, positioning 23. Rubber band methods and dragging, tweening 24. Clipping-line clipping using Sutherland-Cohen 25. Midpoint sub-division algorithm 26. Liang-Barsky line clipping 27. Polygon clipping; 28. Sutherland-Hodgman polygon clipping; 29. window and viewport: Windowing transformation 30. Filling-stack based fill algorithm 31. Scan-line seed fill algorithm 32. 3D transformation matrices for translation 33. Scaling and rotation 34. Parallel projection

35. perspective projection 36. Hidden-surface removal - Z-buffer , back face 37. Scan-line, depth-sorting 38. Area subdivision, Shading - modeling light Intensities 39. Gouraud shading, phong shading 40. Twinning 41. Morphing

TUTORIAL SHEET 1

1. What is the function of a frame buffer and a display processor in an interactive graphics

system? How a picture is created and manipulated using interactive techniques?

2. Describe the following in brief:

(a) Resolution. (b) Look-up table. (c) Image scanner. (d) Plasma panel.

3. a) Write circle drawing algorithms?

b) What are side effects of scan conversion?

4. a) What are advantages of DVST and LED/LCD?

b) Explain color CRT monitors

c) What are the applications of Graphics?

5. Answer the following question in brief:

(a) Distinguish between raster scan and Random scan displays.

(b) What will be the size of frame buffer in bits if the resolution of the monitor is 1024*1024

TUTORIAL SHEET 2 1. a) Write and Explain line drawing algorithms using DDA.

b) Write Bresenhams LDA?

c) Characteristics of good line algorithm.

2. (a) How is a circle drawn using polar coordinates?

(b) Show how an object can be filled using scan line seed fill algorithm

3 a) Explain types of hidden surface elimination?

b) Explain depth buffer algorithms and its limitations?

4. (a) Write the algorithm for drawing a circle using Brenham’s method.

(b) What is the importance of coordinate systems in graphics?

5. Explain the steps that are required to scan covert a line using bresenham’s algorithm. is

bresenham’s? which algorithm better than DDA line drawing algorithm? Obtain the points on

a line with end point (2, 6) and (10, 8) using Bresenham’s algorithm.

TUTORIAL SHEET 3

1. (a) Illustrate the effect of zooming a window using a suitable example

(b) Distinguish between Rubber band technique and dragging.

2. A triangle has vertices located a A (4, 6), B (10, 7), C (7, 12) Indicate a transformation matrix to increase the size of the triangle two times with point A located at the same place thus. Obtain the points of the Scaled triangle.

3. (a) Illustrate the logic of liang Barsky line clipping algorithm using a suitable example.

(b) Describe the 2-D viewing transformation that maps a circular window in world coordinates

onto a normalized circular view port using a appropriate example

4. (a) Explain Sutherland-Hodgman Algorithms.

(b) Explain digital input devices?

5. Explain the following

(a) point and line clipping

(b) Cohen-Sutherland line clipping

(c) mid-point subdivision line clipping,

TUTORIAL SHEET 4

1. (a) Write down the 3-D transformation matrices for rotation about the three axes.

(b) How is linear interpolation used in tweening?

2. Explain the Gouraud shading, phong shading

3. (a) Describe how a 3-D object is modeled before its is transformed into eye coordinate system

(b) Define the equations for interpolating light intensities at various points on an object suing

Gouraud Shading.

4. Effect of zooming using a window using suitable example?

5. (a) Distinguish between oblique. Parallel and Perspective projection.

(b) How are depth values uses to identify hidden surfaces in depth buffer algorithm?

(c) Write short notes on:

(a) Hardware support needed for multimedia.

(b) Multimedia authoring tools.

(c) Rubber -band techniques.

MCA-14-45(I) INFORMATION SECURITY Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks. .

UNIT – I Information Security Concepts: Background and Current Scenario, Types of Attacks, Goals for Security. Security Threats and Vulnerabilities: Overview of Security threats, Weak / Strong Passwords and Password Cracking, Insecure Network connections, Malicious Code, Programming Bugs . Wireless Networks and Security: Components of wireless networks, Security issues in wireless

UNIT – II Basic encryption and decryption, Applications of Cryptography, Encryption techniques, Characteristics of good encryption systems, Secret key cryptography, Digital Signatures, Data Encryption Standard, International Data Encryption Algorithm, Advanced Encryption Standard, Hash and MAC algorithms.

UNIT – III Secure sockets, IPsec overview, IP security architecture, IPSec-Internet Key, Exchanging(IKE), IKE phases encoding, Internet security, Threats to privacy, Packet sniffing, Spoofing , Web security requirements, Real Time communication security, Security standards–Kerberos.X.509AuthenticationService.

UNIT – IV Security protocols, Transport layer protocols, Electronic mail security, PEM and S/MIME security protocol, Pretty Good Privacy, Web Security, Firewalls design principle, Trusted systems, Electronic payment protocols. Intrusion Detection, Password Management, Viruses and related Threats – Virus Counter measures, Virtual Private Networks. Reference Books: 1. William Stallings, “Cryptography and Network Security: Principles and Standards”, Prentice Hall

India. 2. Edward Amoroso, "Fundamentals of Computer Security Technology", Prentice-Hall, 1999 3. William Stallings, "Network Security Essentials", 3rd Edition, Pearson Education, 2006.

4. Bruce Schneier, “Applied Cryptography: Protocols, Algorithms, and Source Code in C”, Wiley India Pvt. Ltd.

MCA-14-45(II) ARTIFICIAL INTELLIGENCE Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT-I Introduction: Background and history, Overview of AI applications areas. The predicate calculus: Syntax and semantic for propositional logic and FOPL, Clausal form, inference rules, resolution and unification. Knowledge representation: Network representation-Associative network & conceptual graphs, Structured representation- Frames & Scripts.

UNIT-II Search strategies: Strategies for state space search-data driven and goal driven search; Search algorithm suninformed search (depth first, breadth first, depth first with iterative deepening) and informed search (Hill climbing, best first, A* algorithm, mini-max etc.), computational complexity, Properties of search algorithms - Admissibility, Monotonicity, Optimality, Dominance.

UNIT-III Production system: Types of production system-commutative and non-commutative production systems, Decomposable and non-decomposable production systems, Control of search in production systems. Rule based expert systems: Architecture, development, managing uncertainty in expert systems -Bayesian probability theory, Stanford certainty factor algebra, Nonmonotonic logic and reasoning with beliefs, Fuzzy logic, Dempster/Shaffer and other approaches to uncertainty.

UNIT-IV Knowledge acquisition: Types of learning, learning by automata, genetic algorithms, intelligent editors,learning by induction.Natural Language Processing (NLP): Problems in understanding natural languages, Different stages of language analysis, Chomsky Hierarchy of formal languages, Transition network parsers (TNP), Augmented Transition network parsers (ATNP). Text Books: 1. George F. Luger, Artificial Intelligence, Pearson Education. 2. Dan W. Patterson Introduction to Artificial Intelligence and Expert system, PHI. Reference Books: 1. Ben Coppin, Artificial Intelligence Illuminated, Narosa Publishing House. 2. Eugene Charniak, Drew McDermott Introduction to Artificial Intelligence, Pearson Education. 3. Nils J. Nilsson Principles of Artificial Intelligence, Narosa Publishing House. 4. Jackson Peter, Introduction to Expert systems, 3rd ed., Pearson-Education.

Lecture Plan MCA-405

Lectures Topics

1. Background and history of AI 2. Overview of AI application areas 3. Syntax propositional logic 4. semantic propositional logic 5. FOPL 6. Clausal form

7. Inference rules 8. ------Do-------- 9. ------Do-------- 10. Resolution 11. Unification 12. Network representation – Associative network 13. Conceptual graphs 14. Structured representation – frames and scripts 15. State space search – data driven 16. Goal driven search 17. Uniformed search algorithms 18. Informed search algorithms-I 19. -------do---------- 20. Informed search algorithms-II 21. Computational complexity 22. Properties of search algorithm – admissibility, Monotonicity, Optimality, Dominance 23. Types of production systems 24. Control of search in production system 25. -----------do------------ 26. Architecture 27. Development 28. Managing uncertainty in expert system- Bayesian probability theory 29. Stanford certainty factor algebra, Non monotonic logic 30. Reasoning with beliefs, Fuzzy logic 31. Dempter / Shaffer Theory 32. Other types of approaches to uncertainty 33. Types of learning 34. Learning automata 35. Genetic algorithms 36. Intelligent editors 37. Learning by induction 38. Programming with prolog- Introduction, 39. Clauses: Facts, goals and rules 40. Prolog unification mechanism, 41. Operators in PROLOG 42. List manipulations, Fail, Cut and Not predicates 43. Recursion in PROLOG

Tutorial Sheet 1

1. (i) What is skolemization?

(ii) Define monotonicity.

2. (a) What is Artificial Intelligence? Write the short note on following applications of

Artificial Intelligence:

(i) Natural Language Processing

(ii) Theorem Proving.

(b) What is Most General U n i f i e r (MGU)? Write the unification algorithm to find the

MGU.

3. Differentiate between following:

(a) MOdus ponen and modus tolien

(b) Associative network and conceptual graph

4. What do you understand by universal instantiation and universal existential?

5 Explain a) Turing test? b) Inference rules?

Tutorial Sheet 2 1. (i) W ha t is unit resolution?

(ii) What is inference engine in expert system?

2 a) What do you understand by data driven and goal driven search? Discuss the characteristics of

the problem motivating the use of data driven or goal driven search. b) What do you understand by hill climbing search? What is steepest hill climbing? Explain.

3. (a) What do you understand by admissible heuristic? Explain using 8-ple problem.

(b) What do you understand by alpha and beta pruning? How do they help in pruning the search area? Explain. 4 a). Define production system and discuss the following conflict resolution strategies used

in production system.

(a) Refraction. (b) Recency. (c) Specificity.

5 write short notes on the following:

(a) Beam search (c) hill climbing search.

Tutorial Sheet 3

1. (i) What is the use of mutation operator in genetic algorithm?

(ii) Discuss the use of= operator in PROLOG.

2. Differentiate between following:

(a) Commutative and non-commutative production system '

(b) Propositional logic and fuzzy logic.

3. a) What is an Expert system? Discuss the ruled architecture of expect system.

b) Discuss in brief Standard certainty factor algebra 4 Explain expert system life cycle? How AI is linked with Expert system

5 a). Compare the following search techniques Depth first , Breadth first, Hill climbing, A*

b) Explain the following knowledge representation schemes

Semantic network, Frames

Tutorial Sheet 4

1. (i) What are the space complexities of depth first and breadth Search?

(ii) What is Prenex Normal Form (PNF)?

2. (a) What are the different sections in PROLOG program? Discuss their uses.

3. Write short notes on the following:

(a) Learning automata b) Encoding techniques in Genetic algorithm.

4. What is learning as induction? Discuss the following general rules of induction:

(a) Generalization by disjunction. (b) Generalization by tree climbing.

(c) Replacement of constants by variables.

5. What are the inputs /output predicates available in PROLOG? Explain.

MCA-14-45(III) INFORMATION SYSTEMS Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks. .

UNIT – I Fundamental of Management Information systems: The Fundamental Roles of Information System in business, Trends in Information Systems, Types of Information Systems, Managerial Challenges of Information Technology. The Components of Information Systems: System Concept, Components of an Information System, Information System Resources, Information System Activities, Recognizing Information Systems

UNIT – II IT Infrastructure and Emerging Technologies: - IT Infrastructure, Infrastructure Components, Software/Hardware Platform Trends and Emerging Technologies, Management Issues. Foundation of Business Intelligence: Databases and Information Management: Organizing Data in a Traditional File Environment, The Database Approach to Data Management, Using Database to Improve Business Performance and Decision Making, Managing Data Resources.

UNIT – III Securing Information Systems: - System Vulnerability and Abuse, Business Value of Security and Control, Establishing a Framework for Security and Control, Technologies and Tools for Security. Key System Applications for the Digital Age Enterprise Applications: - Enterprise Systems, Supply Chain Management Systems, Customer Relationship Management Systems, Enterprise Applications: New Opportunities and Challenges.

UNIT – IV Managing Knowledge: - The Knowledge Management Landscape, Enterprises-Wide Knowledge Management Systems, Knowledge Work Systems, Intelligent Techniques. Enhancing Decision Making: - Decision Making and Information Systems, Systems for Decision Support, Executive Support Systems (ESS), Group Decision-Support Systems (GDSS). Text Books: 1. Kenneth C.Laudon, Jane P.Laudon, Management Information Systems Managing the Digital Firm, 10th

Edition, Pearson Education. 2. James A O’Brien, George M Marakas, Management Information Systems, 7th Edition, Tata McGraw-Hill. Reference Books: 1. Laudon & Laudon, Essentials of Management Information Systems, 8/e Pearson Education. 2. McLeod & Schell, Management Information Systems, 10/e, Pearson Education. 3. Rahmatian, Management Information Systems: Learning Exercises and Applications, 1/e Pearson Education. 4. Jawadekar, W.S., Management Information Systems, 2/e, Tata McGraw-Hill. 5. Robert G.Mudrick, Coel E.Ross, James R.Claggett,Information Systems for Modern Management. 6. James A.O'Brien, Management Information Systems.

MCA-14-45(IV) SECURITY IN COMPUTING Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Computer Security Concepts, Threats, Attacks and Assets, Security Functional Requirements, Security Architecture and Scope of Computer Security, Computer Security Trends, Computer Security Strategies. Program Security: Secure Program, Non-malicious Program Error, Viruses and other Malicious Code, Targeted Malicious Code, Control against Program Threats.

UNIT – II Database Security: Database Management System, Relational Databases, Database Access Control, Inference, Security Requirements, Reliability and Integrity, Sensitive Data, Database Encryption. Network Security: Threats in Network, Network Security Controls, Firewall- Need for firewall, Characteristics, Types of firewall, Firewall Basing, Intrusion Detection System- Types, Goals of IDS, IDS strengths and Limitations.

UNIT – III Internet Security Protocols and Standards: Secure Socket Layer (SSL) and Transport Layer Security (TLS), IPv4 and IPv6 Security, Kerberos 672, X.509 678, Public Key Infrastructure. Linux Security Model, File System Security, Linux Vulnerability, Linux System Hardening, Application Security. Window Security Architecture, Windows Vulnerability, Windows Security Defense, Browser Defenses.

UNIT – IV Physical Security Threats, Physical Security Prevention and Mitigation Measures, Recovery form Physical Security Breaches, Security Auditing Architecture, Security Audit Trail, Security Risk assessment, Security Controls or Safeguard, IT Security Plan, Cybercrime and Computer Crime, Intellectual Property, Privacy, Ethical Issues. Reference Books: 1. Charles. P. Pfleeger & Shari Lawrence Pfleeger, Security in Computing, fourth edition,Pearson Education, 2006.ISBN: 978-81-317-2725-6. 2. William Stalling, Lawrie Brown, “Computer Security Principles and Practice”, First edition,Pearson

Education, 2010. ISBN: 978-81-317-3351-6.

S/W LAB–VII BASED ON MCA-14-41

MCA-14-46

List of Programs to be implemented in JAVA

1. Write a program to sort list of names (Entered as Command Line Arguments). 2. An Electronics shop has announced some discounts on the purchase of 5 types of electronic items. Write a menu driven program to implement this billing structure. Use the data given in the slabs below:

Purchase Laptop(L) Desktops Notebook Hard Printer Amount (D) (N) Disk (P)

(H)

0-25000 2.3% 5% 3.8% 4.5% 3% 25001- 5.8% 7% 6% 6.5% 5% 51000

51001- 9% 10% 8% 9.6% 8% 100000

Above 1 12% 15% 13% 12.5% 16% Lakh

(a) Data Members for following data: Name of customer, Address, Amount paid type of purchase. (b) Methods for :

i) Initializing the data members ii) Getting the inputs for billing generation iii) Calculating and printing the final bill iv) Searching the bill

3. Create a database in MS-Access with the fields name, class, rollno. , address for the student personal information system and perform the following actions:

(i) Insert the records of the new admitted students in the database. (ii) Update the records of the students (iii) Fetch the whole information of the students on the basis of the data entered for any field. (iv) Throws an exception on entering the wrong number format for the rollno

4. Write a program to create a sequential file that could store details about five products. Details include product code, cost and number of items available and are provided through keyboard. After creating a file read the data from that file and computes total value of all the five products.

5. We want to build the basic backbone of a simple Railway Reservation System. The following classes are required to model the system: Person, Date, Train and Rail Reservation Record. You have to invent the requisite attributes and functions for the various classes based on a description of the functionality and constraints of Rail Reservation Object given below:

i) Create a package containing class registration and login

ii) Create another package containing the logic for reservation iii) Create a package containing the logic for the journey details

iv) Create an interface containing the logic for validation

v) Use the above interface in the validation for registration and reservation process i.e whether the registration and reservation are confirmed

vi) Reservation is made from a start station to a destination on a single train, in a particular class, for a particular date, for a person. So we’ll not take care of journeys requiring two or more trains.

vii) Reservation can be made up to a maximum of 60 days and upto a minimum of 1 day before the date of departure.

viii) Reservations already made can be cancelled. ix) Assume that the trains have infinite capacity. So you need not make checks to see whether

space is available or not. x) For reserving accommodation each passenger’s name, gender and age is required. xi) Each Rail/Reservation Record Object must have a unique reference number/string for access

purposes. All classes should have proper access specifiers.

6. Write a program to implement marquee tag of HTML 7. Write a program to create a digital clock using applet and threads. 8. Write an application to create tic-tac-toe game using frames. 9. Write a program to create a Note Pad Editor using Applets and menus. 10. Write a program to create a registration page with the help of awt components and displays a message

“registration successful” after complete registration process. 11. Create an application to initiate chatting between two clients using applet and awt packages. 12. Create a user registration form using java beans using the following steps: Step 1: Create a simple registration form (register .html): Step 2: Create a process.jsp file which contains some conditional logic to invoke form _bean class and either of the jsp files (retry.jsp/success.jsp)when the user submits the registration form. Step 3: Create a test package that contains form_bean class which defines the getter and setter methods for each input elements defined in register .html file. Step 4: Create a “retry.jsp”file for displaying error.if the user submits the form without fulfilling filed. process.jsp will return on retry.jsp page. If there are no validation errors, the request is forwarded to success.jsp Step 5: Create a “success.jsp” file for displaying all data entered by user. Success.jsp in turn extracts the bean component form the request and confirms the registration to the client.

S/W LAB-VIII BASED ON MCA-14-44

MCA-14-47

(Based on Prolog & C)

List of Programs to be implemented in Graphics using C

S.No. Name of the Program

1. (a) Draw a line, circle, rectangle using inbuilt graphics functions.

(b)Draw Indian Flag, change the size of flag using arrow key.

2. Create a Tree by generating branches and leaves by using Pixel generater.In the first step stem is drawn and then two branches appear on the stem. Then subsequent more and more branches are drawn.

3. (a) To draw a line using simple DDA and Bresenhams algorithm.

(b) To draw a circle using Bresenhams and midpoint algorithm.

(c) Draw Chess Board using DDA line drawing algorithm.

4. Draw a ticking Clock

5. Create an animation of a simple solar system where

the earth is rotating around the sun, the angle of inclination is 23.5 degrees, the earth is rotating around its axis, the moon is rotating around the earth, There is another planet also rotating around the sun (e.g. Mars) with a

different speed, distance and plane than the earth.

6. Develop a paint brush program having the following functionalities:

(a) Drawing line, eclipse, circle using mouse. (b) Writing text (c) Saving an image

7. Creates a cube with one corner cut off.

•Use front-face/back-face culling to find the corresponding faces of the cube.

•Use z-buffer algorithm to find the visible faces of the cube.

8. Develop a Traffic light program in c displaying what happens in our daily life at traffic light signals. User will press an any key to start the traffic light simulation.

9. Press me button game using C and graphics function.

In this game when you try to bring mouse near a circle it moves away from the mouse, so you keep on trying pressing the circle. Whenever we find mouse pointer very close to circle we move the circle suitably.

10. (a) Draw a shape given below and implement clip rectangle on it using Cohen Sutherland algorithm.(Using polygon clipping)

(b)To Make a square Object and implement 2D transformations Like scaling, Rotating and Translation.

(c) To translate, Scale and rotate a cubic object by translation, scaling and rotation vector in 3D.

(d) To Make a hut and perform a Zoom operation on it using zooming algorithm.