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| &
For questions having more than one part the answers to those parts are to be written together in continuity.
TEAR HERE TO OPEN THE QUESTION PAPERàíZ nÌ H$mo ImobZo Ho$ {bE `hm± \$mS>| go H$m{Q>E
C _mÜ`{_H$ narjm , 2018
SENIOR SECONDARY EXAMINATION, 2018
gyMZm àm¡Úmo{JH$s Am¡a àmoJ«mqJ - II
INFORMATION TECHNOLOGY AND PROGRAMMING - II
EopÀN>H$ (Optional)
g_`
: 3¼KÊQ>o nyUmªH$
: 56Tear Here
SS03Info.Tech.(Opt.)
No. of Questions 30 No. of Printed Pages 07
Roll No.
Zm_m§H$
Sl.No. :
5) àíZ nÌ Ho$ {hÝXr d A§J«oOr ê$nmÝVa _| {H$gr àH$ma H$s Ìw{Q> / AÝVa / {damoYm^mg hmoZo 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$ àË`oH$ àíZ
A 1-13 1
~ 14-24 2
g 25-27 3
28-30 4
Section Q. Nos. Marks per
question
A 1-13 1
B 14-24 2
C 25-27 3
28-30 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) Zm°Z {b{Z¶a S>mQ>m ñQ´>³Ma H$mo n[a^m{fV {H${OE& [1]
Define Non linear data structure.
2) Malloc ¡moar §$³eZ H$m {gÝQ>o³g {b{IE& [1]
Write Syntax of Malloc Memory function?
3) Ëd[aV gm{Q>ªJ H$s g¶ O{Q>bVm ³¶m hmoVr h¡? [1]
What is the time complexity of Quick Sort?
^ ^
^ ^
4) ³¶w H$mo n[a^m{fV {H${OE& [1]
Define queue.
5) qb³S> {bñQ> Ho$ H$moB© Xmo ZwH$gmZ ~VmB©E& [1]
Give any two disadvantages of Linked list.
6) qb³S> {bñQ> Ho$ {d{^Þ àH$ma ~VmB©E& [1]
Give different types of Linked list.
7) DDL H$mo n[a^m{fV {H${OE& [1]
Define DDL.
8) H¡$ÝS>rS>oQ> H$s ³¶m hmoVr h¡? [1]
What is Candidate Key?
9) dbms_output.put_line ZmH$ {ZX}e H$m Cn¶moJ ~VmB©E& [1]
What is the use of dbms_output.put_line?
10) SQL | NOW() §$³eZ H$m Cn¶moJ ³¶m h¡? [1]
What is the use of NOW() function in SQL?
11) Am°naoQ>a Egmo{gE{Q>{dQ>r ³¶m h¡? [1]
What is operator associativity?
12) C++ | new Am°naoQ>a H$m ³¶m Cn¶moJ h¡? [1]
What is the use of new operator in C++?
13) C++ | E³gog mo{S>$m¶a ³¶m hmoVm h¡? [1]
What is access Modifier in C++?
IÊS> - ~ SECTION - B
14) E-R AmaoI | dZ Qw> ¡Zr gå~ÝY H$m ³¶m AW© h¡? [2]
What is the meaning of One to Many relationship in E-R diagram?
15) gmYmaU Am¡a gJ« EQ´>rã¶wQ> | AÝVa ~VmB©E& [2]
Differentiate between Simple and Composite attribute.
16) S>mQ>m~og {S>OmBZ Ho$ MaUm| H$mo {b{IE& [2]
Write the steps to design a database.
17) PL/SQL | SET Serveroutput ON H$m ³¶m Cn¶moJ h¡? [2]
What is the use of SET Serveroutput ON in PL/SQL?
18) ñnog O{Q>bVm ³¶m h¡? BgH$s JUZm H¡$go H$s OmVr h¡? [2]
What is Space Complexity? How can we calculate it?
19) Xmo Am¶mr Eoao | nVm JUZm H$mo gPmB©E& [2]
Explain the address calculation in 2-D array.
20) ñQ>¡H$ Ho$ ~w{Z¶mXr Am°naoeZ ~VmB©E& [2]
Explain the basic operations of stack.
21) AS>pßQ>d d Zm°Z-AS>pßQ>d gm°{Q>ªJ EëJmo[aÏ | AÝVa ~VmB©E& [2]
Differentiate between Adaptive and Nonadaptive Sorting algorithms.
22) ñQ>o{Q>H$ S>oQ>m ¡å~ag H$s {deofVmE§ ³¶m h¡? [2]
What are the features of Static data Members?
23) ³bmg Ho$ ¡å~a §$³eZ H$mo E³gog H$aZo Ho$ {bE àmê$n {b{IE& [2]
Write the syntax for accessing the Member function of a class.
24) Amn §$³eZ AmodabmoqS>J go ³¶m gPVo h¡? [2]
What do you understand by function overloading?
IÊS> - g SECTION - C
25) M¶Z gm°Q>© H$mo CXmhaU g{hV gPmB©E& [3]
Explain selection sort with example.
26) H$mb ~mB© ao$a|g go Amn ³¶m gPVo h¡ CXmhaU g{hV gPmB©E& [3]
What do you understand by call by reference? Explain with example.
27) {ZåZ S>mQ>m~og {dgJ{V¶mo H$mo gPmB©E [3]
H$) AnS>oQ>
I) BÝgg©Z J) {S>{beZ
Explain following database anomalies a) Update
b) Insertion c) Deletion
28) O© gm°Q>© H$mo CXmhaU g{hV gPmB©E& [4]
Explain Merge Sort with example.
AWdm/OR
'C' | [aH$e©Z H$mo CXmhaU Ho$ gmW gPmB©E&
Explain recursion in 'C' with example.
29) SQL | Amn AJ«rJoQ> §$³eZ go ³¶m gPVo h¡ AJ«rJoQ> §$³eZg H$mo {ZåZ ñH$sm Ûmam gPmB©E&[4]
Teacher (T.name, salary, age, dob)
What do you understand by aggregate function in SQL? Explain aggregate function on following Schema.
Teacher (T.name, salary, age, dob)
AWdm/OR
{ZåZ H$mo E-R AmaoI | gPmB©E&
H$) S>amB©dS> EQ´>rã¶yQ>
I) nmQ>u{gnoeZ H$ÝgQ´>oÝQ>
J) H$s H$ÝgQ´>oÝQ>
Explain following in E-R diagram : a) Derived attribute
b) Participation constraints c) Key constraints
30) ëQ>rnb BZho[aQ>|g H$mo CXmhaU g{hV gPmB©E& [4]
Explain Multiple Inheritance with example.
AWdm/OR
C++ | H§$ñQ´>³Q>a AmodabmoqS>J H$mo gPmZo Ho$ {bE EH$ àmoJ«m {b{IE&
Write a C++ Program to explain Constructor overloading.
