NIRMAL HAPPY SR. SEC.

SCHOOL
PRE BOARD PAPER
Class – 12th
Time :- 3:15 H. Subject:- Computer Marks:- 80

Section - A
Q.1 cgqfodYih iz’u (Multiple Choice Question)
(i) File esa String dh List fy[kus ds fy, fuEu esa ls dkSulk Function Use fd;k tkrk gS &
(a) Write ( ) (b) Writeline ( ) (c) Writelines ( ) (d) Write (oll)
(ii) Stack ,d linear Data structure gS &
(a) True (b) False (c) Zero (d) None of the above
(iii) Data structure stack dks fdl list ds :i esa tkuk tkrk gSA
(a) first in first out (b) First in last out (c) last in last out (d) both (a) & (b)
(iv) ,d Queue esa insertion ------------ ds Nksj (end) ij gksrk gSA
(a) front (b) Top (c) rear (d) Any
(v) Exception object create djus vkSj mls run time system dks handle djus dks process dgk tkrk gS &
(a) catching exception (b) raising exception (c) throwing exception (d) asserting exception
(vi) Local vkSj Global variable dks define ugha fd;k tkrk gS] rc fdls raised fd;k tkrk gS &
(a) Name error (b) Type error (c) Value error (d) Zero division error
(vii) fuEu esa ls dkSulh searching algorithm fast gS &
(a) Binary search (b) linear search (c) Hash search (d) Both (a) and (b)
(viii) Insertion sort algorithm dh lcls [kjkc fLFkfr esa time complexity D;k gksxh] ;fn input esa vf/kdre n O;qRØe ds lkFk 1 ………….. n ds Øe ifjorZu
rd lhfer gS &
(a) 𝜃 𝑛2 (b) 𝜃 𝑛 log 𝑛 (c) 𝜃 𝑛1.5 (d) 𝜃 𝑛
(ix) fuEu esa ls dkSulk Storage device gS &
(a) HDD (b) SSD (c) DVD (d) All of these
(x) og Data ftls vPNs rjhds ls Tablvar ¼ifjHkkf"kr½ Formate esa Store fd;k tkrk gS] mls dgk tkrk gS &
(a) Structure Data (b) Semi-Structure Data (c) Unstructure Data (d) None of the these
(xi) DBMS ls igys lwpukvksa dks dgkW ij Store djds Use fd;k tkrk FkkA
(a) Data system (b) Memory system (c) Drive (d) File system
(xii) Table ls common typies dks izkIr djus ds fy, fdldk Use fd;k tkrk gS &
(a) Attribute (b) R DBMS (c) Foreigo key (d) Intersection
(xiii) CSV dk iwjk uke D;k gS &
(a) Comma separted files (b) Comman separted value (c) Comma separted value (d) Comma separation value
(xiv) Data transfer rate esa BPS dk D;k vFkZ gksrk gS &
(a) Byte per second (b) Bytes per second (c) Bits per second (d) Binary per second
(xv) Hub dk Use fd;k tkrk gS &
(a) Data transfer to all computer (b) Data transfer to selected computer
(c) Both (a) and (b) (d) Hevristics
(xvi) Malware dk irk yxkus ds fy, antivirus }kjk Use dh tkus okyh invalid method gS &
(a) Send box detection (b) Firewall (c) Data mining technique (d) Hevristics
Q.2 fjDr LFkku dh iwfrZ djks &
(i) Fornt dk iz;ksx Queve ds ------------- dks n’kkZus ds fy, fd;k tkrk gSA
(ii) -------------- rc mRiUu (raised) gksrk gS] tc vuqjksf/kr (requestal) module dh ifjHkk"kk ugha feyrh gSA
(iii) -------------- search fdlh Hkh element dks NksMs fcuk ,d ckj esa ,d list ds element dh tkWp djrk gSA
(iv) -------------- ,d program dk laxzg gS] tks database dk mi;ksx o maintain djus ds fy, Users dks cukrk gSA
(v) -------------- sorting algorithm input list esa element ds sequence ij lcls de /;ku nsrk gSA
(vi) -------------- dk Use table ds chp relations dks n’kkZus ds fy, fd;k tkrk gSA
(vii) Website dks fn;k x;k uke ------------- dgykrk gSA
(viii) Wireless network esa ------------ switching dk Use fd;k tkrk gSA
(ix) FTP dk iwjk uke gS ----------------
(x) Delete gksus ds ckn nksckjk cuus okyh cookies dks --------------- dgk tkrk gSA
Q.3 vfry?kwÙkjkRed iz’u &
(i) Paise statemtent dk D;k mi;ksx gS \
(ii) Transmission media D;k gksrk gSA
(iii) Seek ( ) method dk Use vkSj Syntax fy[ksaA
(iv) Python esa IO Exception error dks dSls idMsA
(v) SQL esa ge Update Statement (commond) dks dc iz;ksx esa ysrs gSA
(vi) Database schema D;k gS \
(vii) Selection sorting D;k gksrh gS \
(viii) fdlh d{kk esa Nk=ksa dh ÅWpkbZ ls-eh- (C.M.) esa nh x;h gS [ 90, 20, 0, 5, 85, 90, 00, 10] Nk=ksa dh ÅWpkbZ dk vkSlr (average) Kkr dhft,A
Section - B
Q.4 Finally clause dk D;k mi;ksx gS \
Q.5 Write ( ) o Writelines ( ) method dks mnkgj.k lfgr le>kb,A
Q.6 Queue o Stack esa vUrj dhft,A
Q.7 Queue o Deque esa D;k varj gS] Li"V dhft,A
Q.8 ,d list dks vojksgh Øe (descending order) esa Øec) djus ds fy, Bubble sort dk Algorithm fy[ksA
Q.9 Linear search dks mnkgj.k lfgr ifjHkkf"kr dhft,A
Q.10 Data collection D;k gksrk gS \
Q.11 fuEu dFkuks (Statement) ds lewg esa varj crkb, &
(a) and (b)
(a) P = Open (“Practice – text”, “r”) as P :
P. read (10)
(b) With open (“Practice.txt”,:r”) as P :
X = P.read ( )
Q.12 Cookies D;k gksrh gS \
Q.13 ,d lIrkg ds lkr fnu dk rkieku ¼lsfY;;l esa½ 34, 34, 34, 27, 28, 27, 34, 34 fn;k x;k gSA bl rkieku dk ek/; (mean), ekf/;dk (median) o
cgqyd (mode) Kkr djsaA
Q.14 PPP ij laf{kIr fVII.kh dhft,A
Q.15 Single Row function vkSj Aggegate function esa dksbZ rhu varj crkb,A
Section - C
Q.16 Stack on impliement dks le>kb,A
vFkok
fuEufyf[kr Infix notation dks izR;sd Step esa Stack vkSj String lkexzh fn[kkrs gq, Postfix notation esa Convert djsaA
(a) A + B – C * D (b) A * ((C+D))/E
Q.17 Queue on impliemention dks Li"V dhft,A
vFkok
Deque ds cqfu;knks Operation dks foLrkj ls le>kb,A
Q.18 Insertion sort dks Program lfgr Li"V dhft,A
vFkok
Selection sort, insertion sort o Bubble sort rhuksa esa varj dks foLrkj ls Li"V dhft,A
Q.19 ,d numlist esa 7 element gS [8, -4, 7, 17, 0, 2] bl numlist esa gesa 17 search djuk gSA Linear search Algorithm dk iz;ksx djrs gq, blds Step fy[ksaA
vFkok
Algorithm dh Time Complexity dks foLrkj ls le>kb,A
Q.20 DBMS dh eq[; vo/kkj.kk (Key concept) dk o.kZu dhft,A
vFkok
File system dks Li"V djrs gq, blds Disadvantage fy[ksA