Duration: 2 hours Max. Marks: 60

Similar documents
Station Road, Datar Colony, Bhandup (East), Mumbai Tel.: / TIME TABLE BSC IT SUBJECT

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Module Contact: Dr Stephen Laycock, CMP Copyright of the University of East Anglia Version 1

BCA (Part II) EXAMINATION 2008 C++ PROGRAMMING Max Time : 3 Hours Max. Marks : 50

COMPUTER GRAPHICS, MULTIMEDIA AND ANIMATION, Second Edition (with CD-ROM) Malay K. Pakhira

Principles of Computer Graphics. Lecture 3 1

B.Sc. (Part II) (Information Technology) EXAMINATION, 2009

OXFORD ENGINEERING COLLEGE (NAAC Accredited with B Grade) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

CS602 MCQ,s for midterm paper with reference solved by Shahid

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++

Part 3: 2D Transformation

(a) rotating 45 0 about the origin and then translating in the direction of vector I by 4 units and (b) translating and then rotation.

Institutionen för systemteknik

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Discrete Mathematical Structures. Answer ONE question from each unit.

Course Title: Computer Graphics Course no: CSC209

CHAPTER 1 Graphics Systems and Models 3

Graphics and Interaction Rendering pipeline & object modelling

CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK

Roll No. :... Invigilator's Signature : GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70

End-Term Examination

Lesson Plan. Name of Faculty: Sana Bharti. Discipline: MCA. Semester: 4 th. Subject: Data Mining and Warehousing (MCA-16-43)

Time : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions.

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

QUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION

1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).

Clipping and Scan Conversion

CS 130 Final. Fall 2015

ADMINISTRATIVE MANAGEMENT COLLEGE

CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination

CS2401 COMPUTER GRAPHICS ANNA UNIV QUESTION BANK

Clipping & Culling. Lecture 11 Spring Trivial Rejection Outcode Clipping Plane-at-a-time Clipping Backface Culling

Rasterization. MIT EECS Frédo Durand and Barb Cutler. MIT EECS 6.837, Cutler and Durand 1

Madhya Pradesh Bhoj (Open) University, Bhopal

CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks)

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Rani Durgavati Vishwavidyalaya Jabalpur (M.P.) (UICSA) Master of Computer Application (MCA) Practical List of. MCA III SEM Session -2010

TEACHING PLAN FOR DEGREE COLLEGE FOR THE YEAR

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Computer Graphics

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

FROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU

The Traditional Graphics Pipeline

Write C++/Java program to draw line using DDA and Bresenham s algorithm. Inherit pixel class and Use function overloading.

Renderer Implementation: Basics and Clipping. Overview. Preliminaries. David Carr Virtual Environments, Fundamentals Spring 2005

KRISTU JYOTI COLLEGE OF MANAGEMENT & TECHNOLOGY QUESTION BANK BCA SEMESTER III Computer graphics Part A (2 marks questions)

ME COMPUTER AIDED DESIGN COMPUTER AIDED DESIGN 2 MARKS Q&A

Cs602-computer graphics MCQS MIDTERM EXAMINATION SOLVED BY ~ LIBRIANSMINE ~

VALLIAMMAI ENGINEERING COLLEGE

BCA (Part II) EXAMINATION, 2009 C++ PROGRAMMING Time allowed: Three Hours Maximum Marks: 50 Attempt any five questions

The Traditional Graphics Pipeline

B.Sc. Final B.SC. PART-III PAPER I COMPUTER ORGANIZATION II

CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo)

2D Image Synthesis. 2D image synthesis. Raster graphics systems. Modeling transformation. Vectorization. u x u y 0. o x o y 1

CS452/552; EE465/505. Clipping & Scan Conversion

PROGRAMMING IN C AND C++:

Realtime 3D Computer Graphics Virtual Reality

CS602- Computer Graphics Solved MCQS From Midterm Papers. MIDTERM EXAMINATION Spring 2013 CS602- Computer Graphics

END TERM EXAMINATION

COMP30019 Graphics and Interaction Rendering pipeline & object modelling

Lecture outline. COMP30019 Graphics and Interaction Rendering pipeline & object modelling. Introduction to modelling

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions.

The Traditional Graphics Pipeline

VALLIAMMAI ENGINEERING COLLEGE

JAIPUR NATIONAL UNIVERSITY, JAIPUR

R. C. TECHNICAL INSTITUTE, SOLA

KINGS GRAPHICS AND MULTIMEDIA DEPARTMENT OF COMPUTER SCIENCE AND ENGG. OUTPUT PRIMITIVES Part-A (2-MARKS)

Computer Graphics. Apurva A. Desai

EXAMINATIONS 2017 TRIMESTER 2

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

Viewing with Computers (OpenGL)


LIST OF EXPERIMENTS. (1) (Office Automation)

Silver Oak Engineering College and technology Information Technology Department

B.Sc. (Part II) (Information Technology) EXAMINATION, 2008

The University of Calgary

Computer Graphics: 7-Polygon Rasterization, Clipping

Example Examination 2IV

General Hidden Surface Removal Algorithms. Binghamton University. EngiNet. Thomas J. Watson. School of Engineering and Applied Science CS 460/560

CS/IT DIGITAL LOGIC DESIGN

Short Notes of CS201

Polygon Partitioning. Lecture03

S Y B Voc Software Development Syllabus

Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

CS201 - Introduction to Programming Glossary By

2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into

COMP30019 Graphics and Interaction Scan Converting Polygons and Lines

CS1354 GRAPHICS AND MULTIMEDIA DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK SUB CODE / SUBJECT: CS1354 GRAPHICS AND MULTIMEDIA.

3D Rendering Pipeline (for direct illumination)

3D Polygon Rendering. Many applications use rendering of 3D polygons with direct illumination

Points and lines, Line drawing algorithms. Circle generating algorithms, Midpoint circle Parallel version of these algorithms

MET71 COMPUTER AIDED DESIGN

CERTIFICATE IN WEB PROGRAMMING

Overview. Pipeline implementation I. Overview. Required Tasks. Preliminaries Clipping. Hidden Surface removal

Design and implement a program to solve a real-world problem using the language idioms, data structures,, and standard library.

Computer Graphics and GPGPU Programming

Einführung in Visual Computing

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

Transcription:

I. (a) Determine the number of positive integers n where 1 and n is not divisible by 2 or 3 or. (b) How many integers between 1 and 2000 are divisible by 2, 3, or 7? (c) Let S = {1, 2, 3, 4,, 6, 7, 8, 9}. Determine whether or not each of the following is a partition of S. i) {{1, 3, }, {2, 6}, {4, 8, 9}} ii) {{1, 3, }, {2, 4, 6, 8}, {, 7, 9}} iii) {{1, 3, }, {2, 4, 6, 8}, {7, 9}} iv) {{S}} (d) It is known that at the University, 60% of the professors play tennis, 0% of them play bridge. 70% jog, 20% play tennis and bridge, 30% play tennis and jog, 40% play bridge and jog. If someone claimed that 20% of professors jog and play bridge and tennis, would you believe the claim? Why? (a) Draw truth tables for the following logical statements: i) ( ) ( ) ii) ( ( )) (b) Prove the following logical equivalence using laws of logic only: i) [( ) ( )] ( ) ii) ( ) [ ( )] ( ) (c) Determine whether ( ) and ( ) ( ) are logically equivalent using truth tables. (d) Prove that 2 + + 8 + + (3n-1) = ( ) using Mathematical Induction. III (a) Let A = {1, 2, 3} and R and S are relations on A (b) [ ] and [ ] Find Let A = {1, 2, 3, 4} Determine whether the relation R whose matrix [ ] is Reflexive, Irreflexive, Symmetric, Asymmetric, Antisymmetric or Transitive. (c) Let A = {1, 2, 3, 4} and R = {(1, 2), (2, 1), (2, 3), (3, 4)} Find transitive closure of R using Warshall s Algorithm. (d) Draw Hasse Diagram for the given relation matrix defined on set A = {1, 2, 3, 4, } Is it a chain? [ ]

IV (a) Obtain CNF and DNF for the following: i) ( ) ii) ( ) (b) Let A = {a, b, c, d, e} and B = {x, y, z}. Determine whether relation R from A to B is a function, give its range. i) R = {(a, y), (b, z), (c, x), (d, z), (a, z), (b, x)} ii) R = {(a, x), (b, y), (c, x)} iii) R = {(a, x), (b, z), (c, y), (d, y), (e, z)} iv) R = {(a, x), (b, x), (c, x), (d, x), (e, x)} v) R = {(a, z), (b, y), (c, z), (c, y), (c, x),(b, x)} (c) Let A = B = C. Let defined by ( ) ( ) Find f o g(x), g o f(x), f o f(x), g o g(x), f o f o f(x) (d) Let f, g, h be the functions mapping set A = {1, 2, 3, 4} into itself. f = {(1, 2), (2, 1), (3, 1), (4, 4)} g = {(1, 2), (2, 4), (3, 1), (4, 3)} h = {(1, 1), (2, 3), (3, 1), (4, 3)} Find f o g, g o h, g o g, h o h V. (a) Using Nearest neighbor method find Hamiltonian circuit for the graph shown in figure stating with vertex a. What is the weight of this path? (b) Define: i) Graph ii) Degree iii) Loop iv) Isolated Vertex v) Adjacent Vertices (c) How many nodes are necessary to construct a graph with exactly 6 edges in which each node is of degree 2? (d) Show that the maximum number of edges in a simple graph with n vertices is ( ) VI (a) Find the solution of that satisfies (b) Find the solution of (c) Find the solution of that satisfies (d) Find total solution of

I. (a) Write step involved in DDA algorithm. Consider the line coordinates A(,) and B(13,9).Determine the line segment using DDA algorithm (b) Describe the components of a typical computer graphics display system. Explain the construction & working of CRT displays. (c) Define Image. Also write a difference between bitmap and vector image. (d) Derive steps involved in Mid point circle drawing algorithm. I (a) Develop a single transformation matrix which does the following i) Scale by 2, 3 in x and y direction ii) Rotates by an angle 30 0 in clockwise direction iii) Translates 4 units in the xdirection (b) Derive the matrix of rotation by an angle Ө in clockwise direction. (c) Derive the transformation matrix to magnify the triangle A(0,0),B(1,2),C(3,2) to twice its size. Draw the same. (d) Write note on 2D Shear transformation. (a) Shear a unit cube situated at origin in xz plane by factor 2, 3 in x and y direction respectively. (b) What is homogeneous coordinate system? Write scaling, translation 3D matrix in homogeneous form. (c) Rotate an object about z axis with coordinates A(1,1,), B(4,1,1),C(,1,4) and D(6,0,0) by and angle 90 degree. (d) Reflect the object about the x=0 plane, where object is having vector coordinates A[1 0 1 1], B[2 0 1 1], C[2 2 1 1],D[1 2 1 1]. (a) Explain why the Sutherland-Hodgman algorithm works only for convex polygon regions. also suggest modifications to clip concave polygon. (b) Explain Inside-outside test method test with example (c) Write a short note on 2D Viewing pipeline. (d) Clip line p1p2 having coordinates p1 (-10, 0),p2 (30,80 ) against window (Xmin= -30,Ymin= 10), (Xmax= 20,Ymax= 60) using Cohen-Sutherland line clipping algorithm. V. (a) Generate a B-spline curve having polygon vertices p1(1,1), p2(4,3), p3(8,),(8,10) { X=[0 0 0 0 1 1 1 1] and N 1,4 (u)=(1-u) 3,N 2,4 (u)=(1-u) 2 *u, N 3,4 =(1-u)*u 2,N 4,4 =u 2 } (b) Explain Painter s algorithm for hidden surface removal. Also give its advantages and disadvantages. (c) Write short note on Bilinear surfaces. (d) Explain following terms i) Spane line coherence ii) Object coherence iii) frame ccoherence iv) depth coherence. (a) What is shadow? Explain different types of shadows. (b) How to put realism in a scene?explain 2 types of colour model. (c) Explain how phong shading technique is works. Also state advantages and disadvantages of phong shading technique (d) Explain term visibility invisible surfaces. Explain two approaches used to determine hidden surfaces

I. (a) Explain the following Functions with syntax and example i) MONTHS_BETWEEN ii)next_day iii) SQRT iv) SIGN v)trunc (b) What is a predicate? Explain its different types (c) What are the guidelines for GROUP BY clause (d) What is a view? Explain its types with example I (a) What is a privilege? Explain its types with example. (b) Explain multiple column subqueries with suitable example (c) What is set operators? Explain its type with example (d) What is correlated subquery? Explain scalar subquery with example (a) Explain the advantages of PL/SQL (b) What is an identifier? Write a note on Bind variable. (c) Write a short note on comments in PL/SQL (d) Explain PL/SQL Block structure. (a) Explain IF-THEN-ELSE statement with example. (b) write a PL/SQL program to reverse the nos from 10 to 1 using FOR loop (c) Explain any collection methods with example. (d) What are cursors? Write a short note on classification of cursors. V. (a) What is a procedure? Explain with syntax. (b) List the advantages of stored functions and procedure. Also write the syntax for dropping a function. (c) What are packages? What are its advantages? (d) create a procedure raise_salary to update the emp table, raise the salary by 10% using IN parameter. (a) Explain the execution flow of SQL. (b) Define triggers. List the guidelines for designing triggers. (c) Distinguish between statement level and row level triggers. (d) Explain the INSTEAD of trigger with syntax.

I. (a) What is object oriented programming? How is it different from procedure oriented programming? (b) Explain the basic concepts of OOPs. (c) Explain the benefits of OOP. (d) How does object oriented approach differ from object based approach. I (a) Can a class contain multiple constructors? If yes, explain with an example. (b) Short note on destructor. (c) Explain static member functions with an example. (d) What is a class? Explain the general form of class declaration. (a) Explain overloading of unary operator. (b) Explain this pointer in detail. (c) Explain overloading of increment operation. (d) What are friend functions? Write a program using friend function to find largest of 2 numbers. (a) Explain multilevel inheritance with an example. (b) How are constructors used in derived class? (c) Explain read() and write() function. (d) Explain how to open and close a file with an example. V. (a) Explain showpos, showpoint flag with an example. (b) What is a stream? Explain C++ stream classes. (c) How can we design our own manipulators? (d) Both cin and getline() function can be used for reading a string. Comment. (a) What are function templates? Write a program using function template 2 swap 2 integer and 2 float numbers. (b) What is a vector? What are the functions of vector class? (c) Explain maps with an example. (d) Explain use of function objects in algorithms.

I. (a) Explain operating system with diagram (b) Write a short note on i) Assembler ii) Linker (c) Discuss real time system (d) Write a short note on cluster system. I (a) Discuss kernel concept (b) Discuss layered approach structure (c) Discuss system call with example (d) Write a short note on system boot (a) Discuss peterson s algorithm (b) Discuss process states (c) Explain multi-threading models (d) Discuss threading issues (a) Discuss concept of swapping (b) Assume there are 4 fixed partitions 1k, 2k, 4k, 8k in the main memory for user. Separate memory is allocated for operating system is 200k then show the memory map of MFT with single queue as well as memory map for MFT with multiple queue. 1. Job 1 need 3.7k memory 2. Job 2 need 1.2 k memory 3. Job 3 need 2k memory 4. Job 4 need 7k memory. Job 2 over 6. Job 3 over 7. Job needs 6 k memory (c) Explain demand paging algorithms (d) Find out page removal algorithms for 3 frames and 4 frames. If reference strings is as follows 1,2,3,4,1,2,,1,2,3,4, Use MRU algorithms. V. (a) Discuss function that is performed on file. (b) Discuss necessary condition required for deadlock creation. (c) Write a short note on i) Bit vector ii) Linked list (d) Discuss deadlock prevention (a) Discuss security problem (b) Discuss DOS attack. (c) Explain virus and it s types. (d) Explain password and it s rules and characteristics.