Computer Science Honours Syllabus of RK Mission

8/19/2019 Computer Science Honours Syllabus of RK Mission

1/21

Ramakrishna Mission Residential College

Narendrapur, Kolkata

Semester – !

"#"$R %R&'" (&"!C "eriods M#RKS

Theory

P-I

Group-A Circuit Theory & Basic

Electronics

40

Group-B Digital Electronics 50

(otal )0 *0

P- IIA

Group-A Introduction To Coputer !0

Group-B Prograing Through C 40

(otal +0 2*

PracticalP - IIB

Group-A "#$ la%Digital electronics &

Basic Electronics'

(0 )5

Group-B *#$ la%C prograing ' 40 )0

(otal 100 2*

Syllabus : 2012-2015


2/21

"aper – !

%R&'" – # Ciruit (heory ./asi $letronis 0 "eriods

Circuit Theory+ Passi,e circuit paraeters and their euili%riu conditions . /ircho1sla23 Dierential euation representation o passi,e circuits *olution o circuit o

dierential euations or siple circuits3 concept o ipedance and reactance *teady

state response reuency doain analysis o 67C circuits Aplitude and phase 8ector

representation3 resonance3 circle diagra 9et2or: euation3 ;- DE7TA transors3net2or: theores . superposition3 reciprocity3 The,nin3 9ortan3 unction diode3 or2ard and re,erse %ias3 current coponents in p-n

diode3 ,olt . apere characteristic3 diode resistance3 %rea: do2n diodes ?ener3a,alanche'3 Application o diode as rectiier "al-2a,e3 ull-2a,e and %ridge rectiier'

Transistor + @unction Transistor3 current coponents3 Transistor as an apliier3 Coon %ase and coon eitter coniguration3 acti,e3 cut o and saturation region

Operational Amplifier + Basic PA


3/21


4/21

Classification of computers+ according to tas: perored General purpose and special

purpose'3 according to logic Analog3 digital3 "y%rid'3 according to sie *uper coputer3ain rae3 ini and icro coputer'3 Personal coputer3 2or:station3 Porta%le

coputers laptop3 note%oo:3 handheld coputer3 PDAs'

Components of digital computers and functions of each unit + CPF A7F & CF'3

eory3 Input and output de,ice3 %loc: diagra o a digital coputer

&ardware and software+ Purpose o "#$ & *#$ Classiication o *#$ *yste *#$3

Application *#$'3 ir2are

Problem sol$ing using computers+ Algorith and its properties3 siple algoriths ase=aples3 lo2chart3 decision ta%le3 coparati,e study o achine le,el language3

asse%ly language3 high le,el language

'umber system+ %ase or radi=3 Decial3 %inary3 octal and he=adecial nu%er syste3Algorith or con,ersion ro any %ase to any %ase or %oth Integral and loating point

data'

Arithmetic operation+ addition3 su%traction3 ultiplication and di,ision o %inary3 octal

and he=adecial nu%er

Signed number representation+ signed agnitude3 diinished radi= copleent 6-)'′

s copleent and radi= copleent 6 ′s copleent3 relati,e ad,antages and

disad,antages3 addition and su%traction using copleent representation

i(ed and floating point representation+ i=ed point nu%er and its disad,antages3loating point nu%er and scientiic representation antissa and e=ponent'3 Biased

e=ponent and its ad,antages3 IEEE J54 loating point representation

Computer codes+ ad,antages o codes3 $eighted & non-2eighted code3 BCD code BCD

representation o decial nu%ers3 con,ersion o BCD to %inary3 addition andsu%traction o BCD nu%ers'3 Fnit distance code3 6elected code3 Gray code Binary

code to gray code and ,ice-,ersa'3 A*CII code3 Error detecting and correcting code

or%idden co%ination chec: code3


5/21


6/21

Semester – !!


TheoryP-III

Group-A Data *tructure (0

Group-B 9uerical Analysis 40 (otal 100 *0

P- I8AGroup-A Coputer rganiation 50

(otal *0 *0

PracticalP - I8B

Group-A 9uerical Analysis 7a% 40 )0

Group-B Data *tructure 7a% (0 )5

(otal 100 *0

"aper – !!!

%roup – # ata Struture +0 "eriods

!ntrodution4 Algorith and its properties3 siple algoriths as e=aples

#lgorithm and omple3ity+ Asyptotic notation 3 3 Q'3 polynoial tie3

e=ponential tie

ata struture4 Deinition and Concepts o 7inear and 9on 7inear Data *tructures

#rrays4 Types3


7/21

6ecursi,e And 9on 6ecursi,eK Array and 7in:ed 6epresentation o Binary TreesK B*T

Insertion and Deletion AlgorithK Threaded Binary Trees+Insertion3 tra,ersal Algorith

Sorting4 Algorith and Cople=ity Analysis o Bu%%le3 *election3 Insertion3 uic:3


8/21

Stac* organi)ation+ Ipleentation o *tac: using *hit register3 Application o stac: in

rganiation

+emory+ Types o


9/21

"aper – <

%R&'" – # &perating System +0 "eriods

!ntrodution4 Concepts o *yste *#$ and Application *#$3 Concept o Copiler3

Interpreter3 Asse%ler ne Pass and T2o Pass Concepts'3 7oader3 7in:er

&perating System 5undamentals4 Concepts o Batch3


10/21

%roup – / Miroproessor ? 0 "eriods

!ntroduction+ ect odels

Class modeling4 %>ect and classK *tate K Beha,iourK 6elationships aong o%>ectsK 7in:

and associationsK Generaliation3 inheritance3 polyorphis K 9-ary associationsKAggregationsK


11/21

!nteration Modeling4 Fse case odelsK *euence odelsK Acti,ity odelsK Fse case

relationshipK Procedure seuence odelsK

System Coneption4 De,elopent lie cycleK de,ising a syste conceptK preparing a pro%le stateent

omain #nalysis4 Doain class odelK Doain state odelK Doain interaction odelK

#ppliation analysis4 application interaction odelK application class odelK applicationstate odel

System design4


12/21


13/21

%roup – / So9t6are $ngneering 0 periods

!ntroduction+ *#$ engineering discipline . e,olution and ipact3 Progra 8s *#$3

Eergence o *#$ engineering Introduction to Control %ased design3 Data structure

oriented design3 data lo2 oriented design3 o%>ect oriented design' S#1 life cycle+ Fseulness3 7ie cycle


14/21

(ransportation "roblem4 Introduction3 atheatical orulation3 inding initial %asic

easi%le solution3 optiality3 degeneracy3 un%alanced transportation pro%le

#ssignment "roblem4 Introduction3 atheatical orulation and solution

!nteger "rogramming "roblem+ Introduction3 All integer prograing pro%le3 i=edinteger prograing pro%le3 Branch and Bound ethod

7ueueing (heory+ Introduction3 ueueing syste3


15/21

"aper-!A

%roup – # #utomata (heory 0 "eriods

!ntrodution4 *ynchronous & Asynchronous *euential Circuit3 *torage Eleent3


16/21

recursion3 recursi,e descent parsing3 let-actoring3 Predicti,e parsersI6*T 3 77$

rules3 Construction o parsing ta%les3 77)' graars

R-"arsers+ *tac: odel o 76 parser3 Parsing ta%le3 Canonical Collection o 76 0'ites closure3 goto3 ,alid ites'3 Construction o *76 parsing ta%les Construction o

canonical 76 parsing ta%le

%roup – C isrete Mathematis B* "eriods

+athematical !nduction+ irst and second *trong' principle o Induction 2ith e=aples

Sets+ Deinition3 Fni,ersal set3 su%set3 Po2er set3 perations on *et Fnion3 Intersection3

Copleent3 Cartesian product3 Coputer representation o *etsunction+ Deinition3 ne to one and onto unction3 In,erse unction3 Coposition o

unction

Principle of !nclusion And E(clusion+ Proo3 soe siple pro%les3 Application o PIE

To deterine the nu%er o solution in integers o an euation 2ith constraint3 to ind

nu%er o pries o a positi,e nu%er'

3elation+ Introduction3 unctions as relation3 relation on set3 properties o relation3

co%ining relation3 n-ary relation3 data%ase and relation . an application3 Eui,alence

relation & eui,alence classes3 Partial ordering3 "asse diagra3 7attices3 topological

sorting

Counting Theory+ unction3 Dis>unction3 9egation3 Iplication'3

*iple logic Pules3 $ell ored orula3 logical eui,alence3 Predicates anduantiier Fni,ersal and E=istential'


17/21

"aper-A

%roup – # ata Communiation #nd Computer Net6ork +* "eriods

ata Communiation4 Coponents3 Data 6epresentationK Direction o Data lo2K

Types o ConnectionsK Categories 9et2or:sK Concepts Protocols

Signals4 Analog and DigitalK Periodic and aperiodic *ignalsK Tie reuency Doains3Coposite *ignalsK Concepts reuency3 Band2idth 3 Bit 6ate3 Baud 6ate3 Channel

CapacityK 9yuist & *hannon1s TheoreK Attenuation3 Distortion and 9oise3 concept o

odulation

Multiple3ing4 D<


18/21

"aper-A!

Net6ork ab4

&ne o9 the 2 options 1 'N!A net6orking programming2 a;a net6ork programming

Compiler ab

"aper-A!!

Deb #ppliation ab4

8(M4 Dierent "T


19/21

Semester -


Theory

P-IIIGroup-A Analysis o algorith 40Group-B Graph Theory 40

(otal F0 *0

P-I8Group-A Graphics & ect 2or:

50

(otal *0

"aper-A!!!

%roup – # #nalysis o9 #lgorithm 0 "eriods

%ro6th o9 5untions+ Asyptotic notation3 Big-3 Theta3 ega notations

Reurenes4


20/21

"attern mathing algorithm+ preliinary string atching algorith3 6a%in /arp

algorith3 string atching 2ith inite autoation3 /nuth


21/21

%roup – # %raphis . Multimedia *0 "eriods

Computer Science Honours Syllabus of RK Mission

Documents