Syllabus ldentity (to be filled by librarion) Received Throug Downloading from University Website Vf/ Authentication Certifi cate.

Transcription

1 Mhtm Eduction Society's Pilli HOC College of Engineering nd I'echnology syttbus Authentiction Request nd Distribution Form : University : University of Mumbi Received Through University Courier [ ] Syllbus ldentity (to be filled by librrion) Acdemic Council Item Dte : Degree, B"dAt{ of Engineering Brnch: // Scheme, CBGS Yer : FE / 36 tre tbe/ ME of * 1- Number, +'+f TotlNumberof Pges, *?l *- semester: f-"jrv Received Throug Downloding from University Website Vf/ Librrin Nr*.,4 G Yl o,,v--- Signture : o",* ' BL lzovr -r---f- Hed, Deprtment of syllbus uthenticted nd submit Principl Signture : the Principl. Engineering is requested to get the eid-, Authentiction Certifi cte Syllbus hs been verified with the University of Mumbi website. Certified tht this syllbus is n uthentic syllbus of the University of Mumbi for the concerned yer. Submitted to the Principl. I-IoDNme ' sct.detf,3 ',lrrr,t* signrure,s \ pu1*, iyl3\15 Hed, Deprtment of the uthenticted syllbus of the Uni of Mumbi to fculty members for teching purposes. Principl Signture : Dte: $o Syllbus Aur-hentic rion nd Distribution Relese Dte : lvlon 16 Feb 2015 Version 1.0

2 AC Item no UNIVERSITY OF MI]MBAI ( Revised Svllbus Prosrflm- Bchelof of Engineering Course -Computer Engineering (Second Yer: Sem. lll & IVI Under I \* FACULTY OF TECHNOLOGY :_ (As per Credit Bsed Semester nd Grding System from ZOl3-14) ffi,' \./ *t I *,hl 4LqgH**ffi : LIBFqAftY

3 From Den's Desk: To meet the chllenge of ensuring excellence in engineering eduction, the issue of qulity needs to be ddressed, debted nd tken forwrd in systemtic mnner. Accredittion is the principl mgns of qulrty ssurnce in higher eduction.the mjor emphsis of ccredittion process is to mesure the outcomes of the progrm tht is being ccredited. In line withthis Fculty of Technology of University of Mumbi hs tken led in incorporting philosophy of outcome bsed eduction in the process of curriculum development. Fculty of Technology, University of Mumbi, in one of its meeting unnimously resolved tht, ech Bord of Studies shll prepre some progrm Eductionl objectives (PEo's) nd give freedom to ffilited Institutes to dd few (PEo's) nd objectives-nd course outcomes to be clerly defined for ech course, so tht ll fculty members in flilited "o*r. institutes understnd the depth nd pproch of course to be tught, which will enhnce lerner's leming process. It ws lso resolved tht, mximum senior fculty from colleges nd experts from industry to be involved rvhile revising the curriculum. I m hppy to stte tht, ech Bord of studies hs dhered to the resolutions pssed by Fculty oftechnology, nd developed curriculum ccordingly. In ddition to outcome bsed eduction, semester bsed credit nd grding systern is lso introduced to ensure qulity ofengineering eduction' Semester bsed Credit nd Grding system enbles much-required shift in focus from techer-cenkic to lemer-centric eduction since the worklod estimted is bsed on the investment of time in lerning nd not in teching. It lso focuses on continuous evlution which will enhnce the qulity of eduction. Universiry of Mumbi hs tken led in implementing the system through its flilited Institutes nd Fculty oftechnology hs devised trnsprent credit ssignment policy nd dopted ten points scle to grde lerner's performnce.credit ssignment for courses is bsed on 15 weeks teching t.u-ing Oro""rr, however content of courses is to be tught in weeks nd remining 3-2 weeks to be utilized for revision, guest lectures, coverge ofcontent beyond syllbus etc' Credit nd grding bsed system ws implemented for First Yer of Engineering from the cdemic yer Subsequently this system will be crried forwrd for Second Yer Engineering in the cdemic yer , for Third yer nd Finl Yer Engineering in the cdemic yers20l4'2015 nd 2015'2016 respectively. Dr. S. K. Ukrnd Den, Fculty of Technolory, Member - Mngement Couneil, Sent6, Actlemic Council University of Mumbi, Mumbi

4 Premble: l'he engineering eduction in Indi in generl is expnding in mnifolds. Now, the chllenge is to ensure its qulity to the stkeholders long with the expnsion, To meet this chllenge, the issue of qulity needs to be ddressed, debted nd tken forwrd in systemtic mnner. Accredittion is the principl mens ofqulity ssurnce in higher eduction nd reflects the fct tht in chieving recognition,,the institution or progrm of study is committed nd open to externl review to meet certin minimum specified stndrds. The mjor emphsis ojthis ccredittion process is to mesure the outcomes of the progrm tht is being ccredited. In line with this Fculty of Technology of University of Mumbi hs tken led in incorporting philosophy of outcome bsed eduction in the process of curriculum dwelopment. The Progrm Eductionl Objectives finlized for undergrdute progrm in Computer Engineering re listed below: l. To prepre Lerner's with sound foundtion in the mthemticl, scientific nd engineering fundmentls 2. To prepre Lerner's to use effectively moderh tools to sotve rel life problems 3. To equip Lemerls with brod eduction necessry to understnd the impct of computer Technology in globl nd socil context 4. To encourge, motivte nd prepre Lemer's for Lifelong-leming 5. To inculcte professionl nd ethicl ttitude, good iedership qulities nd commitment to socil responsibilities In ddition to bove 2 to3 more progrm eductionl objectives of their own my be dded by ffilited Institutes. The progrm outcomes re the skills nd bility tht Lemer will demonstrte upon completion of undergrdute degree progrm in Computer Engineering. Few my be listed s follows: 1. Ability to effectively pply knowledge of computing nd mthemtics to computer science problems. 2. Ability to design, implement nd evlute computer-bsed components, systems, processes or progrms to meet desired needs nd specifictions. 3. Ability nd skills to effectively use stte-of-the-rt techniques nd computing tools for nlysis, design, nd implementtion of computing systems. 4. Ability to function effectively s member of tem ssembled to undertke common gol. 5. An understnding ofprofessionl, ethicl, legl, security, nd socil issues nd responsibilities. 6. Ability to communicte effectively to both technicl nd non-technicl udiences. 7. The bility to successfully pursue professionl development thru lifelong leming In ddition to Progrm Eductionl Objectives, for ech course ofundergrdute progrm, Course Objectives nd expected outcomes from lemer's point of view re lso included in the curriculum to support the philosophy of outcome bsed eduction" In order to chieve outcome tr,2,nd 3 mjor emphsis is plnned towrds designing Lbortory courses third yer onwrds. I believe strongly tht smll step tken in right direction will definitely help in providing qulity eduction to the stke holders. Dr. Prchi Ghrpure Chirperson, Adhoc Bord of Studies in Computer Engineering University of Mumbi, Mumbi University of Mumbi Computer Engineering ( Second Yef - lqt lll &!V) Revised Course(R2012) 3 L [* F.&RY-j

5 Progrm Structure for B.E. Computer Engineering Second Yer (Computer) ( SemesterIII) (REV2012) Course Code Course Nme Teching Scheme Credits Assigned (Contct Hours) Theory Prct Tut Theory Tw/ Tut Prct CSC3O1 Applied Mthemtics III* 4 t# CSC 302 t Ob.iect Oriented Progrmming Methodology* CSC303 Dt Structures 4 ) 4 I 5 CSC304 Digitl Logic Design ndanlysis J 2 J I 4 CSC305 Discrete Structures Totl CSC306 Electronic Circuits nd Communiction I 5 Fundmentls Totl Course Code Course Nme Exmintion Scheme Internl Assesment Internl Assesment End Sem Exm TW Prct Tot Test 1 Test 2 Avg Exm Durtion I ( in Hrs) orl CSC3Ol Applied Mthemtics III* ,(l 125 CSC302 Object Oriented Progrmming Methodolgy* CSC3O3 Dt Structures 2A CSC304 Digitl Logic Design ndanlysis CSC305 Discrete Structures CSC306 Electronic Circuits nd Communiction Fundmentls Totl * Common wittr tt T futoril to be tken clss wise! Tutor'ils will be evluted s Term work University of Mumbi Computer Engineering ( Second Yer - Sem lll & tv) Revised Course(R2012) 4

6 Progrm Structure for B.E. Computer Engineering Second Yer (Computer) ( Semester IV) Y2012 Course Code Course Nme Teching Scheme (Contct Hours) Credits Assigned Theory Prct Tut Theory Tw/ Prct Tut Totl CSC4OI Applied Mthemtics IV* 4 I 4 t# { CSC4O2 Anlysis ofalgorithms I 5 CSC4O3 Computer Orgniztion nd Architecture t 5 CSC4O4 Dt Bse Mngement systems I 5 csc40s Theoreticl Computer Science CSC4O6 Computer Grphics J 2 J I 4 Totl 23 8 I,t Course Code Course Nme Exmintion Scheme Internl Assesment Internl Assesment End Exm TW Prc Test I Test 2 Avg Sem Durtion t Tot Exm ( in Hrs) orl CSC4O1 Applied Mthemtics IV* csc402 Anlysis ofalgorithms csc,403 CSC4O4 Computer Orgniztion nd Architecture* Dt Bse Mngement systems ls CSC4O5 Theoreticl Computer Science CSC4O6 Computer Grphics s0 Totl t * Common Subjects with IT # Tutoril to be tken clss wg! Tutorils rvill be evluted s Tellm work University of Mumbi Computer Engineering ( Second l

7 Course Code Course Nme Credits csc301 Applied Mthemtics III 05 Objectives: 1) Complex Vrible (2) Lplce Trnsform (3) Fourier Series (4) Discrete Structures (5) Z.trnsform These topics involve the study of nlytic function nd mpping of.complex function.lplce trnsform, Inverse Lplce,*rrf"r. nd ppliction of Lplce trnsform to solve differentil equtions, finding Fourier series, Sine nd cosine ;il;; ilgrrl * z-*rr.fo... Th."" topics help them to solve mny engineering problems rising in course of their further stuilies nd lso while working in the prcticl life situtions. Outcomes: L r --!--t --^Lt--- Students inthis course,will pply the Procedure nd methods to solve technicl problems. Detils of the SYllbus:- Module Topics Hrs 01 U2 Complex Yrible & mpping l I Functions of complex vrible, Anlytic functions, Cucby-Riemnn equtions in Crtesin co-ordintes, Polr co-ordintes' 1.2 Hrmonic functions, Anlytic method nd Milne Thomson methods to find (z), Orthogonl trjectories. l.3 Conforml Mpping, Liner, Biliner trnsformtions, Cross rtio, fixed points nd stndrd trnsformtion such s rottion nd mgnifiction, invertion, trnsltion. Lplce Trnsform 2.1 Introduction, Definition of Lplce trnsform, Lplce trnsform of constnt; trigonometricl, exponentil functions. 2.2 Importnt properties ofl.plce trnsform: First shifting theorem, Lplce trnsform of L{f (t)}, L{ (0/t}, (10) (10) "{Su*},4gf*#e0}, L{(o} without proo Z.2lJnitstep function, Hevi side function, Dirc-delt function, Periodic function * tn"it Lplce trnsforms, Second shifting theorem' 2.3lnverse Lplce trnsform with Prtil frction nd Convolution theorem (without proof). 2.4 Appliction to solve initil nd boundry vlue problem involving ordinry differentil equtions with one dependent vrible nd constnt coefficients' University of Mumbi Computer fngineellg (!eco1 ;Sem lll & lv) Revised Course(R2012) 6,,dj t)..t" +\

8 03 Fourier series (10) 3.1 Dirichlet's conditions, Fourier series of periodic functions with period 2nndZL. 3.2 Fourier series for even nd odd functions. 3.3 Hlf rnge sine nd cosine Fourier series, Prsevel's identities (without proof). 3r4orthogonl nd Ortho-norml functions, Complex form of series. 3.5 Fourier Integrl Representtion. Fourier 04 Vcctor Algebr nd Clculus 4.1 VectorAlgebr: Sclr nd vector product ofthree nd four Vectors nd their properties. (10) 4.2 Vector Clculus: Vector differentil opertor V, Grdient of sclr point function, Diversions nd Curl of Vector point function, V (z v), s.{s#.er{@-f,?e {e#}. 4.3 Vector Integrtion: Line integrl; conservtive vector field,green's 4.4 GussDivergence theorem & Stokes' theorem (Without proof nd no oroblems on verifiction of bove theorems). 05 Z trnsform 5.1 Z-trnsform of stndrd functions such s Z(),2(n\, (8) 5:2 Pfoperties ofz-hnsform :Linerity, Chnge of scle, Shifting property, Multipliction of K, Initil nd finl vlue, Convolution theorem (ll without proofl 5.3 Inverse Z trnsform: Binomil Expnsion nd Method of Prtil frction. Term work: Term work shll consist of minimum four SCILAB prcticls nd six tutorils. SCL,q.B grcticls Tutorils Attendnce Totl : 10 mrks : 10 mrks : 05 mmks z 25 mrks University of Mumbi Computer Engineering ( _Yer*Sem lll & lv) Revised Course(R2012)!BTEARY

9 Text Books:. Higher Enginegring Mthemtics by Grewl B. s. 38e edition, Khnn Publiction 2005' i Kreyszig E' 96 edition' John Wiley' o AdvncedEngineeringMthemticsb;. ATextBook ofapplied Mthemtics Vol' I & II by P'N'Wtilr & J.N.Wrtikr, Pune, Vidyrttli Grih Prkshn" Pune'..DiscretendCombint.onlMthemticsbyRlphPCrimldi,BYRmn I References:. AdvRced Engg. Mthemtics by c. Ry Wylie & Louis Brrett.TMH Intemtionl Edition'. Mthemticl Methods of Science nd Engineering by Knti B. Dtt, Cengge Lerning' r.lpplcetrensformsbymurryr.spiege!schun'soutlineseries.mcgrwhillpubliction. o Discrete mthemtics by ERIL FOSSETT' Wiley Indi Theory Exmintion: estions, of20 Mrks' 1. Question pper will comprise of totl 6 questions' ech or zu MrKs' 2. Only 4 questions need to be solved' 3;Questionlwillbecompulsoryndbsedonmximumf.rtoftfesyllbus' 4. Remining questions *itt uu mixed in nture (for exmfle suppose Q.2 hs prt () from module 3 then prt (b) will be from ny mode other thn module 3) In'question pper, weightge of ech msdule will be proportionl to number of.respective lecture hours s mentioned in the syllbus. University of Mumbi Computer Engineering ( Revised Course(R2012) 8

10 Subject Code Subject Nme Credits CSC302 Object Oriented Progrmming Methodology (OOPM)* 05 Course Objectives 1. To understnd Object oriented concepts like dt bstrction, encpsultion, etc. 2. To solve the rel world scenrios using top down pproch. 3. To.understnd vrious Jv progrmming constructs. Course Outcomes 1. Students wi[ be ble to solve computtionl problems using bsic constructs like if-else, control structures, rry strings. 2. Student cn understnd how to model rel world scenrio using clss digrm. 3. Students will exhibit communiction between 2 objects using sequence digrm. 4. Students will be ble to implement reltionships between clsses. 5. Students will be ble to demonstrte vrious collection clsses. 6. The students willbe ble to demonstrte progrms on exceptions, multithreding nd pplets. Sr. No I Topic Progrmming Approch from procedurl to Object Orienttion OO methodologies: Grdy Booch Methodology of OO development No of Hours 4 ) OO Concepts: Object, Clss, Encpsultion or informtion hiding, Inheritnce, Polymorphism, Messge communiction, Abstrction, Reuse, Coupling nd Cohesion, Sufficiency Completeness nd Primitiveness, Met clss 3 Obj ect Oriented Progrmming : Jv Evolution: History, How jv differs from others Overview of Jv lnguge: Introduction,Instlling nd implementing Jv, WM 4 Constnts, vribles nd dt types Opertors nd Expressions Revision of Brnching nd looping 5 Clss Object nd Method: member, method, Modifier, Selector, constructer, destructor, itertor, Stte of n object, Method Overloding, Inheritnce, Method Overriding,Finl clss, bstrct clss nd method University of Mumbi Computer Engineering ( Course(R2012) 9 4r u'.' J t"y'l' \9f,

11 t2 Cl"rie, *d R"1"tt"nship; : Implementtion of Assocition nd Aggegtion using simple scenrios Any, String, Vector Irt.rf";;*t"bt* t" Interfces, Extending n Interfce, Difference between nabstrct clss nd n Interfce Multithred Progrmming C6r-pffi;f.!ss* for deployment nd reuse: Built-in Pckges: j v.lng: wrpper clsses jv.util: Arrylist nd Linkedlist Cretine nd using User defined P Mnglng Error nd E;rcePtion Applet progrmming Z J J 1 Suggested list iof Progrmming Assignments llbortory Work Divide lbortory work into 3 Prts A. gsic Jv structurl components nd Conditionl nd control sttements:. To demonstte the use of commnd line rgument. To understnd the working of n rry'. To understnd string clss nd demonstrte its vrious functions. B. perform following prcticl on some cse study like Bn-king Appliction, Librry Appliction etc' Find out clsses, objects nd their properties' o Crete nd disply objects found in bove'. Add methods to clsses nd implement'. Refine bove objects by dding constructors nd locl vribles.. show communic4tion between the objects by clling instnce of one object from nother clss.. Find reltionships like inheritnce, ssocition, ggregtion, composition. knplemcnt bove reltionships' C. To implement user defined exceptions in Jv' Dernonstrte the use collection clsses like Anylist/Linkedlist/HshSet/TreeSet/Mp. University of Mumbi ComPuter pr:se.m lll & lv) Revised Course(R2012) 10

12 To illustrte Multitlreding in Jv. Simple progrms onapplets ndawt. TermWork: Students will submit Term Work in the form of journl tht will include t lest 15 progrmming ssignments. Ech progmmming ssignment will consist of n lgorithm or clss digrm/sequence digrm (if pplicble), progrm listing with proper documenttion nd snpshot of the output. Prcticl Exmintion will be bsed on the term work nd questions will be sked to judge understnding of the ssignments t the time of the exmintion. The finl certifiction nd cceptnce of term work ensures tht stisfctory performnce of lbortory work nd minimum pssing mrks in term work. TermWork:25Mrks(totlmrks):15Mrks(Experiment)+5Mrks(Assignment)+5(Attendnce (theory+prcticl)).-mcticlexm wiil bsed on bove syllbus Theory Exmintion: 1. Question pper will comprise of totl 6 questions, ech of 20 Mrks. 2: Only 4 questions need to be solved. 3; Question t will be compulsory nd bsed on mximum prt of the syllbus. 4. Remining questions will be mixed in nture (for exmple suppose Q.2 hs prt () from module 3 then prt (b) will be from ny module other thn module 3) In question pper, weightge of ech module wilt be proportionl to uumber of respective lecture hours s mentioned in the syllbus. Text Books! t. Rlph Brvco, Shi Simoson, "Jv Progrming From the Group Up",Tt McGrw-Hill 2. Grdy Booctr, Object OrientedAnlysis nd Design ; 3. JimeNino, FrederickA. Hosctu 'An introduction to Progrmming nd Object Oriented Design using Jv?, Wiley Student Edition. Reference Books: l. Jv: How to Plogr-m, 8/e, Dietl, Dietl, PHI 2. Grdy BooctL Jmes Rumbugh, Ivr Jcobson, "The Unified Modeling Lnguge User Guide", Person Eduction 3. Schin Mlhotr, Surbh Chudhry "Progrmming in Jv", Oxford Universiry Press, 2010 University of Mumbi Computer Engineering ( Second eourse(r2012) 11 c,i,,il#ltffi1ii

13 Subject Code SubjectNme Credits CSC303 Dt Structures (DS) 5 Course Objectives l. To tech efficient storge mechnisms of dt for n esy ccess. ;:. i; il;fid i-pt"*"-nt tion of vrious bsic nd dvnced dt structures. j. 1'o intro-duce vrious techniques for representtion of the dt in the rel world. 4. To develop ppliction using dt structures' 5. To tech tle Concept of protection nd mngement of dt. 6. To improve the logicl bility Course Outcomes J. 4. Student will be ble to choose pproprite dt structure s pplied to specified problem definition. Student will be ble to hndle opertions like serching, insertion, deletion, trversing mechnism etc. on vrious dt structures. Students will be ble to pply concepts lemed in vrious domins like DBMS, compiler construction etc. Students will be ble to ui. iirr.ur nd non-liner dt structures like stcks, queues, linked list etc. Module Detiled content Hours 01 Introduction to Dt Structure Tyles of Dt Structure, Arrys, Strings, Recursion, ADT (AbstrctDt type),concept of Files,Opertions with files, types of files Liner Dt Structure Linked List s n ADT, Linked Listvs" Arrys, Memory Alloction & De-lloction for Linked List, Linked List opertions, Types of Linked tist, Implementtion of Linked List, Appliction of Linked Listpolynomil, sprse mtrix. STACK iilg.k s nad! Stck opertion, Ary Representtion of Stck, Link Representtion of Stck, Appliction of stck - Recursion, Polish Queues The Queue s nad! Queue opertion,arry Representtion of Queue, Linked Representtion of Queue, Circulr Queue, Priority Queue, & Dequeue, Appliction of Queues - Johnsons Algorithm, Simultion 05 University of Mumbi ComPuter & lv) Revised Course(R20121 Lz

14 Non-liner Dt Structure Trees Bsic trees concept, Binry tree representtion,binry tree opertion, Binry tree trversl, Binry serch tree implementtion, Thred Binry tree, The Huffmn Algorithm, Expression tree, Introduction to Multiwy serch tree nd its cretion(avl, B-tree, B* tree) Grphs Bsii concepts, Grph Representtion, Grph trversl (DFS & BFS) l0 04 SortingAND Serching 07 Sorting; Sort Concept Shell Sort, Rdix sort,insertion Sort, Quick Sor! Merge SorlHep Sort, Serching: List Serc]r,Liner Index Sercll Index Sequentil Serch Hshed List Serch, Hshing Methods, Collision Resolution l0 Text Books: 1. Dt Structures A Psedocode Approch with C, Richrd F. Gilberg & Bekouz A. Forouzn, second edition, CENGAGE Lerning. 2. Dt Structures using C, Reem Threj, Oxford University press. 3 Introduction to Dt Structure nd its Applictions Jen-Pul Trembly, R G Sorenson Reference Books: 1. Dt Structures Using C & C++, Rjesh K. Shukl, Wiley- Indi.,2. Dt Stuctures Using C, ISRD Group, Second Edition, Tt McGrw-Hill 4. C &Dt Structures, Prof. P.S. Deshpnde, Prof. O.G Kkde, Dremtech press. 5. Dt Stuctures, Adpted by: GAV PAI, Schum's Outlines Termwork: Term work should consist of t lest 12 experiments. JourRl must include t lest 2 ssignments. The finl certifiction nd cceptnce of term work ensures tht stisfctory performnce of lbortory work nd minimrrm pssing mrksrin term work. TermWork:25Mrks(totlmrks)":15Mrks(Experiment)+5Mrks(Assignment)+5(Attendnce (theory+prcticl)) Prcticl exm will be bsed on the bove syltbus, University of Mumbi Computer Engineering ( Second Yer - Sem lll & lv) Revised Course(R201"2) 13

15 Theory Exmintion: l. Question pper will comprise of totl 6 questions, ech of 20 Mrks. 2. Only 4 questions need to be solved. 3. Question 1 will be compulsory nd bsed on mximum prt ofthe syllbus' -r -1. LL^- *^ r 4. Remining questions will be mixg{ il.nture (for exmple suppose Q.Z t * prt () from module 3 then prt (b) will be from ny module other thn module 3) --: - In question pper, weightge of ech module will be proportionl to number of respective lecture hours s mentioned in the syllbus. Suggested ExPeriments : /mt Note: Students re required to complete 12 experiments. The str (*) mrks experiments re mndtory' Irrpt.*"rt"tt"ns of Linked Lists menu driven progrm' * Implementtion of different opertions on linked list - copy, conctente, split, reverse, count no. ofnodes etc Representtion of Sprse mtrix using multilinked structure. Implementtion of sprse *ut i* multipliction. irnpt.rn.ntuiion of polynomils opertions ( ddition, subtrction) using Linked List. Implementrions of Linked Lists menu driven p_.?glrtj:tck nd queue) Ipplementtions of Double ended queue using Linked!i' t' Implementtion of Priority queue progrm using Linked Lis. q?,. Implementtions of stck menu driven progrm Implementtion of multistck in one lry. * Implementtions of Infix to Postfix Trnsformtion nd its evlution progrm. Impllmenttions of Infix to Prefix Trnsformtion nd its evlution progrm' Simultion of recursion Queue Implementtions of circulr queue menu driven progrm * Implementtions of double ended queue menu driven progrm Implementtions of queue menu driven progrm Implementtion of Priority queue progrm using rry' Implementtion of Johnsons Algorithm Implementtion of Simultion Problem Tree University of Mumbi ComPuter Yer-Sem lll & lv) Revised Course(R I' f t,.: ii,l #i-.ijgql;g{;ill)

16 o *Implementtions of Binry Tree menu driven progrm Implementtion of Binry Tree Trversl progrm. *Implementtion of construction of expression tree using postfix expression. Implementtions of Huffmn code construction Implementtions of BST progrm Implementtion of vrious opertions on tree like - copying tree, mirroring tree, counting the number of nodes in the tree, counting only lef nodes in the tree. Implementtions of B-tree menu driven progrm Implementtions of B+ tree progrm Implementtion of Preorder trversl of threded binry tree" Implementtions ofayl Tree menu driven progrm Sorting *Implementtions of Shell sort, Rdix sort nd Insertion sort menu driven progrm Implementtions of Quick Sort, Merge sort nd Hep Sort menu driven progrm Serching. *Implementtions of serching methods (Index Sequentil, Interpoltion Serch) menu driven progrm. Implementtion of hshing functions with different collision resolution techniques Grph. * Implementtions of Grph menu driven progrm (DFS & BSF) University of Mumbi Computer lll & lv) Revised Course(R2012) 15

17 Subiect Code Subiect Nme Credits CSC304 4 Course Objective: l. To provide concepts tht underpins the disciplines of digitl electronics nd microprocessor 2,. foprovide the concept of modeling Combintiolll.ld qequentil cilcults' t. i; "proria" bsic knowledge of how digitl building blocks re described systems. in VHDL. Course 0utcomes: J Binry nd hexdeciml clcultions nd conversions' Designing of combintionl circuits. Desig-n synchronous nd synchronous sequentil circuits' rrnstte rel world problems into digitl logic formultions. Construct test nd debug digitl networks using VHDL' Lerners will show wreness bout TTL nd CMOC Logic Module Detiled Contents Number Systems nd Codes: Revision of finury, Octl, Deciml nd Hexdeciqll number Systems nd their conversion, Binry Addition nd Subtrction (1's nd 2's complement method), Gry Code, BCD Code, Excess-3 code, ASCII Code, Enor Detection nd Correction Co4qs' niotetenatgebr nd Logic Gtes: Theorems nd Properties of BoolenAlgebr, stndrd sop nd PoS form, Reduction ofboolen functions using Algebric method, K:mp method (2,3,4Yrible), nd Quine- McClusky Method. NAND-NOR Reliztion. Bsic Digitl Circuits: NOT,AND,OR,NANDNO&EX-O&EX-NOR Gtes, Logic Fmilies: Terminologies like Propgtion Dely, C-onsumption,!91v-e1 Fn in ld Fn out etc. with respect to TTL nd CMOS Logic nd Hours l0 J 4 ft.bi,1"td;t L"Ei Design: Introduction, Hlf nd Full Adder, Hlf nd Full Subtrctor, Four Bit Binry Adder, one digit BCD Adder, Four Bit Binry Subtrctor ( 1's nd 2's compliment method), code conversion, Multiplexers nd Demultiplexers, Decoders, One bit, S.qr*rtl"t LGc Design: Concept of Multivibrtors: Astble, Monostble nd Bistble multivibrtors, Flip Flops: University of Mumbi Computer Engineering ( - Sem lll & lv) Revised Course(R2012) 16

18 Mster Slve nd T Flip Flop, Truth Tbles nd Excittion Tbles, Flip-flop conversion. sequentil circuit nlysis, construction of stte digrms. Counters: Design of Asynchronous nd Synchronous CountQrs, Modulo Counters, UP- DOWN counter Shift Registers: SISO, SIPO,PIPO,PISO, Bidirectionl Shift Register, Universl Shift Register, Ring nd Johnson Counter. Pseudorndom Functionl Simultion, Timing Simultion, Logic synthesis, 5 Introduction to VHDL, Frmework of VHDL progrm( Syntx nd progrmming to be done only during Prcticls), Introduction to 03 CPLD nd FPGA Text Books: 1. R. P. Jin, "Modqm Digitl Electronics", Tt McGrw Hill. '-- Yrbrough JohnM., "Digitl Logic Applictions nd Design ", Cengge Leming 3. J. Bhsker.* VHDL Primer", Person Eduction Reference Books: 1. M. Morris Mno, "Digitl Logic nd computer Design", PHI. 2. Dougls L. Perry, *VHDL Progrmming by Exmple",TtMcGrw Hill. 3. Donld p Lech, Albert Pul Mlvino,"Digitl principles nd Applictions",Tt McGrw Hill. Termwork: Term work should consist of t lest 12 experiments out of which t lest 2 to be VHDL bsed. Journl must include t lest 2 ssignments Th. fir.i;;ii;io"*ju.."ptn"ce of term work ensures tht stisfctory performnce of lbortory work nd TermWork25Mrks(totlmrks)=15Mrks(Experiment)+05Mrks(Assignment)+05(Attendnce rtheorytprcticl)) \E in.o"y Exmintion: 1. Question pper will comprise of totl 6 questions, ech of 20 Mrks. 2. Only 4 questions need to be solved. 3. Question I will be compulsory nd bsed on mximum prt of the syllbus. 4. Remining questions will be mixed in nture (for exmple suppose Q.2 hs prt () from module 3 then prt (b) will be from ny module other thn module 3) In question pper, weightge of ech module will be proportionl to number of respective lecture hour:s s mentioned in the syllbus. University of Mumbi Computer Engineering ( Second Yer - Sem lll & lv) Revised Course(R2012l. 77

19 Subject Code csc305 Subject Nme Discrete Structures Credits 4 Course Objectives 1. To ssimilte discrete mthemticl concepts' Z. Introducing discrete mths s bsic foundtion of nlysis nd pplictions like communictior; Course 0utcomes l. Ability to reson logiclly.. 2. Ability to understnd use of functions, grphs nd trees in progrmming pplictions' 3. Understnd use of groups nd codes in Encoding-Decoding' 4. Express recursive functions of other subjects like Dt Structures s reculrence reltion. Modu!e Set Theory Detiled content Hours 01 o Sets, Venn digrms, Opertions on Sets. Lws of set theory, Power set nd Products. Prtitions of sets, The Principle of Inclusion nd Exclusion Logic 05,o Propositions nd logicl opertions, Truth tbles 02 Equivlence, ImPlictions Lws of logic, Norml Forms 06 Predictes nd Quntifi ers Mthemticl Induction Reltions, DigrPhs nd Lttices. Reltions, Pths nd Digrphs. Properties nd types ofbinry reltions. Mnipultion of reltions, Closures, Wrshll's lgorithm 08. Equivlence nd prtil ordered reltions r Posets nd Hsse digrm o Lttice University of Mumbi lll & lv) Revised Course(R2012) 18 ti.

20 04 Functions nd Pigeon Hole Principle Definition nd types of functions: Injective, Surjective nd Bijective Pigeon-holeprinciple Generting Functions nd Recurrenee Reltions. Series nd Sequences o Generting functions. Recurrence reltions o Recursive Functions: Applictions of recurrence reltions e,g, Fctoril, Fiboncci, Binry serclr, Quick Sort etc. Grphs nd Subgrphs. Definitions, Pths nd circuits: Eulerin nd Hmiltoniu Trees o Isomorphism of grphs. Subgrphs nd Subgrph isomorphism Trees nd weighted tees Spnning tees nd minimum spnoing tree Isomorphism oftrees nd sub trees Prefix codes 08 Algebric Structures o Algebric structures with one binry opertion: semigroup, monoids nd groups Product nd quotient oflgebric structures. Isomorphism,HomomorphismndAutomorphism. Cyclic groups, Norml subgroups. Codes nd group codes 06 University of Mumbi Computer Revised Course(R2012) 19,..1""*- -1*--ffi.'*t li\ )i

21 Text Books: I. Kenneth H. Rosen. "Discrete Mthemtics nd its Applictions", Tt McGrw-Hill. 2. Bemd Kolmrq Robert Busby, Shron Cutler Ross, Ndeem-ur-Rehmn, "Discrete Mthemticl Structures", Person Eduction. 3. D. S. Mlik nd M. K. Sen, "Discrete Mttremticl Structures", Thompson. References: l. C. L. Liu, D. P. Mohptrq'Elements of Discrete Mthemtics" TtMcGrwHill. 2. l, P. Trembley, R. Mnohr oodiscrete Mthemticl Structures withapplictions to Computer Science", Tt Mcgrw-Hill 3. YN Singtr, "Discrete Mthemticl Structures", Wiley-Indi. Theory Exmintion: 1. Question pperwill comprise of totl 6 questions, ech of 20 Mrks. 2. Only 4 questions need to be solved. :. Question 1 will be compulsory nd bsed on mximum prt of the syllbus. 4. Remining questions will be mixed in nture (for exmple suppose Q.2 hs prt () from module 3 then prt (b) will be from ny module other thn module 3) In question pper, weightge of ech module wilt be proportionl to number of respective lecture hours s mentioned in the syllbus. University of Mumbi Computer Engin lv) Revised Course(R2012) 20

22 Subiect Code Subiect Nme Credits CSC306 Electronic Circuits nd Communiction Fundmentls 0s Course Objectives: l. To develop the knowledge of semiconductor devices nd circuits, nd explin their use in communiction pplictions 2. To inculcte circuit nlysis cpbilities in students. 3. To mke students wrelof vrious types of integrted circuits tht cn be used in computer pplictions. 4. To mke students wre tht knowledge gined in electronic devices nd circuits is useful in rel life pplictions Course Outcomes: 1. Ability to understnd nd use semiconductor devices in circuits. 3. Ability to understnd field effect devices nd crry out their DC nlysis 4. Ability to understnd concept of feedbck nd oscilltions euiiity to use oscilltors in vrious pplictions. 6. Ability to use opertionl mplifier invrious pplictions 7. bility to understnd concept of phse lock loop nd their use communiction pplictions. 8. Ability to understnd fundmentl concepts of comrnuniction, 9. Ability to pply knowledge of electronic devices nd circuits to communiction pplictions. Module Detiled content Hours 01 Electronic Circuits '. Field effect bsed devices nd circuits: Junction Field Effect Trnsistors, IFET Chrcteristics, FET mplificbtion nd switching, DC lod line nd bis poin! te bis, self bis, voltge divider bis, coupling, bypssing nd AC lod nd prmetirs,-com*ott sour"e circuit lines, FET -odels : nlysis principle of oscilltion, FET bsed Hrtley nd Colpitts Oscilltor.. Crystl oscilltor r BJT s power mplifier ( only clss A nd C) t r Opertionl Amplifier nd its pplictions: Op-mp prmeters nd chrcteristics, Inverting nd Noninverting mplifier, Comprtor, Summing Amplifier, Integrtor, Differentitor, Zero Crossing Detector.. PhseLockLoop: Operting principle of PLL, Lock rnge nd cpture rnge. Modultion Principles of Anlog Communiction: Elements of nlog communiction systems, Theory of mplitude modultion nd types of AM, Genertionof DSB SC using blnced modultor, Genertion of SSB using phse shift method Theory of FMnd PM, Genertion of FM by Armstrong method 06 t2 University of Mumbi Computer EngineerilB{ ece,?i{vdr!fenittl&.lv) Revised Course(R2012) 2L l' fl

23 04 Demodultion:. Principle of super heterodyne receiver.. Foster seely detector for FM detection. Appliction of PLL QC 565) s FM detector, Frequency trnsltor, Phse shifter, nd freq synthesizer Concept of smpling :Smpling Theorem, Types of smpling Quntiztion, A/D nd D/A conversion concept Pulse Modultion: genertion nd detection of PAM, PPM, PWM, PCM, DM nd ADM.Principle of TDM nd FDM. L2 Text Books: 1. Dvid Bell, 'Electronic Devices nd Circuits', Oxford, 5th Edition. 2. Wyne Tomsi'Electronic Communiction Systems (fundmentls through dvnced)', Person J. 4. Eduction,4h Edition. Rmknt A. Gykwd, oop-mp nd liner integrted circuits', PHI, 3"1 edition. G. Kennedy, B. Dvis, S R M Prsnn, 'Electronic Communiction Systems', Mc Grw HilL 5th Edition. References: 1. Robert Diffenderfer, 'Electronic Devices: Systems & Applictions', Cengge Lerning, Indi Edition. 2. K.R. Botkr, 'Integrted Circuits', Khnn Publishers, 9fr Edition 3. Donld Nemen, 'Electronic Circuit Anlysis nd Design', Tt McGrw Hill,2'd Edition. 4. Dvid Bell, 'Electronic Devices nd Circuits', Oxford, 5fr Edition. 5. Wyne Tomsi 'Electronic Comniuniction Systems (fundmentls through dvnced)', Person Eduction,4& Edition. 6. Rmknt A. Gykwd, 'Op-mp nd liner integrted circuits', PHI, 3'd edition 7. G..Kennedy, B.Dvis, S RM Prsnn4 'Electronic Communiction Systems',. 8. Robert Diffenderfer, 'Electronic Devices: Systems & Applictions', Cengge Lerning, Indi Edition. 9. K. R Botkr, 'Integrted Circuits', Khnn Publishers, 9t Edition 10. DonldNemen, 'Electronic Circuit Anlysis nd Design', Tt McGrw Hill,2"d Edition. Grw Hill, 5ft Edition. Termwork: Term work should consist of t lest 08 experiments. Journl must include t lest 2 ssignments. The finl certifiction nd cceptnce of term work ensures tht stisfctory performnce of lbortory work nd minimum pssing mrks in term work. TermWoitc2,5Mrkq(totlrnrks)=15Mrks(Experiment)+5Mrks(Assignment)+5(Attendnce (theory+prcticl)) Orl exm will be bsed on the bove syllbus. University of Mumbi Computer lv) Revised Course(R2012) 22 7t +' *

24 Suggested List of Experiments: l. Study of vrious test nd mesuring instruments 2. Irnplementtion of diode detector 3. Implementtion of single stge FET mplifier 4. Implementition of oscilltors 5. Implementtion of IC 741 bsed ppliction 7. Implementtion of IC555 bsed ppliction 8. Troubleshooting of given fults 9. Modultion nd demodultion of AIWSSB/FM * 10. Study of superheterodyne receiver I l. GOnertion nd.detection of PAM/PP}y1/PWM 12. Genertion nd detection of PCM/DIWADM 13. StudyofFDMndTDM 14. SPICE bsed simultions Importnt Note:. 507o experiments from communiction nd 507o experiments from electronic circuits should be tken. In theory exm the weightge for mrks out of 80 r 35 for Devices rid 45 for communictions Theory Exmintion: 1. Question pper will eomprise of totl 6 questions, ech of 20 Mrks. >,. Only 4 questions need to be solved. 3; Question 1 will be compulsory nd bsed on mximum prt. of the syllbus. : 4. Remining questions will be mixed in nture (for exmple suppose Q.2 hs prt () from module 3 then prt (b) will be from ny module other thn module 3) In question pper, weightge of ech module wilt be proportionl to number of respective lecture hours s ' mentioned in the syllbus. University of Mumbi lv) Revised Course(R2012) 23

25 Subiect Code Subject Nlqg_ Credits CSC4O1 Applied Mthemtics IV * 05 Course Objectives: This course will present mtrix theory, Similr mtrices nd it's ppliction to find the mtrics function' Present methods of comiuting nd using eigln vlues nd eigen vectors. Set up nd directly evlute contour integrls Cuclys integri thejrem nd formul in bsic nd extended form. Present Tylor nd Lurents series to find singulrities iero,s nd poles lso presents residues theory nd it's pplictions. Present theory of probbility, Bleis Theorem, Expecttion rd Mom"nts nd it's ppliction. Present probbility distribution such s binomil, poisson nd-norml distribution with their properties. Present smpling theory nd it's ppliction for smll nd lrge smple. Present methods of computing optimiztion using simplex method. Course Outcomes: Students in this course will pply the method of solving complex integrtion nd computing residues. Use residues to evlute vrious contour integrls. Demonstrte bility to mnipulte mtrices nd compute eigen vlues nd eigenvectors. Students in this course will pply the Procedure nd methods to solve technicl problems. Module' 01 Complex Integrtion Line Integrl, cuchy's Integrl theorem for simply I.l complex Integrtion - connected regions, Cuchy's Integrl formul(without proof) 1.2 Tylor's nd Lurent's series (without proof) I.3 Zeros, poles of f(z), Residues, Cuchy's Residue theorem (10) Applictions of Residue theorem to evlute lntegrls of the type I z-n IJ f*i, o,coso,o,! fkwx. lo 02 Mtrices:- (08) 2.1 Eigenvlues nd eigen vectors 2.2 Cyley -Hmilton theorem(without proof) 2.3 Similr mtrices, digonlisble of mtrix. 2.4 Derogtory nd non-derogtory mtrices,functions of squre mtrix. 03 Correltion (04) 3.lscttered igr University of Mumbi ComPuter Course(R2012) 24 *

26 Spermn's Rnk correltion. 3.2 Regression Lines. 4 (10) 4.1 Bye's Theorenq 42 Rndom Vribles:- discrete & continuous rndom vribles, expecttion, Vrince, Probbility Density Function & C-umultive Density Function" 4.3 Moments, Moment Generting Function. : 4.4 Probbility distribution: binomil diskibution, Poisson & norml distribution. (For detil study) 05 Smpling theory (08) 5;l Test of Hlpothesis, Level of siguificnce, Criticl regior5 One Tiled nd two Thiledtes! Test of significnt for Lrge SmplesiMens of the smples nd test of significnt of mens of two lrge smples. 5.2 Test of significnt of smll smples:- Students t- distribution for dependent nd independent smples. 5.3 Chi squre test- Test ofgoodness offit nd independence ofttributes, Contingency tble. 06 Mthemticl Progrmming (08) 6.1 Types of solution, Stndrd nd Cnonicl form of LPP, Bsic nd fesible solutions, simplex method. 6.2 Artificil vribles, Big -M method (method of penlty). 6.3 Dulity, Dul simplex method. 6.4 Non Liner ProgrmmingiProblems with equlity constins nd inequlity constrins (No formultion, No Grphicl method). Terq work shll consist of minimum four SCILAB prcticls nd six tutorils. SCILAB prcticls Tutorils Attendnce Totl 10 mrks 10 mrks 05 mrks 25 mrks University of Mumbi Computer Engineering lv) Revised Course(R2012) 25 ffii!'.:,':t,',,'-.'' /

27 Text Books: l. Higher Engineering Mthemtics by Grewl B. S. 38d' edition, Khnn Publiction Opertion Reserch by Hir & Gupt4S Chnd' 3. ATextBook ofapplied Mthemtics vql. I & II by P.N.Wrtilr & 4, JN.Wrtikr, Pune, Vidyrthi GrihPrkshn', Pune' 5. Probbility nd sttistics for Engineering, Dr. J Rvichndrn, wiiey-indi Reference Books: l..probbility,& Sttistics with relibilityby Kishor s. Trivedi, Wiley Indi. tev 2. Advnced Errgg. Mthemtics by C. Ry Wylie Wvlie & Lorris Louis Rrrt Brrett.TMH Intemtionl E 3: Mthemticl Methods of Science nd Engineering by Knti B. Dttq Cengge Lerning.. 4. Advnced Engineering Mttremtics by Kreyszig E-9ft edition, John Mley. 5. Opertions Reserch by s.d. shrm Kedr Nth, Rm Nth & co. Meert. l idition. 6. Engineering optimiztion (Theory nd Prctice) by Singiresu S.Ro, NewAge Intemtionl publiction. Theory Exmintion: 1. Question pper will comprise of totl 6 questions, ech of 20 Mrks. ;. il;;,ijo* n".dtob" solved. 3. Question 1 will be compulsory nd bsed on mximum prt of the syllbus' 4. Remining questions *itt b. mixed in nture (for exmple suppose Q.2 hs prt () from module 3 then prt (b) will be from ny module other thn module 3) In question pper, weightge of ech module will be proportionl to number of respective lecture hours s."itioo.o in the syllbus. University of Mumbi Computer Engineering ( Second Yer-Sern lll & lv) Revised Course(R2012) 26

28 Subject Code Subject Nme Credits CSC4O2 Anlysis ofalsorithm 5 Preqursites : Students should be fmilir with Dt structure concepts, Discrete structures Course Objectives: 1. To tech vrious problem solving strtegies.. 2. Totech mthemticl bckground for lgorithm nlysis nd implementtion of vrious strtegies like divide nd conquer, Greedy method, Dynmic progrmming, Brcktrcking, brnch nd bound 3. To tech different string mtching lgorithms. -ourse Outcomes: l. Abilit), to select pproprile problem solving strtegies. 2. Ability to clculte time complexlty nd spce complexity of n lgorithm. 3. Ability to nlyze different divide nd conquer problems. 4. +Pil,.ry to nlyze different greedy method problems. 5. Ability to nlyze different dynmic progrmming problems. 6. Ability to nlyze different bcktrcking problems. 7. Ability to nlyze different string mtching lgorithms. Module Detiled Content Hrs. I 2 Introduction to nlysis of lgorithm. Decision nd nlysis fundmentls. Performnce nlysis, spce nd tirne complexrty. Growth of function - nig Oh,Omeg, Th.tu nottion o Mthemticl bckground for lgorithm nlysis. Anlysis of selection sort, insertion sort r Rndomized lgorithms, r Recursive lgorithms. The substitution method. Recursion hee method. - Mstbr method Divide nd Conquer. Generl rnethod: Binry serch. Finding minimum nd mximum. Merge sort nlysis. Quick sort nlysis. Shssen's mtrix multipliction. The problem of multiplying long integers University of Mumbi Computer Engineering & lv) Revised Course(R2012l

29 . - constructing Tennis toumment Greedy Method. Generl Method 3 07 r Knpsck problem. Job s"quer"irrg with dedlines. Minimum cost spnning trees:kruskl nd prim's lgorithm. Optiml storge on tpes Dynmic Progrmming. Generl Method Multistge grphs. lt pir shortest pth '. single source shortest pth. 0/1 knpsck o Trvelling slesmn problem. - Flow shop schedulin Bcktrcking l. Generl Method 5. 8 queen problem( N-queen problem) 05. Sum ofsubsets String Mtching Algorithms o The nive string mtching Algorithms o The Rbin Krp lgorithm String mtching with finite utomt. Theknuth-Morris-Prttlgorithm. Longest common subsequence l Brnch nd bound. Generl method 7 04 o 15 puzzleproblem o Trvelling slesmn Text Books: 1. Ellis horowit z, srtjshni, s. Rjsekrn. "Fundmentls of computer lgorithms" University Press. 2. T.H.coremn, C.E. Leiserson,R.L. Rivest, nd C. Stein, "Introduction to lgorithms", 2'd edition, PHI publiction Alfred v. Aho, John E. Hopcroft, Jeffrey D. Ullmn, "Dt structures nd Algorithm" Person eduction, fourth impression 2009 Reference books: l. Michel Gooddrich & Roberto Tmmssi" "Algorithm design foundtion, nlysis nd internet exmples", Second edition, wiley student edition. University of Mumbi Computer Engineering - Sem lll & lv) Revised Course(R2012) 28

30 Suggested Prcticls: Implementtions Progrming Lnguge must be in 'C'only. Module no Module nme 1 Introduction to nlysis of lgorithm: Suggested Experiment list selection sort insertion sort ( for this experiment comprtive nlysis on the bsis of comprison required to sort list is expected for lrge vlues ofn ) Divide nd Conquer -binry serch 2 -finding minimum nd mximum -Merge sort nlysis* -Quick sort nlysis* ( the bove two experiments mrked s * should be considered s single experimen!. For this experiment comprtive nlysis on the bsis of comprisons requiredlo sort list is expected for lrge vlues of n ) -Strssen's mtrix multipliction,the problem of multiplying long integers -constructin g Tennis tournment* J Greedy Method -Knpsck problem* -Job sequencing with dedlines -Minimum cost spnning trees-kruskl nd prim's lgorithm* -0ptiml storge on tpes -Sinele source shortest pth 4 Dynmic Progrmming -Multistge grphs :ll pir shortest pth -single source shortest pth -Optiml binry serch tree* -0/l knpsck.trvelling slesmn problem* -FIow shop scheduling 5 Bcktrcking -8 queen problem( N-queen problem)* -Sum ofsubsets -Grph coloring 6 String Mtching Algorithms -Knpsck problem -The nive string mtching Algorithms -The Rbin Krp lgorithm -String mtching with finite utomt 'The knuth-morris-prtt lgorithm -Lonsest common subsequence lsorithm* 7 Brnch nd bound -15 puzzle problem* -Trvelling slesmn problem 29 r-.. i:,r'::;-r;r-titl'4 S I

31 Termwork: Totl experiments to be performed re 12= (9 + 3 ) 9 Experiments mrked + re mndtory' For dditionl 3 experiments techer cn choose experiments from suggested list. The finl certifiction nd cceptnce of term work ensures tht stisfctory performnce of lbortory work nd rnini*u* pssing mrks in term work. Termwori<: 25 Mrks ( totl mrks ) = 15 Mrks Experiments + 05 Mrks Assignment + 5 (Attendnce (heory+prcticl)) Prcticl Exm will be bsed on bove syllbus Theory Exmintion: 1. Question pper will comprise of totl 6 questions, ech of 20 Mrks. z. drrv + qu.riio* need to be solved.. Question I will be compulsory nd bsed on mximum prt of the syllbus., 4. Reminingquestions will be mixed in nture (for exmple suppose Q.2 hs prt () ftom module 3 then prt (b) will be from ny module other thn module 3) In question pper, weightge of ech module will be proportionl to number of respective lecture hours s mentioned in the syllbus. University of Mumbi 30 ib-

32 Subiect Code Subiect Nme Credits CSC4O3 Computer Orgniztion nd Architecture* 05 Course Objectives; 1. To conceptutize the bsics of orgniztionl nd rchitecturl issues of digitl computer. 2. To nlyze performnce issues in processor nd memory design of digitl computer. 3. To understnd vrious dt trnsfer techniques in digitl computer. 4. To nlyze processor performnce improvement using instruction level prllelism -ourse outcomes: 1. Ability to understnd bsic structure of computer. 2. Ability to perform computer rithmetic opertions. 4.. Ability to design memory orgniztion tht uses bnks for different word size opertions. 5. Ability to understnd the concept of cche mpping techniques. 6. Abilii to understnd the concept of VO orgniztiin Z eumty to conceptulize instruction level prllelism" Pre-requistesl Fundmentts of Computer, Digitl Logic Circuits, Progrmming Lnguges (C, Q*+, Jv) Module Detiled Contents Hours 1 Overview of Computer Architecture & Orgniztion:. Introduction of Computer Orgniztion nd Architecture. c Bsic orgniztion of computer nd block level description of the functionl units. o Evolution of Computers, Von Neumnn model.. Performnce mesure ofcomputerarchitecture. o Introduction to buses nd connecting I/O devices to CPU nd Memory bus strucfure. 04, Dt Representtion nd Arithmetic Algorithms:. Number representtion: Binry Dt representtion, two's ' comploment representtion nd Floting-point representtion. ref;8754 floting point number representtion. Integer Dt computtion: Addition, Subtrction. Multipliction: Signed multipliction, Booth's lgorithm

33 o Division of integers: Restoring nd non-restoring division Floting point rithmetic: Addition, subtrction J Processor Orgniztion nd Architecture:. CPU -Architecture, Register Orgniztion, Instruction formts,.bsic instruction cycle. Instruction interprettion nd sequencmg. o Control Unit: Soft wired (Micro-progrmmed) nd hrdwired control unit design methods. Microinstruction sequencing nd execution. Micro opertions, concepts of nno progrmming.. Introduction to RISC nd CISC rchitectures nd design issues.. Cse study on 8085 microprocessor: Fetures, rchitecture, pin configurtion nd ddressing modes. t2 4 Memory Orgniztion: t2. Introduction to Memory nd Memory prmeters. Clssifictions of primry nd secondry memories. fypes of RAM nd ROM, Alloction policies, Memory hierrchy nd chrcteristics.. Cche memory: Concept rchitecture &1,L2, L3), mpping Itechniques. Cche Coherency, Interleved nd Associtive memory.. Virtul Memory: Concept, Segmenttion nd Pging, Pge replcement policies. UO Orgniztion nd Peripherls: 5 6. Input/output systems, I/O modules nd 8089IO processor. o Types of dt trnsfer techniques: Progrmmed IlO, Interrupt driven VO nd DMA.. Peripherl Devices: Introduction to peripherl devices, scnner, plotter, joysticks, touch pd. 6 Introduction to prllel processing systems: 4 Introduction to prllel processing concepts. Flynn'sclssifictions r pipeline processing o instructionpipelining, o pipeline stges o pipeline hzrds. University of Mumbi Computer Engineering ( Second Yer - Sem lll & lv) Revised Course(R2012)

34 Text Books: 1. Crl Hmcher, Zvonko Vrnesic nd Sfirt Zky,o'Computer Orgniztion", Fifth Edition, Tt McGrw-Hill. 2. J"l- P ft;;;r, "Co*puterArchitecture nd Orgniztion", Third Edition. 3. Willim Stllings, "Computer Orgniztion ndarchitecture: Designing for Performnce", Eighttr Edition, Person. 4. B. Oovindrjulu, "ComputerArchitecture nd Orgniztion: Design Principles nd Applictions", Second Edition, Tht McGrw-Hilt. Reference Books: v1. Dr. M. Ush, T. S. Sriknth, "Computer System Architecture nd Orgniztion",First Edition, Wiley 'Computer Orgniztion" by ISRD Group, Tt McGrw-Hill. Rmesh Gonkr, "Microprocessor Architecture, Progrmming nd Applictions with the 8085, Fifth Edition,Penrm. Termwork: i.;;"rk;h"uld consist of t lest 08 experiments. Journl must include t lest 2 ssignments. The finl certifiction nd cceptnce of termwork ensures tht stisfctory perfolmnce of lbortory work nd minimum pssing mrks in term work. TermWoik25Mrks(totlmrks):15Mrks(Experiment)+5Mrks(Assignryent)+5(Attendnce (theory+prcticl)) orl exm witl be bsed on the bove syllbus. Note: r. The fculty should conduct eight progrmming prcticl / experiments bsed on the bove syllbus including \#,r'o cse studies on recent developments covering the bove contents. All the plogrms should be implemented in ClC*lJvunder Windows or Linux environment. : Experiments cn lso be conducted using vilble open source tools microprocessor should be included only s smple cse study to visulize the concepts. No questions in University Exms / Clss Tests should be sked on 8085 microprocessor.. SUGGESTED LIST OF COA PRACTICAL / EXPERIMEI{TS 1. To sludy Full Adder (7483): 2. To study ALU (74181) 3. To study MASM (Micro Assembler)..----I:-l: ^^:.^ -^ 4. A progrm for hexdeciml ddition nd multipliction. University of Mumbi Computer Engineering { Second Yer - Sem lll & lv) Revised Course(R2012} 33