. .. ... .. ... . . .. . .. .......

' ' [Link]. ·CSIT ·Entrance ·

MODEL QUESTIONS COLLECTION
2019;

Asst. ]Prof. Nawaraj Paudel

OurTeam HOD, CDCSIT,TU
Advisor
Asst. Prof. Nawaraj Paudel
Advisor

Pran1p Gunmg
Prarup Gurung
President Presedent SACS
Chief editor
Puran Adhikari
Vice President

Omkar Basnet Editors

Secretary Puran Adhikari
Omkar Basnet
Krishncl Bhandari Krishna Bhandari
Vice Secretary Chaturanand Yadav
GudduKumar
Anmol Shrestha
Treasurer
Layout & Design
Members [Link]
Anuj Shrestha
Bikash Gyawali
Devananda Yadav
Jiwan Dhungel
Prashant Gautam
Pusmita. Shrestha ©: SACS 2018-19
 ◄

Questions Structure

Set A - Computer

Four questions from each subject and one mark for each question

1. Introduction to Information Technology

2. C Programming
3. Discrete Structure
4. Data Structures and Algorithms
5. Digital Logic
6. Microprocessor
7, Computer Architecture
8. Operating Systems ·
9. Object Oriented Programming Language
10. Numerical Methods
11. Database Management Systems
12. Computer Graphics
13. Automata Theory
14. System Analysis and Design
15. Simulation and Modeling
16. Artificial Intelligence
17. Computer Networks
18. Design and Analysis of Algorithms
19. Compiler Design and Construction
20. Web Technology

I
Set B - Mathematics ,
I

Ten questions from each subject and one mark for each question

1. Linear Algebra
2. Calculus .ind An;ilytlcal Geometry
 R [Link].

Tribhuvan University
Institute of Science and Technology
Central Department of Computer Science nnd Information Technology
[Link]. CSIT Entr:rnce Enmination, January 22, 2016
Full Marks: 100 Time: 2 Hrs
Pass Marks: 35
j
Attempt all questions. Please Tick/Encircle the ct,rrect answer. Any omission or correction
to the answers is not allowed.

I. Regular expression are ..........................

a Type O language
.b. Type 1 language
c. Type 2 language
d. Type 3 language
2. Which of following is true .........................
a. Tape ofTuring Machine is finite whe 1 language is regular
b. Tape of Turing Machine is infinite regardless of language
c. Tape of Turing Machine is infinite when the language i's not regular
d. Turing Machine is same as Linear Bound Automata.
3. A PDA is deterministic if ...........................
a. For any q E Q' a E E u {C} ' X E r, the set o( q, a, Xhas at most one
element.

b. For any q E Q, XE f, irc5(q, Ci :r) f- 0, then 6 (q, a, :r) = 0 for

every a E E.
c. both a and b holds true
d. it has one final state F
4. TI1e grammar S - aSa I bSb In I b generates ....................... over {a, b}
a. All palindromes starting with a and ending with a.
b. All odd length palindromes.
c. All strings starting with n and ending with b
I
d. All even length palind�omes.
1
 Roll, Uo,

5. Natural Language Processing is can be divided into ............ ...... ..

a. semantics and pragmatics
b. generation and understanding
c. recognition and synthesis
d. context and expectations
6. In Baye's theorem, what is the meant by P(HilE)? \
a. The probability that hypotheses Hi is true girn evidence E
b. The probability that hypotheses Hi is false given evidence E
c. The probability that hypotheses Hi is true giyen false evidence E
d. l11e probability that hypotheses Hi is true given un~xpected evidence E
7. . ............... represents a transfer of physical location of an object in conceptual
. 1
dependencies
.. .
a. ATRANS
b. PROPEL
c. PTRANS
d. MTRANS
8. A search method that examines the values associated with the immediate successor nodes
and goes to the node if the successor has the better value than itself is .................... .
a. minimax Search
b. A• Search
c. Depth First Search
d. hill-climbing Search
9. In CRT, which of following is correct ...... .... ...... ...... .
n. electron gun focuses the beam of electrons on the screen
b. inside front surface is conted with phosphors
c. control electrode is used to tum the electron beam on and off
d. All of above
I0. Coordinates of viewport arc known as .........................
n. World coordinates
b. Polar coordinates
I
2 \
I

I
 Roll. No.

c. Screen coordinates
d. Cnrtesinn coordinates
11. ...................... datn structure is used to identi fYthe vertices for each polygon edge.
a. Edge table
b. Vertex table
c. Polygon table
d. Surface table
12. The transfonnation in which the dimension of an object nre changed relative to a
specified fixed point is called ........................ .. •
a. Rotation
b. Scaling
c. Reflection
d. Translation
13. Consider the following entries in a Cascading Style Sheet (CSS) file;
P (color: blue; background-color: white; border-color: red; bordcr-lcfl: solid)
BODY (color: black; border-color: green)
What is the color of text in a p~agrnph of an ·;rML document that uses the above style
I
sheet? 1

a. green
b. blue
c. black
d. red
14. XML documents are validated against ........................... .
a. XSD
b. OTO
c. Both a & b
d. XSLT
15. Repeater Control consist of ....................... .
a <HeaderTemplate>, <Item Template> and <FooterTcmplatc>
b. <HeaderTemplate> or <ItemTemplate> or <FooterTemplate>
c. <HeaderTemplate> or <Item Templat,:>

3
 .
Roll. No.

d. <FoolcrTcmplatc>
I6. Whal will be the output of the following script?
<html>
<head><title>.lavaScript</title><n1ead>
<body>
<script language="JavaScript">
var a=70
var b=(a=80? "pass" :"fail");
[Link](b)
</script>
</body>
</html>
a. fail
b. null
C. 80
d. pass

17. lfAa= [
cosa sin
.
-sma cosa
a] .
thenA,,xAplS ........... .. .... .... ... .

n. A .fl 11

b. A,,-fl

d. None of these /
18. The necessary and sufficient condition that a square matrix A lrns an inverse is that ... .. ..
I
a. IAl=O
b. INIO
c. A=l
d. None of these
19. IA-,HI =0 is cnlled as
a. Characteristic equation . i

h. Characteristic Vector

4
 Roll. No.

c. Characteristic Matrix
d. None of these
3
20. For what values of k will then vector (I, k, !;) in R is n linear combination of (I, .3 1 2)
and (2, -2, 1)?
a -5
it should be 2, -1 ,1
b. 6
vector(..) = a(..)+b(....)
C. -8
d. JO
21 . The dimension of the vector space of all 2 x ~ matrix over R is ·························
a. I
b. 3
c. 2
d. 4
22. Every finite dimensional non zero vector spac:e has
a. Linearly independent vectors
.b. lineariy dependent vectors vector = 0 is linearly dependent
c. orthogonal basis
d. none of these
23. Let V and W be vector space over K.T: V-•W be: a linear map. Then T is surjective if
and only if ..... ................... .
a KerT=0v
b. KerT=0w
c. lmT=W
d. lmT=V
24. A set of orthonomrnJ basis is
a. Linearly dependent
b. Linearly independent
c. Neither Linearly dependent nor Linearly independent
I

d. None of these ,
I
25. The collection of all eigenvectors v e Vsuch that T(v) = ,lv is called ..... ....... ... .... . .
'
a. Eigen values

5
 ..
Roll. No.

b. Eigen vectors
c. Eigen space
d. None of these

[Link] A=[~ ~] and x=(~ ~) what is LA(X)?

n. ( =;)
b. (;,)

C. (~) I
I

d. (:] j

27. The eccentricity of the ellipse (x-!,):? + IS .. .. .. . ... . . . . . .. .. . ... .

a·
a. b2=n2( 1-e2)
b. b2=a2( e2- I)
eccentricity e = undrroot 1- b^2/a^2
c. ,i2=b:?( 1-e2)
d. b2=a:?( 1-e2)

28. The value of the integral Jsin: xd-c is .... ................ .. .. .

n

,r
a. -
4
,r·'
b.
4
C. ,r

d. 0
29. The gcncrnl solution of (D:? + l)y = sin x is ............... ....... .. .

. X
a, y = acosx+ bsmx--cosx
2

6
 Roll. No,

. 1 X
b. y=acosx+bsmx+2cos

• X
C. .v= acosx-bsmx--cosx
2

d. None
dy .
30. The solution of tanx d-c + )' = secx is ········ ················
a ysinx=x+C

b. ysinsx=x+C

c. .vcosx = x+C
d. None
(n 2 + 1) .
31 The value of lim ___..;--- 1s ................ ... .... ..
• "➔"' (n + l)(n + 2)
iI
l
a. 0
I b. -
2
C. l
\
d. 2
32. Every absolutely convergent series is .......... ............ ...
a. Divergent
b. Neither Convergent nor Divergent
c. Convergent
d. None

33. What is the value of improper integral _.:!:-

1
J?
1 (I +J')2
r
l I
l a. -
3
I
I
1
b. ✓3
lI
2
C. ✓J

--· ---
 Roll. No.

d. 4
2 I
34. The value of the integral f f,,J dx~ is ....................... ..
1 1

0 0

a. I
b. 2
C. 3
d. 4
35. If 11 = /(x.y)thcn its totnl differcntinl is
a. du= .fudx+ fi,_dy

h. du= /.,dx+ f,dy

c. du= .f.d,; + /,.dy

d. None

36. i = j = k is equnls .. ................... .. ..

a. 0
b. -I
C, I
d. 2
37. Which of following is valid variable declaration?
a. int a. b; c;
b. int a; b; c;
c. int a, b, c;
d. int a. b, c,
38. How m:my times "Tribhuvnn University is get printed?
I
#inlcude<stdio.h>
int main()

int x;
for (x=-1; x< IO; x++)

8
 - ----:

Roll. No.

continue;
else
brea~
I
printf("Tribhuv:m Uninversity");

return O;

n. 0 times
b. 10 times
c. 11 times
d. Infinite times
39. Which of the following is the correct order ol evaluation for the below expression?
z=x + y • z I 4 % 2 - I
n. •!%+-=
b. = • /%+-
c. I•%-+=
d. • ¾ /. + =
40. How will you free the allocated memory ............ ........... .
a. remove (var-nnme);
b. free(var-namc);
c. ddete(var-narne);
d. dalloc(var-narnc);
41. Which of following is the application layer p1 otocol'l
n. HTTP
b. FTP
c. SMTP
d. All of the above
42. Which is the following layer of TCP/IP s concerned with addressing nnd routing
messages?
a. Application Layer
b. Transport Layer

9
 [Link].

c. Internet Layer
d. Network Access Layer
43. What is the default subnet mask for a class C network?
a. 127.0 0.1
b. 255.0 0.0
C. [Link]
d. [Link]
44. What device separntes a single network into two segments but lets the two segments
appears as one to higher protocols?
o. Switch
b. Bridge
c. Gateway
d. Router
45. Which or the following is not a level of data abstrac!ion?
n. Physical Level /
b. Critical Level
c. Logical Level
d. View Level
46. In an entity relationship diagram, dashed ellipse represents ............... .. ....... .
n. Multi-valued Attribute
b. Derived Attribute
c. Composite Attribute
d. Descriptive Attribute
47. Which or the following is high level dota model?
n. Relationnl Model
b. Ohjcct Oriented Model
c. Entity Relntionship Model
d. Ohjcct Rclu'tionnl Model
48. Dcfarcd updntc is also known as .. ... ....................
n. UNDO/REDO algorithm
h. UNDO/NO-REDO algorithm

10
.,.
 Roll. No.

c. NO-UNDO/REDO algorithm
d. Both ll ond b
49. Standard TTL has a multiple emitter input tra1sistor and a ............ output
a. totl!m-pole
b. bipolar
c. register
d. transistor
50 lnsiead of counting witl1 binary numbers, a ring counter uses words that have a .
· single
high.......... .. .
a bytes
b. bit
c. gate
d. chip
I
51 . which logic family dissipates the minimum power?
n. DTL I
b. TTL
C. ECL
d. CMOS
52. A logic circuit which !s used to change a BCD numbers into an equivalent decimal
numbers is.
a. decoder
b. encoder
c. multiplexer
d. demultiplexer
5°3. Wlwm:ver the POP H instruction is executed, .. ...... .... ...... ..... ..
A. data bytes in the HL pair are stored on the stock
0. two data bytes at the top of the stack uri= trunsfared to the HL register puir
C. two data bytes 01 the top of the stack ore trw1sferrcd lo the program counter
D. two data bytes from tltt! HL, register lhnt were previously stored on the stack rue
transferred back to the HL register.
54. TI1e next address generator is sometime cnllcd n .... ...... ........ .... .. .

11
 [Link]

A. Instruction sequence
B. program sequence
C. microprogram sequence
D. Translator
55. The stack organized computer has • , • • •••• ". t • •• ••••• • •• • • •

A. three- nddress instruction

B. two-address instruction
C. one-nddress instruction
D. zcro-nddress onstrnction.
56. Microprocessor is n device which has at least
A. Memory
B. 1/0 devices
C. registers
D. CPU
57 .. .... ..... .. ..... .. .... .... ... model randomly generates the time lh:it elapses until the next
event occurs.
A. previous event increment
13 just in time
C. next event increment
D. real time
58. Simulnlion nlwnys refers to
A. building diagrams
0. building mnthcrnaticnl representation
C. n nnd b
D. none or the above
59. When we speak or the fixed time increment models, we ore referring to the .......... .. ..
A. length or time for which the simulation is run
B. length of the time the model is developed
C. length or the mcnn time to failure
D. :ill or the obovc
60 In ussigning rnndom numbers in o montc cnrlo simulation. it is important to ... .... ........ .

12
 Roll No.

A. develop stochastic model I

B develop renl vnriate model

C. develop cumulntive probability distrihution
D. none of the above
61 [Link] of the following is not OOP feature in C++ ?
a. Encapsulation
b. Abstraction
c. Polymorphism
d. Exceptions.
62. Additional information sent when an cxcepti,m is thrown may be! placed in
··················
a. the throw keyword
b. the function that caused the error
c. the catch block
d. An object of the exception class.
63 Run rime polymorphism is achieved by .. ... .... .. .... ........ .
a. Friend function
b. virtual function
c. operator overloading
d. none of the above
64. The actunJ source code for implementing a t,:mplate function is created when
·········
a. ·me declaration of function appears
b. TI1e runction is invoked
c. The definition of the function appear~
d. None of the above
I
65. NOT (P OR Q) is equivalent with NOT(P) AND NOT(Q) is
·························
a. Tautology
b. contradiction
c. contingency
d. none of the above
66. The minimum number of cards to be dealt from an nrbitrary shuffled deck of 52 cards to
guarantee that three cards are from some suit is

13
 Roll. tlo

a. 13
b 8
C. 9
d. 12
67. In a tree between eyery pair of vertices there is ..........................
a. Exactly one path
b. A self loop
c. two circuits
d. n numbers of paths
68. A connected multigrnph with at least two vertices has nn Euler circuit if and onl)' if

a. Ench of its vertices has odd degree

b. Each of its vertices has even degree
c. At least one of its vertices has odd degree
d. At least one of its vertices has even degree. I
69. Evaluate the following prefix expression +•2+/12 i 5 I .
a. 23 I
b 24
C. 25
d. 37
70. What is the maximum total numbers of nodes in a tree that has N levels ? Nole 1h01 the
root is level zero.
a. iN
b. zN_ 1
C. 2N•I_ I
d. 2N 2N
71. Which one is very useful in situation when dntn have to stored and then retrieved in
reserve order?
a. STACK
b. Queue
c. List

14

__ .. ____,
 Roll, No,

d. Link list
72. Wlrich of the following is true about the chnra-:tcristics of abstract data types?

i . it represents a types.

ii. it represents a set of operations .

a. Truc,rnlse
b. falsc,true
c. true,true
d. false, folse
I
73. Interrupts which are initiated by an instruction are
·························
n. hardware
b. software
c. intcmol
d. external
74. The most common addressing techniques employed by a CPU is
·························
n. immediate
b. direct
c. indirect
d. all of the above
75. Address nnd data line in 8085 are .................. .... ..
a. separate lines
b. only lower byte of address is multiple,.ed.
c. common lines
d. shnred line
76. Part of ~1e computer where data nnd instructi,,ns nre held is
·························
.a register unit
b. accumulator
c. memory unit
d. CPU
77. Problem statement includes all except
a. input

15
 -------,.
Roll. No.

b. oulpul
c. processing
d. storage
78 . ...... .. .... ... ... ....... design nnd implements datnbasp strnclun: in SDCL.
a. programmer
b project manager
c. OBA
d. system analyst
79. Enhancements upgrades and bug fixes nre done during the: ........ ..... .... of SDLC
n. maintenance and evaluation phase
b. Problem idenlificntion
c. development and documentalion
d. design
80. ......... .. ............. ..... is not a foctor in the foilurc od system development projects.
n. Size of company
b Failure of system integration
c. inndequnlc user involvement
d. Conlinualion of project that should have been cancelled
81 The high vol toge level of n digital signal in positive logic is .................. ..... ..
n. 0 and I both
h. 0
C. I
d. none
82. A computer program that convert entire program into machine lnnguage is called

n. Assembler
b. commander
c. Interpretcr
d. compiler
83. In analog computer ............. ........... .
n. input signal is convcrt<.'d to digitul fom1

16
 [Link],

b. input program in never converted to digital form

c. output is converted to digitlll fonn
d. none
84. Which is true?
a Field nre composed of bytes
b. fields nre composed of characters
c. Records are composed of fields
d. all of the above
85. The act of pursing source program to proper syntactic classes is ccllcd
a. syntax analysis
b. Lexical analysis
c. Intermediate code generation
d. Interpretation and analysis
86. Which from is not intcnnediate code?
a. postfix
b. syntax tree
c. 3-addrcss code
d. Quadruples
87. .. ..... ......................... is the most powc:rful parsc:r
a canonical LR
b. operator precedence
c. LALR
d. SLR
88. Syntax directed translation scheme is descrited because .........................
a. Easy to modify
b. Description is independent to any im~lementotion
c. Based on syntax
d. all of the above
89. Which of tJ1e following method can be used to system of linear equations as well as to
find inverse of a matrix?
a. gauss elimination method

17
 7
.
b gauss Jordan method
c. cholesky's method
d. gnuss seidnl method
90 Simpson's I/3 mle used in numericnl integration can he: derived by putting. n = .......
in general quadrature formula.
D. 0

b. I
C. 2
d. 3
91. Which of the following method solves initial value problem by using sloped .it two
points?
a. Eulers method
b Hcuns method
c. RK methpod
d. picards method
92. Given f{x) r:JQ at X-1 , f( x )=18 ot x·2c 24 at x· 3. we wish to find ij2.5), for 1h1s we
hnvc to ........ .. ............. ..
a. Use interpolation
b. Use extrapolation
c. Use regression
d. Solve boundary value problem
93 In which of the storage placement strategic n program is placed in the largest available
hole in the main memory?
a. best fit
b. first fit
c. worst fit
d. buddy
9-t Oanker's :-ilgorithm for resource allocntion deals with ......... ........ . .. .. .
a. Deadlock prevention
b. deadlock avoidance
c. deadlock recovery

18
 Roll No.

d. mutual exclusion
95 · There ·ls no ····· · · ·•···• ······· •······· ........................... ,vith linked allocat'10 no f Ii1lcs.
a internal fragmentation
b. External fragmentation
c. starvation
d. all of these
96. Optimal page- replacement algorithm is ........................ .
a. replace the page that has not been used for a long time
'
b. replace the page that has been used fo1 a long time
I

c. replace tl1e page that will not be used for 2. long time
d. none of tl1ese I
97. Worst case time complexity of merge sort is ························
a. O(logn)
b. 0( nlogn)
c. O(n)
d. 0(n2)
98. Time complexity ofhcapify operation can be described by the recurrence rclatio
11.
a. T(n)=T(nn)+I
b. T(n)=T(nn)+n
c. T(n)=T(2n+3)+1
,d. T(n)=T(2nn)+2
99. Which of the following statement is false?
a. Greedy algorithms are more efficient 1han DP algorithms
b. Greedy algorithms guarantees optimal solution
c. Greedy algorithms are used for solvin ! optimization problems
d. All of the above
100. Which of the following shortest path algorithms fol lows dynamic programming strategy?
a. Dijkstra Algoritl1m
b. DAG Algorithm
c. Floyed Warshwall Algorithm
d. Bellman Ford Logarithms

19
 ....

S}'mbol No ..
Tribhuvan University
lns1i1u1c of Science and Technology
Ccnlrnl Department of Computer Science and lnfom1a1ion Technology
[Link]. Computer Science and lnfonnation Technology
Entrance Examination, March 23,2017

Full Marl,s: I00 P:,ss Marks: 35

Time: 2 I-lours I Tic!<(✓) the correct answer
I
Attempt all questions. Each question carries ONE mark!
I
. mc.r-1) .
). The vaIUCO f Itm.r~l - f.r-1( IS

a. -../3
b. {3 d. 2

2. lf J~ 1 f(x)clx = 5 and J14 f(x)dx = -2 then what is the value of J~1 f(x)dx?
a. l c. 0
b. 2 d. 3
3 The series }:~'=o !:~!" is convergent to
2

3 -4
a. 10 C -
9

s d. 0
b. 7

4. The eccentricity of circle is

a. -1 C. 0
b. d. rn

5. The distance from the point (2, 2, 3) to the plane 2:< + y + 2z = 4 is

s C. 2
a. - 3 d =ax1+by1+cz1+d/(underroot a^2+b^2+c^2)
1
b. -3B d. -3
distance = take always +ve value
1 1
fo f0 xyzdxdydz is
1
6. The value of f0
a. -n
1
c. -41
b. -2l d. -32

20
 Symbol No,,

. .rZ-ry
7. What IS the llmcrJ')--(0,0) .fi-,fi?
n. I C. 0
b -1 d. 2

8. If the roots of P,$, + P1: + P2y = 0 arc real and equal then C.F. is

a. (C1 + C2x)emr c. e cn(Aco~Px + BsinPx)

b. C,emt.r+ C:em2r d. None
9. The curvature for the space curve~ = cost 7 + sint 7+ t 7 is
1 C, I
a' -J
2 d t
b. s 2

2 2
10. The length of major axis of the ellipse 9x + 25} = 225 is
compare equn with x^2/a^2 +
a. 6 y^2/b^2 = 1 major axis is 2*
C. 8
b. IO greater value and minor smaller d. None
value
11 . The set of least squares solution of Ax= b coincides with the nonempty set of solutions of
the normal equation
a. AxAT= bAT c. ATAx = ATb
d. None
12. Let Ube an m x n matrix with orthonormal
I
column.'i and let x be in 1.H" then
I
a. IIUxll = t C. IIUxll = 0

b. IIUxll = IIUII
I d. IIUxll = llxll
I
13. An n x n matrix A is diagonalizable iIT A has
a. n linearly dependent eigen vectors c. n roots
b. n linearly independent eigenvectors d. None of these

14 Lei A =[-:2
4 -2
-5 7
7 -8
!J If the null space oI' A is a subspace ofR' 1hen 1hc value Ork is

a. 3 c. 2
b. 4 d.

21
 Symbol No:

15 Le A be a square maLrix. If a multiple of one row of A is added to another row to produce :i

matrix B then
a. det A = det B c. det A f. det B
b. det A = • det B d. None

16 Let A= [; 9t 2 ➔ 9t 3 be a trnnsfomrntion defined by Tx = Ax then

-1

T(u) is

I7 What is the value of hand k so that system oflinenr equation x, + Jx1 = 2 and 3x1 + hx~= k
has infinite many solutions
a. h = 2/3 & k = I C. h= 2 & k= 4
b h = 9 & k = 2/3 d. h = I & k = 213
18. Let A bean x n matrix then the null matrix of A is defined by
a. NulA=(x : x e9l" : Axt0} c. / NulA={x e 9l" Ax=O)
b NulA={x : x e~Jt" : Ax=b} d./ None
19. Which of the following pairs of vectors arc orthogonal?

a. afs]. b=[=!l C. a=
3
2
.b=
-4
I
-5 -2

b. a=[] b=[-:3] 2
d. None of these
6

20 What is the distance between the vectors u = (2. 3) and v = (3, . J)?
n. ill c. ..ff7
h S d. {IT

22
 ~ I \1:_:.t t l!' -: ,r~\1r.:u..·:rn •·i:b,1 of r,10 ci!C') thcr ,::m be 1irnuluu1eo~ly 1ruidc lh~ u c:.:
~ . ·1 ::: o::. t L ~,u:J 11!1.-e cond1uo117
3. 0 c. 2
h d. 4
1! W?t _ t ►' cr: 7
.! It 11 r:-c:,-r:r:1~101~ in disk. c. Ir is progrnm inc:, ccution
b h 1s ntc:111 or m:iin memory d. It is Job in ~econcb) ~[Link]
~J \\'h.!ch cf tl1e proCt's, 5chc:duling clgori1hm is no pr.:ctrcnJly re:mblc?
a._ Shortol Job first c. Round Robm
d. Priority Scheduling
2-l Ir m_e of memory is I6 MO :uid p:ige size is 4~.• how m::ny bits .:.re used to repre
~nt P~te
number'/
log2(16mb/4KB) C. 12
b. 8 d. 16
25 Which o!'tJ1c following rccum:nce caru1ot be sol ved by masters method?
o T(n}=2T(n/2}+n c. T(n}• T(nn)+ I
b T(n)•T(n-1 )+ I d. T(n)=-2T(n/2)+n1
26 Whl! is the solu1ion orlhe recurrence rela1ion Trn)=4T(n/2}+n?
a. O(n) c. O(n ~)

27. Which of the following algorithm is nol greedy :Jgorith.m?

a. Prims Algorithm c. DiJkstrn Algomhm
b Kruskals AlgoritJ1m d. Floyd Warshwall Algorithm
28 Which of the following olgorill1J11 design strategy can be used for dealing with NP-complete
problems?
a. Approximation Algorithms c. Greedy Algorithms
b. Dynamic Programming d. Randomized Algori1h111s
29. What is convergence rate of Newton Raphson melhod?
a. Line:ir c. Quadratic
b Super linear d. Logarithmic

23
 "WI

JO If \\C \,,:::a to iind II~ urJJ~O\\TI \ jc..!s of )' lr:r ~. :;~ 1. ·' 1, :-!~ : C,!" !.~ .~" ~,.. A_I

t..?~hr , ..i~es. \\fu h inrcrpol~t:on 1s t~ttd/

difTcmm:
not clear
rn:crpoli'.11on
fom~ rd difTcrence
interpol lion
31 When Choksl,y method e.1n be used for solving system oflme:r c:;t:~:;rm~"'
a. Co-:fficienl [Link]: 1:; sqUJie C. Cocffic1er.1rne'J l ;\ J: :c:., ·:- :": ::;
b Coc ffic 1en1 m:i nx is symmetnc d. Cocffimnt m.:111x ,~ d!"" : '.) -: -.:: •1.
3~. WhJCh of the followmi rule n;,proxrm:ites the integr~ind by a second ord:-1 J>O:yru.:-•.:J~
a. Trnpnoid:il Rule c. Simpson's 3/8 Ruk
b. Simpson's J/3 Rule d. Goussi::n ln1egr;it1on
33 Odd f,lfllYof \\1>rd Cln be tested by
a OR e,.:ite c. XOR g:itc
b AND gate d NOR g:itc:
34. Sum of minterms of Dool can functions Sl\'C cond11ioru in wh ich function is
a. Don! [Link]'C c. 0
b. Vo.n:iblc d.
35 Exclus,[Link] 1s :in
a. Prime funcllon C. Even function
ODD function
b. Undefined function d. Odd funct ion
36 In T fl ipflop when s!Jte ofT flipflop h:ls to be e-0mplc:mc:ntcd T musl be
:i O must be high so 1
C. T
b. I d. T+I
37 How m::iny prns ore there in 8086?
C. 32
b 46 d. 40

38. What 1s the store by register'?

a. Data c. Memory
ti. Operands d. All of these

24

- --- -~---- -----·

 Symbol No .

39, Which is not the control bus signal?

n. READ
c. RESET
b. WRJTE d. None of these
40. Which RAM is cr~ted using MOS transistors?
a. Dynamic RAM c. Pennanent RAM
b Sl3tic RAM d SD RAM

41 Dynamic model is
a. Time dependent c. a run time model
b. Independent of Time d. None of these
42. A stochastic simulation model have
a one or more non random outputs c. One or more random outputs
b no random output d. All of these
43. A mathematical model implements
a. z-notation c. P-notntion
b Algebraic notation d. Symbolic notation
44. Markov process is based on
a. Mcmorylcssncss c. Random
b Analytical d. None of these
45. A circle, if scaled only in one dir~ction becomes a?
a. Parabola c. Ellipse
b. Hyperbola d. Remains a circle
46. A line with endpoints codes as 0000 nnd 0100 is
a. Panially invisible c. Completely invisible
b Completely visible d Trivially invisible
47. Which attributes of image trnnsfomrntion rotate the imnge by a given angle?
a. Translate - X c. Both a and b
b. Translate - Y d. None or these
48. Back face removal is nn example of
a. Object space model c. Combination of both
b. Image spac~ model d. None of these

25
 Symbol No.:

49 LctS= (1,3,5, 7,9, 11, 13, 15, 17, 19, 21} . WhatislhcsmallestintegerN>Osuchthatfor
any set ofN integers, chosen from S, there must be two distinct integers that divide each
other?
a. 10 c. 9
b. 7 d 8
50. "John is good and John is nice" implies "John is good", is derived by
a. Conjunc1ion low c. lmplica1ion law
b. Simplification law d Contra positive law
51. In nelwork flow slack is
a Difference ofnow and capacity c. Both a and b
b Difference of cnpacity and now d None of these
52 A minimal spanning tr~c of a graph G is
a A spanning sub grnph c. Minimum weight
b A tree d All of these
53 Inn JK nip-nop lhe function K=J' is used to realize
a. T nip-Oop c. D flip-flop
b. SR tlip-Oop d. MIS JK tlip-nop
54 Decimal equivalent of binary number 101001.1011
0. 41 .0875 C. 4J.6875
b. 40.6875 d. 40.0875
55 A CPU generally handles the interrupt by executing interrupt service routine
a. As soon as interrupt is raised
b. By checking the intem1pt register at the end of fetch cycle
I
I
c. By checking the intcm1pt register aOcr finishing the executing the current instruction
d. 13y checking the intem1pt register nt fo;ed time intervnl.
56. Which of the following coordinates vnrious operntions using timing signals?
o. Memory unit c. Input output unit
b. Control unit d. Arithmetic login unit

26
 Symbol No.:

57. The pre-order trnvcrsnl sequence ofn binlll')' seruch tree is 30, 20, 10, 15, 25, 23, 39, 35, nnd
42. WJ1ich one of the following is the post-order troversol sequence of the some tree?
a. 10, 20, 15, 23, 25, 35, 42, 39, ~0 C. 15, 20, 10, 23, 25, 42, 35, 39, 30
I
b. 15, 10, 25, 23, 20, 42, 35, 39, JO d. 15, 10, 23, 25, 20, 35, 42, 39, JO
58. The height of a binary tree is the ~aximum numoer of edges in any root lo leaf path. The
maximum number of nodes in a b~nary tree of height h is:
a. 21\h -1 C. 21\(h+ I) -1
b. 2"-(h-1)-1 d. 2" (h+I)
59 Which of the following sorting algorithms has the lowest worst-case complexity?
a. Bubble sort c. Merge sort
b. Selection sort d. Quick sort
60 Which of the following searching techniques do not require the data to be in sorted fonn
a. Linear Senrch c. Interpolation Search
b. Binary Search d. All of these
61. The members of a class by default are
a. Private c. Public
b. Protected d. Mandatory to specify
62. Which of the following is not a type of construclor?
a. Copy constructor c. Default constructor
b. Friend constructor d. Parameterized constructor
63. Which of the following is ~ot the member of cla;s?
a. Static function c. Const function
b. Friend function d. Virtual function
64. Which of the following are available only in the cla.c:s hierarchy chain?
a. Public data members c. Protected data members
b. Private data members d. Member funct ions
65. Three address code involves
a. Exactly three addresses c. No unary operators
b. At most three addresses d. None of these

27
 Symbol Ho :

66. Consider a grammar

A ::= B X I YC le
8 ::=CzA
C ::=x 8
What is First(A)?
a. {y) C. {x,y}
b. fy,z) d {x,y,z)
67. The graph that shows basic blocks and their successor relationship is called
a. DAG c. Control graph
b. Flov, Graph I
d. None of these
68 A "stream of token" is the output of
a. Lexical analyser c. / Semantic analyser
b. Syntax analyser d. Code optimizer
69. One Gigabyte is approximately equal to
a. 1000,000 bytes c. 1000,000,000,000 bytes
b 1000,000,000 bytes d. None of these
70 The first internet search engine was
a. Yahoo c. Archie
b. Altavista d. Google
71 . An octal number I 002 is equal to the hexadecimal number
a. 202 C. 514

b 101 d. I0000000 I0
72. Firewall is used in computer _ __
a. For monitoring c. For data transmission
b. For authentication. d. For security
73. ln the Analysis phnse, the development of the _ _ _ _ occurs, which is a [Link]
statement of the goals and objectives of the project.
o. documentation c. progrnm specification
b. flowchart d. design

28
 ...........

Symbol No .

74. The DFD is the basic component of.............. 5Yst c:m.

n. Conceptual c. Physical

b. logic:il d. None of these

75. Systems arc modified whenever

n. user's requirements chnngc
b. ne\v computers ore introduced in the market
c. new softwnre tools become avnilnble in the rnnrkct
d. other similar organization modify these system
76. Enhancements, upgrndes, and bug fixes are dom: during the _ _ _ _ _ step in the
SDLC.
a. Problem Identification c. Development and Documentation
b. Design d. Maintenance and Evaluation
77. Which string can be generated by S-+nSlbA, A-➔dlccA?
small a not A
a. Aabccd b. Adab~ca ,;. Abcca d. Abababd
78. Which of the following is NOT the set of regular expression R = (nb + nbb)• bbab?
I
a. Ababbbbab [Link] ,;.ababbabbbab [Link]
79. Which of following is n mapping done by the tmnsition function in OFA?
a. L X Q-+ ~ C. t Xt -+ Q
b. Q X Q-+ L d. Q X L - Q
80. What a Turing Machine cnn do in a one move?
a. May change its state c. Move the head one position lell or
b. Write a symbol on the cell being right
scanned d. All of the above
81 . How cnn you create a link in a in html which will bl! opened in new browser window/tab?
a. < a href= "url" target= "new"> c. <a hrcf = "url".new>
b. <a hrcf"" "url" target= "_blank"> d. <n href = "url" target ="open">
82. Which of following is true about the CSS defined using class in HTML?
a. The class selector uses the HTML class nllribute und i!i defined with u ".''
b. The class selector uses the HTML class attribute and is ckfinr:d with a "#"
c. Generally the class selector is used to specify style for a single unique clcml!nt
29
 Symbol No ·

d. The class selector is used only in internal CSS

83. Where is the correct pince to insert n JnvnScript?
a. The <body> section c. Both the <head> section and the
b. The <head> section <body>
d. TI1e <Title> section
84. Among XSD indicators, which of following represent order indicator?
a. Choice c. Group name
b. maxOccurs d. Order
85. Which of following is the strategy used to reduce the numhcr of tree branches and the
number of static evaluations npplied in case of a game tree?
n. Minimax strntegy c. Constrnint sntisfoction strategy
b. Alpha-beta pnming strntcgy d. Static Max strategy
86 In Scripts, which of following represent object involved in events?
u. Props c. Track
h. Roles d. Events
87. Which of following is used in Version Space Method?
n. Gcnerolizntion Specialization Tree c. Vector Space Model
b. Number of Versions d. Speciolizntion Tree
88 Which of following is not an nctivntion function?
a. Linear c. Sigmoid
b Threshold d. Asymptotic f-unction
89. Which of the following is n vnlid identifier in C progrnmming?
o. Var-I c. Ivar
b. Vnr 1 d. I All of these
I
90 The arguments in o function call in C programming nrc called
o. Actual arguments c. i Pnra~1ctcrs
b. Fomwl arguments d. Both o ond b
91. Which of the following function in C progrnmming is used to allocate memory dynamically
with nil bits set to zero?
n. malloc() c. calloc()
h. frccl) d. deleteO
30
 Symbol No.:

92. An individual structure membei con be occe~sed in tcm1s of its corresponding pointer
I

vnrinble by using I
a. > operator c. . operator
b. • operator d. -> operator
93 Which of the following component in ER diagram represents multi-valued attribute?
n. Ellipses c. Diamond
b. Double ellipses d. Rectangle
94. Which of the following SQL command is used t,, insert attributes in un existing relation?
a, Create table c. Drop table
b. Alter table d. Create domuin
95. Which of the following FD is trivial?
o. A-> f3 C, AB-> f3
trivial functional dependency (FD)
b. A-> BC d. AB->C.
96. Which of the following is shadow paging algori1hm'?
a. UNDO/REDO c. NO-UNDO/REDO
b. UNDO/NO-REDO d. NO-UNDO/NO-REDO
97. ADSL is the abbreviation of
n. Asymmetric Dual Subscriber Line c. Asymmetric Dual System Linc
b. Asymmetric Digital System Line d. Asymmetric Digital Subscriber Line
98. Router operates in which layer of OSI reference model?
n. Physical Layer c. Transport Layer
b. Network Layer d. Application Layer
99. What is the minimum header size of on IP pnckt't?
a. 10 bytes c. 30 bytes
b. 20 bytes d. 60 bytes
I

100. Which of the following is the number of bits used in 1Pv6 address?
I

n. 16
b. 32
C. 64'
d. 128

31
---
 Roi/. fJo

Tribhuvan University
Institute or Science and Teclrnology
Central Department or Computer Science and Information Technology
[Link]. CSIT Entrance Examination, March 23, 2018
Full Murks: 100 Time: 2 Hrs
Pass Marl<s: 35
Attempt nll questions. Please Tick/Encircle the correct answer. Any omission or correction
to the answers is not allowed.

I. The vectors (3, 2) and (6, 2) arc

a. Equal c. Linearly independent
b. Orthogonal d. Linearly dependent

2. If A= ( ~I -~}nd 1/ = ( }i). then T(ii) = Aii =

. [~9] C. m
b. (}1) d. [Y)
3. The matrix G-9)
6
· IS

a. Diagonal c. Invertible
b. Symmetric d. Non invertible
4. The area of the parnllclogrnm detcm1ined by the points (-2, -2), (0, 3), (4, -1) nnd (6, 4) is
I
a. 28 I C. 0
b. -28 d. 25

33
 Roll. No,

5. If bl = (2, I), b2 = (-1, 1), j = (4, 5) and fl= (bl ,b2) then the coordinate vector (x)n

of x relative to B is

• GJ
b. (-/)
-1 0
6. Thrnnk of A = (~ -2 5
0 0
;]
n. 0 c. 2

b. I d. 3

7. The Eigenvalues of A~ G~) ore

a. -3, 8 ans is 9 and 2 C. 3, -8
b. 3,8 d. -3, -8
8. The unit vector of ii = (I, -2, 2, 0) in the dire:tion of v is
n. (I, -2, 2, 0) unit vector = u/|u| C. (1/3, -2/3, 2/3, 0)
|u| = underroot x^2+y^2+z^2
b. (1/9, -2/9, 2/9, 0) d. ( l /3, 2/3, 2/3, 0)

3] [-Ii [-1/~
9. The vectors ~ , ~ , ;,i l
[ are

u. Orthogonnl c. Equal
b. Not orthogonal d. Lincnrly dependent
10. The vectors a,.. (5, 6, -1) nnd b"" (413, -1, 2/3) are
n. Pnrollel c. Orthogonal
b. Equal d. Dependent

11. The solution of Ix -31 ~ 1 is

n. (-oo,2] u[4,oo) c. (-oo,2) u(4, oo)
b. [-ro,2]u[4,co] d. (-oo,2] u[4, co)

34
 ---.

Roll. No.
do derivative and put first value 2 in
derivvative that is m value
2
12. Equation of normal to the curve f(x) = x + I ot (2, 5) is then do y=mx+c and find c do and
put in y=mx+c
n. 4y- y + 3 = Q C. 4y + X = 0
b. y- 4x + 3 =-0 d. 4y + x + 22 = 0

13. The function y = .J4 - x: is not di ffercntiable at x =

n. ± I C. ±2

b. ± 1.5 d. 0

x "x:
14 X ~► 0 . - - =
·· 3x~ + 5x
n. 0/0 C. 1/3
b. 2/5 d. 1/5

15 _Jsin(lnx)d,=
X

c. cos(lnx) + A
n. - cos(ln x) +A
X d. cos(ln x) + A
b. -cos(lnx) + A X

16. Power series expansion of f(x) = cosx is

a. I - x2/2! + x4/4! - x''/6! +.. . C. J + Xl/2! - i/4 1 + x'°'/6! - ...
b. I+ x212! + x4/4! + x''/6! +.. . d. I - x3/3! + x5/5! - ...
17. The directrix of the parnboln x: = 8y is
a. y =2 (x-h)^2 =4p(y-k) or (y-k)^2 =4p(x-h) c. x-= 2
b. y = -2 after p valuey- p = 0 and y -p value = 0 d. x = -2
18. If v = (tcost) i + (tsinl) J. then the unit tongent vector f is
n. (cost) T+ (sint) ] c (cost) T- (sinl) .7
find derivative
h. (cost) T+ (tsint) J d. (cost) i - (tsint) i
) I du IS
.
I 9. I f \I = x·, + y - . (
2. = Sill X + )' t \Cll -
d~
o. x + sin(x + ~) c. 2x + cos(x + y)
find separat derivation of x and
b. 2x + sin(x + y)sin and add d -1 - cos(x + y)

35
 Roll. No.

••in.r
20. f f_vdydx ==
0 0

a. TT/4 C. TT

b. 0 d. TI/3
21 . Jn c, if you pass an array ns an argument ton function, what actually gets passed?
a. Value of elements in array
b. First element of the array
c. Base address of the array
d. Address of the last element of array
22. What is the output of the code
main()
(
int a= 2;
printf("¾d",a++);
printf{",%d",++a);

a. J,4 C. 2,J
b. 2,4 d. None of the ubove
23. If there is any error while opening a file, fopen will return
a. Nothing c. NULL
b. EOF d. Depends on compiler
24. Function fobs defined math.h header file tnkes argument of type integer
n. True
b. False
c. Depends on the implementation
d. Depends on the standard
25. The processes that are residing in main memory nnd arc ready and waiting to execute nre
kept on a list culled
n. Job Queue c. Execution Queue
b. Ready Queue d. Process Queue
26. For non sharable resources like a printer, mutual exclusion
a. Must Exist c. May Exist
b. Must Not Exist d. None of the above
36
 - ·--

Roll. No.

27. Every address genernted by the CPU is divided into two parts
a. frame bit & pngc number I c. pnge ofTsct & frame bit
b. pnge number & page offset i d. frame orTsel & page offset
28. To ensure difficulties do not arise in the readers _/writers problem, ___ arc given
exclusive nccess lo the shared object
a. Readers c. readers and writers
b. Writers d. none of the mentioned
29. Physical model of simulation can be classified as
a. Numerical and Analytical c. Static ond Dynamic 1
•
b. Mathematical and Numerical d. Analytical and Static
30. Face validity means
a. Input-output validation c. Model validation
b. process validation d. Mathematical validation
31 . Which of the following test is used for uniformity test of random numher
a. Kolmogorov-Smimov test c. Auto-correlation lest
b Gap test d. Poker test
32. Where the outcome of nctivity can be completely described by its input, the nctivity is
said to be:
n. Indigenous c. Stochastic
b. Exogenous d. Detem1inistic
33. How many different string cnn be made by reordering the letters of the word "SUCCESS"
a. 520 C. 420
b. 240 d. 640
34. Suppose that P(n) is a propositional function. Detem1ine for which positive integers n the
statement P(n) must be trnc when P(I) is trne nnd ifP(n) is true then P(n+2) is tnie, for
nil positive integer n.
I
a. P(3) c. P(4)
b. P(2)
I d. P(6)
I
35. A full binary tree with 111 vertices contains ............ '. .... Internal nodes.
n. (2n-1) c, 2n+I
b. lo~n d. (n-1 )/2

37
 Roll. No.

36. Let a coMcctcd planer graph ha.s 20 vertices, each of degree 3. Into how many regions
does a representation orlhls planer graph spill the plane?
n. JQ C. 12
b. 20 d. 60
37. Let A= {a, b}, 8= {c, d}, then (A•nB) U (B·•nA) consists of
a {a,b,c,d,c} c. {c,d,c}
b. {a, b, C} d. ( }
38. Which of following is true for extended transition function ofDFA?
a. Q X t-Q C. Q X t• -Q
b. q• x r• -r d. Q x r-r
39. Which of following is a luring machine that i:: able to simulate other luring machines?
a. Nested Turing machines c. Counter machine
b. Universal Turing machine d. Nested Machine
40. Which of the following grammars are in Chomsky Nonna! Fann:
a. s-ABIBCICD, A-o, s-1. c-2. c•-3
b. s-AB, s-BCAlplq
C. s-ABa, A-aaB, a-Ac
d. A-dlccAI c
41 . Which of following css type for an element h.35 highest priority?
.a External style c. lnline style
b. Internal style d. lntag style
42. Which is the valid syntax in JavaScript to define a variable containg an integer numbe r ??.
a var x="7"; c. int x=7;
I

b. var x=7; / d. int x, x=7;

43. Choose the correct HTML tag for the largest heading?
a. <HI> C. <H2>
b. <H6> d. <H4>
44. In XSLT, which of following is used to extra:t value ofan XML element and add it to
the output stream?
a. <xsl;value> c. gctXMLElement()
b. <xml:value> d. <xsl:vnlue-of>

38

..
 45 Which of the following is not the part of ADT description?
a. Dala c. All of the above
b Operation d. None of the ahove
46 Quick sor1 algorithm is an example of
a. Binary search appronch c. [Link]
b. Greedy appronch d. Divide and conquer approach
47. What is the worst case logarithmic time complexity, where n is the number of clements in
the array
a. O(log n -1) c. O(logn+l)
b O(log n) d. None of the above
48. In case of Tower of Hanoi, the objective of the puzzle is lo move the entire stack from
one peg lo nnother peg, obeying the following simple rules except:
a. Only one disk can be moved al a time.
b. Each move consists oflaking the upper disk from one of the slacks and placing it
on top of another stack. l
c. No disk may be placed on top of a greater disk.
d. None of the above. I
49. To eliminate redundant code, we should use
a. Operator overlonding. c. Both a and b
b. Inheritance. d. None of the above.
50. Which of the following approach is used by object oriented design:
a. Top-down approach. c. Both a and b.
b. Bottom-up approach. d. None of the above.
51 . In C++, the default return type for all the function is
a. char c. void
b. int d. None of !he above.
52. Virtual member functions are most commonly used for
a. Operator overloading. c. None of the above.
b. Polymorphism. d. All of the above.

39

.) .
 ' ~?~~ ' • ~ i:.l •""Jd, i1..~!i 0' ) htr•l ··L r:t.: ~·t•;r ltl

CJ. f-'riJ~n:,~,

...: C . t :-- .:'Is•~.. t. i 1 -~ ~ic IJ ~[Link] with

~ L. . . · c 1'1>.ds
. r.' i ct. !-i:onc:c,;f1fo:t,t.J,'.1') .d
=---- t'i .a rritd bo4y W!.J1~forme!ion rJ E.I mo\~ ob;[Link] v.-11!10:.a dtfom:ti.,..~1.

d. All of 11:e mer.i:cr:t j

' ....., [~ r~ .c~.tl 15 :m cxrunple of
~ G..:-:::1 : f.:!<I! method c. Combm:tio:i of both
t . !=.!.~~ ~lee method d. None of clio·,·e
! ; ••~..!~ .cf t':e fellowing slfetegles are edop~ed if inform:ition requ:rements are not well.
~f.:..~~
.::. s~l;Cl:it?d ::nJlysi, development method
"' S;~~!T'..5 devdopment life cycle methcd
c.. ?rc~typing method
cl S~:r!J [Link]
! S. L'::i~~ r:1oddin3 l::nguage
e. !J fn obj:ct orienied programming lnnguoge
b Ls 1."!efoJ in d~cribing object oriented design modds grnphicully
c, Al!o·.1./1 to represent multiple views of n system
d. ls ~fl o!Jjea oriented ,ystem dcveloprr cnt rne~10dology
59. CASE tools ere ~d_ _ _ __
a. Tog~ routine work in a development project done
b. To trzin UY-rl of the system
c. As n productivity tool in systems dev< lopmcnt
d. Not to automate the implementation phase of a development project
60. ____represents a Whole Part or Comr,osi1ion relationship.
a Aggregation c. Stereotype
b. lnheritance d. Association

40
 'A •.,·1•1 • 'i'1 1'•1 ·
'- '- I 1•• ;.. t • ' •

r: . .101 l
d lj l!il
6~ /.. !.!11t1 rtii!!tr c:.::1 b~ userl for
:i. Pu-J!!l to ,eri:J com·,r!wn C O:_t.~til ~h') t:) •:·:_it
b. 5-rri::.1 1o p:n!.l le I con·, en:<.•n d A!Lc:f ' 1i: .11;c ,-:-

.i Addre:s !price l/O Sct:i:m..

b lfardwart VO Scheme
66. Which on: of Lh:m 1_s fahe reg.;:rdin6 PROM
a Manufactured by blo"ing fusible nichrc,me ½1rc: liru
b Reprog~minz pos~ible
c. Programmed by the user
d None of the above
67 8085 has ..... ................ bi1addre.s.s ipace
a. 32 C. S
b. 64 d. 16
68. Which stack is used in 8025?
a. FIFO c. FILO
b. LIFO d. LILO
69. Which of the following level describes how d:ita .rrc stored in the d::i:.~.:~:;.:'?
a. Physical level or internal level
b. Logical level

41
 [Link],

70. Which of the following nonnel form is based on transitive dependency?

n. INF c. 3NF
b. 2NF d, 4NF
71 . "A transaction is either perfonned in its entirety or not perfonncd al all" is
a. Atomicity c. Isolation
b. Consistency d. Durability
72. Which of the following locks do not conflict?
a. Read, Write c. Write, Read
b. Read, Read d. Write, Write
73. Which of the following is a class A network addn!ss?
a. [Link] c. [Link]
b. [Link] d. 100.100.100.I00
74. Which of the following layer ofTCP/lP is responsible for reliable transfer of data?
a Network access layer c. Transport layer
b. Internet layer d. Physical layer
75. Which of tl1e following is the number of bits used in 1Pv6 address?
a. 16 C. 64
b. 32 d. 128
76. Which of tl1e following is LAN technology
a. Ethernet c. ATM
b. X.25 1 d. Frame relay
77. A .......... Stores data on flopJy disk cartridges with at least 70 times the capacity of
floppy disk.
a. DVD drive c. Zip Disk Drive
b. Hard Disk drive d. None of the above
78. What is the name for a \VCbpage address?
a Domain c. Protocol
b. Directory d. URL
79. Which character representation code is widely used for microcomputers?
a HTML [Link]
b. Unicode d. EBCDIC

42
80. Which of the protocols below is used for sending email?
a. FTP c. TCP/IP
b. SMTP d, HTTP
81. An example or peephole optimization is
a. Loop optimization c. Data flow analysis
b. Local optimization d. None of thi: abo..,e
82. A compiler that runs on one machine and produce code for a different muchint! is calkd
a. One pass compiler c. Cross cumpilt!r
b. Two pass compiler ll. none
83. . .... .... , . ,.... grammar produces morl! than onc parsc tree for sum..: s..:nli:11~..:.
a. Unambiguous c. Regul.1r
b. Leli rc1:ursive d. Ambiguous
84. Type checking is carried out in
a. Lexical analysis c. Syntax din:cted transla11trn
b. Synta,-; analysis d. Optimillltiun
85. Which of"the following algorithm is generally used CSP search algorithm'!
a. Bre □dth-lirst search algorithm
b. Depth-first search algorithm
c. Hill-climbing search algorithm
d. None of the mentioned
86. A ____ is used lo demonstrate, on a purely syntactic basis, that one fonnula is a
logical consequence of another fonnula.
a. Deductive Systems
b. Inductive Systems
c. Reasoning with Knowledge Based Systems
d. Search Based Systems
87. Which is used to construct the complex sentences?
a. Symbols c. Logical connectives
b. Connectives d. All of the mcntiuncd

43
 Roll. No.

ss t hi: 1r111h, al11l'S nr 1raditional si:t theory is

- - - - - and tlwt or fuzzy set is

a hthi:r Onr I. ht:i\\CCn O& I

h lkl wi:en O& I. either Oor I
c Rctwccn O& I. between O& I
d Either Oor I. either Oor t
l-i'l Tn soh·c , : - 2 = 0 hy Newton Raphson technique. tr initial guess is Xo = 1.0. subsequent
l' --t1111 a tl· nr:-- (i.e. \1) will he
C. 1.0
h I5 d. None or 1hese
llO In the Ciauss elimination method for solving a system oflinear algebraic equations,
1nang11l:uzat1on leads to
a Diagnnal matrix c. Upper triangular matrix
h. 1.o" er triangular matrix d. Singular matrix
'' I In "l11ch or the following. method. we approximate the curve or solution by the tangent in
l"al Ii 111tcrval
a [Link]·s method c. Newlon's method
h Eukr·:- method d. Runge Kulla method
1
)2 Wl11ch nr the following. statements applies to the bisection method used for rinding roots
or li111c11ons'!
a Comwgcs within a few itcrntions
h (~11ar;in1ccd to wor~ ror all Continuous functions
c. Is l;1stcr than the Ncwton-Raphson method
ti t~cq111res that there he no error in cletermi11111g the sign of the fu nction
1 13 I l1l\\ many carry hits arc used to detect overllow in case of signed arithmat1c?
a. 0 C. 2
h d. 3
1J..l What '"ill he the result ,r2 ir lell shilled by J position?
ii 5 C. 8
b <, d. 16

44

--1D
95. Whal we cull lite: technique: thul uses opcode OJ addrcu of next micro-of)l:rotion'/
o. Direct Mur,ping c. Opc:oJ~ M11ppi11g
b. lnline Mapping d, Sequ(ntial [Link] ing
96. Which or the following 10 handling technique is best for th~ d.::vicc5 that p:r(orm odJ
one task?
a. Polling C. OMA
b. Interrupt Driven 10 d 10 Pro~ sur
97. Which or the following recurrence cannot be solved by masters method?
a. T(n)=2T(n/2)+n c. T(n)=T(n/1 )+ 1
b. T(n)=T(n-1 )+ I d. T(n)=2T( nf.H•n:
98. What is best case time complexity or merge sort?
,
a. 0(n) c. 0(n")
for worst also
b. O(nlogn) d. O(logn)
99. Which or the following algorithmic paradigm is not used for solving. upt1m11; 111un
probh:ms?
a. Recursive c. Dynamic ProgrJmming
b. Greedy d. All or tht! above
100. Which or the following algorithm design strategy can be used for [Link] \\ llh

NP-compklc problems?
a. Approximation Algorithms
b. Dynamic Programming
c. Greedy Algorithms
d. Randomized Algorithms

45
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
Lin('a r algcbrn:

I. Prnclurt of icll'ntity matrix and any matrix A is equal to

product matri:,;
1\ .
B. u11itlen1ilicd rnntrix
C. nwlri:-.; t\
f). iclcnt ity nrntri:,;
\1h ( '

l. Product of idrntit)' matrix and any matrix A is equal to

1\ .prnducl matrix
13. unidentified matrix
C. [Link]:,; /\
f1. identity nrntrix
.1\ llS 1\

J. The system of linear equations

(-td - I), +y + z = 0
-y+z=O
(-td - I) z = 0
h:1s :1 non-t rivinl solution, if d equals
1\ . 11:
B. II-I
C. 31-l
D. I
. \1p; n

-t: II' t\ nnd B arc squnrc matrices of size n x n, then which of the following
stntcmcnt is not true'?
/\ . det (1\B) = det (A) det (B)
11. det (k 1\) = kn det (A)
C. dcl (A+ 8) = det (A)+ det (B)
0. det (AT) =1/det (A-1)

5: The mntri, rf= AT, where A is any nrntrix is

A. Skew symmetric
B. Symmetric nbout the secondnl)' diagonal
C. A lwnvs
., symmetric
.
D. Another general mntrix

46
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
o: Eigcn values or it real symmetric matrix arc alwriys
A. Positive
B. Real nnd imnginnry
C. Negative
D. Real
Ans : D

7. Let A be a Hermitian matrix. Then, which or the following statements is

false'!
A. The diagonal entries of A are all real.
B. There exists a unitary U such that U• AU is a diagonal matri:-..
C. If A3 = I, then A = I.
D If A2 = I, then A = I.
/\ns:D

8 Let A be a complex n x n matrix. Let ).l,i.2,).3 be three distinct

eigcnvnlucs of A, with corresponding eigenvectors zl,z2,z3. Then, which ur
the following statements is false?
A. z l + z2, z 1- z2, z3 nre linearly independent.
B. z I , z2. z3 are linearly independent.
C. z l, zl + z2, z l + z2 + z3 are linearly independent.
D. z I, z2, z3 are linearly independent if and only if A is diagonalizable.
/\ns· D

9: Let A,B be two complex n x n matrices that arc Hermitian and

Cl = A+ B,C2 = iA + (2 + 3i)B, nnd C3 = AB.
Then, among Cl,C2,C3, which is/nre Hermitinn?
A. Only C,
B. Only C~
C. Only C3
D. All of them
Ans:A

IO: If A and B be real symmetric nm trices of sizen n x n, then

A. AAT = I
B. A = A-1
C. AB = BA
D. (AB)T = BA
Ans:D

Calculas
t. Ir
A.
r\
<')-->,:?- • ,. Cr:1C, Clh?tl~
dx
-X

47
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
11. ✓:-.
c.n
11. I
,\n-.. ..•\

2. Coordinates of midpoint of line joining two points (16, 4) and (36, 6) arc:
t\ . (26. 5)
B. (5. 26)
C. ( I 0. I)
D. (I. I 0)
,,11,·,\
2. The set {x : n < x < b} cnn also written as

t\. fa. b]
ll (n. b)
C. [ n. b)
D. (n. bl
:\n, ll

J. Thl' points (- 2, 0), (- I, 0), (I, 0) nnd (2, 0) lie on

1\ . y - n;--: is
B. :-,;- nxis
C.. \' - ,,,.
D. y = 5:--.;

-L Till' th rel' lines define by the equation x + 2y = 0,2x + y = 0 and 3x +Sy =

narc
1\ . [Link]
13. P~rpendiculnr
C. Cnncurrenl
D. Nol parallel
;\ 115 ('

5. The slope of a line segment is 1/3. The slope of a perpendicular line is

I\ . ·.'
It 0.3
if 2 lines are perpendicular than value is -1 i.e 1/3*m2 = -1
C. - 113
D. 1/3
,\11,;·,\

6. Given points A(6,3) nnd 8(3,-1 ). The distance between A and Bis
appro~imntcly
A. -L5

48
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
-- 'B. 5 -
c. 7
D. 2.6
Ans: 13

r
7. Jo
1
e-6x dx =

9: Hn line is parallel to y-axis then slope of the line [Link] to this

line is
A. 2
B. 0
C. I
D. - I
Ans: B

10: The following function has a local rnnnimn at which value of x

t( x ) = x~ ·s :(2
A. ~
2
0. \5
c.\I
'2
D. \;·s_
·2
Ans: C
49
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT}

lnfornrnfion technology
I: .Joystick is used to?
A. Mcwe cursor on the screen
11 . Computer gnmes
C. Both a and b
D. None of these

2: Computer microphone converts audio signals into the

A. eleclrical waves
13 . clectronrngnetic waves
C. digitnl signals
n. annlog signals
,\11, /\

3: For reproducing sound the CD audio player uses a?

A. Qua11z Cristal
n. Titanium Needle
C. Lnser Benm
11. 13nrium Titanium Cernmic
\11' L.

~: A peripheral device used in a word processing system is

I\ . r loppy disk
fl tvt.-ignetic card render
C. CRT
nr
11 ,\ II these
\Jh I)

C l)roornmino
I':" t=,

I. Who is known as the fothcr of C Language?

A. .lamt!s A. Sosling
B. V_jarne Stroustrup
C. Dennis Ritchie
D. Dr. E. F. Codd

2: \Vhirh of the following is invalid?

so
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
-- - A" -·- --
B ti II
C'a'
D abc'
Ans:C

3: Which is the right way to declare constant in C?

A. int constant var =10;
8. int canst var= IO;
C. canst int var= IO;
D. B & C Both
Answer : D

4: The Default Parameter Passing Mechanism is called as

A. Call by Value
8. Call by Reference
C. Call by Address
D. Call by Name
Ans : A

Discrete structure

1: If X and Y be the sets. Then the set ( X - Y) union (Y- X) union (X

intersection Y) is equal to?
A. X union Y
B. Xe union y,=
C. X intersection Y
D. Xe intersection ye
Ans:A

2: The complete graph with four vertices has k edges where k is:
A. 3
B. 4 k = (n * (n-1)) / 2.
C. 5
D. 6
Ans:D

3: Let A and B be any two arbitrary events then which one of the following
is true ?
A. P( A intersection B) = P(A). P(B)
B. P(A union B) = P(A) + P(B)
C. P(AB) = P(A intersection B). P(B)
D. P(A union B) >= P(A) + P(B)
Ans: D

51
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
-n A l'Ontirrnous non - intersecting curve in the plane ,,,hose origin and
tcrmin11s coincide?
I. Pinner
2. .lordnn
] . 1-lnmiltoninn
-L l\llofthesc
:\n, n
Da(a s(ructurc
I: Which if the following is/arc the levels of implementation of data
structure
A Applicntion level
B Abstract level
C Implementation level
D AII or the nbove
\11, I)

:!.: 111 ............... , search [Link] at the beginning of the list and check every
ckmcnl in the list.
1\) Linenr senrch
B) Binary senrch
C) Hash Search
D) Binary Tree senrch
.\11, .\

J: Which of the following data structures arc indexed structures?

A. Lincnr nrrnys
8 . Linked lists
C. Queue
0 . Stack

-t: The time complexity of quick sort is ..............

A) O(n) •
[3) 0(112)
not worst
C) O(n log n)
D) O(log n)
.\ns L'

Digital Logic

S2
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
J: ·oi:i~ffnm which is -i,sed to show logic clements nnd their inten·o1rnrctiu11s
is said to be

A. circuit diagram
B. system diagram
C. logic diagram
D. gate diagram

Ans:C

2: The universal gate is ................ ..

A. NANO gate
8. OR gate
C. AND gate
D. None of the above

Ans:A

3: The greatest negative number which cnn be stored is 8 bit computer

using 2's complement arithmetic is ........
A. -256
8 . -128
C. -255
D. -127
Ans:B

4: Latch is a device with

A. One stable state
8 . Two stable state
C. Three stable state
D. None of the Mentioned

Ans:B

Microprocessor
1: The devices that provide the means for n computer to communicate ,yith lhr llSl'
computers arc referred tons:
A. CPU
13. ALU
C. 1/0

53
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
D. none of the above
- --

:!:The _ _ _ ensures thnt only one IC is active nt n time to avoid a bus

conllict caused by two ICs writing different datn to the same bus.
A. control bus
n. control instructions
C. address decoder
D. CPU

J:Bcc:111sc microprocessor CPUs do not understand mnemonics as they arc,

thcr have 1o he converted to - - -
A. hexadecimal machine code
8. binary machine code
C. nssembly language
D. nll of the above

~: What docs microprocessor speed depends on

A. Clock
R. Dntn bus width
C. Address bus width
D. Size of register

Computer organization
I: The two phases of executing an instruction are _ _ __
A. Instruction decoding and storage
8. Instruction fetch and instruction execution
C. Instruction execution and storage
D. Instruction fetch and Instruction processing
.,11~.n
2: Arnllcction oflincs thnt connects several devices is called:
A. peripheral connection wires
B. bus
C. Both aand b

54
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
D. lntemal wires
Ans:0

3: Instruction in different stages of pipeline do not interfere with one

another, sepa.-ation is done by

A. Pipe stage
8. Pipeline stacks
C. Pipeline registers
D. Processor cycle
Ans:C

4: If a comparing instruction and branch instruction uses some

architectures, to treat these comparisons chooses as

A. Error
8 . Exceptions
C. Special cases
D. All above
Ans: C

Operating System

1: To avoid the race condition, the number of processes that may be

simultaneously inside their critical section is
A. 8
8. l
C. 16
D. 0
Ans:B

2: When a thread needs to wait for an event it will

A. Block
B. Execute
C. Terminate
D. Update
Ann\

3: In priority scheduling algorithm

A. CPU is allocated to the process with highest priority

B. CPU is allocated to the process with lowest priority

55
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
C. Equnl priority processes can not be scheduled
D. None or the mentioned
1\11~ ,,

~: A common synchronization mechanism used in multiprocessor operating

~~·stem is

/\. Complex
B. Locks
C. Lockstep
D. None
•\11, B

OOPS lnnguagc

I: Which of the following is an nbstract data type?

t\ . Cl::iss
11. I111
C. String
n. Dnubk
;\II ~ 1\
.2: Which of lhc following type of class allows only one object of it to be created?
1\. Virtual class
I

II 13. Abstract class

I C. Singlelon ckiss
i
I
I
D. Friend clnss

,\11~ l '
J:Whcn a clnss serves ns base class for many derived classes, the situation is
calkd:
A. Polymo1vhis111
11. hierarchic;il inheritance
C. hybrid inheritance
0. rnullipath inheritance

56
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)

Ans : □
4: Consider the declarations
char n;
const char aa = 'h';
char *na;
const char *naa;
Which of the following statements
Statement I: aa = a; 1
Statement II: na = &a;
Statement Ill: na = &aa;
is/are illegal?
A. Only I and II
8. Only II and Ill
C. Only I and 111
D. All the three statements are illegal

Ans :C

Numerical method

1. What is the other name of Jacobi's method?

A. Simultaneous method
B. Diagonal method
C. Displacement method
D. Simultaneous displacement method
Ans:D

2: By using Ncwton-raphson method, Double (Repeated) root of ~x3- 8x2-

3x + 9 = 0 is?
A. 1.6
B. I .55
C. 1.4
D. 1.5
Ans: D
3: Errors may occur in performing numerical computation 011 the
computer due to
/\ .Rounding errors
B. Power fluctuation
C. Operator fati gue
[Link] of these
An s - A

57
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
.J: 111 which uf tlH· following method, we approximntc the curve of solution
h., tlu.· t:111gl'11t in each interval.

:\ . f> il'J nl's method

It Euk·r's m~rhod
C Newton's llH.'lhod
D. Runge Kulla method

Da t.1 hasc
I : In :1 relational schcmn, cnch tuple is divided into fields cnlled
,\ . Relations
R Domains
C. Queries
D. All of the above
\11, ,~

2. \\'hich one of the following provides the ability to query information

from the databnsc and to insert tuples into, delete tuples from, and modify
tuples in the database?
/\ . DML(Dara Manipulation Langauge)
B. DDL(Data Definition Langauge)
C. Query
D. Relational Schema
,\n, ,\

J: In an ER model, ................ is described in the database by storing its

d:itn.
/\. Entity
8. At tribute
C. Relationship
D. Not ation
/\ n,:/\

-I: The __ condition alJows a general predicate over the ·relations being
joined.
/\ . On
B. Using
C. Set
D. Where

58
 TRIBHUVAtJ Ulll\/[Link]
ln!ititute of Science and Technology (CSfT)
-- -~- - - ...

Computer Graphics

I: Which of the following is not a line-type?

A Dashed line
B Dark line
C. Dotted line
D. Only b
/\ns·B

2: Graphics is one of the ____ major key element in [Link] of

multimedia application
A. Three
B. Four
C. Five
0 . Six
Ans :C

3: Color depth can be defined by _ _ _ which can be displayed on a

display unit
A. Bits per pixel
8 . Bytes per pixel
C. Megabyte per pixel
0 . None of these
Ans.A

4: The division of the computer screen into rows and columns that dcfinl."
the no. of pixels to display a picture is called
A. Persistence
B. Resolution
C. Encapsulated post script
D. None
Ans:B

Automata

I: L= language of words containing even number of a's. Regular

Expression is
A. (a+b)aa(a+b)
B. (b+aba)
C. a+bbaaba
0. (a+b)ab(a+b)
Ans:B

59
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)

~.A language Lis accepted by a finite automaton if and only if it is

1\ .c011tc:'\t - free
[Link]\ t-sensit ive
[Link]
D.R ight-lincnr
•\11, I)

J: The output of the lexical and syntax analyzer can stated as:

1\. parse strenrn. pnrse tree

11 . t()kcn tree. parse tree
C. tnken stream. parse tree
D. nil or the mentioned
,\ 11, ('

-t : The scanner outputs:

/\. Stream of tokens
8. Image fil e
C. Intermed iate code
D. Mnchine code
\11~ \

S~·stcm analysis and design

I :The step-by-step instructions that solve a problem arc called _ _
/\. An nlgorithm
B. /\ list
C. A plnn
D. A sequential structure
. \11' ,\

2: r>ocumcntation is prepared
/\. at everv. sta 0 e
~

8. at system design
C. at system nnalysis
D. nt system development
,\n~:A

J: A rcrtnnglc inn DFD represents

A. a pwccss
8. a clamstore
C. an e~tcrnal entity
D. an input unit

60
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT}
- - -- Ans:C

4: ....... is a tabular method for describing the logic of the decisions to IJc
taken.
A. Decision tables
B. Decision tree
C. Decision Method
D. Decision Data
Ans:A

Simulation and modeling

I :A simulation model uses the mathematical expressions and logical
relationships of the
A. real system.
8. computer model.
C. performance measures.
D. estimated inferences.
Ans: A

2: Which of the following statements are NOT true of simulation'!

A. Simulation models the behaviour of a system
B. The equations describing the operating characteristics of the system m~
known
C. A simulation model cannot prescribe what should be done about a
problem
D. Simulation models can be used to study alternative solutions to a probl~m
Ans:B

3: Select the valid reasons for usin~ simulation.

A. Relationship between the variables is nonlinear
B. Optimized solutions are obtained
C. Conduct experiments without disrupting the real system
D. Answers I and 3
Ans:D

4: Monte Carlo simulation gets its name from which of the following'!
A. Data collection
13. Analysis
C. Model formulation
D. Random-number assignment
Ans:D

61
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)

.-\ rtilicial intelligence

I: \\'hich is not the commonly used progr:unming langu:igc for Al?
(a) PROLOG (b) Java (c) LISP (d)
r~r,

2: A search :1lgorithm t:ikes ____ as an input and returns _ _ _ as

an output.
/\. Input. output
[3. Problem. solution
C. Srdution. problem
D. Parameters. sequence of actions

J: Which sc:irch agent operates by interleaving computation and action?

A. Oftline search
B. Online search
C. Breadth-first search
D. Depth-first search
.\ 11, 13

-l: Artificial Intelligence has its expansion in the following application.

A. Planning and Scheduling
B. Gnme Playing
C. Robotics
D. All of the nbove

Computer network
I :A station in a network forwards incoming packets by placing them on its
shortest output queue. What routing algorithm is being used?
/\. hot potato routing
f3. r-lood ing
C. static routing
D. delta routing...
\ J)\",\
2: In nctworldng terminology UTP means
1\.Un~hielded Twisted pair
R. Ub iq11 itious Teflon port
C. llniformly Terminating port
11.l lnshieldecl T-conneclor port

62
 TRIBHUVAN UNIVERSITY
Institute of Science and Technologi/ (CSli}
Ans:A

3: A communication path way that transfers data from one point to

another Is coiled

A. Link
B. Node
C. Medium
D. Topology
Ans:A

4: ommunication channel is shared by all the machines on the network in:

A. broadcast network
8. unicast network
C. multicast network
D. none of the mentioned
Ans:A

Design and analysis Algorithm

1: Following arc called logical operators
A.+,-, *I/
B. <,>,<=,>=
C. AND, OR, NOT
D. \, MOD
Answer:- C

2: The PAC stands for

A. Program Analysis Chart
B. Problem Algorithm Code
C. Problem Access Code
D. Problem Analysis Chart
Answer:- D

3: How many passes are required to sort a file of size n by bubble sort
method?
A. N2 B. N C. N-1 D. N/2
Answcr:-C

4: In stack terminology, insertion operation is defined to be

A. INSERT operation

63

.....
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)
8. EDIT operation
C. PUSH opcrntion
I). POP operation
\11, C

Compiler design
I: In a compiler, keywords of a language nrc recognized during

/\ . parsing or the program

B. the code generation
C. the lexical annlysis of the program
D. datnllow nnnlysis

2:,Vhkh of the following groups is/arc token together into semantic

Sll'lll'lllrcs'!
A. Syntnx nnalyzer
13. lntcr111cdiate code gcncrntion
C. Lexical analyzer
D. Scmnntic nnalyzcr

J: _ ___ is considered as a sequence of characters inn token.

A. Te.,e111e
13. Pc11tern
C. Lc.,e111c
0. Mcxcrnc
\11- l'

-t: To rcconr from nn error, the operator precedence parser mny

/\ . insert sy111bols onto the stack and onto the input
B. delete symbols from the stack
C. delete symbols from the input
D. all or these

\Vch tcchnolooy
'='•
I: A fll'OJ,?ram running on server machitH\ is en lied
.'\ . Web scrwr
n. \\'t'b npplicntion
C. Web process
D. \Veb program
.\tb \

64
 TRIBHUVAN UNIVERSITY
Institute of Science and Technology (CSIT)

2: Internal communication within institutions is done through

A. LAN
13. WAN
C. EBB
D. MMS
Ans:A

3: URL stands for

A. unique reference label
B. uniform reference label
C. uniform resource locator
D. unique resource locator
/\ns:C

4: \Vhat is the correct HTML for adding a background color'!

A. <background>yel low<Background>
B. <body color = "yellow''>
C. <body bg color = "yellow">
D.<body bg ="yellow">
Ans·C

Best of Luck

6S
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology {CSIT)

( . (1111!,!.ntlllill!,!.

I ( ·0111pikr gmerntes _ file.

•\ - F,crntahk cndc
ll - ()hJL'(I code
t · - :\,q·mhl y cnch:

I) - N1111c ll rIhe ahnvc.

2. ·1hr "ords if, rise, auto, noal etc. have predefined meaning and users cannot use them
a, ,ariahlcs. These words arc called
/\. constant
n. iclcntilier
C. data types
D. ~t')'\\'Orcls
I
I I
I J \\'hil'h npl'ralors perform operations on data in hinary level'!
:\ I 11gical ()pcrnlnr
H llll\\'i~c opcrn1nr
C. 1\dd11io11:il npm11nrs
I) N1111c 11r lhc nhnvc

-1 The .~i7c or a character variahle in C is

,\ ·:-: hylcs
ll ., "' 1c,
l 2 h\'lc,
I) I hylL'
Sof111 an· Engincl'f"ing
:-. \\'hal is lhc final oulcome or the requirements analysis and specifications phase?

.\. l1ra11111g 1hc dnla llow dingrnm

B. rhc SRS Documcnl
C. ( ·11t1ing lill' pm,icct
ll. I hL' 11\cr i\ [Link]
<,\\Ital i, noi.q• in lerms of software dc\'clopmcnf '!

.\ . \\·n1111gim·lcvanl s1.11cmcn1 In lhc soOwnre development in lhc SRS doc11mcn1

ll. ·\dd111~ l'1u11rnd1clory rcquircmcnls in SRS doc11mcn1
C. \\'n1111g o,w-srcc11ic rcq11ircmc11ts
n. None nr1hesc above
7. Blad, 1111, ll'!-ling can he applied lo:

.\ . 111\ II d1.1grn111
H. n.11,1 1101" diagram

66
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSIT)

C. Entity-relationship diagram
D. Flowcharts
8. Which one of the following tcstlni: Is performed by ui,cr?
A. Accc::ptoncc tcsting
B. Unit testin 6
C. Compatibility testing
D. None or these
Database Man:1gcmcnt System
9. The data [Link] which describes how the data is :1ctually stored is :
A. internal model
8. external model
C. logical model
D. none of these
10. D:ita about tlatn is normally termed :1s:
A. directory
B. data bank
C. mcta data
D. none or the above

11. A \liew of database that :1ppeal's to :111 :application progr:1111 is lrnown :1s:
A. schema
ll. subschema
C. virtual Lubic
D. none or the above

12. Every weak entity set can be converted into a strong entity sci by:
A. using generalization
B, uddmg appropriate attributes
C. using nggregution
D. none of the above

Digital Logic
13. The ER model includes :1dditional concepts lil<e:
A. Specialization
ll. Generalization
C. Categorization
D. All of the above

67
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology ICSIT)

1-'. l ,~ing an atltlitional NOT gale, :1 .JK flip-llop can he converted into

\. I ll1p-llnp
B. l{S llrp-flop
< ·. ~·laster Sln,·c flip-flop

ll. 11 llrp-llnp
l:i. In a .J-h: Flip Flop the function K=,J' is used lo realize
.\ . T-l"lip-Flop
B. "-I~ Flip-Flop
C. n -rlip-Flnp

D. i\ 1·s .1-K Flip-Flop

1(1. \\'hid1 [Link],!il' drcuil woulll you use for :uldrcssing memory?
.\ . I 1111 adder

I>. I)1rt·ct mi:morv acci:ss circuit

1);1ta ~lrul·turc and ,.\lgorilhm

17. \\ hid1 of the fi1llow111g has si:arch i:flickncy is 0( 1)-
\ I !\'I:
n lk;tp
t · I l;1~h I ahli:

I) I 111kcd-l I I

IS . .\ phol dl'l11cnl lo partition unsorted list is usetl in

I) Si:lccl 1011 Sort

l'I. ·1inH' n·quiml In merge two sorted lists of size m anti n, is
I
, \ (){ Ill 11)

ll. O(m ·I n)

. In!!- n)
( · I l(m

D. ()(11 Ing 111)

68
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSIT)

20. Quick sort algorithm is :in cx:1mplc of

:
., A. Greedy appronch
B. Improved binary search
C. Dynamic Programming
D. Divide and conquer
Compiler Design And Construction
21. In :1 compiler, l<cywords of :1 l:angu:1gc arc recognized during
A. parsing of the program

B. the code generation

C. the lexical analysis or1he program
D. datallow analysis
22. The grammar A - AA I (A) It is not suitable for prcdictivc-p:1rsing lm:ausc lhc
gr11mm:1r is
A. ambiguous
8 . left-recursive
C. right-recursive
D. an operator-grammar
23. In :1 IJotlom-up crnluation of a syntax directed definition, inhcritcd 111trih11lcs c:111
A. always be evaluated
B. be evaluated only if the definition is L-attributed
C. be evaluated only if the definition has synthesized attributes

D. never be evaluated
2-L Which or the following statements is false'!
/\. /\n unambiguous gr:m1mar has same kl\mosl und rightmost derivutiun
[3 /\n LL( I) p~1rser is a lop-down p:irscr
C. LALR is more powerflil thtm SLR
D. An nmbiguous grammar can never be LR(k) for nny k
C++
25. Ir no exception is thrown, then
A. u cntch block will-cnusc nn error
U. the lirst cutch block coded will execute
C. the Inst cntch block coded will execute
0. any cntch blocks coded will be by passed.

69
 l'RIBHUVAN UNIVERSITY
to~t1tute or Scu~ncc And Tcchnolonv (CSITI
~<,. I hr ( +-+ op,·r:11or mrll to ~,llucatc mcnwry Is
\ , lth' lll

~7. \\'hich i~ not 1hr fr:1turc of strucrumJ progr:1mming'!

\. :-.11pp,1r1 ft,r nH1Jul.1r pmgr,mm1mg
B. I 1,cr-d ·tined J.,ta I) pcs
< . l'mph.,~i. 1111 Jl~(lrtthm

ll, I l,11;1,11'..irac11n11

~s. \\ hk h 11f 1hc follnwin~ c:rn he passnl In function lemrlate as :in argument?
\ . 11, L·r-dd inL·d J;11a typ~s

C'. ~ ln!CI I~IX'

I>. .\ II of thc:-c

Operating System
~•). \\ h:it i~ the ckctrnnic signal lh:11 cause comruler lo stor current progr:im?

B. inll'Tnlpl

n. cnmmanJ
Jll. What i, a running proJ!r:1m under execution c:illed?

B. Jnh

n. :\ny nf rhc ahovc

JI. llow many prim:iry parlilions c:111 be created?
.\. I

..
(
. ·'
n. -1

70
 'rnH?HUI/A'i LJIIPI Ch:1r,
rn~tltu ft Gf ~dn1(~ /..nd i ttl'r..~u (~fl'}

J2. ,\ J2 :[Link] line$ map) to the mcm,,ry ,,f

A. 1~ l>ylt:S
U. 0.5J.. bytc!S
C. 2k bytes

o. None of these
Discrete Structure
JJ. Which or the following propositions is tautology?
,\.(p \I q)-q

U.p v (q-p)

C.p \' (p-q)

[Link] (b) & (c)

34. Identify the valid conclusion from the premises Pv Q, Q - R, P - M, ~1

A.P ' · (RvR)

U.P " (P " R)

C.R " (P vQ l
D.Q I\ (P V R)
35. Assuming that n = k is true, ant.I that _ _ is also true, corresponds to the second
step of mathematical induction.
A. n=k+ l
B. n=k+ l
C. n=k+2
D n=k-2

36 (P v Q}" (P-R}" (Q - R) is equival~nt to

A.P
B.Q
C.R
[Link]: =T

71
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSIT)

Co111p11ll't' ;\ch\11rk

J7 T\\ jqcd p:1ir have 111:iximum segment of

\ .~Oil 111

B.2rn1 m
C". lllll m
n .2ll1Hl m

.lN Frequency ran~c al which the land coaxial cables arc used, is
,\. I Oh tn I OS 1-11
the frequency range at which the land coaxial cables aril be used is
B. 1ll10 tn !Ill I Hz 10^6to 10^8 Hz
C. Ill] to I04 Hz

JtJ Which of the following is nol a transceiver function'!

\. rrim,111 i,s1nn and receipt of dntn

[Link]~111g or 1111c vnltngcs

C.,\dd111nn nml s11h1ract1011 of headers
n.Cr1IIJ,i1111 tk1c1:11trn
.rn \\ orldn:,! of the \\',\II generally invol\'cS
\ .1ckph1111,~Imes
B. 1111cm "ii\ c,

c·0111pull'r Craphics

~I . The ~uhl'alrgorics of orthographic projection :ire

\. t·aval1cr. cahmct, isometric
[Link], alicr. cabinet
C. jq1mwic. dimctric. trimctric

I>. ,~nmctric. cavalier, trimetric

i
~2 Hasler system!- display a picture from :1 definition in a

.\.di~play lilc program

I
I I B. lrilmc buffer
f C.d1,pla~· controller
, I

72
 , .

TRIBHUVAN UNIVERSITY
Institute Of Science And Tcchnolog,1 (CSIT)

43 . Back face removal is nn exumplc of

A. object spnce method

o. j1110gc ar,uco muthod
C. wmbination of both
D none or thl! above
.t.t. The best [Link] surface removal algorithm is
A. painters
8. depth buffer
C. area subdivision
D. lkpenus on the application

Computer Architecture
45. Which of the following is not :1 form of memory'?
A. Instruction cache
8.1nstruction register
C. Instruction opcode

D. Both (a) and (b}

46. Desirable characteristic(s) of a memory system is(arc)

A. Speed and reliability

B. Low power consumption

C. Durnb1lity and compactness

D. All of these

47. A dynamic RAM consists of

A. 6 transistors

B. 2 transistors and 2 capacitors

C. I transistor and I capacitor

D. None of these

48. Which of the following is the internal memory of the system (computer)'!

A. CPU register

73
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSIT)

l . 1' l;1i11 llll'lllllry

Automata Theory
-1 1) . Pumping lemma is gcncnilly used for pro\'ing that

1\ . g.1Ve11 grammar is regular

B. ~iwn grammar is not regular

C. \\'hc1hcr 1wn given n:[Link] c:-.prcss1011s arc cquivnlcnl or 1101

I 311 . .\ny slrinl! of terminals that can he generated by the following CFG is
S-> \ '
I \--> a\ I h\ I a
\'-> \'a I \'h I a
I .\, h;p; allcilsl nnc 'h'

ll ,hn11ld end ma 'a'

C ha\ 1111 cnn~crnli\'c a's or h's

I) lrn~illlcilSI II\ 0 n's

~I. Sl·I nf n·~ular languages over a given nlphahet set is closed undrr

.\, 111111111

ll Ct11llplcmcnlali()l1 closed under operations union, concatenation and Kleene star.

t llll l'r~l'Cllllll

S2 \\'hirh or the followin~ statement is corrcct7

.\. 1\ll l.111g11.1~cs can not he gcncrnled hy CFG

II. 1\ny ll'~11lar lang11ngc has nn cquivnknl CFG

C·• Snnw 111111 regular langungcs cnn'l be gcncrntcd hy cr-G

D. ho1h (h) and (c)

74
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSITI

Numerical Method
~ SJ. The convergence of which of the following method is sensili\'e to starling ,·alue'!

A.17olse position

., [Link] seidal method

[Link]-Raphson method

[Link] of these

5-t. Newton-naphson melhotl of solution of numerical equal ion is not prefrrrctl when

[Link] or A(8) is vertical

[Link] or x(y) is not parallel

[Link] graph or ltx) is nt:arly horizontal-whert: 1t crosst:s the x-axis

[Link]: of these

55. Ncwton-llaphson methotl is applicable to the solution of

A.13oth algebraic and transcendental Equations

B. Both nlgdm1ic und trunsccndentul und ulso used when the: roots un.: cum pie.,

C./\lgebruic equations only

[Link] cquntions only

56. In which of the following methods proper choice oriniti:11 , alue is ,·cry i1111111rl:11111
1

[Link] method

B. False position

[Link]-Raphson

[Link] ml!thod

DAA
57. Push opcrntion of n stuck comprises of

A. 4 steps
0. 5 Sll!pS

C. 6 steps
D. 7 steps
SS. In Unicast nouting, Dijkstra :1lgorithm creates:, shortest path tree rrom :1

75
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSIT)

,\ (iraph
n Chart
C S1n1ion
D. I ink

59. In slnw-slarl al~orithm, size of congestion window increases exponentially until it

n·achcs

;\ I)

I! n-1
C Threshold
I) 11.1- t

60. \\'hid1 nf the followinl! sort is most cl'licicnt

l' ll11hbk SM

I) I le;1p Snn

Artilicial Intelligence
61. I11lcrn:1I stale of neuron is called _ _ _ _, is the function of the inputs the
lll'lll"OII S nrci\'l'S

n.ar1i, il11nn or activity level of neuron

[Link]~

62. l·>, pcrl systems

\.C,1mhi11111g dilTi:n:nt types or method or inform:llinn

B. ,\ppronch to the design of lcnming algorithms [Link] is struclun::u along the lines of the
nr
1hcnrv cvol11til1n

[Link] infonnalinn hnsc lillecl with the knowkdgc of nn ex pen formulntcd in tcnns of i f-thcn
ruk,

63. l'l·rccpl ron is

.\.( icncral class nr approaches to a prohlcm.

76
 TRIBHUVAN UNIVERSITY
Institute Of Science And TechnoloiY (CSIT)

B. Performing several computations simultaneously

• J
[Link] in a database those are statistically relevant

[Link] forerunner of modem neural networks, without hidden layers

64. Prolog is
A.A programming language based on logic

B.A computer where each processor has its own operating system, iLs own 111c1nury, ,mJ 11s
own hard disk

[Link] the structure of the contents of a database

[Link] of these

65. which system model is :1pplics to computation:11 procctlurc to soh•c cqu:1tions

[Link] Model

[Link] MOdcl

[Link] Model

[Link] Model

66. In Discrete System, Changes arc

A. predominantly continuous
are discontinuous
13. predominantly Discrete

[Link] on the System

[Link] of the Above

67. In bani< system ,what is the customer

[Link]

[Link]

[Link]

[Link] of the Above

68. Which of the following is simul:tlion L:rngu:1gc

[Link]

[Link]

[Link]

17
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSIT)

69. Corn·cl IIT:\11. tag for the largest lic:uling is

711 .lhr altrihutc of <form> tag

,\ .i1dc1hod

B. :\cl 1011

[Link] (a)&(hl

I>. None nr Ihcsc

71. IIT:\ IL is a subset of

B. SGtvll.

[Link])

72. <IH> ta~ is designed to fit :1 single line of our web page but <DD> tag will accept a

.-\.line of lcxl

B. 1'1111 parngraph

C.\\nru

n.rcq11cs1

7J. l'rorc~~nr st.1t11s n·onl orR08S microprocessor has lire nags. They arc

.'\ S. '/.. 1\ C. P. CY

II S. nv. J\C, r, ('Y

l' S. 7. OV, P. CY

I) S. ?. 1\C. P. OV

78
 TRIBHUVAN UNIVERSITY
Institute or Science And Technology (CSITJ

74. The cycle required to fetch and execute an instruction in a 8085 microprucc,[Link] i,
which one of the follow_ing'f

A. Clock cycle

8 . Memory cycle

C. Machine cycle

D. Instruction cycle

75 The number of output pins in 8085 microproccs H and L sors arc

A.40

8.27

C.21

D.19

76. Temporary registers in 8085 :ire

[Link] C

13. D and E

C. 1-1 and L

D.W and Z

System analysis and Design

77. Testing of software with actual data and in actual cn\'ironmcnl is cllllcll

A. Alpha testing

8 Beta testing

C. Regression testing

D. None of the above

78. Which process model is nlso called as classic life cycle model'!

A. Waterfall model

D. RAD model

C. Prototyping model

D. Incremental model
79. Requirements prioritization and negotiation belongs to:

79
 TRIBHUVAN UNIVERSITY
Institute Of Science And Technology (CSIT)
1\ l~l·q11irc111l·n1s v:ilida1ion

eliciation

l > /\nf1tlll'l11Cnls reviews

NO. ·1he ................ model is prcrerred for soflwarc dcvelorment when lhe requirements
an· nnt rkar.

·\ . l~ap,d ,\pplication Dcvdopmcnl

It lt ll i1111al I lnilicd Proci:ss Evolutionary Model

( · I., 11h11innary Model

I) \\'a1crfoll t\·lodcl

NI . Whal is lhe equation or the line lhnl passes through roint (9, 7) and is rerpendicular
111 the linl' y = l/3x - 5?

y = mx + b

m = resiporcol of 1/3x i.e -3

:u .In Ihe Ca rlesian plane, points R(-16, 45) and Q(26, 5) arc the endpoints of one of the
diallll'll'rS of ii circle,

\\'hich nf 1hc fi1llnwing s1a1cmc111s is true?

•1\ ·1he r:idius or this circle is 20.6 units. use mid point and distance formula to find r

ll l"IH.: radius 01'1his circle is 29 units.

l'. Tiu: coorclinnlcs 01'1hc centre of1his circle are (5. 20).

n. The coordi11111cs of' the centre of this circle arc (21 , 25).
NJ. Whal are the values of lhc slope, the zero, and lhe initial value·, respectively'!

80
 TRIBHUVAN UNIVERSITY
fn~tltut!! Of Science And Technology (CSJT)

R4. Flud dyl,b: Ify "'t!siu]x

(a) ccos3x

(b) 3ecos3x

(c) 3(cos3x) csin3x

(d) 3csin3x

85. Find the limit of se,1uence :1s n>c.o, whose general ferm is 5n+2/2-7n

A.0

B. oo

C. I

D.-517

86. If f(x) =..Jxz - 4, the domain off is

A. (-oo,-2) U [2, oo]

8. (- O?,-rJ))

C. [-2,2]

D. [-3, 3)

87. if f(x) = sinx and g(x) =cosx, lhcn (fog)(x) =?

(a) (sinx) (cosx) (b)tanx

(C) sin(cos:-:) (D) cos(sinx)

88. d/tb(sinx)-tl 2 Jdx 2 (cosx) =?

A2sinx

8. 2cosx

C.O

D. -2sinx

89. slope or a [Link]~ht line p:1r.1llcl to x-axis is

A-I

B.O
C.l

81
 TRIBHUVAN UNIVERSITY
Institute or Science And Technology (CSIT)

I) I lnddir~:d

')II. )= liln-l(coh), lirul dy/dx

.1.- I x 2

/;/

[Link]·ar 1\lgchni

')I. In Cr:1111er's rule, dimension of matrix of coeflicients is

i\ I , m11

B I- 11111 1xmn

C 11 .\ 11

I} I + 11111

n. Which of these functions is nol uniformly continuous on (0, 1)?

C lhl = I lor .\ E (0. l). f{O) = f(I) : 0

I) ~111( \)

93. The system of linear equations

(~II · I), +y + z = 0
-y+ 1.=0
(~d- l) z= II
ha, a 11011-l rivia I ., olul ion, if d equals

,\.1 /2

B. 11-1

D.I

82
 TRIBHUVAN UNIVERSITY
Institute or Science And Technology (CSIT)

9-'. The rank or :1 3 x 3 matrix C (= AB), found by multiplying a non-zc:ro column

matrix A or size 3 x I and :1 non-zero row matrix 8 of si1..e I x 3, i!

A.0

D. l

C.2

D.3

95. If A and 8 be real symmetric m:ttrices of sizen n x n, then

[Link]=BA

D.(AB)r = BA

96. Order of the power set of a set of order n is

A.n

B.2n

0.2"

97 ltlentity element in the group given below with respect to m:1trix {Ix xi}
multiplication is

A. (i ~)
13
·(-10 -10)

C. l.!_2 .!.l
2
... 1 l
2 2

D.

83
 TRIOHUVAN UNIVERSITY
lMtltutc or Science And Technology ICSIT)

>s. II \ :11111 n:arc ~1111:a rr 111:itrlccs of size n x 11, then whirh or thr follow In~ st atcmenl Is
1

111111rn r'.1

det(A+B)=det(A)+det(B) " is not correct

( .dc11.\ • 13) "' dc1{i\) + dct (11)

1
[Link] (,\ l =I/Jct (A' 1)

11
l l. Th{· 111:1lri, B= ,\ T, where ,\ is :my matrix is

II.,ymmc1ri!: about lhl! secondary diagonal

ltlll. Ir .\ anti narc non-zero square ma Irices, then AB= 0 implies

\ .:\ and B arc orthogonal

II.,\ anJ B arc ~ingular

c.n 1, ingular

n. \ 1s s111g11br

84
 t'

. ,.

.. . .

.·i

l
. -1
I
..·;

J.