Syllabus

For

(B. Tech 3rd Semester Computer Science & Engineering Course)

2016

Tripura University

(A Central University) Suryamaninagar, Tripura (W)

1 | Page of 17

CSE Deptt. Syllabus-THIRD SEMESTER

Sl. No.

Subject Code

Subject Title L T P Contact Hours

Credit /

Unit#

Full Marks

Theory Subjects: 1. HS 303 Accountancy and Economics for

Engineers 3 0 0 3 3 100

2. BS 312 Discrete Mathematics 2 0 0 2 2 100

3. ES 307 Basic Electrical Engineering 4 0 0 4 4 100 4. CS301 Data Structures & Algorithms 2 2 0 4 3 100 4. CS301 Data Structures & Algorithms 2 2 0 4 3 100

5. CS302 Digital Systems and Logic Design 3 0 0 3 3 100 6. CS303 Computer Organization &

Architecture 2 2 0 4 3 100

7. CS304 Graph Theory and Combinatorics 2 0 0 2 2 100

Practical Subjects: 8. ES 308 Basic Electrical Engineering

Laboratory 0 0 2 2 1 100

9. CS305 Data Structure & Algorithm lab 0 0 2 2 1 100 10. CS306 Digital Logic Design Lab 0 0 2 2 1 100

Mandatory Courses: 11. MC 301 Environmental Studies 3 0 0 3 3 100

Total : 28 23 1000

2 | Page of 17

Accountancy and Economics for Engineers (LTP: 3:0:0, Credit: 3) Course Code: HS303, Contact hours-40

Course Outcomes: After completing the course in Engineering Economics and Accounts, the students will be able to- 1. Conceptualize the fundamentals of Engineering Economics and Accounts. 2. Resource planning in economic system and Elasticity of demand. 3. Role of Banking System and their management on taxation System. 4. Accou nts Keeping by Ledger, Cash Book etc. 5. Maintain the Profit & loss Accounts, Final Accounts. 5. Maintain the Profit & loss Accounts, Final Accounts. 6. Financial Control of products industries and their Costing.

Module -1 (10 hrs.)

Introduction Engineering economy and its important, Want activity satisfaction of wants. Resources planning and distribution in economic system Laissez Faire and socialism. Factors of production and concept of optimum. Laws of return. Demand - Elasticity of demand, demand estimation, market research, supply and industrial costs. Money Value of money, quantity theory; inflation and deflection

Module -2 (8 hrs)

Banking - role in commercial banks credit and its importance in industrial financing, sources of finance Reserve bank of India and its functions. Business management and organization, Proprietorship, Partnership and joint stock company their formation, finance and management. Elements of taxation, insurance, Business combinations. Basic Principles of management. Business combinations. Basic Principles of management.

Module -3 (10 hrs.)

Industrial r ecord keeping: Double entry system Journal, lager, trail balance, cash book, preparation of final accounts.

Module -4 (12 hrs.)

Trading, profit and loss account and balance sheet. Industrial costs and their classifications Material cost contr ol, labor cost control and overhead cost control. Depreciation and replacement studies; financial control ratio analysis and their interpretation for industrial control. Budgetary control.

Reference Books:

3 | Page of 17

1. Cost Accountancy- by Bose and Das. 2. Cost Accountancy- by B . Banerjee. 3. Monetary and fiscal Economics P. R Krishna Aiyer. 4. Industrial Organization and Engineering Economics- by T R Banga and S C Sharma. 5. Mankiw Gregory N.(2002), Principles of Economics, Thompson Asia 6. V. Mote, S. Paul, G. Gupta(2004), Managerial Economics, Tata McGraw Hill 7. Misra, S.K. and Puri (2009), Indian Economy, Himalaya 8. Pareek Saroj (2003), Textbook of Business Economics, Sunrise Publishers

Discrete Mathematics (LTP: 2:0:0, Credit: 2) COURSE CODE: BS312, Contact hours-30

Course Outcomes : After completing the course in Discrete Mathematics, the students will be able to- 1. Perform operations on discrete structures such as sets, functions, relations, and sequences. 2. Formulate short proofs using the following methods: direct proof, indirect proof, and proof by

contradiction, and case analysis etc. 3. Apply algorithms and use definitions to solve problems to prove statements in elementary number

theory.

4. Construct mathematical arguments using logical connectives and quantifiers. 5. Verify the correctness of an argument using propositional and predicate logic and truth tables. 5. Verify the correctness of an argument using propositional and predicate logic and truth tables. 6. Demonstrate the ability to solve problems using counting techniques and combinatorics in the context of

discrete probability. 7. Solve problems involving recurrence relations and generating functions.

8. Know the properties of equivalence relations and partial orderings. 9. Understand lattices and Boolean algebras. 10. Explain basic definitions and properties associated with simple planar graphs, including isomorphism,

connectivity, and Euler's formula, and describe the difference between Eulerian and Hamiltonian graphs. 11. Use graphs and trees as tools to visualize and simplify situations.

MODULE- 1 PROPOSITIONAL CALCULUS & PREDICATE CALCULUS: (10 hrs)

Propositions Logical connectives Compound propositions Conditional and biconditional propositions Truth tables Tautologies and contradictions Contrapositive Logical equivalences and implications

- Normal forms Principal conjunctive and disjunctive normal forms Rules of inference Arguments - Validity of arguments. Predicates Statement function Variables Free and bound variables Quantifiers Universe of Predicates Statement function Variables Free and bound variables Quantifiers Universe of discourse Logical equivalences and implications for quantified statements Theory of inference The rules of universal specification and generalization Validity of arguments.

MODULE- 2 SET THEORY, FUNCTIONS: (10 hrs)

Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of a relation Partitions Equivalence relations Partial ordering Poset Hasse diagram Lattices and their properties Sublattices Boolean algebra Homomorphism. Definitions of functions Classification of functions Type of functions - Examples Composition of functions Inverse functions Binary and n-ary operations Characteristic function of a set Hashing functions Recursive functions Permutation functions.

MODULE-3 GROUPS: (6 hrs)

Algebraic systems Definitions Examples Properties Semigroups Monoids Homomorphism Sub

4 | Page of 17

Algebraic systems Definitions Examples Properties Semigroups Monoids Homomorphism Sub semigroups and Submonoids - Normal subgroups. Monoids and groups: Groups Semigroups and monoids Cyclic semigraphs and submonoids, Subgroups and Cosets. Congruence relations on semigroups. Morphisms. Normal subgroups. Structure of Cyclic groups permutation groups.

MODULE-4 RINGS & BOOLEAN ALGEBRA: (4 hrs) Rings Subrings morphism of rings ideals and quotient rings. Euclidean domains Integral domains and fields Boolean Algebra direct product morphisms Boolean sub-algebra Boolean Rings Application of Boolean algebra in logic circuits and switching functions.

Reference Books:

1. Hill Pub. Co. Ltd, New Delhi, 2003.

2. Edition, Pearson Education Asia, Delhi, 2002.

3. Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.

4. Hill Pub. Co. Ltd., New Delhi, 2003.

5. , Pearson Education Asia, New Delhi, 2002.

6. Kolman B. Busby R. discrete Mathematical Structures for Computer Science, Prentice Hall Englewood 6. Kolman B. Busby R. discrete Mathematical Structures for Computer Science, Prentice Hall Englewood Cliffs. 1987.

7. Sahni , S. Concepts in discrete Mathematics Fridley MN., Camelot Publ. Comp., 1981. 8. Schmidt G. Strohlein T. Relations Graphs Program, EATS Monograph on Theor. Comp. Sc. Vol. 29

Berlin Spinger 1993.

5 | Page of 17

BASIC ELECTRICAL ENGINEERING (LTP: 3:2:0, Credit: 4)

(Course Code: ES307) Contact hours-50

Course Outcomes: After completing the course in Basic Electrical Engineering, the students will be able to -

1. Analysis the basics of Electrical Engineering problems in the practical fields and also for their higher

course of studies. 2. Solve the different DC circuits for applications in the fields of basics of Electrical Engineering problems

and their applications in Electronics Circuits & related fields. 3. Apply their knowledge of AC single & three phase Systems in the related applications in higher courses

and Industries. 4. Apply their knowledge on the basics of DC Machines in their related fields. 5. Apply their knowledge of Transformers in practical fields and their higher course of studies. 5. Apply their knowledge of Transformers in practical fields and their higher course of studies.

Module -1 (12 hrs.)

& KVL), Symbols & notations used for current and voltage. Node and Loop methods of network analysis with applications in suitable circuits. Star-delta conversions.

em & Maximum power transfer theorem. Norton's Theorems. Compensation theorem .

Module -2 (12 hrs.)

Electrostatics: Electric field, lines of force, electric field intensity, electric flux and flux density; and its application; Dielectric strength; Concept of capacitance;

Capacitor in series and parallel, Energy stored in a capacitor, loss angle. Electromagnetism: Faradays Laws; Lenz's Law; Fleming's Rules; Effect of magnetic field on current carrying conductor; Magnetic circuits; Statically and dynamically induced EMF; Concepts of self inductance, carrying conductor; Magnetic circuits; Statically and dynamically induced EMF; Concepts of self inductance, mutual inductance and coefficient of coupling, Inductance in series and parallel; Energy stored in magnetic fields.

Module -3 (14 hrs.)

AC Fundamentals: Equation of sinusoidal ac voltages and currents. Definitions of waveform, time period, frequency, amplitude, phase and phase difference, RMS value, fo rm factor, peak factor. Different forms of ac waveforms, representation in the form of equations; average value, RMS value. Diagrammatic representation of ac quantities using phasors (to specify conditions). Use of j -operator for representing phasors (rectangular, polar, trigonometric, exponential). Concept of Impedance & Admittance: definition, relation, notation, impedance and admittance triangle.

AC Circuits and analysis: Single phase - Series & parallel RL, RC, RLC circuits and their steady state solutions. Introduction to transient response in R, RL & RC Circuits. Three phase - Balance Star-Delta connections, phase and line currents and voltages and their relations. Power in 3-Phase circuit, phasor diagram.

6 | Page of 17

Power in 3-Phase circuit, phasor diagram.

Module-4 (12 hrs.) 1. Principles of Electro-mechanical energy conversion:

Mechanical to Electrical - tromagnetic induction and production of emfs (ac & dc), convertibility between electricity and magnetism , direction of induced emf, Lenz's law, dynamically and statically induced emfs, mutual inductances. DC machines: DC machine construction, DC generator working pr inciple , different types, EMF equation.

Electrical to Mechanical - DC motor working principle, different types, voltage equation of motor, DC machine losses and efficiency. AC machines: classification of AC machines, working principle of 3-phase Induction motor.

Principle of electrical energy transfer from one circuit to the other : Single phase Transformer (static AC machine): Working principle, EMF equation, Transformer on No - load and Full load, different losses Equivalent circuit of transformer and their phasor diagrams.

Reference Books: 1. Electrical Engineering Fundamentals by Del Toro Pub: PHI

2. Electrical Technology By Theraja B L Pub:S Chand 2. Electrical Technology By Theraja B L Pub:S Chand 3. Engineering Circuit Analysis by Hayt W H, Kennely J E Pub: McGraw Hill

4. Electronic Devices and Circuit Theory by Boylstad R E, Nashelsky L Pub: PHI

7 | Page of 17

Data Structure & Algorithm (LTP: 2:2:0, Credit: 3)

Course Code: CS301, Contact Hours-40

Prerequisite: - ES 204 Objectives: Ideally this course should act as a primer/pre-requisite for Design and Analysis of Algorithms course. On completion of this course, students are expected to be capable of understanding the data structures, their advantages and drawbacks, how to implement them in C++, how their drawbacks can be overcome and what the applications are and where they can be used. Students should be able to learn about the data structures/ methods/algorithms mentioned in the course with a comparative perspective so as to make use of the most appropriate data structure/ method/algorithm in a program to enhance the efficiency (i.e. reduce the run-appropriate data structure/ method/algorithm in a program to enhance the efficiency (i.e. reduce the run-time) or for better memory utilization, based on the priority of the implementation. Detailed time analysis of the graph algorithms and sorting methods are expected to be covered in Design and Analysis of Algorithms course but it is expected that the students will be able to understand at least the efficiency aspects of the graph and sorting algorithms covered in this course. The students should be able to convert an inefficient program into an efficient one using the knowledge gathered from this course. Course Outcomes: After completing the course in Data Structure & Algorithm, the students will be able to-

1. Interpret and compute asymptotic notations of an algorithm to analyze the consumption of resources (time/space).

2. Exemplify and implement stack, queue and list ADT to manage the memory using static and dynamic allocations.

3. Understand Non-linear Data Structure like Tree and Graph. 4. Develop and compare the comparison-based search algorithms and sorting. 5. Identify appropriate data structure and algorithm for a given contextual problem and implement it. 6. Understand advanced data structures like Hashing, B-Trees. 6. Understand advanced data structures like Hashing, B-Trees.

Module -1 Linear Data Structure (8 Hours) Introduction Why we need data structure? Concepts of data structures: a) Data and data structure b) abstract Data Type and Data Type. Algorithms and programs, basic idea of pseudo-code. Algorithm efficiency and analysis, time and space analysis of algorithms Asymptotic Order notations, Induction.

Array Different representations row major, column major. Sparse matrix - its implementation and usage. Array representation of polynomials.

Linked List Singly linked list, circular linked list, doubly linked list, linked list representation of polynomial and applications.

Module -2 Linear Data Structure (10 Hours)

8 | Page of 17

Module -2 Linear Data Structure (10 Hours) Stack and Queue Stack and its implementations (using array, using linked list), applications. Queues, circular queue, dequeue. Implementation of queue- both linear and circular (using array, using linked list), applications.

Recursion Principles of recursion use of stack, differences between recursion and iteration, tail recursion. Applications - The Tower of Hanoi , Eight Queens Puzzle.

Pattern search and matching algorithms : Knuth-Morris-Pratt and Boyer-Moore algorithms.

Module-3 Non Linear Data Structure (12 Hours) Trees Basic terminologies, forest, tree representation (using array, using linked list). Binary trees - binary tree traversal (pre-, in-, post- order), threaded binary tree (left, right, full) - non-recursive traversal algorithms using threaded binary tree, expression tree. Binary search tree- operations (creation, insertion, deletion, searching). Height balanced binary tree AVL tree (insertion, deletion with examples only). B- Trees operations (insertion, deletion with examples only).

Graphs Graph definitions and Concept. Shortest path algorithms: Dijkstra (greedy algorithm) and Bellman-Ford (dynamic programmi ng). Graph traversal and connectivity Depth-first search (DFS), Breadth-first search (BFS) concepts of edges used in DFS and BFS (tree-edge, back-edge, cross-edge, forward-edge), applications. Minimal spanning tree edy methods). applications. Minimal spanning tree edy methods). Module -4 Searching and Sorting Algorithms (10 Hours ) Sorting Algorithms Bubble sort and its optimizations, insertion sort, shell sort, selection sort, merge sort, quick sort, heap sort (concept of max heap, application priority queue), radix sort.

Searching Sequential search, binary search, interpolation search.

Hashing Hashing functions, collision resolution techniques.

Recommended Books-- 1. Fundamentals of Data Structure in c++ by Ellis Horrowitz, Sartaj Sahni, Dinesh Mehta 2. Data Structures using c and C++ by A M Tanenbaum 3. Data Structures by S. Lipschutz.

9 | Page of 17

Course Name: Digital Systems & Logic Design (LTP: 3:0:0, Credit: 3) Course Code: CS302, Contact Hours-40

Course Outcomes: After completing the course in Digital Systems & Logic Design, the students will be able to- 1. Apply Boolean algebra for logic expression manipulation. 2. Design digital components including decoders, multiplexer and arithmetic circuits 3. Design and analyze combinational and sequential logic circuits 4. Optimize digital systems to improve its performance by reducing complexities. 5. Test digital systems and analyze faults. 6. Become familiarize with logic families

Module - 1 (10 lectures) Weighted & Non -weighted codes, Sequential codes, self complementing codes, cyclic codes, 8-4-2-1 BCD code, Excess-3 code, Gray code, Error detecting code, Error correcting code: Hamming code. Representation of negative numbers in binary system. Binary arithmetic. Boolean algebra: Reduction of Boolean expressions using laws, theorems and axioms of Boolean algebra, Expansion of a Boolean expression to SOP and POS forms, Minimization of completely & incompletely specified Boolean functions using Karnaugh Map and Quine McCluskey Methods, Synthesis using AND-OR, NAND, NOR and XOR forms. Design examples. Introduction to CAD tools: Introduction to VHDL, Programmable Logic Devices.

Module - 2 (08 lectures) Combinational Circuit Building Blocks: Multiplexers, Decoders, Encoders, Code Converters, Arithmetic Circuits, ROM, PLA. VHDL for combinational circuits. Design of any Boolean function, binary adders, subtractor, BCD adder and subtractor, magnitude comparators, etc. subtractor, BCD adder and subtractor, magnitude comparators, etc. Module - 3 (10 lectures) Flip -Flops & Timing Circuit: S-R Latch; Gated S-R Latch; D Latch; J-K flip-Flop; T Flip-Flip: Edge Triggered SR, D, JK and T Flips-Flops; Ma ster - Slave and Edge triggered Flip-Flops; Shift Registers: PIPO, SIPO, PISO, SISO, Bi-Directional Shift Registers; Universal Shift register. Counter: Synchronous Counters: Design of synchronous counters, Ring counter, Johnson counter. State Model, Design of Finite State Machines, Asynchronous Counter: Ripple Counters; Design of asynchronous counters, Effects of propagation delay in Ripple counters,

Module - 4 (12 lectures) Testing of digital circuits: Fault modeling, functional & structural testing, test pattern generation, controllability & observability, combinational ATPG, D algorithm, PODEM & FAN, design for testability. Basic features of DTL and ECL, TTL family gates: fan-in, fan-out and noise margin. MOS family: NMOS and CMOS Logic Gates, Comparison among various logic families.

10 | Page of 17

and CMOS Logic Gates, Comparison among various logic families.

Recommended Books 1. An Engineering Approach to Digital Design, W. Fletcher, PHI 1st Edition 1997. 2. Digital System Design using VHDL, C. H. Roth, Thompson Publications, Fourth Edition, 2002. 3. Digital Logic and Computer Design, Morris Mano PHI 4. Digital Integrated Electronics, Taub B & Schilling, McGraw Hill 5. 5., Digital Systems Engineering, William J. Dally and John W. Poulton, Cambridge University Press. 6. Digital principle and applications Malvino and Leach- (TMH) 7. Digital circuit Testing and Testability, P. K. Lala, Academic Press. 1997

Course Name: Computer Organization and Architecture (LTP: 2:2:0, Credit: 3) Course Code: CS303, Contact Hours-40

Course Outcomes: After completing the course in Computer Organization and Architecture, the students will be able to-

1. Understanding the architecture and operational Concept of a computer system

2. Understand the necessity and working of cache memory

3. Understand instruction execution through instruction cycles.

4. Design Memory Unit using RAM / ROM Chip

5. Design Control Unit using logic gates and combinational circuits

6. Understand the system interconnection and the different I/O techniques.

7. Understand Pipelining and its application in advanced architecture

Module - 1 [12 hours] Basic organization of computers, Block level description of the functional units as related to the execution of

complement arithmetic, Multiplication of signed binary numbers, floating point number arithmetic, Overflow detection, Status flags, Floating point representation (IEEE 754), computer arithmetic and their implementation; Fixed- on Algorithm and

Module - 2 [ 08 hours] Arithmetic Logic Units control and data path, data path components, design of ALU and data path, Instruction sequencing, hardwired control unit, Microprogrammed control unit, interfacing of memory and I/O. Machine instructions, Instruction set architectures, Assembly language programming, Instruction formats, Addressing modes, Instruction execution with timing diagram. Discussions about RISC versus CISC architectures; CISC architectures;

Module - 3 [ 10 hours] Memory Technology and memory classification, static and dynamic memory, Random Access and Serial Access Memories, address decoding, Registers and stack, ROM and PROM-basic cell. Organization and erasing schemes, Magnetic memories-recording formats and methods, Disk and tape Units, Concept of memory map, Cache memory and Memory Hierarchy, Address Mapping, Cache updation schemes, Virtual

memory and memory management unit.

Module - 4 [ 10 hours] I/O subsystems: Input-Output devices such as Disk, CD-ROM, Printer etc. Interfacing with IO devices, keyboard and display interfaces; Basic concepts Bus Control, Read Write operations, Programmed IO, Concept of handshaking, Polled and Interrupt-driven I/O, DMA data transfer, Pipeline Processing, Instruction and Arithmetic Pipeline, Pipeline hazards and their resolution, concept of Parallel Processing.

Reference Books:

11 | Page of 17

Reference Books:

1. Computer Organization by V. Carl Hamacher, Safwat G. Zaky and Zvonko G. Vranesic , McGraw-Hill series (2002)

2. 3. Computer System Architecture by Mano, M.M.,, Prentice Hall of India, New Delhi, 1992 4. Computer Systems Design and Architecture (2nd Edition) by Vincent P. Heuring and Harry F. Jordan

(Dec 6, 2003) 5. Computer Architecture and Organization, by Hayes, J.P.1998, McGraw -Hill

Course Name: Graph Theory and Combinatorics (LTP: 2:0:0, Credit: 2) Course Code: CS304, Contact Hours-30

Course Outcomes: After completing the course in Graph Theory and Combinatorics, the students will be able to-

1. Apply concepts and fundamentals theorems of Graphs and Combinatorics to model problems of real

world. 2. Implementation of Graphs and Combinatorics algorithms. 3. Find the research directions in the field of Graphs and Combinatorics.

Module-1 [10 hours] Module-1 [10 hours] Basics Graph definitions, concepts and properties. Definitions of terms such as graph,sub-graph, vertex,

edge, directed/undirected graph, weighted/un-weighted edges, sub -graph, degree, cut vertex/articulation

point, pendant node, clique, complete graph, Finite and Infinite Graphs , bipartite graphs, Isolated Vertex,

Pendent Vertex, and Null Graph ,connected components strongly connected component, weakly connected

component, path, shortest path, isomorphism).

Path and Circuits-- Walks, paths and Circuits. Connected Graphs, Disconnected Graph and Components.

Euler Graph, Hamiltonian Paths and Circuits.

Trees: Definitions, properties and fundamental theorems of tree s, rooted trees, binary trees, spanning trees, - Kruskal's

Algorithm, Prims Algorithm, DFS, BFS etc.

Module-2 [ 8 hours] Cut-Set and its Properties- Different Cut Sets in a Graph, Properties of a Cut-Set, Fundamental Circuits and Cut-Sets.

Connectivity: Connectivity and separability, Network Connectivity: Connectivity and separability, Network Flows in Graphs, Blocks, K-connected Graphs and k-edge-connected Graphs, 2-connected Graphs,

Eulerian and Hamiltonian graphs Characterization of Eulerian graphs -Sufficient conditions for Hamiltonian graphs.

Matrix Representation of Graphs Incidence Matrix, Circuit Matrix, Rank, Cut-Set matrix, Patha matrix, Adjacency matrix.

Module-3 [ 8 hours] Planar and Dual graphs Planer graphs and their representation. Dual graphs, Detection of planarity, vertex and edge colouring, Euler's theorem, Kuratowski's two Graphs and related theorem, Different representation of a Planer Graph, Detection of Planarity, Geometric and Combinatorial Dual, Thickness and Crossing.

Coloring, Covering and partitioning- polynomial and chromatic recurrence. Colouring of planar graphs, Independence and coloring: Brooks' theorem, Coloring maps, Greedy coloring algorithm Coloring edges - Vizing's Theorem. Chromatic

12 | Page of 17

theorem, Coloring maps, Greedy coloring algorithm Coloring edges - Vizing's Theorem. Chromatic Number, Chromatic partitioning, The four Colour Problem, Five-color and Four-color theorem, Thickness and crossing.

Module-4 [ 4 hours] Matchings:

Konig Egervary theorem, general matchings. Matching, factors, decomposition and domination. Maximum

matching in bipartite and general graphs, stable matching, vertex and edge Coverings.

Combinatorics: Basic combinatorial numbers. Recurrence, generating functions. Multinomials, counting

Hadamard matrix, Finite geometries. Pigeon-hole principle, permutation, combination, summations.

Reference Books:

1. Graph Theory with Applications to Engineering and Computer Science by Narsingh Deo, Prentice -Hall

India (PHI). 2. Graphs, Networks and Algorithm: John Wiley and Sons. 3. -Wesley, 4. V. K. Balakrishnan, Combinatorics, Schaum Series

5. Richard Brualdi, Introductory Combinatorics, Elsevier 6. Bela Bollobas, Modern Graph Theory, Springer, ISBN 139788181283092 7. Berge, Claude. Hypergraphs: Combinatorics of Finite Sets Amsterdam: North-Holland, 1989. 8. Anderson, Ian. A First Course in Combinatorial Mathem atics New York, NY: Oxford University Press,

1974. 1974.

9. Berge, Claude. Principles of Combinatorics New York, NY: Academic Press, 1971.

13 | Page of 17

Course Name: Basic Electrical Engineering Laboratory (LTP: 0:0:2, Credit: 1)

Course Code: ES308, Contact Hours-30

Course Outcomes: After completing the course in Basic Electrical Engineering Laboratory, the students will be able to-

1. Self sufficient for residential wiring systems for their industrial applications. 2. The applications of Network theorems in higher courses in Electrical Engineering. 3. The applications of Measurements of different quantities which are essential for higher courses of

Electrical Engineering and allied research works. 4. The Measurements of Active & reactive Powers for higher course in Electrical Engineering and allied

Research. Research. 5. The measurements of losses of Transformers used for Power distributions.

List of Experiments should include but not limited to following exercises- 1. Residential house wiring using switches, fuse, indicator, lamp and energy meter.

2. Measurement of resistance to earth of electrical equipments and Stair case wiring.

3. Verification of KVL, KCL of D.C Circuit.

4. Verification of Superposition Theorem a D.C. Circuit with two and three Voltage sources.

5. er Transfer Theorems.

6.

7. Fluorescent lamp wiring with Power, Power factor & Current Measurement.

8. Measurement of electrical quantities voltage, current, power & power factor in RL Series Circuit and

determination of values of Components of the circuit.

9. Measurement of electrical quantities voltage, current, power & power factor in RC Series Circuit and

determination of values of Components of the circuit.

10. Measurements three phase Power of balanced and unbalanced loads.

11. Determination of different losses of a Single Phase Transformer.

14 | Page of 17

Course Name: Data Structure & Algorithm Lab (LTP: 0:0:2, Credit: 1) Course Code: CS305, Contact Hours-30

Course Outcomes: After completing the course in Data Structure & Algorithm Lab, the students will be able to- 1. Assess performance efficiency of sequential algorithms. 2. Implement data structures to enable algorithms and implement sequential algorithms for performance. 3. Implement designed algorithms and corresponding data structures using object oriented programming

languages. 4. Implement essential data structures such as lists, stacks, queues, trees and graph. 5. Implement generic data structures for common problems.

List of Experiments should include but not limited to following exercises

1. Implementation of array operations.

2. Stacks and Queues: adding, deleting elements Circular Queue: Adding & deleting elements Merging

Problem.

3. Evaluation of expressions operations on multiple stacks & Queues.

4. Implementation of linked lists: inserting, deleting, and inverting a linked list.

5. Implementation of stacks & queues.

6. Conversion of infix to postfix expression. 7. Evaluation of postfix expression.

8. Using linked lists:

Polynomial addition, Polynomial multiplication

Sparse Matrices: Multiplication, addition. Sparse Matrices: Multiplication, addition.

9. Recursive and Non-recursive traversal of Trees

10. Threaded binary tree traversal. AVL tree implementation

11. Implementation of Tree, sorting and searching algorithms

Hash implementation: searching, inserting and deleting, searching & sorting techniques.

12. Finding simple interest for a given Principal, Time and rate of Interest. 13. Finding sum, average, maximum and maximum in an integer array. 14. Searching and insertion of element in integer array. 15. Implementation of different sorting techniques in integer array.

16. Program to calculate series e.g., n

ii

ii

1

2

!,

N

n

nn

0

2 )102( etc

17. Construction of Graph using 2-D array for directed and undirected, weighted and unweighted graphs. 18. Implementation of minimum spanning tree in a given graph. 19. Construction of binary tree using linked list ADT. 20. Implementation of Depth First Search in binary tree.

15 | Page of 17

20. Implementation of Depth First Search in binary tree. 21. Implementation of Breadth First Search in binary tree. 22. Preorder Tree Traversal technique. 23. Inorder Tree Traversal technique. 24. Postorder Tree Traversal technique. 25. Finding shortest path in a given graph.

Course Name: Digital Logic Design Lab (LTP: 0:0:2, Credit: 1) Course Code: CS306, Contact Hours-30

Course Outcomes: After completing the course in Digital Logic Design Lab, the students will be able to- 1. Write structural, behavioral and data flow models for digital circuits. 2. Model, simulates, verify, and synthesize with hardware description languages. 3. Simulate HDL models of digital circuits using CAD tool. 4. Analyze the subsystems/ modules using CAD tool . 5. Design and prototype with programmable logic.

List of Experiments should include but not limited to following exercises List of Experiments should include but not limited to following exercises 1. Write structural and dataflow HDL models for

a)4-bit ripple carry adder. b) 4 -bit carry Adder cum Subtractor. c) 2-digit BCD adder / Subtractor. d) 4-bit carry look ahead adder e) 8-bit comparator

2. Write a HDL program in structural model for a)16:1 MUX realization b) 3:8 decoder realization through 2:4 decoder

3. Write a HDL program in behavioural model for a)16:1 MUX b) 3:8 decoder c) 8:3 encoder d) D-Flip flop e) T-Flip flop f) JK Flip flop g) 8 bit parity generator and checker

4. Write a HDL program in structural and behavioural models for a) 8 bit asynchronous up-down counter b) 8 bit synchronous up-down counter c) Shift Register

5. Write a HDL program for 4 bit sequence detector through Mealy and Moore state machines. 6. Write a HDL program for traffic light controller realization through state machine. 7. Write a HDL program for vending machine controller through state machine. 8. 9. Write a HDL program in behavioural model for 8 bit shift and add multiplier. 9. Write a HDL program in behavioural model for 8 bit shift and add multiplier. 10. Write a HDL program in structural model for 8 bit Universal Shift Register. 11. Test bench generation based on above using H DL programming technique. 12. Mini project based on programming implementation. Reference Books- 1. Digital Systems Design Using VHDL 2nd Ed., by Chas Roth and Lizy John, Thomson, 2008. 2. VHDL Made Easy, David Pellerin, Prentice Hall Inc. 3. Fundamentals of Digital Logic with Verilog Design, S. Brown and Z. Vranesic, Tata McGraw Hill

New Delhi, 2008.

16 | Page of 17

Course Name: Environmental Studies (LTP: 3:0:0, Unit#: 3) Course Code: MC-301, Contact Hours-40

Course Outcomes: After completing the course in Environmental Studies, the students will be able to-

Develop a better understanding of human relationships, perceptions and policies towards the environment and focus on design and technology for improving environmental quality. Their exposure to subjects like understanding of earth processes, evaluating alternative energy systems, pollution control and mitigation, natural resource management and the effects of global climate change will help the students bring a systems approach to the analysis of environmental problems.

Module 1 (12 hrs.) Introduction and Natural Resources: Multidisciplinary nature and public awareness, Renewable and Introduction and Natural Resources: Multidisciplinary nature and public awareness, Renewable and nonrenewal resources and associated problems, Forest resources, Water resources, Mineral resources, Food resources, Energy resources, Land resources, Conservation of natural resources and human role. Ecosystems: Concept, Structure and function, Producers composers and decomposers, Energy flow, Ecological succession, Food chains webs and ecological pyramids, Characteristics structures and functions of ecosystems such as Forest, Grassland, Desert, Aquatic ecosystems.

Module 2 (8 hrs.) Biodiversity and Conservation: Definition, Genetic, Species, and Ecosystem diversity, Bio-geographical classification of India, Value of biodiversity at global, national, local levels, India as a mega diversity nation, Hot sports of biodiversity, Threats to biodiversity, Endangered and endemic species of India, In-situ and ex-situ conservation of biodiversity.

Module 3 (8 hrs) Environmental Pollution- Definition, Causes, effects and control of air pollution, water pollution, soil pollution, marine pollution, noise pollution, thermal pollution, nuclear hazards, human role in prevention of pollution, marine pollution, noise pollution, thermal pollution, nuclear hazards, human role in prevention of pollution, Solid waste management, Disaster management, floods, earthquake, cyclone and landslides.

Module 4 (12 hrs.) Social issues and Environment - Unsustainable to sustainable development, Urban problems related to energy, Water conservation and watershed management, Resettlement and re-habitation, Ethics, Climate change, Global warming, Acid rain, Ozone layer depletion, Nuclear accidents, holocaust, Waste land reclamation, Consumerism and waste products, Environment protection act, Wildlife protection act, Forest conservation act, Environmental issues in legislation, population explosion and family welfare program, Environment and human health, HIV, Women and child welfare, Role of technology in environment and human health.

Reference Books: 1. Agarwal, K.C., Environmental Biology , Nidi Publication Ltd., Bikaner, 2001.

17 | Page of 17

1. Agarwal, K.C., Environmental Biology , Nidi Publication Ltd., Bikaner, 2001. 2. Bharucha Erach, Biodiversity of India, Mapin Publishing Pvt. Ltd., Ahmadabad, 2002. 3. Clark, R.S., Marine Pollution, Clanderson Press, Oxford, 2002. 4. Cunningham, W.P., et al. , Environmental Encyclopedia, Jaico Publishing House, Mumbai, 2003.