DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Faculty Course Assessment Report (FCAR Course Co!

e Course T)ttle Faculty CS"#$#% Data Structures An)l C(o-!ary Pro&ram Ac# *ear Sect)on '#Tec( )n CSE "+$",$% A

I# Mapp)n& o. Course to Pro&ram Outcomes/ Pro&ram Outcome a 0 2e3el o. mapp)n& M (4/ ()&( M/me!)un 2/ 2oMappe! Course Outcomes co1 co2 II# Course Assessment/ Course Outcomes CO1 E pla!" fu"dame"tal co"cepts of #ata structures$ space comple !t% a"d t!me comple !t%& CO2 #es!g" l!"ear data structures stacks$ 1ueues a"d l!"ked l!sts& CO3 #es!g" "o"l!"ear data structures trees a"d 3rap4s$ a"d !mpleme"t t4e!r operat!o"s&

c H co3 co4 co5

1 H co3 co4 co5 % Score for selected program outcome b c k

Tool/Task '1(1 '1(2 ')(3 *+, S1(1 S1(2 S1(4 S1(3 +2(1 +2(3 *+, +2(2 S2(4 S2(2 S2(3 a 51 -. 5/0 /5 /0 -2

CO4 +ppl% appropr!ate data structure for a g!5e" appl!cat!o"& CO5 'mpleme"t d!ffere"t searc4!"g a"d sort!"g tec4"!1ues& Compare d!ffere"t searc4!"g a"d sort!"g tec4"!1ues& A&&re&ate 5 score .or eac( selecte! pro&ram outcome

.2 52 2/0 2.. 20 .2 -5 6es

.2 52 2/0 2.. 20 .2 -5 6es

-2& Outcome sat)s.)e! 6es

Note/ %7 8erce"tage of stude"ts 94o got -0% or more marks M!"!mum *e5el for 8O atta!"me"t: -0% III# Comments +ll t4e course outcomes a"d correspo"d!"g program outcomes s4o9ed e pected le5el of atta!"me"t& Ho9e5er as t4e course mostl% !"5ol5es des!g"$ pract!cal !mpleme"tat!o" a"d a"al%s!s$ re1u!res more co"ce"trat!o" o" lab classes& '" +1(1$ +1(3$ +2(1t4e perce"tage of stude"ts 94o got at least 20% marks !s less t4a" 20%&;rom t4!s!t !s obser5ed t4at stude"ts re1u!re some preparator% classes o" log!c gates < ,oolea" algebra& I6# Recommen!at)ons .or )mpro3ement E tra classes 4a5e to be co"ducted o" log!c gates < ,oolea" algebra& More ass!g"me"ts o" Comb!"at!o"al c!rcu!ts&

CO=>SE O=TCOMES < CO>>ES8O?#'?3 (=EST'O?S CO$/ E pla!" fu"dame"tal co"cepts of #ata structures$ space comple !t% a"d t!me comple !t%& +1(1&'mpleme"t ?O> gate 9!t4 ?+?# gate& +1(2&*!st all postulates < t4eorems of ,oolea" algebra& +1(3& E press t4e follo9!"g ,oolea" fu"ct!o"s !" Sum of m!"ters <8roduct of ma terms& *+,: 'mpleme"tat!o" of all log!c gates us!"g ?+?# < ?O> gates& CO"/ #es!g" l!"ear data structures stacks$ 1ueues a"d l!"ked l!sts& S1(1& S!mpl!f% t4e follo9!"g ,oolea" fu"ct!o" us!"g @Amap S1(2& S!mpl!f% t4e follo9!"g ,oolea" fu"ct!o" us!"g Tabulat!o" met4od& S1(4&Br!te t4e e1uat!o"s for ,arro9 < #!ffere"ce of full subtractor& CO%/ #es!g" "o"l!"ear data structures trees a"d 3rap4s$ a"d !mpleme"t t4e!r operat!o"s& S1(3&#es!g" a comb!"at!o"al log!c c!rcu!t for bcd to e A3 code co"5erter& +2(1&'mpleme"t 4Ab!t full adder 9!t4 look a4ead carr% ge"erator& +2(3&d!ffere"t!ate bet& #ecoder < e"coder$ Mu <#eMu & *+, &'mpleme"tat!o" of d!ffere"t comb!"at!o"al log!c c!rcu!ts& E : des!g" of ,C# to -Asegme"t d!spla%& CO7/ +ppl% appropr!ate data structure for a g!5e" appl!cat!o"& +2(2&Co"5ert S> fl!p flop !"to C@ fl!p flop& S2(4&des!g" a clocked se1ue"t!al c!rcu!t for t4e g!5e" state table/state d!agram& CO8/ 'mpleme"t d!ffere"t searc4!"g a"d sort!"g tec4"!1ues& Compare d!ffere"t searc4!"g a"d sort!"g tec4"!1ues& S2(2&#es!g" 3Ab!t s%"c4ro"ous cou"ter/ ModA2 r!pple cou"ter& S2(3&des!g" 4Ab!t b! d!rect!o"al s4!ft reg!ster/4Ab!t u"!5ersal reg!ster&