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

Similar documents
Duration: 2 hours Max. Marks: 60

TEACHING PLAN FOR DEGREE COLLEGE FOR THE YEAR

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

End-Term Examination

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

CHAPTER 1 Graphics Systems and Models 3

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

CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK


1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

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

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

CS2401 COMPUTER GRAPHICS ANNA UNIV QUESTION BANK

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

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

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

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

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

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

Course Title: Computer Graphics Course no: CSC209

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

(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.

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

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

Syllabus CS476 COMPUTER GRAPHICS Fall 2009

Madhya Pradesh Bhoj (Open) University, Bhopal

CS2 Current Technologies Lecture 2: SQL Programming Basics

Introduction to Computer Graphics

Computer Graphics. Apurva A. Desai

M.C.A. FIRST YEAR DEGREE

Interactive Computer Graphics A TOP-DOWN APPROACH WITH SHADER-BASED OPENGL

03 Vector Graphics. Multimedia Systems. 2D and 3D Graphics, Transformations

Databases. Relational Model, Algebra and operations. How do we model and manipulate complex data structures inside a computer system? Until

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

1 Attempt any three of the following: 1 5 a. What is Computer Graphics? How image is to be display on Video Display Device?

Topics and things to know about them:

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

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

Databases - 4. Other relational operations and DDL. How to write RA expressions for dummies

ASSIGNMENT 1 INTRODUCTION TO CAD

Silver Oak Engineering College and technology Information Technology Department

OpenGL Graphics System. 2D Graphics Primitives. Drawing 2D Graphics Primitives. 2D Graphics Primitives. Mathematical 2D Primitives.

Lahore University of Management Sciences. CS 452 Computer Graphics

CS/IT DIGITAL LOGIC DESIGN

Realtime 3D Computer Graphics Virtual Reality

SUBJECT: INFORMATION TECHNOLOGY

DS UNIT 4. Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering Discrete Structutre UNIT - IV

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

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

COURSE DELIVERY PLAN - THEORY Page 1 of 6

CS2 Current Technologies Note 1 CS2Bh

Sample Question Paper

Line Drawing. Introduction to Computer Graphics Torsten Möller / Mike Phillips. Machiraju/Zhang/Möller

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

Institutionen för systemteknik

Lahore University of Management Sciences. CS 452 Computer Graphics

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY

PRACTICAL LIST FOR ODD SEMESTERS Session (PGDCA/MCA/MSC (CS))

Assignment For Fresh (Session ) admitted students Of MCA 5-year (Through Distance Education)

Manipal Institute of Technology Manipal University Manipal

From Vertices to Fragments: Rasterization. Reading Assignment: Chapter 7. Special memory where pixel colors are stored.

KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology

Note: Select one full question from each unit

(3 Hours) N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks.

GIFT Department of Computing Science Data Selection and Filtering using the SELECT Statement

GLOBAL EDITION. Interactive Computer Graphics. A Top-Down Approach with WebGL SEVENTH EDITION. Edward Angel Dave Shreiner

Computer Graphics. Instructor: Oren Kapah. Office Hours: T.B.A.

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

R. C. TECHNICAL INSTITUTE, SOLA

(DMCA201) ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 Second Year SOFTWARE ENGINEERING. Maximum Marks 30 Answer all questions

M P BHOJ (OPEN) UNIVERSITY, BHOPAL ASSIGNMENT QUESTION PAPER

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

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

EF432. Introduction to spagetti and meatballs

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

P.G.D.C.M. (Semester I) Examination, : ELEMENTS OF INFORMATION TECHNOLOGY AND OFFICE AUTOMATION (2008 Pattern)

VALLIAMMAI ENGINEERING COLLEGE

ASSIGNMENT - 1, DEC

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics

EF432. Introduction to spagetti and meatballs

Object Oriented Programming

A Survey of Mathematics with Applications 8 th Edition, 2009

VALLIAMMAI ENGINEERING COLLEGE

ASSIGNMENT - 1, DEC P.G. DIPLOMA IN COMPUTER APPLICATIONS Paper I INFORMATION TECHNOLOGY Maximum : 30 MARKS Answer ALL questions.

COURSE DELIVERY PLAN - THEORY Page 1 of 6

BHARATHIDASAN ENGINEERING COLLEGE,NATTRAMPALLI

FROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU

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

Fundamentals of Discrete Mathematical Structures

QUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION

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

Aptitude Test Question

SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS COURSE PLAN

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY

Power Set of a set and Relations

Advantages: Disadvantages: Q.1 Explain raster scan display with its advantages and disadvantages?

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

CS 4731: Computer Graphics Lecture 21: Raster Graphics: Drawing Lines. Emmanuel Agu

M P BHOJ (OPEN) UNIVERSITY, BHOPAL ASSIGNMENT QUESTION PAPER

Transcription:

Managed By : UTTARI BHARAT SABHA (Regd.) EGE I Station Road, Datar Colony, Bhandup (East), Mumbai -400 042. Tel.: 2566 6691 /2566 2921 Email: info@radav.org TIME TABLE BSC IT 2015-16 SY BSC IT SEMESTER III REGULAR AND ATKT TIME 7.30 AM TO 10 AM.: _ /2015 7.30 AM TO 10 AM - _ /2015 7.30 AM TO 10 AM /2015 7.30 AM TO 10 AM 0/2015 7.30 AM TO 10 AM SUBJECT LOGIC DESCRETE MATHEMATICS COMPUTER GRAPHICS ADVANCED SQL OBJECT ORIENTED PROGRAMMING MODERN OPERATING SYSTEM VICE PRINCIPAL (SELF FINANCE COURSES)

S.Y.S.Se.IT (SEM-III) SUB: COMPUTER GRAPHICS Date: 05.10.2015 MARKS: 75 Duration: 2% Hours Q.1 Answer any TWO of the following questions: [10] (a) What is FPD and explain its different types? Write a note on Cathode Ray Tube. (c) Write the Bresenham's algorithm for drawing a line. (d) Write the Digital Differential Analyzer algorithm. Consider a line AB with A(O, 0) and B(-5, on the line. -5). Apply DDA and calculate the pixels Q.2 Answer any TWO of the following questions: [10] (a) Write a note on 2D scaling and plot the same. Consider line AB with coordinates A(2, 3) and B(4, 5). Perform reflection of the point P about the origin and draw the same. Write a note on 2D rotation and shear transformation and plot the same. (c) Consider a line AB with coordinates A(O, 0) and B(4, 5). Obtain a matrix of transformation for scaling for the line AB in x-direction by the factor 3 and plot the same. (d) Write an algorithm on 2D translation and plot the same..3 Answer any TWO of the following questions: [10] (a) What is a projection? Classify the subclasses of planar geometric projections. Write a note on parallel projection. c rite a note on one-point perspective projections. Tritea note on two-point perspective projections..a.:nsweany TWO of the following questions: [10] at is clipping? Explain Cohen Sutherland Line Clipping 1'gon filling. Explain types of seed-fill algorithms. SYBScIT/CG/l

(c) (d) Explain half toning, thresholding and dithering. Explain aliasing and anti-aliasing. Q.5 Answer any TWOof the following questions: [IOl [a] Explain: (i) Piecewise curve design (ii) Parametric curve design What are Bezier curve? Explain quadratic and cubic Bezier curves. (c) What are B-Spline curves? (d) Write a note on fractal curves. Q.6 Answer any TWOof the following questions: [10] (a) Write a note on Polygon Mesh Shading. Write a note on Phong Shading. Write a note on Coons' patch. (c) Write a note on Shadows and Types of Shadows. (d) Write a note on Texture Mapping. Q.7 Answer any THREEof the following questions: (a) Explain raster scan and random scan displays. Describe Bresenham's circle drawing algorithm. (c) Write a note on orthographic projections. (d) Write a note on Boundary fill algorithms. (e) Write a note on quadric surfaces. (f) Write a note on Ray Casting. [15] YBScIT/ CG/2

S.Y.B.Se.IT (SEM III) B : logic ANO DISCRETE MATHEMATICS (lom) Date: 01.10.2015 _-\11questions are compulsory. igures to the right indicate full marks. empt any TWOfrom the following: Duration: 2% Hours a) Let S = {1,2,3,4,S,6, 7,8} and consider the following collections of subsets of S. (i) Al = {{1,2,3},{3,4,S},{6, 7,8}} (ii) ~ = {{1,2,3},{4,S},{6,7},{8}} (iii) A3 = {{1,2},{3,4,S},{6, 7}} Which of them is a partition of S and why? Also draw diagram.[5] Using the principle of mathematical induction, prove that n 1.3+2.4+3.S+ +n.(n+2)= 6(n+l)(2n+7) [5] (c) Write the negation of (Using the rules of negation) (i) p~(ql\-r) (ii) You will be smart if and only if you are healthy. [5] (d) If S = {a,b,c,d,e,j,g,h}, A = {a,b,c,e}, B = {b,c,d,g}, verify (i) AEBB=(AuB)-(AnB) (ii) A - B = B - A Q.2 Attempt any TWOfrom the following: (a) Find the transitive closure of the relation R = {(1,2),(2,3),(3,4),(4,S),(S,6),(6,1)} using Warshall's algorithm. on A = {1,2,3,4,S,6} [5] Define Partially Ordered set. Consider a set of integer Z. Let arb if b = a r for some positive integer r. Show that (A, Z) is a poset. [5] (c) Define Lattice. If L = {1,2,3,6} and R be the relation "is divisible by", prove that L is Lattice. [5] (d) Let m be fixed positive integer. Two integers a and b are said to be congruent modulo m, written as a == b(modm) if m divides a-b. Show that this relation is an equivalence relation. [5] SYBScITjLDMj 1

Q.3 Attempt any TWOfrom the following: (a) Let f: R ~ Rand f (x) = 2x - 3. Show that the function f (x) is x-i bijective. Also find f- 1 (x). [5] Consider f and 9 are two functions. f: {(1,-1),(2,-2),(3,-3),(4,-4)} g: {(-1,1),(-2,2),(-3,3),(-4,4)} Show that 9 = r'. [5] (c) Function f and 9 are defined as f: R ~ R, g: R ~ R, f(x) = 2x + 3, g(x) = 3x - 4. Find fog, g-l. Verify (fog r 1 = g-10f- 1. [5] (d) Show that if 7 numbers from 1 to 12 are chosen, two of them will add upto 13 (using Pigeonwhole principle). Q.4 Attempt any TWOfrom the following: (a) Construct the tree of algebraic expression (11-(11xll+ll))+(11+(11xll)) [5] Draw binary tree whose resulting string IS abcdefghij after performing a preorder search. [5] (c) Define Eulerian path, Eulerian circuit and Eulerian graph. Show that the graph given by figure is an Eulerian graph. V2 e 2 e V5 ei V3 e 4 e6 e 3 VI V 4 SYBScIT/LDM/2

(d) Show that the graph G I and G 2 are isomorphic. [5] a 1 -,2 bl..----;7 C d 4-----'3 Q.5 Attempt any TWOfrom the folfowing : (a) Define Group. Let G =: {le I le is non zero real number} and a * b = a x b, the usual multiplication. Show that (G,*) IS an abelian group. [5] In a group (G, *), prove that (a- I rl = a a E G. [5] (c) Show that (Z,+,-) is a ring. [5) (d) Show that every field is an integral domain. [5] Q.6 Attempt any TWOfrom the following: (a) Find the formula for the sequence 15,8, 1, -6, -13, -20, -27,. [5] Find the generating function for (i) 3,9,7,81,. (ii) 0,0, 1,2,3,4,. [5] (c) Solve the recurrence relation an = 4an _1 + 5a n_2, al = 2, a2 = 6 [5] (d) Solve the recurrence relation d.; = -3d n _ l - 3d n _ 2 - d n - 3 d l = ~ = 3 d 3 = 7 [5] Q.7 Attempt any THREE from the following: (a) For the two sets A and B, (i) Prove that A x B = ~ if A = ~ or B = ~. (ii) A x B = B x A iff A =: B. [5] SYBScIT/ LDM/ 3

Determine the Hasse diagram of the relation on A = {1,2,3,4,5} 1 0 1 1 1 0 1 1 1 1 whose MR is MR= 0 0 1 1 1 [5] 0 0 0 1 0 0 0 0 0 1 (c) For all x E Rand - -m E Z, prove that Lx + mj = LxJ + m. [5] (d) Show with reason the graph is Hamiltonian but not Eulerian. [5] B C D A L- ~ ~ E F (e) Define monoid. If a * b = a and 8 is the set of all +ve integers Z+ = {1,2,3, } verify whether (8,*) is a semigroup or a monoid. [5] (f) Solve recurrence relation: an = 5an-l, n ~ 0, ao = 1. [5] SYBScIT/LDM/4

S.Y.B.Se.IT (SEM-III) SUB:ADVANCESQl Date: 07.10.2015 MARKS: 75 Duration: 2% Hours Q.1 Answer the following: (Any TWO) [10] (a) Write a Querry to select all records from tables emp and dept. Explain single row functions length and floor. (c) Explain group functions sum and count with a querry. (d) Explain views with an example. Q.2 Answer the following: (Any TWO) [10] (a) Explain Primary Key and Foreign Key. Write a subquerry to select those employees from emp table whose location is DALLASin dept table. (c) Write a querry to find TOP 3 salary using FROM clause. (d) Explain Add_months and Months_between date function using a querry. Q.3 Answer the following: (Any TWO) [10} (a) Explain PLSQL block section. Explain bind variable, display ename m an anonymous block using bind variable. (c) Write an anonymous to display salary and job of employee 'SMITH'. (d) Write an anonymous block to display the Total Salary (Salary + Comm) of employee 'JOHN'. Q.4 Answer the following: (Any TWO) [10] (a) Explain If-Else-Endif control structure with an anonymous block. Write an anonymous block using case statements to display grade 'A' if salary between 30000 and 50000, Grade 'B' if salary between 20000 and 30000, Grade 'C' if salary less than 20000. (c) Using % Row type attribute create a PLSQL block to display Job and empno of ename = SMITH inemp. SYBScIT/ SQL/ 1

(d) Create a PLSQL block to display all the records of dept table (Dname, Loc, Deptno) Q.5 Answer the following: (Any TWO) [10] (a) Explain the difference between anonymous block and stored function. Create a procedure to display empno, salary, comm of employee Ford. c Crea ea. rocedure to display all records in emptable whose dept.0.. 30. (d) Create a function to calculate the total salary of an employee. Q.6 Answer the following questions: (Any THREE) [15] (a) Write a querry to find out difference in salary and comm from emp table. Explain triggers with an example. (c) Explain types of triggers with an example. (d) Create a procedure to truncate a table. (e) Explain package with an example. (f) Create a function to calculate the service tax. SYBScIT/ SQL/2

SUB: S.Y.B.Se.IT (SEM-III) OBJECT ORIENTED PROGRAMMING Date: 09.10.2015 MARKS: 75 Duration : 2% Hours Note: All questions are compulsory. Q.1 Answer any TWOof the following questions: [10) (a) Write down the features of Object Oriented Programming. Explain polymorphism. (c) Explain inheritance with example. (d) Define classes and object. Q.2 Answer any TWOof the following questions: [10] (a) Write down the types of constructor. What do you understand by constructor? (c) Explain static member function. (d) Explain destructor. Q.3 Answer any TWOof the following questions: [10] (a) Explain operator overloading. Write a program to overload assignment operator. (c) Write a program to overload arithmetic plus operator. (d) Explain advantages of overloading. Q.4 Answer any TWOof the following questions: [10] (a) What is inheritance? Write its types. Explain overriding. (c) Explain private, public and protected mode. (d) What is virtual function. Q.5 Answer any TWOof the following questions: [10] (a) What do you understand by stream classes? Explain stream manipulators. (c) What are stream ios flags? (d) Write down the difference between unformatted if 0 and formatted if o. SYBScIT f OOPf 1

Q.6 Answer any TWOof the following questions: [10] (a) Explain templates. Write down the difference between class template and function template. (c) What is function template class? (d) Explain container class. Q.7 Answer any THREEoft following quest.ions : (a) What is abstraction? What do you understand by static data members? (c) Explain abstract base class. (d) What is file handling? (e) What is istream and ostream class? (f) Explain read ( ) and write ( ). [15] SYBScIT / oor /2

S.Y.B.Se.IT (SEM-III) SUB: MODERN OPERATING SYSTEM Date: 12.10.2015 MARKS: 75 Duration : 2Y2 Hours Note: Each question carries 5 marks. Q.l Answer the following questions: (Attempt any TWO) (a) Explain distributed system in detail. What is OS? Explain Batch System with suitable diagram. (c) Explain handheld system in detail. (d) Explain clustered system in detail. Q.2 Answer the following questions: (Attempt any TWO) (a) What is system call? Explain File System of system call. Explain operating system services in detail. (c) What is system structure? Explain layered approach with suitable diagram. (d) Explain virtual machine with suitable diagram. Q.3 Answer the following questions: (Attempt any TWO) (a) List and explain threading issues. What is critical section problem? Explain in detail. (c) What is interprocess communication? Explain direct and indirect communication in detail. (d) What is SJF scheduling? Find average waiting time of the following b>yusmg SJF schedulinz metho d. Process Burst Time PI 24 P2 14 P3 30 P4 10 P5 15 Q.4 Answer the following questions: (Attempt any TWO) (a) Explain virtual memory with suitable diagram. What is paging? Explain with suitable example. (c) What is memory management? Explain segmentation. (d) Consider the following page reference string: 7012030402030302 SYBScITjMOSj 1

How many page faults would occur for the FIFO page replacement algorithm? Remember that all frames are initially empty, so your first unique pages will all cost one fault each. Q.5 Answer the following questions: (Attempt any TWO) (a) What is deadlock? Explain deadlock characterization in detail. What is physical and logical address? Explain segmentation with paging in detail.. (c) What is RAID? Explain RAIDup to two levels. (d) Explain NFS in detail. Q.6 Answer the following questions: (Attempt any TWO) (a) Explain access matrix with suitable diagram. Explain language based protection in detail. (c) Explain principles of protection in detail. (d) What is security? Explain security problem in detail. Q.7 Answer the following questions: (Attempt any THREE) (a) List and explain views of OS. Explain real time systems. (c) What is thread? Explain types of thread. (d) What is operation on processes? Explain process termination. (e) Explain swapping in detail. (f) Explain domain of protection in detail. SYBScIT/MOS/2