Scheme of examination
Yüklə 1,11 Mb.
|
[ T1,T2][No. of hrs. 12] UNIT- III Principle of mathematical induction, principle of complete induction, solution methods for linear and non-linear first-order recurrence relations with constant coefficients, Graph Theory: Terminology, isomorphic graphs, Euler’s formula (proof) ,chromatic number of a graph, five color theorem(with proof), Euler &Hamiltonian paths. [ T1,T2][No of hrs 11] UNIT-IV Groups, Symmetry, subgroups, normal subgroups, cyclic group, permutation group and cayles’s theorem(without proof), cosets lagrange’s theorem(with proof) homomorphism, isomorphism, automorphism, rings, Boolean function, Boolean expression, representation & minimization of Boolean function. [ T1,T2][No of hrs 11] Text Books: [T1] Norman L. Biggs, “Discrete Mathematics”, Oxford, second edition. [T2] Keneth H. Rosen, “Discrete Mathematics and Its Applications”, TMH, seventh edition.
[R1] Kolman, Busby & Ross, “Discrete Mathematical Structures”, PHI, 1996. [R2] C.L. Liu, “Elements of Discrete Mathematics”, TMH, 2000. [R3] J. P. Trembly& P. Manohar, “Discrete Mathematical Structures with Applications to Computer Science”, McGraw Hill, 1997.
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks.
[T1] Zyi Kohavi, “Switching & Finite Automata Theory”, TMH, 2nd Edition [T2] Morris Mano, Digital Logic and Computer Design”, Pearson [T3] R.P. Jain, “Modern Digital Electronics”, TMH, 2nd Ed, Reference Books: [R1] A Anand Kumar, “Fundamentals of Digital Logic Circuits”, PHI [R2] Taub ,Helbert and Schilling, “Digital Integrated Electronics”, TMH
Introduction to signals, their classification and properties, different types of systems, LTI systems and their properties, periodic waveforms and signal synthesis, properties and applications of Laplace transform of complex waveform. [T1,T2][No. of Hours: 10] UNIT-II System modeling in terms of differential equations and transient response of R, L, C, series and parallel circuits for impulse, step, ramp, sinusoidal and exponential signals by classical method and using Laplace transform. [T1,T2][No. of Hours: 12] UNIT-III Graph theory: concept of tree, tie set matrix, cut set matrix and application to solve electric networks. Two port networks – Introduction of two port parameters and their interconversion, interconnection of two 2-port networks, open circuit and short circuit impedances and ABCD constants, relation between image impedances and short circuit and open circuit impedances. Network functions, their properties and concept of transform impedance, Hurwitz polynomial.
Positive real function and synthesis of LC, RC, RL Networks in Foster’s I and II, Cauer’s I& II forms, Introduction of passive filter and their classification, frequency response, characteristic impedance of low pass, high pass, Band Pass and Band reject prototype section. [T1,T2][No. of Hours: 10] Text Books: [T1] W H Hayt “Engineering Circuit Analysis” TMH Eighth Edition [T2] D. R. Choudhary, “Networks and Systems” New Age International, 1999.
[R1] S Salivahanan “Circuit Theory ” Vikas Publishing House 1st Edition 2014 [R2] Valkenburg, “ Network analysis” PHI, 2000. [R3] Bhise, Chadda, Kulshreshtha, “ Engineering network analysis and filter design” Umesh publication, 2000. [R4] Kuo, “Network analysis and synthesis” John Weily and Sons, 2nd Edition. [R5] Allan H Robbins, W.C.Miller “Circuit Analysis theory and Practice”Cengage Learning Pub 5th Edition 2013 [R6] Bell “Electric Circuit” Oxford Publications 7th Edition
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, the student may be asked to attempt only 1 question from each unit. Each question should be 12.5 marks. Objective: To understand the programming and the various techniques for enhancing the programming skills for solving and getting efficient results.
UNIT – 1: Introduction to programming methodologies and design of algorithms. Abstract Data Type, array, array organization, sparse array. Stacks and Stack ADT, Stack Manipulation, Prefix, infix and postfix expressions, their interconversion and expression evaluation. Queues and Queue ADT, Queue manipulation. General Lists and List ADT, List manipulations, Single, double and circular lists. [ T1,T2][No. of hrs. 12] UNIT – II: Trees, Properties of Trees, Binary trees, Binary Tree traversal, Tree manipulation algorithms, Expression trees and their usage, binary search trees, AVL Trees, Heaps and their implementation. [T1,T2][No. of hrs. 12] UNIT – III: Multiway trees, B-Trees, 2-3 trees, 2-3-4 trees, B* and B+ Trees. Graphs, Graph representation, Graph traversal. [T1,T2][No. of hrs. 12] UNIT – IV: Sorting concept, order, stability, Selection sorts (straight, heap), insertion sort (Straight Insertion, Shell sort), Exchange Sort (Bubble, quicksort), Merge sort (only 2-way merge sort). Searching – List search, sequential search, binary search, hashing concepts, hashing methods (Direct, subtraction, modulo-division, midsquare, folding, pseudorandom hashing), collision resolution (by open addressing: linear probe, quadratic probe, pseudorandom collision resolution, linked list collision resolution), Bucket hashing. [T1,T2][No. of hrs. 12] Text Books: [T1] R. F. Gilberg, and B. A. Forouzan, “Data structures: A Pseudocode approach with C”, Thomson Learning. [T2] A .V. Aho, J . E . Hopcroft, J . D . Ulman “Data Structures and Algorithm”, Pearson Education.
[R1] S. Sahni and E. Horowitz, “Data Structures”, Galgotia Publications. [R2] Tanenbaum: “Data Structures using C”, Pearson/PHI. [R3] T .H . Cormen, C . E . Leiserson, R .L . Rivest “Introduction to Algorithms”, PHI/Pearson. [R4] A.K.Sharma, “Data Structures”, Pearson [R5] Ellis Horowitz and Sartaz Sahani “Fundamentals of Computer Algorithms”, Computer Science Press. COMPUTER GRAPHICS & MULTIMEDIA Paper Code: ETCS-211 L T/P C Paper: Computer Graphics & Multimedia 3 1 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, the student may be asked to attempt only 1 question from each unit. Each question should be 12.5 marks.
Objective: To understand various aspects of media and to learn the concept of sound, images and videos. UNIT- I Introduction, Applications areas, Components of Interactive Computer Graphics System. Overview of Input devices, Output devices, raster scan CRT displays, random scan CRT displays. DDA and Bresenham’s Line Drawing Algorithms, Bresenham’s and Mid Point Circle Drawing Algorithms. Homogeneous Coordinate System for 2D and 3D, Various 2D, 3D Transformations (Translation, Scaling, Rotation, Shear). [T1,T2][No. of hrs. 12] UNIT- II Clipping Algorithms, Sutherland-Cohen line Clipping Algorithm Bezier Curves, B-Spline Curves. Parallel Projection, Perspective Projection, Illumination Model for diffused Reflection, Ambient light, Specular Reflection Model, Reflection Vector. [T1,T2][No. of hrs. 11] UNIT- III Shading Models, Flat shading, Gourard Shading, Phong Model. Visible surface detection, Back Face Detection, Depth Buffer (Z-Buffer, A-Buffer) Method. Overview of multimedia: Classification, basic concepts of sound/audio MIDI: devices, messages, software. , Authoring tools, Video and Animation: controlling animation, display and transmission of animation [T1,T2][No of hrs 10] UNIT- IV Data Compression: storage space, coding requirements, Basic compression techniques: run length code, Huffman code, Lempel-Ziv JPEG: Image preparation, Lossy sequential DCT, expanded lossy DCT, Lossless mode, Hierarchical mode. MPEG, Media synchronization, Media Integration, Production Standards. [T1,T2][No of hrs 11] Text Books: [T1] Donald Hearn and M.Pauline Baker, “Computer Graphics C version”, Second Edition, Pearson Education. [T2] Ralf Steinmetz & Klara Nahrstedt, “Multimedia Computing Communication & Applications”, Pearson Education.
[R1] C, Foley, VanDam, Feiner and Hughes, “Computer Graphics Principles & practice”, 2nd Edition [R2] R. Plastock and G. Kalley, Schaum’s Series, “Theory and Problems of Computer Graphics”, McGraw Hill, 2nd edition. [R3] Fred Halsall, “Multimedia Communications Applications, Networks, Protocols & Standards”, Pearson Education. [R4] David F. Rogers, “Procedural elements for computer graphics”, McGraw- Hill. SWITCHING THEORY AND LOGIC DESIGN LAB Paper Code: ETEC-253 L T/P C Paper: Switching Theory and Logic Design Lab 0 2 1 List of Experiments:
NOTE: - At least 8 Experiments out of the list must be done in the semester CIRCUITS AND SYSTEMS LAB Paper Code: ETEE-257 L T C Paper: Circuits and Systems Lab 0 2 1 List of Experiments
NOTE:- At least 8 Experiments out of the list must be done in the semester. DATA STRUCTURES LAB Paper Code: ETCS-255 L T/P C Paper: Data Structures Lab 0 2 1 List of Experiments :
Description of programs:
Description of program:
4. Create doubly linked list with nodes having information about an employee and perform Insertion at front of doubly linked list and perform deletion at end of that doubly linked list. 5. Create circular linked list having information about an college and perform Insertion at front perform Deletion at end. 6. Create a stack and perform Pop, Push, Traverse operations on the stack using Linear Linked list. 7. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and Display the queue elements. 8. Create a Binary Tree (Display using Graphics) perform Tree traversals (Preorder, Postorder, Inorder) using the concept of recursion. 9. Implement insertion, deletion and display (inorder, preorder and postorder) on binary search tree with the information in the tree about the details of a automobile (type, company, year of make). 10. To implement Insertion sort, Merge sort, Quick sort, Bubble sort, Bucket sort, Radix sort, Shell sort, Selection sort, Heap sort and Exchange sort using array as a data structure.
NOTE:- At least 8 Experiments out of the list must be done in the semester. APPLIED MATHEMATICS-IV Paper Code: ETMA-202 L T/P C Paper: Applied Mathematics-IV 3 1 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks
Partial Differential Equation: linear partial differential equations with constant coefficient, homogeneous and non homogeneous linear equations. Method of separation of variables. Laplace equation, wave equation and heat flow equation in Cartesian coordinates only with initial and boundary value. [T1][No. of Hrs. 11] UNIT II Probability Theory: Definition, addition law of probability, multiplication law of probability, conditional probability, Baye’s theorem, Random variable: discrete probability distribution, continuous probability distribution, expectation, moments, moment generating function, skewness, kurtosis, binomial distribution, Poisson distribution, normal distribution. [T1,T2][No. of Hrs. 12] UNIT-III Curve Fitting: Principle of least square Method of least square and curve fitting for linear and parabolic curve, Correlation Coefficient, Rank correlation, line of regressions and properties of regression coefficients. Sampling distribution: Testing of hypothesis, level of significance, sampling distribution of mean and variance, Chi-square distribution, Student’s T- distribution, F- distribution, Fisher’s Z- distribution. [T1,T2][No. of Hrs. 12] UNIT IV Linear Programming: Introduction, formulation of problem, Graphical method, Canonical and Standard form of LPP, Simplex method, Duality concept, Dual simplex method, Transportation and Assignment problem. [T1][No. of Hrs. 10] Text Books: [T1] B. S. Grewal,”Higher Engineering Mathematics” Khanna Publications. [T2]. N.M. Kapoor, “Fundamentals of Mathematical Statistics”, Pitambar Publications
[R1] E. kresyzig,” Advance Engineering Mathematics”, Wiley publications [R2] Miller and Freund, “ Probability and statistics for Engineers” , PHI [R3] Gupta and Kapoor, “ Fundamentals of Mathematical Statistics” Sultan Chand and Sons [R4] G. Hadley, “Linear Programming”, Narosa. [R5] Schaum’s Outline on Probability and Statistics” Tata McGraw-Hill [R6] Gupta and Manmohan, “ Problems in Operations Research”, Sultan Chand and Sons. [R7] R.K. Jain and S.R.K. Iyengar,”Advanced Engineering Mathematics “Narosa Publications. COMPUTER ORGANIZATION & ARCHITECTURE Yüklə 1,11 Mb. Dostları ilə paylaş:
|