Q.

Complexity of searching algorithm measured in terms of :

(a) the umber f (n) of comparisons required to find item in DATA where
DATA contain n elements
(b) O (log2n) comparisons
(c) O (n2) comparisons
(d) None of the above
Q. DELETE (ABCDE!"# $#%& results into:
(a)ABD!
(b)ABD
(c)AD"#!
(d) None of the above
Q. Data items that are di'ided into su( items are called:
(a) "lementar$ item
(b) !roup item
(c) (a) and (b) both
(d) None of the above
Q. A (inary tree T is said to (e a %)tree or an extended (inary tree
if each node *:
(a) has either O or 2 children
(b) has ma%imum number of children
(c) has odd number of children
(d) None of the above
Q. An input restricted de+ue is the one that allo,s:
(a) insertion at onl$ one end of the list but allows deletions at both of the
list
(b) insertions at both ends of the list but allows deletion at onl$ one end of
the list
(c) uncertain insertion and deletion of elements at both ends
(d) None of the above
Q. Deletion of elements in a +ueue can ta-e place at:
(a) both end
(b) one end
(c) in the middle
(d) None of the above
Q. Quic- sort is an algorithm of the :
(a) &odern t$pe
(b) Divide and conquer t$pe
(c) 'lower efficienc$
(d) None of the above
Q. Queue are also called:
(a) ()#O lists
(b) #)#O lists
(c) (in*ed lists
(d) None of the above
Q. E+ui'alent .refix notations for the expression: ((A/B&0C (D12
E&3(/!&& is :
(a) +,,-./AB0D"/#!
(b) .,,-+/AB0D"/#!
(c) +,,/.-AB0D"/#!
(d) None of the above
Q. 4o, many null (ranches are there in a (inary tree ,ith %5
nodes:
(a) 1ero
(b) Thirt$
(c) Twent$ one
(d) None of the above
Q. Liner array is a :
(a) (ist of finite number n of heterogeneous data elements
(b) (ist of finite number2 n of homogenous data elements
(c) (a) and (b) both
(d) None of the above
Q. 6aria(les that can (e accessed (y all program modules are
called:
(a) 3rivate variables
(b) !lobal variables
(c) 'tatic variables
(d) None of the above
Q. T,o condition of Binary 7earch algorithm are:
(a) the list must be sorted and one must have direct access to the middle
element in an$ sub list
(b) the list must be sorted and one must have direct access to the last
element in an$ sub list
(c) onl$ list is sorted
(d) None of the above
Q. An array .T8 is called a pointer array if each element of a .T8 is
a:
(a) )nteger
(b) Null element
(c) 3ointer
(d) None of the above
Q. 8ecursion may (e implemented (y means of:
(a) 'tac*s
(b) Binar$ Tree
(c) 4ueue
(d) None of the above
Q. The three standard ,ays of tra'ersing a (inary tree is: (a&
.rocess the 8oot 8 ((& Tra'erse the left su(tree of 8 in procedure
(c& Tra'erse the right su(tree of 8 in preorder 9n order is:
(a) (2) (5) (6)
(b) (6) (2) (5)
(c) (5) (2) (6)
(d) None of the above
Q. 9n the se+uential representation of !raph ! in computer# it may
(e difficult to:
(a) insert nodes in !
(b) delete nodes in !
(c) (a) and (b) Both
(d) None of the above
Q. There are::::::::::..standard ,ays of maintaining a
graph ! in the memory of a computer.
(a)four
(b)three
(c)two
(d)None of the above
Q. ;hich of the follo,ing a(stract data types are not used (y
9nteger A(stract Data Type group<
(a) 'hort
(b) )nt
(c) #loat
(d) (ong
Q. A node has :::::::elements.
(a) None
(b) One
(c) Two
(d) Three
Q. .olish notation refers to the notations in ,hich:
(a) the operator s$mbol is placed after its two operands
(b) the operator s$mbol is placed before its two operands
(c) the operator s$mbol is placed in the middle
(d) None of the above
Q. =aximum num(er of +ueues needed to implement the priority
+ueue:
(a)Three
(b) Two
(c) #ive
(d) One
Q. 9n this 7TAC>7# ?.@74? is the term used to:
(a)insert an element into a stac*
(b)delete an element from a stac*
(c)modif$ the e%isting element of a stac*
(d)None of the above
Q. By a schematics character 'aria(le ,e mean:
(a) A variable whose length is defined before the program is e%ecuted and
cannot change through the program
(b) A variable whose length ma$ var$ during the e%ecution of the program
as long as the length does not e%ceed a ma%imum value determined b$ the
program before the program is e%ecuted
(c) (a) and (b) both
(d) None of the above
Q. 9n tree construction ,hich is the suita(le efficient data structure
:
(a)arra$
(b)lin*ed lists
(c)stac*
(d)queue
Q. Lin-ed lists are (est suited:
(a)#or relativel$ permanent collections of data
(b)for the si7e of the structure and the data in the structure are constantl$
changing
(c)for both of above situation
(d)for none of the above situation
Q. Arrays are (est data structures :
(a)for relativel$ permanent collections of data
(b)for the si7e of the structure and the data in the structure are constantl$
changing
(c)for both of above situation
(d)for none of the above situation
Q. The operation of processing each element in the list is -no,n as:
(a)'orting
(b)&erging
(c))nserting
(d)Traversal
Q. inding the location of the element ,ith a gi'en 'alue is:
(a)Traversal
(b)'earch
(c)'ort
(d)None of the above
Q. ;hich of the follo,ing is not linear data structure<
(a)Arra$s
(b)(in*ed lists
(c)Both of the above
(d)None of the above
Q. Each array declaration need not gi'e# implicitly or explicitly# the
information a(out:
(a) the name of arra$
(b) the data t$pe of arra$
(c) the first data from the set to be stored
(d) the inde% set of the arra$
Q. The complexity of Bu((le 7ort algorithm is:
(a)O (n)
(b)O (log n)
(c)O (n2)
(d)O (n log n)
Q. The complexity of Bu((le 7ort algorithm is:
(a)O (n)
(b)O (log n)
(c)O (n2)
(d)O (n log n)
Q. The complexity of Binary 7earch algorithm is:
(a)O (n)
(b)O (log n)
(c)O (n2)
(d)O (n log n)
Q. The complexity of Binary 7earch algorithm is:
(a) O (n)
(b) O (log n)
(c) O (n2)
(d) O (n log n)
Q. ::::::: is a ,ay of grouping things together (y placing one
thing on top of another and then remo'ing things one at a time
from the top.
(a) Arra$
(b) 'tac*
(c) 3ointer
(d) All of the above
Q. A +ueue is a :
(a) 'equential Organi7ation of data
(b) (isting of data
(c) )nde%ing of data
(d) None of the above
Q. The de)+ue process remo'es data:
(a) #rom the front of the queue
(b) #rom the bottom of the queue
(c) an not be removed
(d) None of the above
Q. The space factor ,hen determining the efficiency of algorithm is
measured (y:
(a) ounting the ma%imum memor$ needed b$ the algorithm
(b) ounting the minimum memor$ needed b$ the algorithm
(c) ounting the average memor$ needed b$ the algorithm
(d) ounting the ma%imum dis* space needed b$ the algorithm
Q. A data structure is a ,ay of:
(a) arrangement of different data elements
(b) organi7ing data with consideration of items stored into it along with
their relationship with each other
(c) ordering of collected data
(d) None of the above
Q. The time factor ,hen determining the efficiency of an algorithm
is measured (y:
(a) ounting microseconds
(b) ounting the number of *e$ operations
(c) ounting the number of statement
(d) ounting the 8ilob$tes of algorithm
Q. T,o main measures for the efficiency of an Algorithm are:
(a) 3rocessor and &emor$
(b) omple%it$ and apacit$
(c) Time and 'pace
(d) Data and 'pace
7ET)%
Q. 7tac- is:
(a) 'tatic data structure
(b) )n built data structure
(c) D$namic data structure
(d) None of the above
Q. Tra'ersing means:
(a) Accessing and 3rocessing each record e%actl$ once
(b) Arranging and data in some given order
(c) #inding the location of the record with a given *e$
(d) None of the above
Q. @sing arrays most efficient implementation of Queue is as:
(a) (inear queue
(b)ircular queue
(c)3riorit$ queue
(d)None of the above
Q. A 'ertex of degree one is called as:
(a) )solated verte%
(b) 3endant verte%
(c) olored verte%
(d) Null verte%
Q. A connected graph ! is a Eular graph if an only if all 'ertices is
-no,n as:
(a) 'ame degree
(b) Different degree
(c) Odd degree
(d) "ven degree
Q. A full (inary tree ,ith a non)leaf nodes contains:
(a) 2n / 5 nodes
(b) n / 5 nodes
(c) 2n / 9 nodes
(d) log2 n nodes
Q. Di'ide and Con+uer algorithm may (e 'ie,ed as a:
(a) :ecursive procedure
(b) )terative procedure
(c) Both of the above
(d) None of the above
Q. 4eader of lin-ed list is a special node at the :
(a) &iddle of the list
(b) Beginning of the list
(c) "nd of the lin*ed list
(d) Both (b) and (c)
Q. 9f function DELETE (AAA BBB"# %#%& runs# result ,ill (e:
(a) AABB
(b) ABBB
(c) AAAB
(d) None of the above
Q. A techni+ue ,hich collects all detected space in free storage list
is called:
(a) 'tatic memor$ allocation
(b) !arbage collection
(c) D$namic memor$
(d) None of the above
Q. AdAacency matrix of a graph is:
(a) )dentit$ matri%
(b) '$mmetric matri%
(c) As$mmetric matri%
(d) None of the above
Q. !raphic can (e implemented using: (i& Arrays (ii& Lin-ed list (iii&
7tac- (i'& Queue
(a) (i)2 (ii) and (iv)
(b) (i)2 (ii) and (iii)
(c) (ii) and (iii)
(d) (i) and (ii)
Q. ;hich of the follo,ing a(stract data types can (e used to
represent a many to many relation<
(a) Tree2 onl$
(b) 3le%2 onl$
(c) !raph2 onl$
(d) Both B and A
Q. 9n ,hich of the follo,ing tree must (alance of each node (e
either B# 2B or 5<
(a)Threaded tree
(b)(e%ical ordered binar$ tree
(c)A; tree
(d)None of the above
Q. A (alanced (inary tree is a (inary tree in ,hich the height of the
t,o su(tree of e'ery node ne'er differs (y more than:
(a) 2
(b) 5
(c) 6
(d) None of the above
Q. 4o, many cycles should (e contained in a tree<
(a) <
(b)At least 5
(c)An$ number
(d)None of the above
Q. A (inary tree ,ith nodes has:::.num(er of *ull lin-s.
(a)n /5
(b)2n
(c) n /2
(d)n05
Q. ;hich method of tra'ersal does not use stac- to hold nodes that
are ,aiting to (e processed :
(a)Breadth #irst
(b)Depth first
(c)D=search
(d)None of the above
Q. Breadth first search :
(a)'cans all incident edges before moving to other verte%
(b)'cans all ad>acent unvested verte% as soon as pos
(c))s same as bac*trac*ing
(d)None of the above
Q. The heap (represented (y an array& constructed from the list of
num(er : C5#B5#D5#E5#BF#FF#BG# is :
(a) ?<2@<229926<25<25A259
(b) @<2992?<25925<26<25A
(c) @<2?<26<25A29925925<
(d) None of the above
Q. 9n ,hich tra'ersal algorithm# the items are printed in Ascending
order<
(a) 3reorder
(b) 3ost order
(c) )n order
(d) All of the above
Q. 9n the (alanced (inary search tree:
(a) Balance factor each node is either = 0 52< or 5
(b) Balance factor of each node is <
(c) Balance factor of each node is either 022 052 <2 52 2
(d) A binar$ search tree is alwa$s balanced
Q. A (inary search tree is generated (y inserting in order the
follo,ing integers: F5#BF#E%#F#%5#FD#HB#C#D#CG#E5#%$# The num(er
of nodes in the left su(tree and right su(tree of the root
respecti'ely is:
(a)B2A
(b)A2B
(c)@26
(d)62@
Q. A linear list of elements in ,hich deletion can (e done from one
end and insertion can ta-e place only at the other end is -no,n is:
(a) 4ueue
(b) 'tac*s
(c) Tree
(d) Branch
Q. The infix expression A / (B 2C& 0 D is correctly represented in
prefix notation is:
(a) A /B 0 .D
(b)/A . 0 BD
(c) AB0D./
(d) A/B 0D.
Q. The operations push (& and pop (& are associated ,ith:
(a) 'tac*
(b) 4ueue
(c) Tree
(d) All of the above
Q. *@LL pointer is used to tell:
(a) "nd of lin*ed list
(b) "mpt$ pointer field of a structure
(c) the lin*ed list is empt$
(d) All of the above
Q. 9t is appropriate to represent a +ueue is:
(a)A circular list
(b)Doubl$ lin*ed list
(c)(inear lin*ed list
(d)Arra$
Q. The address field of a lin-ed list:
(a)ontain address of the ne%t node
(b)ontain address of the ne%t pointer
(c)&a$ contain NC(( address
(d)Both (a) and (c)
Q. ;hat is the minimum num(er of field ,ith each node of dou(ly
lin-ed list<
(a)5
(b)2
(c)6
(d)B
Q. 7tring Concatenate means:
(a)op$ing one string to another
(b)Adding one string at end of the other
(c)Adding one string at beginning of the other
(d)None of the above
Q. 9f char 0 name I Dishita?#J statement is executed successfully#
then ,hat ,ill (e the 'alue of 0 name<
(a) D
(b)Dishita
(c)!arbage
(d)None of the above
Q. dynamically allocated memory can (e returned to the system (y
using :
(a)malloc ()
(b)alloc ()
(c)realloc ()
(d)free ()
Q. Array is:
(a)(inear Data 'tructure
(b)Non (inear Data 'tructure
(c)omple% Data 'tructure
(d)None of the above
Q. The elements of an array are accessed (y:
(a)Accessing function in built 0 in data structure
(b)&athematical function
(c))nde%
(d)None of the above
Q. ;hat is the lo,er (ound of an array in C<
(a)5
(b)<
(c)!arbage
(d)05
Q. ;hich of the follo,ing is L9K structure<
(a)'tac*
(b)4ueue
(c)Tree
(d)!raph
Q. Complexity measures are:
(a)time
(b)speed
(c)both (a) D (b)
(d)None of the above
Q. ;hat is the complexity of linear 7earch<
(a)O (log2 n)
(b)O (n)
(c)O (n log2 n)
(d)O (n2)
Q. The process of arranging data in increasing order is called:
(a)'orting
(b)Data Arrangement
(c)&erging
(d))nde%ing
7ET)C
Q. The field that in'estigates the mechanics of human intelligence
is:
(a)histor$
(b)cognitive science
(c)ps$cholog$
(d)sociolog$
Q. The ne, organiLation esta(lished to implement the ifth
!eneration .roAect is called:
(a))OT ()nstitute for New !eneration omputer Technolog$)
(b)&)T) (&inistr$ of )nternational Trade and )ndustr$)
(c)& (&icroelectronics and omputer Technolog$ orporation)
(d)'3 ('tategic omputing 3rogram)
Q. An A9 techni+ue that allo,s computers to understand
associations and relationships (et,een o(Aects and e'ents is
called:
(a)heuristic processing
(b)cognitive science
(c)relative s$mbolism
(d)pattern matching
Q. *ils *ilsson headed a team at 789 that created a mo(ile ro(ot
named:
(a):obitics
(b)Dedalus
(c)'ha*e$
(d);a%
Q. 9n L97.# the function returns the first element of a list 9s
(a)set
(b)car
(c)first
(d)second
Q. Kne of the leading American ro(otics centers is the 8o(otics
9nstitute located at:
(a)&C
(b)&)T
(c):AND
(d)':)
Q. 9f a ro(ot can alter its o,n traAectory in response to external
conditions# it is considered to (e:
(a)intelligent
(b)mobile
(c)open loop
(d)None of the above
Q. 9n a rule)(ased system# procedural domain -no,ledge is in the
form of:
(a)production rules
(b)rule interpreters
(c)meta=rules
(d)control rules
Q. 9n L97.# the function assigns the sym(ol x to y is
(a)(setq $ %)
(b)(set $ E F%F)
(c)(setq $ E F%F)
(d)(setq $ F%F)
Q. ;ea- A9 is
(a) the embodiment of human intellectual capabilities within a computerG
(b) a set of computer programs that produce output that would be
considered to reflect intelligence if it were generated b$ humansG
(c) the stud$ of mental faculties through the use of mental models
implemented on a computerG
(d) All of the above
Q. 9n L97.# the addition C / % is entered as
(a)6 / 2
(b)6 add 2
(c)6 / 2 E
(d)(/ 6 2)
Q. The original L97. machines produced (y (oth L=9 and 7ym(olics
,ere (ased on research performed at:
(a)&C
(b)&)T
(c)'tanford Cniversit$
(d):A&D
Q. The 7trategic Computing .rogram is a proAect of the:
(a)Defense Advanced :esearch 3ro>ects Agenc$
(b)National 'cience #oundation
(c)Het 3ropulsion (aborator$
(d)All of the above
Q. 7eymour .apert of the =9T A9 la( created a programming
en'ironment for children called:
(a)BA')
(b)(O!O
(c)&I)N
(d)#O:T:AN
Q. .rior to the in'ention of time sharing# the pre'alent method of
computer access ,as:
(a)batch processing
(b)telecommunication
(c)remote access
(d)All of the above
Q. DEC ad'ertises that it helped to create ?the ,orld"s first expert
system routinely used in an industrial en'ironment#? called MCK*
or:
(a)3D3=55
(b):l
(c);AJ
(d)&A!NO&
Q. To in'o-e the L97. system# you must enter
(a)A)
(b)()'3
(c)( (ommon (isp)
(d)both b and c
Q. .rogramming a ro(ot (y physically mo'ing it through the
traAectory you ,ant it to follo, is called:
(a)contact sensing control
(b)continuous=path control
(c)robot vision control
(d)pic*=and=place control
Q. .8KLK! is an A9 programming language ,hich sol'es pro(lems
,ith a form of sym(olic logic -no,n as predicate calculus. 9t ,as
de'eloped in BHG% at the @ni'ersity of =arseilles (y a team of
specialists. Can you name the person ,ho headed this team<
(a)Alain olmerauer
(b)Nic*laus Kirth
(c)'e$mour 3apert
(d)None of the above
Q. Decision support programs are designed to help managers ma-e:
(a)budget pro>ections
(b)visual pro>ections
(c)business decisions
(d)vacation schedules
Q. ;hat ,as originally called the ?imitation game? (y its creator<
(a)The Turing Test
(b)()'3
(c)The (ogic Theorist
(d)$bernetics
Q. ;hich -ind of planning consists of successi'e representations of
different le'els of a plan<
(a)hierarchical planning
(b)non=hierarchical planning
(c)All of the above
(d)pro>ect planning
Q. ;hat stage of the manufacturing process has (een descri(ed as
?the mapping of function onto form?<
(a)Design
(b)Distribution
(c)pro>ect management
(d)field service
Q. ;hat is the term used for descri(ing the Audgmental or
commonsense part of pro(lem sol'ing<
(a)Leuristic
(b)ritical
(c);alue based
(d)Anal$tical
7ET)$
Q.
The follo,ing figure represents M
(a)Directed graph
(b)Cndirected graph
(c)Cnconnected graph
(d)A;( tree
Q.
+
(a)Directed graph
(b)&ultigraph
(c)A;( tree
(d)None of the above
Q. Kne of the more popular (alanced trees ,as introduced in BHE%
(y adelson)'els-i and Landis is -no,n as:
(a)A;( Tree
(b)B Tree
(c)&=wa$ search tree
(d)None of the above
Q. ;hat ,ill (e the expression for the follo,ing (inary tree<
(a)" E (a0b)N((c.d)/e)
(b)" E a0bNc. d / e
(c)" E a 0 (bNc .d) /e
(d)" E(a0bNc) . (d/e)
Q. The depth n of the complete (inary tree in ,ith a nodes is gi'es
(y:
(a)log2 (n /5) 05
(b)log2 n/5
(c)log2 (n05) / 5
(d)log2 n
Q. The initial configuration of a +ueue is .#Q# 8#7 (. is the front
end&. To the configuration 7#8#Q one needs a minimum of:
(a)2 addition and 6 deletion
(b)6 addition and 6 deletion
(c)6 addition and B deletion
(d)6 addition and 2 deletion
Q. The process of accession data stored in a tape is similar to
manipulating data on a:
(a)'tac*
(b)4ueue
(c)(ist
(d)Leap
Q. The collection of same type of data is called:
(a)A union
(b)A structure
(c)A graph
(d)None of the above
Q. ;hich of the follo,ing sorting algorithm is (ased on the "Di'ide
and Con+uer" paradigm<
(a)4uic* sort
(b)&erge 'ort
(c)Leap 'ort
(d)All of the above
Q. A (inary tree node that has no children is called:
(a)(eaf node
(b):oot Node
(c)Non leaf node
(d)None of the above
Q. 7tac- is also -no,n as:
(a)()#O s$stem
(b)#)#O s$stem
(c)#)#O ()#O s$stem
(d)None of the s$stem