Department of CSE, DUET, Dibrugarh University: CHAPTER 2 DETAILED 4-YEAR CURRICULUM CONTENTS. Undergraduate Degree in Engineering & Technology Branch/Course: COMPUTER SCIENCE AND ENGINEERING THIRD SEMESTER (Credits: 25)Dibrugarh University Department of SE, DUIET, [autor [__3eredits I isc. | Mathematies-It PDE, Complex Variables and Transform Calculus Module 1: Partial Differential Equations (10 hours) ji Solution to homogenows and non-homogenous linear partial differential equations second and higher order by complimentary function and particular integral method. Flows, vibrations and diffusions, second-order linear ‘equations and their classification, Initial and boundary conditions (with an informal description of well-posed problems), D'Alember'’s solution of the wave equation; Duhamel's principle for one dimensional wave ‘equation. Separation of variables method to simple problems in Cartesian coordinates. The Laplacian in plane, cylindrical and spherical polar coordinates, Solutions with Bessel functions and Legendre functions. One dimensional diffusion equation and its solution by separation of variables. Boundary-value problems: Solution of boundary-value problems for various linear PDEs in various geometries. Module 2: Complex Analysis (16 hours) 7 i Differentiatioh, Cauet¥-Riemann equations, analytic’ functions, harmortic functions, finding harmonic conjugate; elementary anaiytic functions (exponential, trigonometric, logarithm) and their properties; Conformal mappings, Mobius transformations and their properties. Contour integrals, Cauchy-Goursat theorem (without proof), Cauchy Integral formula (without proof), Liouville’s theorem and Maximum-Modulus theorem (without proof); Taylor's series, zeros of analytic functions, Singularities, Laurent's series; Residues, CauchyResidue theorem (without proof), Evaluation of definite integral involving sine and cosine, Evaluation of certain improper integrals using the Bromwich contour. Evaluation of definite integral involving sine and cosine, Evaluation of certain improper integrals using the Bromwich contour Module 3: Transform Calculus (10 hours)) Polynomials ~ Orthogonal Polynomials — Lagrange’s, Chebysev Polynomials; Trigonometric Polynomials; Laplace Transform, Properties of Laplace Transform, Laplace transform of periodic functions. Finding inverse Laplace transform by different methods, convolution theorem, Evaluation of integrals by Laplace transform, solving ODEs and PDEs by Laplace Transform method. Fourier transforms, Fourier Integrals. Fourier integral theorem (without proof). Fourier Transform and inverse transform. Fourier Sine & Cosine Transform, inverse transform. Z-transform and Wavelet transforms: properties, methods, inverses and their applications. Text Books * B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36"Edition, 2010. + H.K. Dass, Advanced Engineering Mathematics, S Chand and Company Pvt, Ltd, Reprint 2014. + M.D. Raisinghania, Advanced Differential equations, S Chand and Company Pvt. Ltd Reference Books * Erwin Kreyszig, Advanced Engineering Mathematics, 9" Edition, John Wiley & Sons,2006. * W.E, Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value Problems, 9° Edition, Wiley India, 2009, + S.L. Ross, Differential Equations, 3" Edition, Wiley India, 1984. +E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Halllndia, 1995, . NP. Bal and Manish Goyal, A text book of Engineering Mathematics, 9 Editions Laxmi Publications, * GB. Thomas and R.L. Finney, Calculus and Analytic geometry, 9thEdition, Pearson, Reprint, 2002 + Envin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006,Department of (, DUNE, Dibrugarh 207: OP Leredits Module 1: Introduction. Writing, compiling, and debugging C programs, Hello world. Variables and datatype flow. Funetions and modular programming. Variable scope. Static and global variables, lyput aid output Module 2: Pointers and memory addressing. Arrays and pointer arithmetic. Swrinps. 5) algorithms. User-defined datatypes, structs, unions, bifields. Memory allocation. Linked list, b pointers, pointer and string arrays, multidimensional arrays. Stacks and queues. “Module 3: Void and function pointers. Hash tables, External libraries. B-trees, priority quew ctype, stdib.h, assert, stdarg.h, timesh , Dynamic memory allocation, malloc and valgrind, garbaye collection Module 4: Muktithreading and concurrency. Multithreaded programming. Sockets and a process communication ranous VO. Linwe int Reference: Kernighan, Brian, and Dennis Ritchi Hall, 1988. ISBN: 9780131103627. . The C Programming Language. 2nd ed. Upper Saulle River, NJ: Prentice {LcSE-311__ [Programming Language Laboratory [0L:0T: 4P 2 credits ] Assignment for Practical Programming in C Laboratory: Assignment 1: Writing, compiling, and debugging programs; preprocessor macros: C file structure, variables, for and problem statements; returning from funetions As iment 2: Types, operators, expressions iment 3: Control flow, functions, variable scope, static and global variables, I/O: printf and scanf, fle LO, character arrays, error handling, labels and goto Assignment 4: Pointers, arays, strings, searching and sorting algorithms Assignment 5: Linked lists trees Assignment 6: Pointers to pointers, multidimensional arrays, stacks and queues Assignment 7: Function pointers, hash table Assignment 8: Using and creating libraries, B-trees and priority queues “This course introduces the C programming language, the workhorse ofthe UNIX operating system and lings franca of embedded processors and micro-controlles, After learning this course student should beable to COL: Apply basie syria and grammar of Cin general problem and expose stents to practical programmin, techniques lard library: stoee = Department of EE, DUET, DibeBa yg, and synchronization othe real ap CO2 Apply advanced concepts, suchas dhnamic memaryallocation, concurrency, and sy S (C03; Use UNLY signals and process control, and other libraries for developmen and use in practical situation CSE302 [Data Structure & Algorithms [SLT sop Seredits Pre-requisites | SC 201 Objectives of the course: 1. Toimpart the ban 2. To understand e 3. To understand b: 4. To enable them i concepts of data structures and algorithms. ‘oncepts about searching and sorting techniques asic concepts about stacks, queues, lists, trees and graphs ‘o write algorithms for solving problems withthe help of fundamental data Detailed contents: Module 1: {ntroduction: Basie Terminologies: aye anaty Data Organizations, Data Structure Operations imation. deletion, traversal ete.; Analysis of ae Algorithm, Asymptotic Notations, Time-Space ‘radeofl Searching: Linear Search and Binary Soap ‘Techniques and their complexity analysis Module 2: tack and its operations: Algorithms and their complexity analysis, ks: Expression Conversi n — corresponding algorithms and complexity analysis. ADT queue, Types of Quece: imple Queue, Circular Queue, (Queue; Operations on each types of Queues: Algerie and their analysis Module 3: » Priority Linked Lists: Singly linked lists: Representation in memory, Algorithms of several operations: Traversing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack ‘and Queue, Header nodes, Doubly linked li ‘erations on it and algorithmic analysis: Circular Linked Lists: all operations their algorithms and. the complexity analysis, Trees: Basic Tree Terminologies, Binary Search Tree, AVL Tree; Tr complexity analysis. Applications analysis, Different types of Trees: Binary Tree, Threaded Binary Tree, fee operations on each of the trees and their algorithms with of Binary Trees, B Tree, B+ Tree: definitions. algorithms ant Module Sorting and Hashing: Objective and properties of differen Sort, Bubble Sort, Insertion Sort, Quick Sort, Comparison among all the methods, Hashing, it sorting algorithms: Merge Sort, Heap Sort; Pert Graph: Basic Terminologie 's and Representations, Graph search ity analysis, and traversal algorithms and Suggested books:Department of CSE DAFT. ibrar Unversity 1, “Fundamentals of Data Structires®,y res", Mustrated Fdition by row’ Saal GoMsr Seach Hustrated Faition hy Ellis Horowitz, Sata} Suggested reference books: 1. Algorithms, Data Structures, and Problem Solving with C++ Mark Allon Weiss, Addison-Wesley Patton oe ee Mlustrated Edition by 2. “How to Solve it by Compute lishing Company ", 2nd Impression by R.G. Drome! carson Education Course outcomes |. Fora given algorithm student will able to analyze the algorithms to determine the tim and computation complexity and justify the correctness. 2, For a given Search problem (Linear Search and Binary Search) student will able to implement it. 3. For a given problem of Stacks, Queues and linked list student will able to implement it and analyze the same to determine the time and computation complexity 4. Student will able to write an algorithm Selection Sort, Bubble Sort. Insertion Sort. Quick Sort, Merge Sort, Heap Sort and compare their performance in term of Space and T complexity. 5, Student will able to implement Graph search and traversal algorithms and determine the time and computation complexity. CSE312 [Data Structure & Algorithms OL:0T: 4P | 2 credits Laboratory As per Data Structure & Algorithm, (CSE 302) syllabus. . \Ersean | Digital Electronics ‘SL:0T:0P: Seredits | Course Outeomes: At the end of this course, students will demonstrate the ability to + Understand working of logic families and logicgates. Design and implement Combinational and Sequential logic circuits Understand the process of Analog to Digital conversion and Digital te Analog conversion Be able to use PLDs to implement the given logical problem. Module 1:Fundamentals of Digital Systems and logicfamilies (7Hours) Digital signals, digital circuits, AND, OR, NOT, NAND, NOR and Exclusive-OR operations, Bolsa algebra, examples oflCgates, number systems-binary, signed binary. octal hexadecimal number, arithmetic, one’s and two's complements arithmetic, codes, error detecting and correct characteristics of digital ICs, digital logic families, TTL, Schottky TTL and CMOS and TTL, Tri-state logic. Module 2: Combinational Digital Cireuits (7Hours) Standard representation for logic functions, K-map representatioy using Kemap, minimization of logical functions. Don't care cond Multiplexer/Decoders, Adders, Subtractors, BCD arithmetic, carry look al ALU, elementary ALU design, popular MSI chips, digital comparator.parity ches converters, priority encoders, devoders/drivers for display devices,Q-ML metho ofDibrugarh Department of CE, DUIET, {reuits and systems (7Hours) , cuit properties of Bistable latch, the clocked SR lip flop. J p gisters,applicationsofshifire {ypesfliplops.applicationsoMMipflops.shifiregisters, app! c aircein eee cover pra teria conver ing counter, sequence geertrsiple pee ee synchronous counters, counters design using flip flops,specialcounter IC's, asynchro: counters, applications ofeounters, Module 4: A/D and D/A Converters (7Hours) Digital to analog converters: weighted resistor/converter, R-2R Ladder D/Aconver for D/A converters, examples of D/A converter ICs, sample and hold circuit. analog to disital somverters: quantization and encoding, parallel comparator A/Deonverter successive approximatio A/D converter, counting A/D converter, dual slope A/Deonverter.4, Dex ollagetofiequencyandvoltagetotimeconversion.specificationsofA/Deonvertrs, sczonple converter ICs. Module 5: Semiconductor memories and Programmable logic devi es. (Hours) Memory organization and operation, expanding memory size. clasificeten ara sddreceabie guettial memory, read only memory (ROM), read and write mena sraressable memory (CAM), charge de coupled device memory (CCD, fips ROM as a PLD, Programmable logie aray, Programmable assay log logic devices (CPLDS), Field Programmable Gate Array(FPGAy, TextiReferences: 1. R-P. Jain, "Modern Digital Electronics", McGraw Hill Education,2009, 2. M.M, Mano, "Digital logic and Computer design”, Pearson Education India.2016 5. A. Kumar, "Fundamentals of Digital Circuits", Prentice Hall India. 2016 ESC 312: Digital Electronics Laboratory (0:0:4 ~ 2 eredit) Hands-on experiments related to the course contents of ESC 302. ESC31 [Digital Electronics Laboratory OL:OT:4P | 2eredits As per Digital Electronics, (ESC 301) syllabus. CSE313___| Sofware tools I :6P_ | Seredits Course Content: prizoduetion to Sei Lab: Install Scilab, Mailing list, Complementary resources, Become familiar with Seilab: The general environment and the console $ imple numerical calculations, the Peal ba, the editor, the graphics window, Windows management and workspace casemate Programming: Variables, assignment and display, Loops, Tests, Useful Seilah functions: In analysis , In probability and statistics , To di play and plot, Utilities ntraduetion to Listex: Creating first document, Document structure (s Math, Adding pictures, Table of contents, Bibliography. Footnotes, Tables, ons and paragraphs),Packages, Text Books: 1. Intsoduction to Seilab: For 2. LaTeX and Friends by van incers and Scientists by Sandcep Nagar. jongen, MareDepartmentof CSE, DUIET, Dibrugarh University [eso (Computer ie & Architecture Organization] 3L:0T:0P [3 Credits Objectives of the course: “To expose the students to the following: 1, How Computer Systems work & the basic principles 7 Instruction Level Architecture and Instruction Execution 3. The current state of art in memory system design 4, How 1/0 devices are accessed and its principles. 5. To provide the knowledge on Instruction Level Parallelism 6. To impart the knowledge on microprogramming 7. Concepts of advanced pipelining techniques, Detailed contents: Module 1 . Functional blocks of a computer: CPU, memory, input-output subsystems, control unit Instruction set architecture of a CPU-registers, instruction execution eycle, RTL interpretation of instructions, addressing modes, instruction set. Case study — instruction sets of some common CPUs. Data representation: signed number representation, fixed and floating point representations, character representation. Computer arithmetic ~ integer addition and subtraction, ripple carry adder, cary look-ahead adder, ete. multiplication ~ shiftand add, Booth multiplier. carry save ‘multiplier et. Division restoring and non-restoring techniques, floating point arithmetic, Module Introduction to x86 architecture, CPU control unit design: hardwired and micro-programmed design approaches, Case study ~ design ofa simple hypothetical CPU. Memory system design: semiconductor memory technologies, memory organization, Peripheral devices and their characteristics: input-output subsystems, VO device interface, VO transfers-program controlled, interrupt driven and DMA, privileged and non privileged instructions, software interrupts and exceptions Programs and processes-role of interrupts in process state transitions, /O device interfaces ~SCI, USB Module 3: Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazans Parallel Processors: Introduction to parallel processors, Concurrent acces ceache coherency. to momor and Module 4: : Memory organization: Memory interleaving, con 1 memory organization, cache memory, cache size vs. block size, mapping fictions, replacement algorithms, write policies.Department of CSF, DUIET, Dibrugarh University Suggested boo! 1. “Computer Organization and Design: The Hardware/Software Interface”, Sth Edition by David A. Patterson and John L. Hennessy, Elsevier. 2. “Computer Organization and Embedded Systems”, 6th Edition by Carl Hamacher, McGraw Hill Higher Education, Suggested reference books: 1 “Computer Architecture and Organization”, 3rd Edition by John P. Hayes, WCB/McGraw-Hill 2. “Computer Organization and Architecture: Designing for Performance”, 10th Edition by William Stallings, Pearson Educati 3. “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring and Harry F. Jordan, Pearson Education, Course outcomes I. Draw the functional block diagram of a single bus architecture of a computer and describe the function of the instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. Write assembly language program for specified microprocessor for computing 16 bit multiplication, division and /O device interface (ADC, Control circuit, serial port communication). Write a flowchart for Concurrent access to memory and cache coherency in Parallel Processors and describe the process. Given a CPU organization and instruction, design a memory module and analyze its operation by interfacing with the CPU. Given a CPU organization, assess its performance, and apply design techniques to enhance performance using pipelining, parallelism and RISC methodology CSE-314 ‘Computer Organization |OL:0T:4P _]2 Credits &Architecture Laboratory ‘As per Computer Organization & Architecture, (CSE 304) syllabus, A a)