Scribd
Upload
88 views27 pages

Syllabus Bengaluru University

know syllabus b.tech syllabus 2019

Uploaded by

shiva
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
88 views27 pages

Syllabus Bengaluru University

know syllabus b.tech syllabus 2019

Uploaded by

shiva
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 27
. 0 RANGAL ORE UNIVERSITY DEPARTMENT OF COMPUTRR SCIENCE AND ENGINFFRING, UVCF, BENGALURU Teoh PROGRAMME IN C OMPUTPR SCIENCE AND ENGINERRING Gone Cade [ARSE HOF 1 Catewory | Rave Serences Coon tle | PNGINERRING MATHEMATICS Scheme and f No.of Hours Week Cres TOE Tr Lp [88 | Crehts | Semester it oH Se { o fol. CHE Marks $0 [SEE Mark 50 [Total Max Marks 100 | Duration of SEF 08 Hours Prerequisites (if any) NIL . “COURSE OBJECTIVES, This course will enable all stents to Understand the properties of Founer series. Stody the applications of Fourier Transforms and Z-Transforms Understand what functionals are, and have some appreciation of their appleations Intretce students 1 how to solve linear Partial Differential with different methods Appreciate the importance of probability and statistics computing ard research UIT 08 Hours Fourier Series: Pericdic functions, Fourier expansions, Half range expansions, Complex Foun Snes, Practical harmonic analysis, Applications usr 8 Hours Fourier Transforms: Finite and infinite Fourier Transforms, Fourier sine and cosine ‘Transforms, Properties, Inverse Transforms. Z ~ Transforms Definition, Standard 2. ‘Transforms, Linearity property, Shifting rule, Ital valve theorem, Final value theorem. Inverse Z-Transforms. Application of Z-Transforms to solve differentia] equations usr WHtours Calculus of variations: Vanation of 3 function and a fanctional Extremal of a function, ‘variational problems, Euler's equation, standard variational problems including Geovcsics ‘Minimal surface of revolution, hanging chain, Brashistechrone problems UNITY: 1 Ho Partial Differential Equations (PD.E.): Formulation of PDE Soluion of non hmogeneeas PD Eby ducctntesation, Meth of separation of vanables (stand secon e's near PDE ofthe pe Fp + QR, salut order equations, Solution of Lag f standard pes of non tneat PDE Char p's metho uNIry 10 Hours Statistics and probability: Curve fing ing of 4 aH hie, Biting oF a curve ofthe fr ratmateta Comclawon Regresna ask concepts of probabsty, Addition wae pict toe, Hayes theorem. Random variables woncerng, UVCE aes yale Fin Discrete and continous random variables ~ PDF, CDF. Binomial, Poisson, Exponential and probability, joint dstibutions, disrete and covtinuous, independent random variables, ‘problems om expectation and variance, ‘TEXT BOOKS: 1. BS. Grewal: Higher Engineering Mathemaics, Khanna Publishers, 43rd Ed, 2015 2. $C. Gupta and V. K. Kapoor, Fundamentals of Mathematical Statistics, S. Chand and sons publishers, 3. E.Kreysrig: Advanced Engineering Matheratis, John Wiley & Sons, 10th Ed, 2015 4, P.V. ONeil, Advanced Engineering Mathenaties, Pearson/ Thomson, 5. G.B, Thomas and RL. Finney, Callas, Addison Wesley, 9 Edition, 1998. 6, Walpole and Myers, Probability and Statistis for Engineers and Scientist, 2007 7.D.S, Chandrashekarsiah, “Engineering Mathematie-I", Prism Books Pvt. Lxd. 7% Edition, 2014, REFERENCE BOOKS: 1. BY, Ramana "Higher Engineering Mathematics" Tata Me Graw-Hill, 2006 2. NP Bali and M. Goyal, "A textbook of Engivering mathematics’, Laxmi publications, latest edition 3.1L K Dass and Ex. Rajnish Verma, "Migher Engincering, Mathematics", $. Chand publishing, eition, 2011 ‘COURSE OUTCOMES: ‘The students at the end ofthe course, willbe able te COL: Write given funtion in terms of sine and cvine ers in Fourier series and also to get Jnowledge in Fourier transforms. (C02: Calculate the Laplace transform of standard functions both from the definition and by using tables. (C03: Describe the brachistocrone problem mathematically and solve it; solve isoperimetric problems of standard type, COA: To beable to solv linear ordinary differential equations, by using elementary methods inthe case of constant coeicients COS: Apply method ofleast squares to find the euve of best fit for the given data, Dept of Computer Science and Engineering, OVCE Pages SCHEME OF EXAMINATION: ‘Quiet cies [TS UCAny Thee Unis) -20Mars [ON Maks [Test I (Remaining Two Units)-20 | Quiz I Rana S Marks | 1 (Compubory): MEQE oF Shor answer type Svestons for 15 Marks covering ete syllabus G2 & 3 fiom Unis which have 08 Hours are] compulsory. (QF oF 05, Q6 oF QF and QB or QD from Uni hich have 10 Hous shall have Ina Choice. | 34 Marks Tr3= 51 Marks 172 | Tots: 100 Marks "Note: SEE shall be conducted for 100 Marks ard the Marks obtained i sealed down to $0 Marks, Dept of Computer Science and Engineering, UVCE Page? BANGALORE UNI A pERING, UVCE, BENGALURU onerous ONES Course Code [TBCIPCIO2 ‘Category | Engineering Science Courses Profesional Core Cuonn tie ~ | DIGITAL SYSTEM DESIGN- THEORY of nek | Stoned [aT 86 | Gd | Semester CSBISE rps foto lt 3 ‘CHE Was 50 | SEE Marks. SO | Tota Max. Wars: 100_[ Duration of SEE: 03 Hours | Preequisies(FanyNIE ‘COURSE OBJECTIVES: ‘The couse wll enable the students to 1. Understand various digital logic gates alongwith their operations using tut table and logic diagram. 2. Apply minimization techniques for designing optimized digital circuits. 5. Anlyze and design cost effective combinational and sequential circuits forgiven problems. ‘Analyze and design a counter base on shi esters. 5. Anslyze and design a synchronous and asyncvonous counter. UNITE DIGITAL PRINCIPLES, 08 Hours (Overview of basic gates: NOT, OR, AND, univeral gates: NOR NAND, AND-OR Invert, Gates, Positive and Negative Logic, TTL AND, OR,NOT, NAND Gates, Definition of digital signal, Digital Waveforms, Digital Lope. Combintionl Logie Circuits: Sum-of Products Method, Productof Sum, Karnaugh Simplieations for 4 variables, Don'tcare Conditions, [NAND and NOR Implementation, Simplification ueng Quine MeChisky Method, UNIT I: DATA-PROCESSING CIRCUITS 08 Hours ‘Multplexers, Demuliplexes, Decoder, Encodss, Exclusive OR Gate, Magnitude ‘Comparator, Adder (half nd ful), Subiaco (half nd fll), UNIT HI FLIP-FLOPS 10 Hours Flip-lops: SR, 1K, T,D; JK Master-slave lip-flop, lip lop Characteristic Equations, Fdge ‘Triggered Flip op, Various Representation of Flip flop. Registers: Types of Registers, Srial- in-SerialOut, SerithinParle-Out, Pullin Seris-Out, Parallel-in-Parale-ot, Applications of Shift Register, UNIT IV: COUNTERS 10Hours Asynchronous Counters, Synchronous Counters, Changing the counter modus, Decade ‘Counter, Counters Based on Shit Registers Counts Design a synthesis problem. Oe oF Computer Science and Engincerng, UVCE rage UNIT V: DESIGN OF SYNCHRONOUS AND ASYNCHRONOUS SEQUENTIAL caRcurrs 10 Hours Design of Synchronous Sequenil Cireit: Model Selection, State Transition Diagram, State ‘Synthesis Table, Design Equations and Circuit Diagram, State Reduction Technique ‘TEXT BOOKS: 1, Donald P Leach, Albert Paul Malvino and Goutam Saha “Digital Principles and Applications", 8 Eatin, Tata MeGraw Hill, 2015. 2. KR Venugopal, Shale K, “Digital Circuits and System”, Tata MeGraw Hill, 2011 REFERENCE BOOKS: 1. RP Jaia, Digital Integrated Circuits Design, A Design Prospective, Second Edition Pearson, 2016 2. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, 2M Edition, Tata MeGraw Hill, 2005, 3. Charles H. Roth: Fundamentals of Logic Design, Jr, 5® Editon, Thomson, 2004 Ronald J. Tocti, Nel 8. Widmer, Gregory L. Moss: Digital Systems Principles and Applications 108 Edition, Pearson Eduation, 2007 5. RD Sudhaker Samuel, KS. Nandini Prasad: Logic Design, 1 edition, Elsevier Publication, 2013, ‘© BOOKSS/ONLINE RESOURCES: 1. Ramaswamy Palanisppan, “Digital Systems Design” I Edition, 2011 hhtps/dvikan.nontn-stodenserverikompendie/dgial-systems-design pa ‘Venkatesh, Ravindea P Rajput “Digital System Design” I" Edition 2018. 3. DAGodse AP Godse, Digital System Design, 1* edition, Technical Publication. Innps/tooks googe0.nfbooksisbn-81843 13594, 4. D.G, Wong, Digital System Design, E. Amol, 1985. tps /books. google ca intbooks?isba-0713135395, Moocs: 1 ps:/pte.ac.infeoursest 17105080 2. hnips:twwwsclasscental.comeourselnptel-digital-system-design 619. 3. hips:/online stanford educourseslel08-digita-systems-design, COURSE OUTCOMES: ‘The students atthe end of the course, will beable to COM: Comprehend the fundamental concepts and principles of digital design. C02: Apply techniques of Boolean functions minimization and design and analyze cost fective combinational circuits €O3: Design, analyze and implement various data processing circuits, (CO: Design and analyze synchronous and asynchronous Counter using fipflops. Dept of Computer Science and Engineering, UVCE Page ‘COS: Design and analyze synchronous and asynchronous counter sig Sif register, ‘SCHEME OF EXAMINATION: clE-s0 Marks | compulsory. Taman Quzi= ‘Test (Any Three Units)-20 Marks |g ed ee Marks Testi (Remeining Two Unisy-20 | Quiz = [oeyoy, | Marks | Marks Simarks | ‘QL (Compulsory): MCQS oF Short answer type | 1 ya. 1 | auestions for 15 Marks covering entire syllabus SEE ~100 [2 & 3 fiom Units which have 08 Hours are] 17*2= | Total: 100 | 34Marks | Marks QS oF QS, Q6 oF QF and QB oF Q9 from Units) 17*3= | hich have 10 Hours shall have Internal Choice. | S1Marks Maks, ice Engin Dent of Computer wv SBE shall be conducted for 100 Marks and the marks obtained is scaled down to 50 7 BANGALORE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU 'Tech: PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING. (Coane Cate ‘Category _| Engineering Scienoe Courses: Professional Cow ‘Course title | DATA STRUCTURES AND APPLICATIONS- THEORY | Scheme and No of Hours/ Weck Credits L_[-T TP _[_ 88 | Credits | Semester- Ill CSEASE _ 2 [2 —o fof 3 —_ ‘CIE Marks: 50_| SEE Marks: 50_[ Total Max. Marks 100_| Duration of SEE: 03 Hours Prerequisites (fany) NIL — ‘COURSE OBJECTIVES: ‘The course will enable the students to |. Lear program independent view of data structure, including its representation and operations performed on them. Demonstrate the use of pointers an its application i various problems. ‘Analyse Linear and Non inea Data structures Apply the appropiate data strctures during program development. ‘Get an idea about the various types of data Sorting, searching and indexing methods 0 Increase the knowledge of usage of data stuctures in algorithmic perspective. UNIT I: INTRODUCTION 10 Hours Inswodvetion to Data Structures, Classifications (Primitive & Non Primitive), Storage clas, bit Fields, Structures and Unions: Ama of Structures, Arrays within Structure, Structures within ‘Structures, Structures end Functions Selfreferental Stucturs, Unions, Sze of Structures and ‘unions. Pointer: Pointers and Arrays, Pointers and Chirtetr Strings, Amay of Pointers, Pointe as Function Arguments, Funtions Returning Pinter, Pointer o Functions, Poiates: and Structures. Dynamic Memory Allocation: Advantges and Disadvantages over static ‘memory allocation, Dynamic Memory Allocation functions. Command line arguments: File ‘management with command fine arguments UNITE STACKS AND QUEUES tottus Rarer nD Gperons, Ara Rewestton of Sas, Sik Aplin Na rn ral spt come canon of pis rein caaaaeee eee Banal Coefelen, OCD, Fora Squce, Tower of Ha Naan cary Reston, Gute Opals, Cir Ques, Dec, Prony Ques, Mise Sucks nd Ques User: LINKED List cst avn, ae a UNITIM LINKED LIST aon of ke Ht i Meno Link a pesos Fane ere eran Delton. Dovy inks! iat Cresr ike a2 Tevening, Sewing, rion an Peo. pans of Linke a ~Pobromals Span mui oe. Dept of Comparer Science aed Engineering, UVCE 08 Hours “Anay and linked Representation preorder; Additional Binary tree ructon and Evaluation of an UNIT IV: TREES “Tress terminology, Binary Trees Pro ot Binary Trees, Binary Tree Traversals ‘operations, Threaded binary tees, Binary Expression operties of Bina HES Tnorder, postones, ‘Search Trees) Cons INIT: G AND SEARCHING oe tomy UNI: SORTING A gn So Hating: Hh Table remit TEXT BOOKS: 1 ata Simtres A Pseudo-code approach with C-ibere & Forouzan, 2nd editon Cengage Leaming, 2014 Fankenentnls of Data Structures in C-Ells Horowitz and Sartaj Sahni, 2nd edition, Universities Press, 2014 [REFERENCE BOOKS: 1 Data Sractures- Seymour Lipschitz, Schaum's Outlines, Revised Ist edition, McGraw wil, 2014, 2. An ntrodetion to Data Stctures with A ‘Sorenson, 2d Edition, MeGraw Hil, 2013. ‘Data Stnctures- Seymour Lipschitz, Schaum's Outlines, evsed Ist edition, McGraw Hill, 2014 Daa Structures and Program Design by C R-Kruse, CL Tondo and B.Leung, Second edition, Pearson Education, 2013, plications. Jean-Paul Tremblay & Paul G «- BOOKSS/ONLINE RESOURCES: 1. pstnww courses ongspevalzationsdat-strotures gorithms. 2. psi ude. com/dats-strueture-and-algoritims-dep-dive-using java 3. psn geeksforgesksonpata-structre/ ‘4p we amazon co.uk/Algorithm-Design-Manul ‘Skiena/dp/1848000603, moocs: 1 NPTEL: pnp. ac ineourses/ 106102064, 2. UC Berkeley Data Structures ups: youtube conyplay itis PLBB2PC7S98A3B254, 4, Alorthns, Part (Princeton University): tps /Www couseraorgcourselalgsdpart Dept of Computer Science and Engineering. UVCE eto a Page COURSE OUTCOMES: ‘The toes a the end of he couse, wil be able: COL: Explore various operations on different data suctres {€O2: Develop and Apply tinear and nonlinear data structures for solving computing problems COS: Implement operations like searching, insertion, deletion, avering. mechanism on ‘anus Data stretues. (CO Design and trace the programs for simple problems and for vasows operations on Aitferent Data stoctures ste (COS:_ Design solutions for applications using appropriate data structures. ‘SCHEME OF EXAMINATION, | Test] its) -20 Marks | = Gy (Any Thee Units)-20 ars [ONEI™ | as Marks | se 59 Marks [Test (Remaining Two Unts)-20 [Quiz l= | a5 yang, | Maks Marks 5 Marks _ Q1 (Compulsory): MCQs or Show answer type for 15 Marks covering etre syllabus, | 1 Marks SEE 100 | Qz & Q3 fiom Units which have 08 Hours are] 17*2= | Total 100 Marks | compulsory. 34.Marks | Marks (QM oF Q5, Q6 oF QT and QF oF Q fom Unis] 17" hich have 10 Hours shall have Intsal Choice. | S1 Marks "Note: SEE shall be conducted for 100 Marks and the Marks obtained is sealed down to 50 Marks. Dept of Computer Science and Engineering, UVCE Pages Deranrnenr oF COMPUTERSCIENCE A CNC AND ENGINEERING ~ [1sCIPC3O4 Engineering Course tile | COMPUTER ORGANIZATI ccheme and | __ No. of Houre/Week Schemes | Ne HSC Snes I CSEISE 4 o | oO 0 CIE Marks: 50 | SEE Marks: 50 | Total Max. Marks: 100 Duration of SEE: 03 Hours [Prerequisites any) NIE — Ccounst onsecrives: ‘The coure will enable the students to ‘Understand the various components and views ofa computer system. ‘Leam the design of arithmetic logic uni, nemory nit, processing unit and VO unit. Fanilrize withthe complexities involvedin the design of @ computer system Compare the various compute systems. Design ecient computer systems. UNIT I: INTRODUCTION 10 Hours “The General Purpose Machine: Structure ofa Digit] Computer, The general purpose machine, “The Perspectives of a Computer Sytem: The macine/assembly language programmer's view, ‘The computer architect's view, The computer system logic designer's view, Historical perspective. Machines, Machine Languages and Digital Logic: Classification of computes and their instructions, Computer instruction sts. Infernal description ofthe simple RISC computer SSRC, Formal description of SRC using register transfer notation, RTN, Description of addressing modes with RTN, Register tafe ad logic circuits: fom behaviour to hardware UNIT II: COMPUTER ARITHMETIC AND ARITHMETIC UNIT. 08 Hours [Number systems and radix conversion, ixed-poirt arithmetic, Floating-point arithmetic, UNIT III: MEMORY SYSTEM DESIGN 08 Hours Components of the Memory System, Semicondtor RAM Memories, Read-only memories, ‘Speed, Size and cost, Cache memories, Performance considerations, Viral memories, Secondary Storage. UNIT IV: PROCESSOR DESIGN re Some Fundamental Concepts, Execution ofa complete Instruction, Multple-Bus Organization, Hacdwied Contol, Microprogrammed Cont. Ppelinng: Basic Concepts, Data Hazards, Instruction Hazards, Influence on Instruction Sets, Datapath and Conttol Considerations ‘Superscalar Operation. ee Dept of Computer Science and Engineering, UVCE 0 UNIT Y: UO AND PERIPHERAL DEVICES olen Assessing VO devices, nteupts, Direct Memory Access, Buses, Interface Circuits Standard VO Interfaces, Display devices, Printers, np Devices ‘TEXT BOOKS: |. Vincent P Heuring& Hany F Jordan, Venkatesh, “Computer Systems Design and Architecture", 2014, Parson Edeation Limited 2. Carl Hamacher, Zvonko Vranesi,SafwatZaky, Computer Organisation, Fifth Editon, July 2017, MeGraw Hill Edueaton REFERENCES: William Stallings, Computer Organization and Architecture, Fourth Edition, PHL M-Mano, Computer Architecture, Prentice Hall Hayes, Computer Architecture & Organization, Tied Edition, TMH, Patterson, Computer Architecture, PHL ‘© BOOKSS/ONLINE RESOURCES: 1, www feebookcentreneuComputerScience.(Computer-Organizationand- Architect 2. hntps/ww: padre concomputer-orgnization-and-architecture-books html 3. www fretechbooks comieompter-organizaton-and-arhitetue-156 hm Moocs: 1. ups: classcenral con/courselpte!-computer-organization-and-architenure-0- pedagogical aspect 9824 COURSE OUTCOMES: ‘The students at the end ofthe course, wl be able to COI: Understand the design principles ofa computer system, (C02; Design and analyze the performance ofthe arithmetic loge unit, memory unit input output unit and processing unt ofa computer system. (€O3: Compare the various computer systems and build an efficient computer syst. (COM: Analyse the bottlenecks in computrsytem. (COS: Modify the design to improve the performance ofa computer system. SSF Dept of Computer Scienoe and Engineering, UVCE SCHEME OF EXAMINATION: iE ~ 50 Marks SEE 100 Marks —— Taiz T= a sy Thy Unis) - 20 Maks 25 Marks Tet (Any Ts Ui) [i a “Test Renaning Two Unis) il syeag] Mae at [5 Marks _| 25 Mares FOr (Compulsory MCQS oF Shor answer Opel 5a 5[ ‘questions for 15 Marks cor ing entire syllabus. rs Qi & 3 fiom Unis which have 08 Hours we] 17*2= | Toss: 1y compulsory. a 34 Marks | Mars Qf or QS, Q6 or Q7 and QB or Q9 from Units | 17* ‘which have 10 Hours stall ave Internal Choice. | $1 Marks [Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50 Marks Dept of Seience and Engineering, UVCE Paget BANGALORE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, UVCE, BENGALURU B.Tech, PROGRAMME IN COMPUTER SCIENCE AND ENGINEERING Course Code | WCIPC305 __ Category | Eouinering Science Coat Profesional Coe Cours ile [Scheme and | Cres Semester CSEASE ‘CIE Marks: 50 | SEE Marks 50 ‘Duration of SEE: 03 Hours Praruiites if any) NIL course opsecrives: “The course will enable the students to 1. Understand and apply basic set theory, Permutations, Combinations, pigeon hole principle and analyse the loge, 2: Solve the practical examples of sets, relations and functions, 3. Analyse the concept of Recurence Relations to solve Functions. 4. Recognize the patems that arise in graph problems and apply the knowledge for constrcting the wees snd spanning tres. 5. Understand the concepts of Oder Relations and Groups UNITE: FUNDAMENTAL 10 Hours Sets and Subsets, Operations on Sets, Counting: Permutations, Combinations, Pigeonhole Principle, Recurrence Relations. Logic: Propositions and Logical Operations, Conditional Statements, Methods of Proof, Mathematical Induction. UNIT II: RELATIONS AND DIGRAPHS 10 Hours Product Sets and Parttions, Relaions and Digraphs, Paths in Relations and Digraphs, Properties of Relations Equivalence Relations, Daa Strctures for Relations and Digraphs, Operations on Relations, Transitive Closure and Warshall's Algorithm. Functions: Functions, Functions for Computer Science, Growh of Functions Permutiton Functions, UNIT IIT: RECURRENCE RELATION 08 Hours Generating functions, function of sequences calculating coeticient of generating function, recurence relations, solving reeurence relation by substitution and generating functions, characteristics roots solution of homogeneous recurrence relation, UNIT IV: TOPICS IN GRAPH THEORY 10 Hours Graphs, Euler Paths and Cireits, Hamiltonian Paths and Circuits, Coloring Graphs, Trees. ‘Trees, Labeled Tres, Tree Searching, Undiected Trees, Minimal Spanning Tres, UNIT V: ORDER RELATIONS AND STRUCTURES 08 Hours Partially Ordered Sets, Extremal Elements of Patally Ordered Sets, Latics, Finite Boolean Algsbras, Functions on Boolean Algebras. Semigroups and Groups: Binary Operations Dept of Computer Science and Engineering, UVCE Page 17 evi Semigroups, rats ant Quotes of Semirouns, GOW Prodivets and Quotiens of Groups TEXT HOOKS: 1. Remand Kotnan, Robert Busby, Sharon C. Ross, Disrete Mathematical Stactres, & ation, 2015, 2 Joe L.” Mott, Abraham Kandel, Theodo ‘Computer Scientists and Mathematicians” imited, New Det, di, 2 Editon, 2010. Theodore P. Baker, "Discrete Mathematics for Prentice Hall of India Learning Private REFERENCES: 1. Ralph P, Grima, Discrete and Combinatorial Mathemsatis, Pearson Education, S® ction, 2017 2. ‘Richa Johnsonbaugh, Disrete Mathematics, Pearson, 8° eition, 2017 Scan-Paul Tremblay, R Manohar, Discrete Mathematical Structures with Applications +0 Computer Sens, McGraw Hill Education, 2017 4. CL Liv &D P Mohapatra, Elements of Disercte Mathematics: A Computer Oriented approach, Me Graw ill Ini, 4eition, 2012 5, Seymour Lipschitz, Mare Lara Lipson, Varsha H, Pat Schaum's Outlines, 2017 jscrete Mathematics, ‘© ROOKSS/ONLINE RESOURCES: 1 ntps/avrwsribdcom/documen/36972715 l/Diseree-Mathematical-Structures- \with- Applicaton to-Computer-Scienee-by-J-P-Tremblay-R-Manchar-pa ‘Stanford: pve stanford. eduflassls.. Berkeley: hnps:/peple ces. berkeley edu ‘UWash: hpsacms. washington edweont. -MiT: Mathematics for Computer Science Moocs LIT Diserete Mathematis Lectures: p/w youtube comiplayi? Inps:ewayam gov invcourses/public Ingps:lfwww class-centralcomveourse/nptel-diserete-mathemaics5217, Jntp:fapte ac inveoures 106106004) ‘nups:/fnptel a. ivcouses! 11107058 course outcomes: “he stents atthe nl of cou, wl beable to Cot: Vente cones of ofan egumen using proposonl an prt loi with Basics of the Set theory. eres ° (C02: Density a ave pbk sve problems sing Relations and Fonction. COB: Sole problems ining rcunene elaions nd geen fincons COs: Eapuin garb ven ute Science and Engineering, UVCE Page 18 OS: Demin Oe Retna SCHEME OF EXAM aon ‘Sees INATION, [rest (anytinceunay 20 mans” FORT | 35 va _ crs [TSC thee Un aontans [SHEE [25m | ap Maks [Teal ema ie ing To Unis) Ovi | 95 van an 5 Marks (Compabory MEQE oF Sar answer 99°) 15 ya 15 Maks estos for 15 Marks covering ene yobs. SEE 00 [2 & Q3 fiom Units which have 08 Hous ae] 17*2= | Toa: 100 Marks, compulsory. 34 Marks | Marks Qo Q8, OF oF QT and QB or OF fom Unis] 17°3 = hich have 10 Hous shal ave Intend Choice. | $1 Marks "Note: SEE shal be conducted for 100 Marks andthe Marks obtained is scaled down to $0 Marks. WCE ‘Dept of Computer Science and Engine BANGALORE UNIVERSITY. ia Er ey a INFN Course Cade | 1HCIPCIO6 Category [Engineering Science Courses: Professional Core Course ile | OBJECT ORIENTED PROGRAMMING ~ THEORY Scheme and No.of Howrs/Week Credits L T [P| 88_| Credits | Semester - IN CSE/SE rte pepe f 3 TE Wks | SEE Marks 50 | Tota Max. Mavs: 160 | Duration of EE: 03 Hous ries ayy NTL COURSE OBJECTIVES: ‘The course will enable the students to 1. Leam fusamental features of object oriented languages C++ and JAVA, 2 Apply object oriented programming concepts to solve problems 3. Introduce the principles of inheritance and polymorphism, 44 Introduce the implementation of packages and interfaces. 5. Introduce the concepts of exception handling, maltihr ing and applets in Java UNITE: INTRODUCTION TO C+ W0Hours Basic Concepts of object oriented programming, Benefits of OOP's and its application Procedure Oriented Programming W/S Object Oriested Programming (OOP). Introduction to (C+, Differences between C and C++, Classes and Objects, Inline functions, function ‘overloading, defelt arguments, friend function, static data members and member function, rays of objects, abject as function argument, return objects from funtion const member Function, pointer o object, namespace fundamentals UNIT Ii: CONSTRUCTOR, DESTRUCTOR AND INHERITANCE, 10 Hows Introduction to Constructor and Destructor, Types of constructors, Operator Overloading: Need ‘of operator overloading, overloading unary operators, overloading binary operators, binary operstor overloading using friend funetion, insteamvoutstream operator overloading Inheritance: Introduction, defining a derived classes, single inberitance, multilevel inheritance, ‘multiple inheritance, hierarchical inheritance, hybrid inheritance,” Virwal base classes, ‘Constructors in derived classes, Member classe: Nesting of clases. UNIT II: VIRTUAL FUNCTIONS AND POLYMORPHISM. O08 tours Virtual Functions and Polymorphism: Virtua function, Calling # Vital faxtion through & base class referene, inheting Virtual attribute and Virtual fanetions, Pare wrtualfanetions, Early vs lt binding. C++ VO Stream Basies: Cr streams stream cases, Formatted 10 ‘Templates reduction o funtion templates function templates With mule parameters UNIT IV: JAVA FUNDAMENTALS pote Overview of Java, Datatypes, operators, Programming conse, Simple Java prograns, Introducing Classes, Objects, and Methods, Method overloading an! Meod overnting oT om Dept of Computer Science and Engineering. UVCE Inheritance, Packages handing, Exception type ested try statement, sub classes, ‘ Imeres Exception Handing. Fundamentals of xezpton , Uncaught exceptions, using try and catch, multiple catch clauses, IO, throws ad nly bitin exceptions, rein oN excepion UNIT V: MULT THREADED PROGRAMMING AND APPLETS (8 Hours Thatiincodes Programming: Muliteeaing Fundamentals The Thread Clas and Runnable meres, Creating a Thread, Lite eyele of Tread, resting Multiple Threads, Thread Prontiss Syrehtonzation methods, Thread Communication Using 6, wai, and notfYAMC), Suspending, Resuming, and Stopping Threads. Apps: Applet basics, Applet ‘less, Applet Architecture, Lif eye, comparion of Applet and application, mages in applet, TEXT BOOKS: 1. Balagurasamy, “Programming with C4", 7 Edition, MeCeaw Hill, 2017, 2 Herbert Schill, JAVA The Complete Reference, 9 Edition, MeGraw Hill, 2014 REFERENCE BOOKS: |. Mahesh Bhave and Sunil Patear, Programming with Ja Bducation,2008, 2. KR Venugopal, Rajkumar andT Ravishankar, “Mastering C44", 2" Beition, Tata McGraw Hil, 2013. 23. Rajfumar Duyya,S Thamaral sev, xingshon ch, Objet oriented Progamming with Java, Tata MeGraw Hil, 2009. 4 E Balagurusimy, Programmi Fist aiton, Person with Java primer, 4 Edition, MeGraw Hil, 2010, ‘© BOOKSS/ONLINE RESOURCES: 1. C+# Tutorial, haps: rtralpointcomsplusps. 2. Free C+ Programming Book, htps:/books goalkicker convPlusPlusEooW. 3. C++ Programming ~Computer Notes tp//ecomputemotes comiepp. 4. Java Lectures, hups/vonw cae ith. -nlpsifjavatect_oogust2008 mt, Moocs: 1. Ci Programming, pss. progam com/sp programming 2 Ces Programming, ps:foninecousespll2c.n/ocl6 es? 3. Programing in JAVA, hpsonigcourses tel infoet9_es07 41 va Course, tps curser orpeorses?query=java course ourcomes: ‘The students ot the end ofthe cours, will beable to COL: Understand the fundamentals of C+ ad Java. C02: Explore the knowledge ofthe object-oriented concep, C03: Develop computer programs to solve real world problems in C+ and Java CO4:_ Develop simple GUI interfaces fora comput Program to interact with uses. andling principles wsing Applets. (605: tpl even sed GUI SCHEME OF EXAMINATION: cat ~~] Quie T= — «(any Te Units) ~ 20 Marks ae cue so [ny Pi me Maks Rai TWO THT 2O—(QHTT as, | Mats Marks “Qi (Compliory: MCQS or Shor answer type | cme ts Masoveing nic syabus | 1) Mit | questions for 5 Maks covering ete syfabns. _} —____| SEE—100 [Q2 & OB fom Unis which have OB Hours are [17 *2= | Tost: 10) Marks | compulsory. sen | om] ‘Ot oF QS, Q6 or QT and QB or QP from Units | 17* ‘which have 10 Hours shall have Intermal Choice, | SI Marks Note: SEE shall be conducted for 100 Marks and the Marks obtained is scaled down to 50 Marks. Dept of Computer Se pt of Computer Science and Enginecing, UVCE =a Bane DEPARIIET oFconruTN noes ARE GNC, BENGALING ee IME I ENGINEERING [Course Code nsCincagy COMPUTER SCIENCE AND ENGINES Cat | Engineesin ma Fame hie —f patiestng See Professional Core Course ile [DIGITAL SYSTEM DESIGN LABORATORY | ’cheme anc }___Noof Hours/Week ——_—|H Credits LOTT TP [SS] Credis | Semeste- Il CSBISE oo aos _| CIE Marks: 50_[_SEE Marks: 50_[ Total Max. Marks: 100_| Darton of SEE: 03 Hours [Prerequisites Gif ny) NI COURSE OBECTIVES: ‘The course will enable the siden to 1. Acquire knowledge to design, analyze, and implement circuits wih digital lope basic ‘atesuniversal gates, Design and analyze combinational logic circuits Design and analyze sequential logic circuits. Design counter using sift register and realize the operations of shit registers. Understand various Nip Nop and represen ip flop operation using state transition

You might also like