Total No. of Questions : 4] SEAT No.

8
23
PB36 [6268]-230
[Total No. of Pages : 1

ic-
tat
S.E. (Information Technology) (Insem)

6s
DATABASE MANAGEMENT SYSTEM

7:0
(2019 Pattern) (Semester - IV) (214452)

02 91
3:3
Time : 1 Hour] [Max. Marks : 30

0
41
2/0 13
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4.
0
2) Neat diagrams must be drawn wherever necessary.
3/2
.23 GP

3) Figure to the right indicates full marks.

4) Assume suitable data, if necessary.
E
82

8
C

23
Q1) a) Explain Advantages of DBMS over file processing systems. [5]

ic-
16

tat
8.2

b) Explain concept of Data abstraction in detail with diagram. [5]

6s
.24

7:0
91
c) Explain different keys with example. [5]
49

3:3
30
41

OR
01
02

Q2) a) Explain overall structure of DBMS with diagram. [7]

3/2
GP

b) Write note on: [8]

2/0

i) DDL
CE
82

8
ii) DML

23
.23

ic-
16

tat
Q3) a) List and explain Components of ER model. [6]
8.2

6s
.24

7:0

b) What is domain explain with example in DBMS. [4]

91
49

3:3
30

c) Write a note on views. [5]

41

OR
01
02

Q4) a) Explain all Codd’s rules in detail. [6]

3/2
GP
2/0

b) Explain with example concept of naming convention. [5]

CE
82

c) Write a short note on Referential integrities. [4]

.23
16
8.2

… … …
.24
49

[6268]-230 1
Total No. of Questions : 4] SEAT No. :

8
23
PA-4981 [Total No. of Pages : 1

ic-
[6008]-233

tat
S.E. (Information Technology) (In Sem)

8s
DATABASE MANAGEMENT SYSTEM

9:4
02 91
(2019 Pattern) (Semester-II) (214452)

5:0
0
31
Time : 1 Hour] 6/0 13 [Max. Marks : 30
Instructions to the candidates:
0
4/2
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4.

2) Neat Diagrams must be drawn wherever necessary.
E
80

3) Figures to the right indicates full marks.

8
C

23
4) Assume Suitable data if necessary.

ic-
16

tat
Q1) a) Define: Super key, candidate key, primary key, secondary key, foreign key.
8.2

8s
[5]
.24

9:4
b) Differentiate between logical data independence and physical data
91
49

5:0
independence. [5]
30
31

c) Explain various function of each types of database user. [5]

01
02

OR
4/2

Q2) a) Draw, list and explain different component of database system architecture.
GP

[7]
6/0

b) Write note on : [8]

CE
80

8
23
i) Data Abstraction
.23

ic-
ii) Data Modeling
16

tat
8.2

8s

Q3) a) List and explain (Any 5) codd’s Rule. [6]

.24

9:4

b) What are the different type of Attributes? [4]

91
49

5:0

c) Write a note on converting ER diagrams into tables. [5]

30

OR
31

Q4) a) List E-R diagram symbol & draw an E-R diagram for hospital
01
02

management system with set of patient and set of medical doctors.

4/2
GP

Associate with each patient a log of the various test and examination
6/0

conducted. [6]
CE
80

b) Explain with example Schema Diagram. [5]

.23

c) Write a short note on Enterprise constraint. [4]

16
8.2


.24
49

P.T.O.
Total No. of Questions : 4] SEAT No. :

8
23
PB37 [Total No. of Pages : 1

ic-
[6268]-231

tat
S.E. (Information Technology) (Insem)

7s
COMPUTER GRAPHICS

0:3
(2019 Pattern) (Semester - IV) (214453)

02 91
4:0
Time : 1 Hour] [Max. Marks : 30

0
41
6/0 13
Instructions to the candidates:
1) Answer Que.1 or Que.2, Que.3 or Que.4.
0
2) Neat diagrams must be drawn wherever necessary.
3/2
.23 GP

3) Figures to the right indicate full marks.

4) Assume suitable data, if necessary.
E
82

8
C

23
Q1) a) Consider a line from A (10, 10) to B (18, 15). Use Bresenham’s line

ic-
drawing algorithm to rasterize the line from A to B. Draw the pixel wise
16

tat
rasterization of Line. [8]
8.2

7s
b) What is computer graphics? Explain the concept of display file structure.
.24

0:3
[7]
91
OR
49

4:0
Q2) a) Consider a line from P (2, 3) to Q (7, 11). Use DDA line drawing
30
41

algorithm to resterize the line from P to Q. Draw the pixel wise rasterization
01
02

of Line. [8]
3/2
GP

b) What is aliasing and anti-aliasing? How aliasing effect is removed in vector

6/0

generation algorithm. [7]

CE
82

8
23
Q3) a) What are the steps involved in scan line polygon filling algorithm. [8]
.23

ic-
b) Apply the shearing transformation to square with given coordinates below.
16

tat
[7]
8.2

7s

A(0, 0), B(0, 3), C (3, 3), D (3, 0)

.24

0:3

i) Shear Parameter value of 0.7 relative to the line Y_ref = --1.

91
49

ii) Shear Parameter value of 0.7 relative to the line X_ref = --1.
4:0

OR
30
41

Q4) a) Apply following transformations on polygon A (10, 10), B (20, 40),

01
02

C (50, 40) D (40, 0) [8]

3/2
GP

i) Translation 10, 20 units along X & Y directions.

6/0

ii) Rotate 45 degrees about the origin.

CE

iii) Reflection against X-axis.

82

b) Explain concave and convex polygon with diagram. Explain even-odd

.23

method for testing a pixel inside or outside the polygon. [7]

16
8.2

  
.24
49

[6268]-231 1
Total No. of Questions : 4] SEAT No. :

8
23
PA-4982 [Total No. of Pages : 2

ic-
[6008]-234

tat
8s
S.E. (Information Technology) (Insem.)

7:0
COMPUTER GRAPHICS

02 91
5:1
(2019 Pattern) (214453) (Semester - II)

0
31
8/0 13
Time : 1 Hour] [Max. Marks : 30
0
4/2
Instructions to the candidates:
.23 GP

1) Answer Que 1 or Que 2, Que 3 or Que 4.

2) Neat diagrams must be drawn wherever necessary.
E
80

8
C

23
3) Figures to the right indicate full marks.

ic-
4) Assume Suitable data, if necessary.
16

tat
8.2

8s
Q1) a) Consider a line from A (5,7) to B (10, 15). Use DDA line drawing algorithm
.24

7:0
to rasterize the line from A to B. Draw the pixel wise rasterization of Line.
91
49

[8]
5:1
30
31

b) Explain display file structure. Why is display file interpreter used? Which
01

are the commands used in display file interpreter. [7]

02
4/2
GP

OR
8/0

Q2) a) Explain Mid-point circle drawing algorithm? List its advantages and
CE
80

8
disadvantages over DDA circle drawing algorithm. [8]

23
.23

b)
ic-
What is aliasing and anti-aliasing? How aliasing effect is removed in vector
16

tat
generation algorithm? [7]
8.2

8s
.24

7:0
91
49

5:1

Q3) a) Apply the shearing transformation to square with A (0, 0), B (1, 0), C(1, 1),
30

D(0, 1) as given below. [8]

31
01
02

i) Shear Parameter value of 0.5 relative to the line Y_ref = –1.

4/2
GP

ii) Shear Parameter value of 0.5 relative to the line X_ref = –1.
8/0

b) Explain concave and convex polygons with diagrams.

CE
80

Explain even-odd method for testing a pixel inside or outside the polygon.
.23
16

[7]
8.2

OR
.24
49

P.T.O.
Q4) a) Perform a 450 rotation of triangle A (0,0), B( 1,1), C (5,2) [8]

8
23
i) About the origin (0,0)

ic-
tat
ii) About P (–1, –1)

8s
b) What are the steps involved in filling polygon in scan line algorithm? [7]

7:0
02 91
5:1
0


31
8/0 13
0
4/2
.23 GP
E
80

8
C

23
ic-
16

tat
8.2

8s
.24

7:0
91
49

5:1
30
31
01
02
4/2
GP
8/0
CE
80

8
23
.23

ic-
16

tat
8.2

8s
.24

7:0
91
49

5:1
30
31
01
02
4/2
GP
8/0
CE
80
.23
16
8.2
.24
49

[6008]-234 2