2-1 syllabus.doc

7/23/2019 2-1 Syllabus.doc

http://slidepdf.com/reader/full/2-1-syllabusdoc 1/19

JNTUH B.Tech 2-1 Computer Science and Engineering(CSE) R1 S!""a#u$

Code Su#%ect & T'' C

A40008 Probability and Statistics 4 - 4

Mathematical Foundations of Computer Science 4 - 4

Data Structures 4 - 4

Digital Logic Design 4 - 4

Electronic Devices and Circuits 4 - 4

asic Electrical Engineering 4 - 4

Electrical and Electronics Lab - ! "

Data Structures Lab - ! "



J*+*H*R&*& NEHRU TECHN,&,C*& UN/ERST0 H0ER*B*

0ear B.Tech. CE - Sem & T'' C -'-'-

(*3) R,B*B&T0 *N ST*TSTCS

,#%ecti4e$5 To "earn

•

#nderstand a random variable that describe randomness or an uncertainity in certainrealistic situation$ %t can be of either discrete or continuous type$

• %n the discrete case& study of the binomial and the poisson random variables and the

'ormal random variable for tha continuous case predominantly describe important

probability distributions$ %mportant statistical properties for these random variables provide very good insight and are essential for industrial applications$

• Most of the random situations are described as functions of many single random

variables$ %n this unit& the ob(ective is to learn finctions of many random variables

through (oint distributions$

• )he types of sampling& Sampling distribution of means& Sampling distribution of

variance& Estimations of statistical parameters& )esting of hyppthesis of fe* un+no*nstatistical parameters$

• )he mechanism of ,ueuing system& )he characteristics of ,ueue& )he mean arrival and

service rates$

• )he epected ,ueue length& )he *aiting line

• )he random processes& )he classification of random processes& Mar+ov chain&

Classification od states

• Stochastic matri.transition probability matri/& Limiting probabilities& 0pplications of

Mar+ov chains

UNT -

Sing"e Random 4aria#"e$ and pro#a#i"it! di$tri#ution$5 1andom varaibles - Discrete andcontinuous$ Probability distributions& mass function2 density function of probability distribution$

Mathemtical Epectation& Moment about origin& Central moments Moment generating function

of probability distribution$ inomial& Poisson 3 normal distributions and their properties$Moment generating functions of the above three distributions& and hence finding the mean and

variance$

UNT -

6u"tip"e Random 4arai#"e$7 Correa"tion 8 Regre$$ion5 oint probability distributions- oint

probability mass2 density function& Maginal probability mass 2 density functions$ Covariance oft*o random variables& Correlation Coefficient of correlation& )he ran+ correlation$ 1egression-

1egression Coefficient& )he lines of regression and multiple correlation 3 regression$

UNT -



Samp"ing i$tri#ution$ and Te$ting o9 H!pothe$i$5 Samp"ing5 Definitions of population&

sampling& statistic& parameter$ )ypes of sampling& Epected values of Sample mean and varience&

sampling distribution& Standard error& Sampling distribution of mean and sampling distribution of varience$

arameter e$tmation$ - li+elihood estimate& interval estimations$

Te$ting o9 h!pothe$i$5 'ull hypothesis& 0lternate hypothesis& type %& 3 type %% errors - critical

region& confidance interval& Level of significance& 5nce sided test& )*o sided test&

&arge $amp"e te$t$5

i$ )est of E,uality of means of t*o samples e,uality of sample mean and population mean

.cases of +no*n varience 3 un+no*n varience& e,ual and une,ual variences/

ii$ )ests of significance of difference bet*een sample S$D and population S$D$

iii$ )ests of significance difference bet*een sample proportion and population proportion 3

difference bet*een t*o sample proportions$

Sma"" $amp"e te$t$5 Student t-distribution& its properties6 )est of significance difference bet*eensample mean and population mean6 difference bet*een means of t*o small samples

Snedecor7s F-distribution and it7s properties$ )est of e,uality of t*o population variences$

Chi-s,uare distribution& it7s properities& Chi-s,uare test of goodness of fit

UNT - /

:ueuing Theor!5 Structure of a ,ueuing system& 5perating characteristics of ,ueuing system&

)rasient and steady states& )erminology of 8ueuing systems& 0rrival and service processes- Pureirth-Death process Deterministic ,ueuing models- M2M29 Model of infinite ,ueue& M2M29

model of finite ,ueue$

UNT - /

Stocha$tic proce$$e$5 %ntroduction to Stochastic Processes - Classification of 1andom processes&Methods of description of random processes& Stationary and non-stationary random process&

0verage values of single random process and t*o or more random processes$ Mar+ov process&

Mar+ov chain& classification of seats - Eamples of Mar+ov Chains& Stochastic Matri$

TE;T B,,<S5

9$ :igher Engineering Mathematics by Dr$ $S ;re*al& <hanna Publishers

"$ Probability ans Statistics for Engineers and Scientists by Sheldon M$1oss& 0cademic

Press



!$ 5perations 1esearch by S$D$ Sarma&

RE=ERENCE B,,<S5

9$ Mathematics for Engineers by <$$Datta and M$S$Sriniva& Cengage Publications

"$ Probability and Statistics by )$<$=$lyengar 3 $<rishna ;andhi Et

!$ Fundamentals of Mathematical Statistics by S C ;upta and =$<$<apoor

4$ Probability and Statistics for Engineers and Scientists by ay %$Devore$

,utcome$5

• Students *ould be able to identify distribution in certain realistic situation$ %t is mainly

useful for circuits as *ell as non-circuit branches of engineering$ 0lso able todifferentiate among many random variable involved in the probability models$ %t is ,uite

useful for all branches of engineering$

• )he student *ould be able to calculate mean and proportions .small and large sample/and to ma+e important decisions from fe* samples *hich are ta+en out of unmanagablyhuge populations$ %t is Mainly useful for non-circuit branches of engineering$

• )he students *ould be able to find the epected ,ueue length& the ideal time& the traffic

intensity and the *aiting time$ )hese are very useful tools in many engineering and data

management problems in industry$ %t is useful for all branches of engineering$

• )he student *ould able to understand about the random process& Mar+ov process and

Mar+ov chains *hich are essentially models of many time dependent processes such as

signals in communications& time series analysis& ,ueuing systems$ )he student *ould be

able to find the limiting probabilities and the probabilities in n

th

state$ %t is ,uite useful for all branches of engineering$




0ear B.Tech. CSE - Sem & T'' C -'-'-

6*THE6*TC*& =,UN*T,NS ,= C,6UTER SCENCE

,#%ecti4e$5

• )o eplain *ith eamples the basic terminology of functions& relations& and sets$

• )o perform the operations associated *ith sets& functions& and relations$

• )o relate practical eamples to the appropriate set& function& or relation& or relation model&

and interpet the associated operations and terminology in contet$

• )o describe the importance and limitations of predicate logic$

• )o relate the ideas of mathematical introduction to recursion and recursively defined

structures$

• )o use ;raph )heory for solving problems$

UNT-

6athematica" &ogic 5 Statements and notations& Connectives& >ell formed formulas& )ruth

)ables& tautology& e,uivalence implication& 'ormal forms& 8uantifiers& #niversal,uantifiers$Predicates ? Predicative logic& Free 3 ound variables& 1ules of inference&

Consistency& proof of contradiction& 0utomatic )heorem Proving$

UNT-

Re"ation$5 Properties of inary 1elations& e,uivalence& transitive closure& compatibility and

partial ordering relations& Lattices& :asse diagram$ Functions? %nverse Function Composition offunctions& recursive Functions& Lattice and its Properties& 0lgebraic stuctures? 0lgebraic systems

Eamples and general properties& Semi groups and monads& group sub groups homomorphism&

%somorphism$

UNT-

E"ementar! Com#inatoric$5 asis of counting& Combinations 3 Permutations& *ith

repetitions& Constrained repetitions& inomial Coefficients& inomial Multinomial theorems& the principles of %nclusion @ Eclusion$ Pigeon hole principles and its application$

UNT- /

Recurrence Re"ation 5 ;enerating Functions& Function of Se,uences Calculating Coefficient

of generating function& 1ecurrence relations& Solving recurrence relation by substitution and

;enerating funds$ Characteristics roots solution of %n homogeneous 1ecurrence 1elation$



UNT- /

raph Theor!5 1epresentation of ;raph& DFS& FS& Spanning )rees& planar ;raphs$ ;raph

)heory and 0pplications& asic Concepts %somorphism and Sub graphs& Multi graphs andEuler circuits& :amiltonian graphs& Chromatic 'umbers$

TE;T B,,<S 5

9$ Elements of D%SC1E)E M0):EM0)%CS - 0 computer 5riented 0pproach - C L Liu& D

P Mohapatra$ )hird Edition& )ata Mc;ra* :ill$"$ Discrete Mathematics for Computer Scientists 3 Mathematicians& $ L$ Mott& 0$ <andel&

)$P$ a+er P:%$

RE=ERENCES 5

9$ Discrete Mathematics *ith 0pplications& )homas <oshy& Elsevier$

"$ Discrete Mathematical structures )heory and application-Mali+ 3 Sen& Cengage$

!$ Discrete Mathematics and it7s 0pplications& <enneth :$ 1osen& Fifth Edition$ )M:$

4$ Logic and Discrete Mathematics& ;rass Man 3 )rembley& Person Education$

,utcome$5

• 0bility to %llustrate by eamples the basic terminology of functions& relations& and sets

and demonstrate +no*ledge of their associated operations$

• 0bility to Demonstrate in practical applications the use of basic counting principles of permutations& combinations& inclusion2eclusion princple and the pigeonhole

methodology$

• 0bility to represent and 0pply theory in solving computer science problems$




0ear B.Tech. CSE- Sem & T'' C -'-'-

*T* STRUCTURES

,#%ecti4e5

• )o understand the basic structure concept such as 0bstract Data )ypes& Linear and 'on

Linear Data structures$

• )o understand the notations used to analyAe the Performance of algorithms$

• )o understand the behavior of data structures such as stac+s& ,ueues& trees& hash tables&

search trees& ;raph and their representations$

• )o choose the appropriate data structure for a specified application$

• )o understand and analyAe various searching and sorting algorithms$

• )o *rite progams in C to solve problems using data structures such as array& lin+ed lists&

,ueues& trees& graphs& hash tables& search trees$

UNT -

asic concepts - 0lgorithm Specification - %ntroduction& 1ecursive algorithms& Data 0bstraction

Performance analysis - time compleity and space compleity& 0symptotic 'otation - ig 5&

5mega and )heta notations& introduction to Linear and 'on Linear data structures$

Singly Lin+ed Lists-5perations-%nsertion& Deletion& Concatenating singly lin+ed lists& Circularlylin+ed lists- 5perations for Circularly lin+ed lists& Doubly Lin+ed Lists- 5perations- %nsertion&

Deletion$ 1epresentation of single& t*o dimensional arrays& sparse matrices-array and lin+ed

representations$

UNT-

Stac+ 0D)& definition& operations& array and lin+ed implementations in C& applications-infi to

postfi conversion& Postfi epression evaluation& recursion implementation& 8ueue 0D)&

definition and operations &array and lin+ed %mplementations in C& Circular ,ueues-%nsertion anddeletion operations& De,ue .Double ended ,ueue/0D)& array and lin+ed implementations in C$

UNT-

)rees @ )erminology& 1epresentation of )rees& inary tree 0D)& Properties of inary )rees&

inary )ree 1epresentations-array and lin+ed representations& inary )ree traversals& )hreaded binary trees& Ma Priority 8ueue 0D)-implementation-Ma :eap-Definition& %nsertion into a

Ma :eap& Deletion from a Ma :eap$



;raphs @ %ntroduction& Definition& )erminology& ;raph 0D)& ;raph 1epresentations- 0d(acency

matri& 0d(acency lists& ;raph traversals- DFS and FS$

UNT- /

Searching- Linear Search& inary Search& Static :ashing-%ntroduction& hash tables& hash

functions& 5verflo* :andling$

Sorting-%nsertion Sort& Selection Sort& 1adi Sort& 8uic+ sort& :eap Sort& Comparison of Sorting

methods$

UNT- /

Search )rees-inary Search )rees& Definition& 5perations- Searching& %nsertion and Deletion&

0=L )rees- Definition and Eamples& %nsertion into an 0=L )ree &-)rees& Definition& -)ree of

order m& operations-%nsertion and Searching& %ntroduction to 1ed-lac+ and Splay)rees.Elementary treatment-only Definitions and Eamples/& Comparison of Search )rees$

Pattern matching algorithm- )he <nuth-Morris-Pratt algorithm& )ries .eamples only/$

TE;T B,,<S5

9$ Fundamentals of Data structures in C& "nd Edition& E$:oro*itA& S$Sahni and

Susan 0nderson-Freed& #niversities Press$"$ Data structures 0 Programming 0pproach *ith C& D$S$<ush*aha and 0$<$Misra& P:%$

RE=ERENCE B,,<S5

9$ Data structures? 0 Pseudocode 0pproach *ith C& "nd edition& 1$F$;ilberg 0nd

$0$ForouAan& Cengage Learning$"$ Data structures and 0lgorithm 0nalysis in C& "nd edition& M$0$>eiss& Pearson$

!$ Data Structures using C& 0$M$)anenbaum&B$ Langsam& M$$0ugenstein& Pearson$

4$ Data structures and Program Design in C& "nd edition& 1$<ruse& C$L$)ondo and

$Leung&Pearson$

$ Data Structures and 0lgorithms made easy in 0=0& "nd Edition& 'arsimha <arumanchi&

CareerMon+ Publications$

$ Data Structures using C& 1$)hare(a& 5ford #niversity Press$

$ Data Structures& S$LipscutA&Schaums 5utlines& )M:$

G$ Data structures using C& 0$<$Sharma& "nd edition& Pearson$$

H$ Data Structures using C 3CII& 1$Shu+la& >iley %ndia$

9J$ Classic Data Structures& D$Samanta& "nd edition& P:%$



99$ 0dvanced Data structures& Peter rass& Cambridge$

,utcome$5

• Learn ho* to use data structure concepts for realistic problems$

•

0bility to identify appropriate data structure for solving computing problems inrespective language$

• 0bility to solve problems independently and thin+ critically$




0ear B.Tech. CSE- Sem & T'' C -'-'-

T*& &,C ESN

,#%ecti4e$5

• )o understand basic number systems codes and logical gates$

• )o understand the oolean algebra and minimiAation logic$

• )o understand the design of combinational se,uential circuits$

• )o understand the basic s of various memory$

UNT-

igita" S!$tem$5 inary 'umbers& 5ctal& :ea Decimal and other base numbers& 'umber baseconversions& complements& signed binary numbers& Floating point number representation& binary

codes& error detecting and correcting codes& digital logic gates.0'D& '0'D&51&'51& E-51&E-'51/& oolean algebra & basic theorems and properties& oolean functions& canonical and

standard forms$

UNT-

;ate @Level MinimiAation and combination circuits& )he <-Maps Methods& )hree =ariable& Four =ariable& Five =ariable & sum of products & product of sums Simplification& Dont care

conditions & '0'D and '51 implementation and other t*o level implantation$

UNT-

Com#inationa" Circuit$ (CC)5 Design Procedure& Combinational circuit for different code

converters and other problems& inary 0dder& subtractor& Multiplier& Magnitude Comparator&Decoders& Encoders& Multipleers& Demultipleers$

UNT-/

S!nchronou$ Se>uentia" Circuit$5 Latches& Flip-flops& analysis of cloc+ed se,uential circuits&

design of counters& #p-do*n counters& 1ipple counters & 1egisters& Shift registers& Synchronous

Counters$0synchronous Se,uential Circuits? 1eduction of state and follo* tables& 1ole free Conditions$

UNT-/

6emor!5 1andom 0ccess memory& types of 15M& Memory decoding& address and data bus&Se,uential Memory& Cache Memory& Programmable Logic 0rrays& memory :ierarchy in terms

of capacity and access time$



TE;T B,,<S5

9$ Digital Design- M$ Morris Mano$

RE=ERENCE B,,<S5

9$ S*itching and Finite 0utomata )heory by Kvi$ <ohavi& )ata Mc;ra* :ill$"$ S*itching and Logic Design& C$=$S$ 1ao& Pearson Education$

!$ Digital Principles and Design @ Donald D$;ivone& )ata Mc;ra* :ill& Edition$

4$ Fundamentals of Digital Logic 3 Micro Computer Design & ): Edition& M$

1afi,uAAaman ohn >iley$

,utcome$5

0fter this course student could able to design& understand the number systems&combinational se,uential circuits$ 0nd they should be in a position to continue *ith computer

organiAation$




0ear B.Tech. ECE - Sem & T'' C -'-'-

E&ECTR,NC E/CES *N CRCUTS

,#%ecti4e$5

)his is a fundamental course& basic +no*ledge of *hich is re,uired by all the circuit branchengineers$ )his

course focuses?

)o familiariAe the student *ith the principle of operation& analysis and design of unction

diode& ) and FE) amplifier circuits& transistors and field effect transistors$

)o understand diode as rectifier$

)o study basic principle of filter circuits and various types$

UNT -

-N Junction iode5 8ualitative )heory of P-' unction& P-' unction as a Diode& Diode

E,uation& =olt- 0mpere Characteristics& )emperature dependence of =% characteristic& %deal

versus Practical @ 1esistance levels

.Static and Dynamic/& )ransition and Diffusion Capacitances& Diode E,uivalent Circuits& LoadLine 0nalysis& rea+do*n Mechanisms in Semiconductor Diodes& Kener Diode Characteristics$

Specia" urpo$e E"ectronic e4ice$5 Principle of 5peration and Characteristics of )unnel

Diode .*ith the help of Energy and Diagram/& =aractor Diode& SC1 and Semiconductor PhotoDiode$

UNT -

Recti9ier$ and =i"ter$ 5 )he P-' (unction as a 1ectifier& :alf *ave 1ectifier& Full *ave

1ectifier& ridge 1ectifier& :armonic components in a 1ectifier Circuit& %nductor Filters&Capacitor Filters& L- Section Filters& - Section Filters& Comparision of Filters& =oltage

1egulation using Kener Diode$

UNT -

Bipo"ar Junction Tran$i$tor and UJT5 )he unction )ransistor& )ransistor Current

Components& )ransistor as an 0mplifier& )ransistor Construction& ) 5peration& ) Symbol&Common ase& Common Emitter and Common Collector Configurations& Limits of 5peration &

) Specifications& ) :ybrid Model& Determination of h-parameters from )ransistor

Characteristics& Comparison of C& CE& and CC 0mplifier Configurations& #)and Characteristics$



UNT - /

Tran$i$tor Bia$ing and Sta#i"i?ation5 5perating Point& )he DC and 0C Load lines& 'eed for

iasing& Fied ias& Collector Feedbac+ ias& Emitter Feedbac+ ias& Collector - EmitterFeedbac+ ias& =oltage Divider ias& ias Stability& StabiliAation Factors& StabiliAation against

variations in =E and & ias Compensation using Diodes and )ransistors& )hermal 1una*ay&

)hermal Stability& 0nalysis of a )ransistor 0mplifier Circuit using h - Parameters$

UNT - /

=ie"d E99ect Tran$i$tor and =ET *mp"i9ier$

=ie"d E99ect Tran$i$tor5 )he unction Field Effect )ransistor .Construction& principle of

operation& symbol/ @ Pinch-off =oltage - =olt-0mpere characteristics& )he FE) Small Signal

Model& M5SFE) .Construction& principle of operation& symbol/& M5SFE) Characteristics inEnhancement and Depletion modes$

=ET *mp"i9ier$5 FE) Common Source 0mplifier& Common Drain 0mplifier& ;eneraliAed FE)

0mplifier& iasing FE)& FE) as =oltage =ariable 1esistor& Comparison of ) and FE)$

TE;T B,,<S5

9$ Millmans Electronic Devices and Circuits @ $ Millman& C$C$:al+ias& and Satyabrata it&" Ed$&9HHG& )M:$

"$ Electronic Devices and Circuits @ Mohammad 1ashid& Cengage Learing& "J9!

!$ Electronic Devices and Circuits @ David 0$ ell& Ed& 5ford$

RE=ERENCE B,,<S5

9$ %ntegrated Electronics @ $ Millman and Christos C$ :al+ias& 9HH9 Ed$& "JJG& )M:$

"$ Electronic Devices and Circuits @ 1$L$ oylestad and Louis 'ashels+y& H Ed$& "JJ&

PE%2P:%$

!$ Electronic Devices and Circuits @ $ P$ Singh& 1e+ha Singh& Pearson& " Ed& "J9!$

4$ Electronic Devices and Circuits - <$ Lal <ishore& " Ed$& "JJ& SP$

$ Electronic Devices and Circuits @ 0nil <$ Maini& =arsha 0gar*al& 9 Ed$& "JJH& >iley%ndia Pvt$ Ltd$

$ Electronic Devices and Circuits @ S$Salivahanan& '$Suresh <umar& 0$=allavara(& " Ed$&

"JJG& )M:$

,utcome$5



#nderstand and 0nalyse the different types of diodes& operation and its characteristics$

Design and analyse the DC bias circuitry of ) and FE)$

Design biasing circuits using diodes and transistors$

)o analyAe and design diode application circuits& amplifier circuits and oscillators

employing )& FE) devices$


0ear B. Tech CSE - SE6 & T'' C -'-'-

B*SC E&ECTRC*& ENNEERN

,#%ecti4e$5

)his course introduces the concepts of basic electrical engineering parameters& ,uantities&

analysis of 0C and DC circuits& the construction operation and analysis of transformers& DC and

0C machines$ %t also gives +no*ledge about measuring instruments operation in detail$

UNT -

ntroduction to E"ectrica" Engineering5 5hms la*& basic circuit components& <irchhoffs

la*s$ Simple problems$

Net@orA *na"!$i$5 asic definitions& types of elements& types of sources& resistive net*or+s&inductive net*or+s& capacitive net*or+s& and series parallel circuits& star delta and delta star

transformation$ & 'et*or+ theorems- Superposition& )heveninss& Maimum po*er transfer

theorems and simple problems$

UNT-

*"ternating :uantitie$5 Principle of ac voltages& *aveforms and basic definitions& root means,uare and average values of alternating currents and voltage& form factor and pea+ factor& phasor

representation of alternating ,uantities& the operator and phasor algebra& analysis of ac circuits

*ith single basic net*or+ element& single phase series circuits$

UNT-

Tran$9ormer$ 5 Principles of operation& Constructional Details& %deal )ransformer and Practical

)ransformer& Losses& )ransformer )est& Efficiency and 1egulation Calculations .0ll the above

topics are only elementary treatment and simple problems/$

UNT- /

.C. and *.C. 6achine$5

.C generator$5 Principle of operation of dc machines& types of D$C generators& EMF e,uation

in D$C generator$



.C motor$5 Principle of operation of dc motors& types of D$C motors& losses and tor,ue

e,uation& losses and efficiency calculation in D$C generator$

*.C 6achine$5 )hree phase induction motor& principle of operation& slip and rotor fre,uency&tor,ue .simple problems/$

UNT - /

Ba$ic n$trument$5 %ntroduction& classification of instruments& operating principles& essential

features of measuring instruments& Moving coil permanent magnet .PMMC/ instruments&

Moving %ron of 0mmeters and =oltmeters .elementary )reatment only/$

TE;T B,,<S5

9$ asic concepts of Electrical Engineering& PS Subramanyam& S Publications$

"$ asic Electrical Engineering& S$'$ Singh& P:%$

RE=ERENCE B,,<S5

9$ asic Electrical Engineering& 0bhi(it Cha+rabarthi& Sudipta nath& Chandra+umar Chanda&)ata-Mc;ra*- :ill$

"$ Principles of Electrical Engineering& =$< Mehta& 1ohit Mehta& S$Chand Publications$

!$ asic Electrical Engineering& )$<$'agasar+ar and M$S$ Su+hi(a& 5ford #niversity Press$

4$ Fundamentals of Electrical Engineering& 1a(endraPrasad& P:%$

$ asic Electrical Engineering by D$P$<othari & %$$ 'agrath& Mc;ra*-:ill$

,utcome$5

0fter going through this course the student gets a thorough +no*ledge on basic electrical

circuits& parameters& and operation of the transformers in the energy conversion process&electromechanical energy conversion& construction operation characteristics of DC and 0C

machines and the constructional features and operation of operation measuring instruments li+e

voltmeter& ammeter& *attmeter etc$$$>ith *hich he2she can able to apply the above conceptualthings to real-*orld electrical and electronics problems and applications$




0ear B. Tech CSE - SE6 & T'' C - -''- 2

E&ECTRC*& *N E&ECTR,NCS &*B

*RT - *

9$ =erification of Superposition and 1eciprocity theorems$"$ =erification of Maimum po*er transfer theorem$

!$ =erification of )hevenins and 'ortons theorems$

4$ MagnetiAation characteristics of D$C$ Shunt generator$

$ S*inburnes )est on DC shunt machine$

$ ra+e test on DC shunt motor$$ 5C and SC tests on Single-phase transformer$

G$ ra+e test on !-phase %nduction motor$

*RT - B

9$ P' unction Diode Characteristics .For*ard bias& 1everse bias/$

"$ Kener Diode Characteristics$

!$ )ransistor CE Characteristics .%nput and 5utput/$

4$ 1ectifier *ithout Filters .Full *ave 3 :alf *ave/$

$ 1ectifier *ith Filters .Full *ave 3 :alf *ave/$




0ear B.Tech. CSE- Sem & T'' C - -''- 2

*T* STRUCTURES &*B

,#%ecti4e$5• )o *rite and eecute programs in C to solve problems using data structures such as

arrays& lin+ed lists& stac+s& ,ueues& trees& graphs& hash tables and search trees$

• )o *rite and eecute *rite programs in C to implement various sorting and searching

methods$

Recommended S!$tem$'So9t@are Re>uirement$5

• %ntel based des+top PC *ith minimum of 9 M:K or faster processor *ith at least 4

M 10M and 9JJ M free dis+ space$

• C compiler$

+eeA 15 >rite a C program that uses functions to perform the follo*ing?

a$ Create a singly lin+ed list of integers$ b$ Delete a given integer from the above lin+ed list$

c$ Display the contents of the above list after deletion$


a$ Create a doubly lin+ed list of integers$

b$ Delete a given integer from the above doubly lin+ed list$

c$ Display the contents of the above list after deletion$

+eeA 5 >rite a C program that uses stac+ operations to convert a given infi epression into its

postfi E,uivalent& %mplement the stac+ using an array$

+eeA 5 >rite C programs to implement a double ended ,ueue 0D) using i/array and ii/doubly

lin+ed list respectively$


a$ Create a binary search tree of characters$ b$ )raverse the above inary search tree recursively in Postorder$


a$ Create a binary search tree of integers$ b$ )raverse the above inary search tree non recursively in inorder$



+eeA D5 >rite C programs for implementing the follo*ing sorting methods to arrange a list of

integers in 0scending order ?

a$ %nsertion sort b$ Merge sort

+eeA 35 >rite C programs for implementing the follo*ing sorting methods to arrange a list of

integers in ascending order?

a$ 8uic+ sort

b$ Selection sort

+eeA 5

i$ >rite a C program to perform the follo*ing operation?

a$ %nsertion into a -tree$

ii$ >rite a C program for implementing :eap sort algorithm for sorting a given list of

integers in ascending order$

+eeA 15 >rite a C program to implement all the functions of a dictionary .0D)/ using

hashing$

+eeA 115 >rite a C program for implementing <nuth-Morris- Pratt pattern matching algorithm$

+eeA 125 >rite C programs for implementing the follo*ing graph traversal algorithms?

a$ Depth first traversal

b$ readth first traversal

TE;T B,,<S5

9$ C and Data Structures& )hird Edition& P$Padmanabham& S Publications$"$ C and Data Structures& Prof$ P$S$Deshpande and Prof$ 5$;$ <a+de& Dreamtech Press$

!$ Data structures using C& 0$<$Sharma& "nd edition& Pearson$

4$ Data Structures using C& 1$)hare(a& 5ford #niversity Press$

$ C and Data Structures& '$$=en+ates*arlu and E$=$Prasad&S$Chand$

$ C Programming and Data Structures& P$1adha <rishna& :i-)ech Publishers$

,utcome$5

• 0bility to identify the appropriate data structure for given problem$

• ;raduate able to design and analyAe the time and space compleity of algorithm or

program$



• 0bility to effectively use compilers includes library functions& debuggers and trouble

shooting$

2-1 syllabus.doc

Documents