Syllabus of B.Tech Programme in Computer Science and Engineering (North Campus) For Batch 2016 and onwards University of Kashmir a Srinagar | crCOURSE LAYOUT3rd Semester [Teaching Periods Course No Subject per week | Credits L[T]P MTH-3117 | Discrete Mathematics 3[ifo] a4 CSE-3217 | Object Oriented Programming inc++| 3 | 0 | 0 | 3 CSE-3317_| Data Structures using C 2 |e Oss |e ECE-3417 | Network Analysis & Synthesis 3[i1fo] a4 ECE-3517 | Signals and Systems aa (inn row (aera cse-szin, | eet Oriented Programmingin HT 4 | 5 | ] 9 CSE-3317L | Data Structures using C Lab ofo 2 ECE-3417L | Network Analysis & Synthesis Lab on Rae Total Las [4 [12 [3s 4" Semester ‘Teaching Periods’ Course No Subject per week — | Credits f L[T|P MTH-4117 | Probability Statistics and Queuing | 3 | 1 | 0 | 4 CSE-4217 | Analysis and Design of Algorithms | 3 | 1 | 0 | 4 ECE-4317 | Digital Electronics 3[ifo[ 4 CSE-4417 | Data Communication 3fofo| 3 MTH-4517 | Numerical Methods eile oe ae cse-azint | Arabs and Design oF Algortims|"y J |g | 9 ECE-4317L | Digital Electronies Lab o fo 2 CSE-4417L | Data Communication Lab Ms | SO A [ae Total [4 fia2l[ 2s Page | 2 hyNote: 5" Semester ‘Teaching Periods| Course No Subject per week — | Credits 1 Be Ls CSE-5117 | Operating ‘Systems. ae 1 0 4 ese-s2i7 | Comput Atchlecture BF | aie on [aes CSE-5317 | Database Management Systems a ‘i 0 4 CSE-5417 | Intemet and Web Technology 3 0 0 3 ECE-5517 | Digital Signal Processing amy |e onl CSE-5317L | Database Management Systems Lab 0 0 4 2 CSE-S417L | Internet and Web Technology Lab | 0 | 0 | 4 2 ECE-S517L | Digital Signal Processing Lab ofola| 2 Total is] 4] iz{ 2 ‘The students are required to go for Industrial Training atthe end of Sth or 6th semester after the university examinations are over for 4 to 6 weeks duration. ‘The same shall be evaluated at the end of the 7th semester. 6" Semester ‘Teaching Periods| Course No Subject perweek — | Credits L[T[P CSE-6117 | Theory of Computation Be) lm (Om ae CSE-6217 | UNIX and Shell Programming Bo oe |e CSE-6317 | Microprocessor ue | Bite | rom ea CSE-6417 | Software Engineering 295) cites (SO ae CSE-6517 | Computer Networks oz ie |e ae CSE-6217L | UNIX and Shell ProgrammingLab | 0 | 0 | 4 | 2 CSE-6317L | Microprocessor Lab ofoj4] 2 CSE-6517L | Computer Networks Lab ol[ola4a|{ 2 Total 1s] 4 [12] 25 Page | 37 Semester ‘Teaching Periods| | Course No Subject per week | Credits ca (ence Be CSE-7117__| Cryptography and Network Security | 3 | 0 | 0 | 3 CSE-7217_| Compiler Design 3m (Fon, 0m [aes CSE-7317_| Computer Graphics are [os Ne | CSE-7417_| Minor Project (oes ESI] 2 (a, een ical Training & Pre-Placement | 4 | 9 | > , CSE-7317L_| Computer Graphies Lab Mss CSE-761X17 | Elective-1 3[ol[2] 4 CSE-772X17 | Elective-2 PIRES Total us| s | 10| 25 Note: + Students are required to prepare a synopsis report in the minor project reflecting a clear cut idea about the major project to be carried in the 8 semester. 8" Semester [Teaching Periods| Course No Subject per week | Credits ; LIT [P * Entrepreneurship Development | |_CSE-8117_| Management 3]o}fo] 3 CSE-8217_| Artificial Intelligence 3[olfo|[ 3 CSE-8317_ | Major Project & Viva Voce o[s|4]{ CSE-8417L_| Seminar (ont TOU [pes CSE-853X17| Elective-3 3{ifo[ 4 CSE-864X17 | Elective-4 30 (a Total 12 [10] 6 [ 25 L-Lectures T-Tutorials P--Praeticals Page | 4Course Code Title CSE-761117 _| Distributed Computing CSE-761217_| Advanced DBMS. CSE-761317_| Java Programming CSE-761417 _| Digital Image Processing Elective-2 Course Code Title CSE-772117 _| Cloud Computing CSE-772217 _| Embedded Systems CSE-772317 _ | Management Information System CSE-772417_| E-Commerce _ Elective-3 Course Code Title CSE-853117_ | Advanced Computer Networks CSE-853217_| Advanced Computer Architecture CSE-853317_| Data Mining and Data Warehousing CSE-853417_| Enterprise Java Elective-4 Course Code Title CSE-864117 | Wireless and Mobile Communication CSE-864217 | Robotics CSE-864317 | Neural Networks CSE-864417 | Pattern Recognition Page | 5 WeDETAILED SYLLABUS SEMESTER - 3Course No: MTH-3117 Discrete Mathematics Objective: The objective of this course to understand the concept of sets, relations, propositional logic, graph theory, solving graph problems and introduce to the basic concepts of tress and group theory. Unit 1 Relations: Sets, product sets, relations, representation of relations, composition of relations, partitions, equivalence relations. Ordered Sets and Lattices: Ordered sets, diagram of partially ordered sets, Supremum and Infimum, well ordered sets, lattices, bounded and complemented lattice, and distributive lattice. Propositional Caleulus: Statements, basic operations, truth value of compound statements, algebra of propositions, tautologies and contradiction, conditional and bi-conditional statements, logical implications, logical equivalence, predicates, universal and existential quantifiers. Unit2 Graph Theory: Graphs and multi-graphs, degree of a vertex, paths connectivity, cut points bridges, walks, paths, cycles, connected graphs, bipartite, regular, planar and connected graphs, components, Euler graphs, Euler’s theorem, Hamiltonian path and circuits, graph coloring, chromatic number, isomorphism and homomorphism of graphs, Konigsberg seven bridge problem, shortest path. Trees: Properties of trees, pendant vertices in trees, degree sequences in trees, necessary and sufficient conditions for a sequence to be a degree sequence of a tre. Unit3 Group Theory: Groups, semi group, infinite group, finite group, order of a group, Abelian group, subgroup, necessary and sufficient condition for a subset to be a subgroup of a group, Lagrange’s theorem, cosets, normal subgroups, order of an element of a group, cyclic group. Rings, homomorphism and isomorphism of rings. Books Recommended: Elements of Discrete Mathematics by C. L. Liu, 2nd Ed.Tata Me-Graw Hill Discrete Mathematical Structers, Kolman, Busby and Ross, 6th Ed.PHI (2009). Narsingh Deo : Graph Theory with Applications to Engineering and Computer Sciences,PHI. Murry R. Spiegel: Discrete Mathematics (Schaums Outline series) Tata McGraw Hill (2009). Kenneth H. Rosen : Discrete Mathematics and its applications,sth Ed. Tata McGrawHill. K.R Parthasarty : basic Graph Theory, Tata Me-Graw Hill ayer eee Page 20 of 73Course No: CSE~3217 Object Oriented Programming in C++ Objective: The objective of this course is fo make a student understand the basic approach of object oriented to design software, implementation of programs using classes and objects. Specify the _forms of inheritance and use them in programs and introduce the concept of polymorphic behaviour of objects, Unit 1 Introduction: Basic features and concepts of Object Oriented Programming (OOP), languages and applications of oops. Tokens, Expressions and Control Statements: Tokens, Keywords, identifiers and constants, basic data types, user defined data types, derived data types, memory management operators, manipulators, expressions, control structures. Functions in C++: Function prototyping, call by value, inline functions, default functions, call by reference, Call by Address Unit 2 Classes and Objects: Specifying class, defining member functions, private member functions, arrays within class, memory allocating for objects, arrays of objects, objects as function arguments, returning objects, pointers to members, function overloading, Friend Function. Constructors and Destructors: Constructors, parameterized constructors, constructors with default arguments, dynamic initialization of objects, dynamic constructors and destructors. Operator Overloading and Type Conversion: Definition and rules of overloading operators, Overloading Binary and Unary Operators. Unit 3 Inheritance: Single, mul derived classes. vel, multiple, hierarchical and hybrid inheritance, virtual base classes, Pointers, Virtual Functions and Polymorphisi functions, pure virtual functions, abstract classes. Pointers, pointers to objects, and virtual Exception Handling, Templates: Class templates, function templates. jes and I/O streams: Working with files, stream input/output classes and objects. Books Recommended: 1. Object Oriented Programming using C++, E Balagurusamy. 2. Object Oriented Programming in Turbo C++, Robert Lafore. 3. A Structured Approach using C++, Farouzan and Gilber. 4. Object Oriented Programming with C+, R S Salaria. Page 21 of 73Course No: CSE-3317 Data Structures using C Objective: To understand the basies of data structures, various techniques of sorting and searching, ‘o design and implement arrays, stacks, queues, and linked lists and to understand the complex data structures such as trees and graphy. Unit 1 Introduction: Basic concept of data, structures and pointers. Arrays: Representation, implementation, polynomial representation, limitations, Strings: Representation, string operations, implementing String.h library functions. Linked List: Static and dynamic implementation, single, double, circular, multiple linked lists. Unit2 Stack: Recursion and Stacks, static and dynamic implementation, expression evaluation, infix, postfix expressions. Queue Hash table: Implementation, hashing techniques, single, double. static and dynamic implementation of queue, circular queue ani iplementation. Storage Management: Memory Management techniques, garbage collection. Unit3 Trees: Binary trees, binary search trees, static and dynamic implementation, tree operations, insert, delete, and search, AVL tress. Heap: Introduction, Implementation, heap sorting. Sorting and Searchin; Different sorting techniques- insertion sort, selection sort, bubble sort, radix sort, quick sort, merge sort, heap sort, linear search, binary search. Graph Representation of graphs, BFS, DFS. graph algorithms. Books Recommended: Data Structures by Rajni Jindal. Data Structures, Schaum's Series. Data Structures by Knuth. Data Structures by Farouzan. Data Structures using C and C-++ by Langsam, Augestem, Tanenbaum. Page 22 of 73Course No: ECE-3417 Network Analysis and Synthesis Objective: The objective of this course is to understand of the basic concepts of circuits/networks, solutions of networks using different techniques, network theorems, parameters in a two port network and to introduce the concept of filters Unit 1 Development of the Circuits Concept: Charge and energy, capacitance, inductance and resistance parameters, approximate realization of a physical system as a circuit, Conventions for Describing Networks: Reference directions for currents and voltages, ‘magnetically coupled circuits, circuit topology. t Order Differential Equations: Differential equations as applied in solving networks, application of initial conditions, evaluating initial conditions in networks. Laplace Transformation: Solutions of Network problem using Laplace and Heaviside’s expansion theorem. Unit2 Waveform Analysis and Synthesis: The unit step, ramp and impulse functions and Laplace transforms. Initial and final value theorem, convolution integral, convolution as summation. Network Theorems and Impedance Functions: Complex frequency, transformer impedance and transform circuits, series and parallel combination of elements, Fosters reactance theorem and reciprocity theorem. Network Funetions-Poles and Zones: Ports of terminal pairs. Network functions for one port and ‘two port network (ladder and general networks). Poles and zeros of network functions, restriction ‘on pole and zero locations for driving point and transfer function, time domain behavior from pole zero plot. Unit3 ‘Two Port Parameters: Relationship between two-port parameters, admittance, impedance, transmission and hybrid parameters, relationship between parameter sets, parallel connection of two port networks, characteristic impedance of two port networks, Filters: Filter fundamentals - pass and stop band, filter classification, constant-k and m-derived filters, behavior of characteristic impedance over pass and stop bands design of filters. Books Recommended: 1. Network Analysis by Van Valkenberg 2, Network Analysis and Synthesis by F. Kuo Page 23 of 73Course No: ECE-3517 Course Name : Signals and Systems Objective: The objective of this course is 10 understand the various classification of both continuous and discrete time signals and systems, analysis of signals using Laplace Transform and Fourier Transform, analysis and characterization of the discrete signals through Fourier and Z- transform. Use probabilistic characterizations of random signals and noise, and measurements derived from these signals. Unit 1 Introduction to Signals: Classification of signals-deterministic, non-deterministic, periodic, aperiodic, even, odd signals, energy, power, elementary, exponential, ramp, pulse, square wave signals. Basic Operations on Signals: Time shifting, time scaling, time inversions of signals. Basie Properties of System: causality, time invariance, stability, lines system, interconnection of systems. LTI Systems: Linear time invariant systems, characterization, Unit Impulse response, convolution, properties of LTI systems. wusoidal, impulse, step, , memory, order of Unit2 Fourier analysis of signals and systems: Fourier series of periodic signals and its properties, Fourier transform of aperiodic signals and its properties, Fourier transform of periodic signals, convolution in time and frequency domain, energy and signals, parsevals theorem, energy spectral density and its properties, Transfer function of LTI system. Laplace Transform: Relation between Laplace and Fourier transforms, region of convergence, properties of Laplace transform, initial and final value theorems, convolution, transfer function of LTI system, concept of poles and zeroes, stability criteria. Z-Transform: Region of convergence, inverse Z-Transform, transform analysis of discrete time LTI systems. Unit 3 Random Variable Theory and Random Signals: Probability, conditional probability, statistical independence, random variables, discrete and continuous random variables, probability distribution and probability density functions, statistical averages of random variables, some important density functions. Random Processes and Characterization: Ensemble and time averages, stationary and non- stationary random process, wide sense stationery random process, autocorrelation and cross correlation functions, response of LTI systems to random inputs, noise and its types, white noise, signal to noise ratio of LT! systems. Books Recommended: 1. Signals and Systems by Zieman, Tranter, Fannin. . Signals and Systems by Sanjay Sharma, Signals and Systems by A Populis. Random processes and Systems by A Popul 5. Signals and Systems by S. Hykin. 2, By 4, 5 Page 24 of 73, AACourse No: CSE-3217L Object Oriented Programming in C+ Lab 1. Simple class design in C++, namespaces, objects creations 2. Class design in C+ using dynamic memory allocati 3. Funetion overloading, default arguments in C++ 4, Constructor, Destructor. 5. Operator overloading, friend functions 6. Overloading assignment operator, type conversions 7. Inheritance, run-time polymorphism 8. Template design in C++ 9. Exceptions handling 10. File handling. Note: This is only the suggested of practical, Instructor may frame additional practicals relevant to the course contents, Page 25 of 73Course No: CSE-3317L Data Struetures using C Lab Basic concepts of data, linear lists, strings, arrays and orthogonal lists, representation of trees and graphs, storage systems, arrays, recursion, Stacks, Queues, Linked lists, Binary trees, General Trees, Tree Traversal, Symbol Table and Searching Techniques, Sorting Techniques, graphs. 1. Implement singly and doubly linked lists. Represent a polynomial as a linked list and write functions for polynomial addition, Implement stack and use it to convert infix to postfix expression Implement array-based circular queue. Implement an expression tree. Produce its pre-order, in-order, and post-order traversals. Implement binary search tree. Implement priority queue using heaps Implement various sorting techniques as taught in class. Implement Dijkstra’s algorithm 10. Implement Prim's and Kruskal's algorithms Note: This is only the suggested of practical. Instructor may frame additional practicals relevant to the course contents, Page 26 of 73Course No: ECE-3417L Network Analysis and Synthesis Lab 1, Study of CRO - Measurement of Voltage frequency and Phase of a given waveform. To assemble RC circuits and observe its performance in low pass and high pass mode. To assemble a series and parallel resonant circuit and observe their frequency response. To measure impedance and bandwidth of a parallel tuned circuit and obtain its quality factor. ‘To measure image and characteristic impedance of a symmetrical Tee and Pi networks. For a given two port network measure: ABCD parameters. ii) h- parameters. 7. To experimentally determine the characteristic impedance and to plot the attenuation characteristics of the following circuits. {Prototype low pass filter. ii) Prototype high pass filter. iii) Prototype band-pass filter. Note: This is only the suggested of practical. Instructor may frame additional practicals relevant to the course contents. Page 27 of 73DETAILED SYLLABUS SEMESTER - 4Course No: MTH-4117 Probability Statistics and Queuing Objective: The objective of this course is to make a student understand the fundamental concepts of probability and statistics, theorems of probability theory, and to understand elementary queuing concepts. Unit 1 Measures of central tendency and measures of variations (dispersions), moments, measures of skewness and kurtosis. Random experiment, sample space, events, classical statistical and axiomatic definitions of probability. Statements and proof of theorems on addition and ‘multiplication of probabilities, simple problems. Baye's theorem on conditional probability Unit 2 Random variables, derivation of formulae for mean variance and moments of random variables for discrete and continuous cases. Laws of expectation, Binomial, Poisson and normal distributions, beta and gamma distribution, t-distribution, F-Distribution, Chi-square distribution and their applications. Methods of least squares, fitting a straight line and parabola of degree-p. Regression and correlation, Multiple and partial correlation. Unit 3 Markov Chain and Reliability: Markov chain, transition probabilities, Limiting distributions, concepts of reliability. Introduction to Queuing Theory: Markovian queuing models, Little's formula, application of queuing theory, M/M/1 Model. Books Recommended: 1 ler and Fread’s Probability and statistics for engineers-Richard A Johnson, Pearson Education Asia/ PHI. 2. Fundamentals of Mathematical Statistics- S. C. Gupta and V. K. Kapoor, Sultan and Sons, Easten Economy Edition 3. Introduction to Mathematical Statistics-Craig and Hogg, Pearson. 4, Probability and Statistics With Reliability, Queuing With Relial Science Application by Kishor S. Trivedi, PHI. Ys Queuing and Computer bp Page 28 of 73Course No: CSE-4217 Analysis and Design of Algorithms Objective: To understand the importance of algorithm and its complexity, to analyze the complexity of an algorithm in terms of time and space complexities, 10 design and implement various programming paradigms. Unit 1 gn paradigm, motivation, concept of algorithmic efficiency, run time analysis of algorithms, asymptomatic notations and recurrence relations. ivide and Conquer: Structure of divide and conquer algorithms, examples- binary search, quick sort, analysis of divide and conquer. Greedy Method: Overview of the greedy paradigm, examples of exact optimization solution (minimum cost spanning tree), approximate solution (Knapsack problem), single source shortest paths. Unit2 Dynamic Programming: Overview, difference between dynamic programming and divide and conquer, applications- shortest path in graph, matrix multiplication, travelling salesman problem, longest common sequence. Graph Searching and Traversal: Overview, traversal methods, depth first and breadth first search. Unit3 Backtracking: Overview, 8-queen problem and Knapsack problem. Braneh and Bound: LC searching, bounding, FIFO branch and bound, applications- 0/1 Knapsack problem, Travelling salesman problem, Computational Complexity: Complexity measures, Polynomial ys non-polynomial time ‘complexity, NP hard and NP complete classes, examples. Books Recommended: 1. Introduction to algorithms by Cormen, Leiserson, Rivest, Stein: 2. Fundamentals of computer algorithms by E. Horowitz and Sahni: 3. The Design and Analysis of Computer Algorithms by Aho, Hoperaft, Ullman, Pearson Education 4, Algorithm Design by Good Rich and Tamassia, wiley student edition, Page 29 of 73 yeeCourse No: ECE-4317 Digital Electronics Objective: The objective of this course is to understand the essential knowledge on the fundamentals number system, Boolean algebra, digital circuits and concept on the design principles of digital computing systems Unit 1 Number system and Codes: Binary, Octal, Hexadecimal number systems and their inter- conversion, Binary Arithmetic, BCD codes, 8421 code, Excess-3 code, Gray code, error detection and correetion- Hamming code. Logic Gates and Boolean Algebra: Basic theorems and properties of Boolean algebra, Boolean functions, Canonical and Standard forms of Boolean expressions, Digital logic gates. Logie Families: TTL and ECL, MOS, CMOS devices (work and characteristics), Boolean Function tabulation method. plification: The Karnaugh map (K-map) method, Quine McCluskey Unit2 Combinational Circuits: Combinational circuit design, design of half adder/subtractor, full adder/subtractor. Design of Encoders and Decoders: Priority encoders, BCD to decimal decoder, BCD to seven segment display decoder, design of Multiplexers (MUX). PLA, PAL: Programmable Logic Arrays, Programmable Array Logic, implementation of combinatorial logic using these devices. Semiconductor Memories: Introduction, memory organization, sequential memories, ROMs, RAMs, content addressable memories, design of memory modules. Unit 3 Sequential Circuit Design: Flip flop and its types, flip-flop characteristic and excitation tables, conversion of flip-flops. Counters and Registers: Design of shift registers, universal shift register, and design of asynchronous counters- Ripple counters, Mod (N) counters, sequence detectors, design of various synchronous counters- state diagrams and truth tables. Books Recommended: 1. Malvino and Leach “Digital principles and Applications” Tata McGraw Hill, Jain R P “Modern Digital Electronics”, Tata McGraw-Hill. 2, 3. Mano M Morris, “Digital Design” Pearson Education. 4, James W. Bignell and Robert Donovan, “ Digital Electronics”. 5. . Flecther “An Engineering Approach to Di | Design”, Prentice Hall of India.Course No: CSE-4417 Data Communication Objective: The objective of this course is to understand different modulation and demodulation techniques, concept of digital communication, data transmission techniques, noise and its analysis. Unit 1 Modulation: Introduction, overview of communication system, communication channel, need for modulation, baseband signals Modulation types: Amplitude modulation (DSB-FC), Double sideband suppressed carrier (DSB- SC), Single Sideband modulation (SSB), Vestigial sideband modulation (VSB), Angle modulation, Frequency and Phase modulation, NBFM, WBFM. Demodulation: Block diagram of AM and FM transmitters and receivers. Unit 2 ital Communication: Sampling, Quantization, quantization error, coding, pulse code modulation, differential PCM, ADPCM, Relative advantages and dis-advantages, Delta modulation, PWM and PPM, Frequency Division Multiplexing (FDM), Time Division Multiplexing (TDM). Binary Transmission Systems: Applications and types ASK, FSK, PSK, M-FSK DPSK, QPSK, QAM, DSL, ADSL schemes. Unit 3 Introdui ion: Channels, bandwidth, transmission media. Data Transmission Techniques: simplex, half duplex, full duplex, synchronous and asynchronous Line coding techniques. Data rate, bandwidth (Shannon’s theorem), baud rate. Errors: Types, detection and correction techniques. Noise: types, noise analysis of AM and FM, pre-emphasis, de-emphasis and SNR improvement. Books Recommended: 1. Principles of Communication Systems by Taub and Schelling 2. Electronic Communication Systems by G. Kennedy 3. Communication systems by S. Haykins real Page 31 of 73‘Course No: MTH-4517 ‘Numerical Methods Objective: The objective of this course is to introduce students to the various numerical techniques, which find their applications in almost every sphere of Science and Engineering, Unit 1 Solution for linear and non linear equations: Algebraic equations: Bisection method. Regula-Falsi method. Newton Raphson Method, Secant method. Solution for systems of equations: Basie Gauss Elimination method, Gauss Elimination with Pivoting, Gauss Jordan method for linear system of equations. Unit 2 Interpolation: Meaning of A, E, » and 8. Forward difference, Backward difference, and Central difference, Newton's formula. Lagrange’s Interpolation formula, Sterling’s and Bessel’s formula. Unit3 Numerical Integration and Differentiation: Introduction. Newton-Cotes Methods: Trapezoidal rule, Simpson’s 1/3 rule, Simpson’s 3/8 rule. Gaussian Integration Difference Equations and their solutions: One-step methods: Taylor series methods, Euler’s method, Range Kutta method. Predictor Corrector methods: Milne-Simpsons method, Adams Bashforth method. Books Recommended: 1, Numerical Methods, E. Balaguruswamy, TMH. Introduction to Numerical Methods, V. Rajaraman, TMH. D 3. Applied Numerical Methods for Engineers using MATLAB and C, Schilling, Cengage Indi 4, Numerical Mathematics and Computing, Cheney, Cengage India. 5 ‘Numerical methods for engineers by Chapra and Canale, Sth edition, Tata McGraw Hill. Page 32 of 73Course No: CSE-4217L, Analysis and Design of Algorithms Lab 1. Sort a given set of elements using the Quicksort method and determine the time required to sort the elements. 2. Obtain the Topological ordering of vertices in a given digraph. 3. Implement 0/1 Knapsack problem using Dynamic Programming. 4, From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijikstra“s algorithm, Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal" algorithm, Print all the nodes reachable from a given starting node in a digraph using BFS method. Check whether a given graph is connected or not using DFS method. Find a subset of a given set $ = {sI,s2,...8n} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1,2, 5, 6, 8} and d= 9. Implement and find the optimal solution for the Traveling Salesperson problem. 10, Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm. 11. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm 12, Implement N Queen's problem using Back Tracking, . Note: This is only the suggested of practical, Instructor may frame additional practicals relevant to the course contents. Page 33 of 73Course No: ECE-4317L Digital Electronics Lab 1. Verification of the truth tables of TTL gates (7400, 7402, 7404, 7408, 7432, 7486). Verify the NAND and NOR gates as universal logic gates, To realize AND, OR gates using diodes and resistors (Logic fia ies). To verify De-Morgans law using logie gates. Design and Verification of the truth table of half and full adder circuits, 2. 3. 4 5. 6. Verification of truth table of the Multiplexer 74150. 7. Verification of truth table of the De-Multiplexer 74154. 8. Design and test of SR Flip Flop(F/F) using NAND/NOR gates. 9. Verify the truth table of a J-K F/F (7476). 10. Verify the truth table of a D F/F (7474). 1. Operate the counters 7490, 7493, and 74194. Verify the frequency division at each stage and with a low frequency clock (say 1 Hz) display the count on LED's. 12, Verify the truth table of decoder driver 7447/7448. Hence operate a 7 segment LED display through a counter using a low frequency clock. Note: This is only the suggested of practical. Instructor may frame additional practicals relevant to the course contents. eet Page 34 of 73Course No: CSE-4417L, Data Communication Lab Generation and detection of amplitude modulated signals. Generation and detection of frequency modulated signals. To measure sensitivity, selectivity, and fidelity of a radio receiver. To generate PAM and PDM signals using IC $55. ‘To measure the n A.MLFM System. figure of the following systems:- Making Straight, Rollover and Cross-Over cables Study of Amplitude, Frequency Modulation Study of frequency Modulation Study of ASK, FSK Modulation Simple point-to-point communication and error detection Note: This is only the suggested list of practicals. Instructor may frame additional practicals relevant to the course contents Page 35 of 73DETAILED SYLLABUS SEMESTER - 5Course No: CSE-S117 Operating Systems Objective: The objective of this course is to make a student understand the services, process ‘management, inter-process communication and memory management techniques handled by operating system. Moreover, to learn basics about file-system design and implementation issues. Unit 1 Introduction to operating systems: Operating system and functions, evolution of operating system, batch, interactive, time sharing and real time system, system protection, Operating system structure: System components, operating system services. Process management: Process concept, principle of concurrency, producer consumer problem, | section problem, semaphores, inter process communication, Unit 2 Process scheduling: Scheduling concept, scheduling criteria, scheduling algorithms, multiprocessor scheduling. Deadlock: System model, deadlock characterization, deadlock-prevention, avoidance, detection and recovery. Memory management: Multi partition, paging, segmentation rogramming with fixed partition, multiprogramming with variable Unit3 Virtual memory management: Virtual memory concept, Demand pa replaced algorithm, Allocation of frames, Thrashing. ig, Performance, Page File system: File Concept, Access Methods, Directory and Disk Structure, File Sharing. V/O management and disk scheduling: /O devices, /O scheduling, /O buffering, Disk 1/0, Disk scheduling algorithms, RAID Structure. Books Recommended: 1. J. Peterson, A. Silberschatz, and P. Gal Edition, 1989. 2. M.J. Bach, Design of the Unix Operating System, Prentice Hall of India, 1986, Operating System Concepts, Addison Wesley, 3rd 3. Silberschatz, Galvin, Gagne, "Operating System Concepts", John Wiley and Sons, 9th edition, 2013, 4, Modern operating systems by A.S.Tanenbaun, 2" edition. PHI Operating system by Milan Milenkovie: Tata MeGraw Hill. Page 36 of 73Course No: CSE-5217 Computer Architecture and Organization Objective: The objective of this course is to make a student understand the basic structure and operation of digital computer, design of arithmetic and logic unit, implementation of fixed-point and floating-point arithmetic operations, control unit techniques, concept of pipelining, hierarchical memory and techniques of communicating with I/O devices. Unit 1 Basie Structure and Functional Interconnection: Basic structure and functions of a digital computer, Von Neuman architecture, hierarchical structure of functional units and their interconnection; Bus architecture Instruction Execution and Addressing Modes: Instruction set, processor registers viz. PC, IR, MAR, MBR, PSW, etc, instruction cycle, instruction format and types, execution of a compete (basic) instruction, micro-operations, addressing modes, CPU organizations-accumulator, general register and stack. Unit 2 Data Representation: Integer representation- sign-magnitude and two’s complement, Integer addition, subtraction, multiplication and division, Booth’s algorithm, floating point representation, IBEE 754 standard. Control Unit Organization: Hardwired control, micro-programmed control, micro-instruetions, address sequencing, control memory, introduction to pipelining. Unit3 Memory Hierarehy and Cache Memory Organization: Semiconductor main memory, RAM and its types-SRAM and DRAM, memory hierarchy, locality of reference, cache memory, organization and characteristics, mapping techniques- direct, associative and set associative, replacement algorithms (brief account only), write policies- write-back and write-through WO Techniques and Interfaces: /O modules and their functions, programmed 1/0, commands, memory-mapped and isolated 1/0, interrupt-driven /O, DMA, introduction to standard interfaces viz. PCI, SCSI, and USB. Books recommended: ‘Computer System Architecture, M. Moris Mano, Pearson Education. Computer Organisation and Architecture, William Stallings, Pearson Education. Computer System Architecture, J. P. Hayes, Pearson Education, Computer Organization, Hamachar, Vranesic and Zaky. Page 37 of 73 hyCourse No: CSE-5317 Database Management Systems Objective: The objective of this course is to make a student understand the basic concepts of DBMS, learn models, conceptualize and depict a database system using ER diagrams, database languages, normalization and its importance and to know the fundamental concepts of transaction processing techniques Unit 1 Introduction and Architecture: Overview of database management system, database system verses file system, database characteristics, database system concept and architecture, data independence, schemas and instances, users and database administrators. Data Modeling using the Entity Relationship (ER) Model: Mapping constraints, keys, generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationship of higher degree. Relational Data Model and Language: Relational data model concepts, integrity constraints, entity integrity, referential integrity, Key constraints, Domain constraints, relational algebra and relational calculus- operations and queries. Unit 2 Database Languages and Structured Query Language (SQL): DML, DDL and DCL, SQL-a relational database language, date definition in SQL, constraints, views, indexes, queries and sub- queries in SQL, triggers, cursors and stored procedures. Functional Dependency (FD) and Normalization: Need for normalization, functional dependency, normal forms based on primary keys (INF, 2NF, 3NF and BCNF), lossless join and dependency preserving decomposition, multivalued FD and fourth normal form, Join dependency and fifth normal form. Unit3 ‘Transaction Management: Transaction concept and state, implementation of atomicity, isolation and durability, concurrent executions, serializability of schedules. Concurrency and Recovery Control: Techniques, lock-based protocols, timestamp based Protocols, deadlock and deadlock handling, Recovery: Recovery system, failure classification, storage structure, recovery and atomicity, log- based recovery, shadow paging, recovery with concurrent transactions. Books Recommended: 1. R.EI, Masti and S. B. Navathe. Fundamentals of Data Base Systems, Benjamin Cummings. 2. H.F. Korth and A. Silberschatz. Database Concepts, 2nd E n, Megraw Hill, 1991. 3. J.D. Ullman, Principles of Database and Knowledge Base Systems, Vol. | and II Page 38 of 73 vant