CS/B.

TECH(N)/ODD/SEM-3/3443/2022-2023/014
:70
Marks
Full 101
10=
[1x [5)[51 15] [5]
[5x3=15] [5] =45] [31 [41 (8] (15)[31[5]
(15x3 (51 (81 [71 [2] (51
ithat
t
BENGAL so
storage n0?
n the
WEST disk of
values of
Algorithms practicable the complexity
TECHNOLOGY, on method?
all
or for
memory cg(n)0, stack.
as ?notation traversals the
using algorithm?
&
Structure far with structure
Question) computer's to index. find
as
marks. equalstarts
words postfix the array Question) data Question) expression Also
OF Data fullown of
or index following following search
queue.
UNIVERSITY
003443
UPID:
indicate Type to in
algorithm? whichthanarraythe stack
list.
CSBS301PCC-CS301 their expression
either greater at Type Type binary array?
the linked postfix
list.
Answer using Theplace the
using
the of Explain.
in
margin -data Answer Answer linked an array
answers conversion by are 10,takes three
of
structure. ausing of
three equivalentofcomplexítyin
expression
AZAD the
Short infix
orderthatsize /G)*H 231*+9 circular search circular algorithm
an addressing? h(n) element(Short any represented (Long any
in their (Very converting ascending of search?
PCC- postix --and array
functions Answer data E*F) Answerqueue? its a time binary operations.
array. a
KALAM Figures give
Group-A
is
case as--- next Group-B queue
postfix Group-C stack:to of uses
expression trom an
Code: to
stable?
algorithm? an technique. case binarypertoming ofperform
to of % tree. simple an item
in all using
known
Therequired infixfor of best directsearch? insertion and into(D be can
using and average in their
way sorted (B/C+ disadvantages search
ABULPaper an essential in called
in of
often set implemented expression b+
polynomial than from an
of sort complexity
sorting
particular linear searchstack and expression
infix differing Explain
for linear delete
are complexity is be a The tree better and preconditions
MAULANA Candidate bubble
technique is can
comprises betweenA- convert ofmeasur
is
followingfollowing stable
efficiently.
for notation 9. binary b
:explanationbetween is
worst ADT? to
case BST infix for
a
is of search is isrear y+5xy2-2.
y2-4x2
7x2
following queuepostfixto advantages
is
search program algorithm
algorithm.
Time
Allotted:3
Hours time structurea complexity
sorting best Polisha queue for following
differences programbest Stack
the
the
not in notationand algorithm
circular
the the the the
used the values difference algorithm.
Evaluate are linearare C a
of the (V)--0s the circular the
ten of 6, detailed are
is data a is is Reverse
TimeWhenWhat What The Which front
the how is an Define
any WhatWhich be Why aWritethe What How WhataWriteWhatWrite
is
can an the Convert What
Answer A A Write State Show Write Write
0 ) (W) () (M) (VI) (Vl)(X) () (K) (XI) with 7.(a) (b) (c) (a) (b) (c) (d) (a) b) (a) tb)
10. 11,
1. 2. 3. 4. 5. 6. 8. 9.
{c) Deine asymptotic notation and explain each types. [8]