Rajasthan Board Class 12 Question Paper 2019 Information Technology and Programming II

Zm_m§ H $ Roll No.

Tear Here
Sl.No. :

No. of Questions – 30
No. of Printed Pages – 07
SS–03–Info.Tech.(Opt.)

Cƒ _mÜ`{_H$ narjm, 2019
SENIOR SECONDARY EXAMINATION, 2019
gyMZm àm¡Úmo{JH$s Am¡a àmoJ«mq‘J - II

TEAR HERE TO OPEN THE QUESTION PAPER
INFORMATION TECHNOLOGY AND PROGRAMMING - II
EopÀN>H$ (Optional)

àíZ nÌ H$mo ImobZo Ho$ {bE `hm± \$m‹S>|
g_` : 3¼ KÊQ>o
nyUmªH$ : 56

narjm{W© ` m| Ho $ {bE gm_mÝ` {ZX} e
GENERAL INSTRUCTIONS TO THE EXAMINEES :
1) narjmWu gd©àW_ AnZo àíZ nÌ na Zm_m§H$ A{Zdm`©V {bI| &
Candidate must write first his / her Roll No. on the question
paper compulsorily.

2) g^r àíZ H$aZo A{Zdm`© h¢ &
All the questions are compulsory.

3) àË`oH$ àíZ H$m CÎma Xr JB© CÎma-nwpñVH$m _| hr {bI| &
Write the answer to each question in the given answer-book
only.

4) {OZ àíZm| _| AmÝV[aH$ IÊS> h¢, CZ g^r Ho$ CÎma EH$ gmW hr {bI| &
`hm± go H$m{Q>E

For questions having more than one part the answers to those
parts are to be written together in continuity.

SS–03–Info.Tech. (Opt.) 1303 [ Turn Over

2
5) àíZ nÌ Ho $ {hÝXr d A§ J « o O r ê$nmÝVa _| {H$gr àH$ma H$s Ìw { Q> / AÝVa / {damo Y m^mg
hmo Z o na {hÝXr ^mfm Ho $ àíZ H$mo ghr _mZ| &
If there is any error / difference / contradiction in Hindi & English
versions of the question paper, the question of Hindi version should
be treated valid.
6) IÊS> àíZ g§ » `m A§ H $ àË`o H $ àíZ
A 1-13 1
~ 14-24 2
g 25-27
28-30
^ 3
4
^
Section Q. Nos. Marks per
question
A 1-13 1
B 14-24 2
C 25-27
28-30
^ 3
4
^
7) àíZ H« $ _m§ H $ 28, 29 d 30 _| AmÝV[aH$ {dH$ën h¢ &
Question Nos. 28, 29 and 30 have internal choices.

IÊS> - A
SECTION - A
1) {H$gr EëJmo[aϑ {H$ g‘¶ O{Q>bVm H$mo n[a^m{fV {H${OE & [1]
Define the time complexity of an algorithm.

2) [a³e©Z H$mo n[a^m{fV {H${OE & [1]
Define recursion.

3) 'C' ^mfm ‘| pñQ´>¨J H$s bå~mB© ‘mnZo Ho$ {bE {H$g ’§$³eZ H$m à¶moJ {H$¶m OmVm h¡ & [1]
Which function is used to measure the length of string in 'C' language?

SS–03–Info.Tech. (Opt.) 1303

3
4) ~mBZar gM© H$s g‘¶ O{Q>bVm ³¶m hmoVr h¡? [1]

What is the time complexity of Binary Search?

5) BZ ßbog gm°{Q>ªJ H$m EH$ CXmhaU Xr{OE & [1]

Give an example of In place Sorting.

6) ñQ>¡H$ H$mo n[a^m{fV {H${OE & [1]

Define the Stack.

7) Breadth first traversal ‘| {H$g S>mQ>m ñQ´>³Ma H$m Cn¶moJ {H$¶m OmVm h¡? [1]

Which data structure is used in Breadth first traversal?

8) C++ àmoJ«mq‘J ^mfm ‘| H$s dS>©g H$mo n[a^m{fV {H${OE & [1]

Define the key words in C++ Programming language.

9) C++ àmoJ«mq‘J ^mfm ‘| new AmnaoQ>a H$m ³¶m à¶moJ h¡? [1]

What is the use of new operator in C++ Programming language?

10) ’§$³eZ àmoQ>moQ>mB©n H$mo n[a^m{fV {H${OE & [1]

Define the function Prototype.

SS–03–Info.Tech. (Opt.) 1303 [ Turn Over

4
11) ’«|$S> ’§$³eZ H$m ³¶m Cn¶moJ h¡? [1]

What is the use of friend function?

12) S>oQ>m BÝQ>r{J«Q>r (Integrity) H$mo n[a^m{fV {H${OE & [1]

Define the data Integrity.

13) ñQ´>³Ma ³¶yar b¢½doO H$m CXhmaU Xr{OE & [1]

Give an example of structure Query language.

IÊS> - ~
SECTION - B
14) EH$ Am¶m‘r Eoao ‘o {H$gr VËd H$s pñW{V H$s JUZm Ho$ {bE gyÌ {b{IE & [2]

Write the formula to find the location of an element in one dimensional array.

15) ñQ>¡{Q>H$ Ed§ S>m¶Zo{‘H$ ‘¡‘moar EbmoHo$eZ ‘o AÝVa ñnï> H$s{OE? [2]

Clear the difference between static and dynamic memory allocation.

16) EZ³¶w AmnaoeZ go Amn ³¶m g‘PVo h¡? [2]

What do you understand by Enqueue operation?

17) C++ àmoJ«m{‘§J ^mfm ‘o AmBS>|Q>r’$m¶a H$mo n[a^m{fV H$aZo Ho$ ³¶m {Z¶‘ h¡? [2]

What are the rules to define identifier in C++ Programming language?

SS–03–Info.Tech. (Opt.) 1303

5
18) BZbmBZ ’§$³eZ H$m ³¶m Cn¶moJ h¡? [2]

What is the use of Inline function?

19) {S>ñQ´>³Q>a go Amn ³¶m g‘PVo h¡? [2]

What do you understand by destructor?

20) Procedural DML Am¡a Non Procedural DML ‘| AÝVa ñnï> H$s{OE & [2]

What is the difference between the Procedural DML and Non Procedural DML?

21) ~hþ‘mZ EQ´>rã¶yQ> ³¶m hmoVm h¡? Xmo CXmhaU Xr{OE & [2]

What is the multivalued attribute? Give two examples.

22) Normalization Ho$ CÔoí¶ ³¶m h¡? [2]

What are the objectives of Normalization?

23) SQL ‘| J«mÝQ> (GRANT) H$‘mÊS> H$m Cn¶moJ ³¶m| H$aVo h¡ & [2]

Why do we use the GRANT Command in SQL?

SS–03–Info.Tech. (Opt.) 1303 [ Turn Over

6
24) {Q´>Ja ³¶m hmoVm h¡? [2]

What is the trigger?

IÊS> - g

SECTION - C

25) 'C' ^mfm ‘| {ZåZ {’$~moZ¡H$s grarO H$mo {à§Q> H$amZo Ho$ {bE àmoJ«m‘ {b{IE - 0 1 1 2 3 5 8 13 21.[3]

Write a Program to print following Fabonici series in 'C' language - 0 1 1 2 3 5
8 13 21.

26) H$m°nr H$ñQ´>³Q>a H$mo CXmhaU g{hV g‘PmB©E & [3]

Explain the copy constructor with the help of example.

27) E~ñQ´>o³Q> ³bmg ³¶m hmoVr h¡? CXmhaU g{hV g‘PmB©E & [3]

What is the abstract class? Explain with the example.

28) Ëd[aV gmQ>© H$mo CXmhaU g{hV g‘PmB©E & [4]

Explain Quick Sort with example.

AWdm/OR

‘O© gmQ>© H$mo CXmhaU g{hV g‘PmB©E &

Explain Merge Sort with example.

SS–03–Info.Tech. (Opt.) 1303

7
29) {ZåZ{b{IV ’§$³eZ H$m SQL ³¶yar {gÝQ>o³g {b{IE & [4]

Write the SQL Query Syntax of following functions.

i) GREATEST

ii) ADDDATE

iii) NOW

iv) COUNT

AWdm/OR
’$moaoZ H$s BÝQ>rJ«rQ>r H$ÝgQ´>oÝQ>g ³¶m h¡? g‘PmB©E &
What are the foreign key Integrity Constraints? Explain.

30) 3NF ³¶m hmoVr h¡? [aboeZ ñH$s‘m Ho$ 3NF ‘| hmoZo H$s Amdí¶H$ eV© {b{IE & [4]

What is 3NF? Write the necessary condition for relation schema to be in third
Normal form.

AWdm/OR
E-R ‘mS>b Ho$ {d{^ÝZ KQ>H$mo H$mo {MÌ Ho$ gmW g‘PmB©E &

Explain the different components of E-R Model with suitable diagram.

ssss

SS–03–Info.Tech. (Opt.) 1303

E
ER
H
NG
I
TH
NY
A
TE
RI
W
O T
N
DO