i is ~ S.E( Se. a S.E. (COMPUTER SCIENCE ws ENGG.) PART -1 Paper : 100 Marks “Term Work : 25 Marks , SECTION - 1) Ordinary Differential Equations of First Order & first Degree: Method of solution; oe ne Non: Non: ( mart amos cele, A 2) 2 thera Ete Cooctinnst anes oats ko method of variation ft seman tnoneheo noe orl as 3) Partial Differential Equation : Fixeocait ian Liaaal differential equations of first order. (4) 4) Applications of First Order & First Degree differential — ‘equations & Linear Differential Equation with constant < Simoes 0 ciate ifeasies&: spe Electical4 Syllabus ~ S.£,(Computer Se. & Engg.) formulation, Method for obtaining intial basic feasible solution Noth west comer method, Low cost entry method, Vogel approximation method. Method to obtain Optimal solution. Nature of Question Paper : lee 1) Duration of paper shal be 8 hours ca urs earyng a 100 marks 2) Tate sal be wo sections each containing 4 questions cach. 3) Total si questions will have to be attempted ie. any tae pted ie, any three from each 4) Each question shall cary 16 of 17 marks. 5) Use of a non-programmable calculator is alowed, Text Book : SIMs nee) Reference Books : 1) Atextbook of appied Mathematics Vol. by J. N. Wartar, 2 ape engnening ratarats by 8.8 Creal : vanced Engneeting Mathematics by Jaggi and mathur, 4) Operaton Research yO. Shama, . 5) Operation Research by Kant Swaroop,P.K. Gupta 2000000000004 2. DISCRETE MATHEMATICAL STRUCTURES Lectures: 4 Hrs. / week Tutorials : 2 Hrs./week aareotaderah Term work 25 Mer SECTION - 1 ae 1) Mathematical logic : Introduction, statements and notation, Connectives - negation, conjunction, disjunction, conditional, bi-conditiona, statement formulas and tut tables, well formed formulas, Tautologies, Equivalence ot formulas, Duality law, Syllabus - $..( Computer Sc. & Engg.) 5 Tautological implicatiéns, functionally complete sets of connectives, other connectives, normal & principle normal forms; Completely parenthesised infix & polish notations ‘Theory of inference for statement calculus. co) 2) Set theory : Basic concepts of set theory, types of operations (on sets, Ordered pairs, Cartesian product, Representation of discrete structures, Relations, Properties of binary relations Matrix and greph representation, Partition and covering of set, Equivalence relation, composition, POSET and Hasso diagram, Functions- types, Composition of functions. inverse functions, Natural numbers, (10) 43) Algebraic systems, semi-groups and monoids, properties & examples @) SECTION - 4) Polish expressions & their compilation, group & group codes. 6) 5) Lattices and Boolean algebra : Lattice as POSETs, definition, examples & properties, Lattice as algebraic systems, Special latices, Boolean algebra definition and examples, Boolean functions, representations & minimization of Boolean functions. ®@ 6) Graph theory : Basic concepts, Storage representation & ‘manipulation of graphs, Fault detection in combinational switching circuits, PERT & related techniques @ Term work : In tutorial sessions, students of diferent batches be assigned. 41) Diflerent exercise problems & be guided for the problem solution 2) To write programs in’c’ on any 4 to § folowing related topics. 4) Generating truth table of a statement formula, 'b) Application of bt representation of sets and operations on sets ot relations. eo8 Syllabus ~ S.€.(Computer Sc. & Engg.) ©) Conversion of polish expressions. 4) Obiaining the path matix, path of cfferent lengths 6) Different tree traversal methods 4) Evaluating polynomial expressions using inked lists 9) Allocation graphs and deadlock detection ) PERT related techniques, Text Book : CROSS Cee Reference books : 1) Discrete mathematical structures with applications to computer scence J.P Tremblay R Manohar (MGH Imag) 2) Discrete mathematics ~ Liu (MGH) oh? 3) Foundations of ciscrete mathematics -K.D. Joshi 4) Theory and problems in abstract zlgebra - Schaum's seres (MGH) 700000000000 Le eDATA STRUCTURES Lectures : 3 hrsiweek Tutorial: 2 hre/week ‘sell ie d Term Work: 50 Marke SECTION - 1 1) Stacks, Queues, Circular queues : Defiton, representation briorty queues, operations and thelr applications ( 2) Searching and sorting Techniques : Linear search, Binary search, Bubble Sor, Insertion sort, Merge Sort, Quick Sort Selection Sot, Radix Sort, Heap Sort 6) 3) Lists: Denton, representations operations & applications of Singly linked ist, Doubly inked is, Circular inked ist. (6) SECTION ~ II ; 4) Hashing : Defintion, Hash Functions, Overtow, Colision Open Hashing, Close Hashing, Rehashing Techniques. (5) syllabus ~ S.£.( Computer Se. & Engg.) Zz 5) Trees : Basic Terminology, Binary trée, Traversal, methods, Binary Search Tree, B Tree, B + Tree, Heaps ~ Operations & their applications. 6) 6) Graphs: Basic concept of graph theory, storage representation & manipulation of graphs. 4) Tutorials = Students of different batches are assigned the work to develop programs for implementing the data structures & the same be ‘executed during practical sessions of Programming Lab- | Text Book : Data structures - Agarwal Prakashan Reference Books 1) Dala structure using © A M. Tanenbaum, Y. Langeam, 2) Theory & Problems of Data Stuctures - LinschutzMGH) 3} Data structures and Algorims -Aed V. Ano, 44) Data structures and program design ~ Robert L. Kru 2000000000 4. SWITCHING THEORY & LOGIC Pye Theory : 100 marks Term work : 25 Marks Lectures : 3 Hrs./week Tutorial: 1 Hrs./week SECTION -1 4) Fundamentals concepts : Introsuation, digital signals, Basic digital circuits, NAND & NOR operation, EX-OR operation, Boolean algebra, Practical examples of IC gates, Number systems & their conversions-Binary, Octal, Hex, signed numbers, Basic characteristics of TTL & CMOS logic families. 2) Flip ~ Flops & Semiconductor Memories : S-R, J-K & O Flip