23
1 TABLE OF CONTENTS S. No. Topic Page No. 1. New Study Evaluation Scheme (Year-II, Semester-III) ...…………….…. 3 2. New Study Evaluation Scheme (Year-II, Semester-IV) ...…………….. 4 3. ECS-301: Digital Logic Design ….………………..…………………………... 5 4. EAS-301: Mathematics-III ………..……………………………………………. 5 5. ECS-302: Data Structures Using-C……………………………………….…… 6 6. ECS-303: Discrete Mathematical Structures .…………………………….…. 7 7. ECS-304: Informationechnology Infrastructure and Its Management ….. 8 8. ECS-351: Logic Design Lab …………………………..………………….…… 9 9. ECS-352: Data Structure Lab …………………………………………………. 9 10. ECS-353: Numerical Techniques Lab ……………..…………………………. 9 11. EEC-406: Introduction to Microprocessor ………………..……………...... 9 12. ECS-401: Computer Organization .……………………………………….…... 10 13. ECS-402: Database Management System .………………………………..... 11 14. ECS-403: Theory of Automata and Formal Languages ..…………………... 12 15. ECS-456: Microprocessor Lab ……….………………………………….......... 13 16. ECS-452: DBMS Lab ……….………………………………………………...... 13 17. ECS-453: Computer Organization Lab ………..……………………………… 13 18. List of Science Based Open Elective ……………….………………………. 14 19. EOE-031/EOE-041: Introduction to Soft Computing .…………………….. 15 20. EOE-032/EOE-042: Nano Sciences …………………….……………………. 15 21. EOE-033/EOE-043: Laser System and Applications ….……………… …… 16 22. EOE-034/EOE-044: Space Sciences…………………….…………………… 17 23. EOE-035/EOE-045: Polymer Science & Technology ….…………………… 17 24. EOE-036/EOE-046: Nuclear Science …………………….………………….. 18 25. EOE-037/EOE-047: Materials Science …………………….………………… 18 26. EOE-038/EOE-048: Discrete Mathematics………………….……………….. 19 27. EHU-301/EHU-401: Industrial Psychology ………………….………………. 20 28. EHU-302/EHU-402: Industrial Sociology…………………….……………….. 21 29. EHU-111: Human Values & Professional Ethics ......................................... 21

TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

Embed Size (px)

Citation preview

Page 1: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

1

TABLE OF CONTENTS

S. No. Topic Page No.

1. New Study Evaluation Scheme (Year-II, Semester-III) …...…………….…. 3

2. New Study Evaluation Scheme (Year-II, Semester-IV) ..….…………….…. 4

3. ECS-301: Digital Logic Design ….………………..…………………………... 5

4. EAS-301: Mathematics-III ………..……………………………………………. 5

5. ECS-302: Data Structures Using-C……………………………………….…… 6

6. ECS-303: Discrete Mathematical Structures .…………………………….…. 7

7. ECS-304: Informationechnology Infrastructure and Its Management ….. 8

8. ECS-351: Logic Design Lab …………………………..………………….…… 9

9. ECS-352: Data Structure Lab …………………………………………………. 9

10. ECS-353: Numerical Techniques Lab ……………..…………………………. 9

11. EEC-406: Introduction to Microprocessor ………………..……………..….... 9

12. ECS-401: Computer Organization .……………………………………….…... 10

13. ECS-402: Database Management System .………………………………..... 11

14. ECS-403: Theory of Automata and Formal Languages ..…………………... 12

15. ECS-456: Microprocessor Lab ……….………………………………….......... 13

16. ECS-452: DBMS Lab ……….………………………………………………...... 13

17. ECS-453: Computer Organization Lab ………..……………………………… 13

18. List of Science Based Open Elective ……………….………………………. 14

19. EOE-031/EOE-041: Introduction to Soft Computing ….…………………….. 15

20. EOE-032/EOE-042: Nano Sciences …………………….……………………. 15

21. EOE-033/EOE-043: Laser System and Applications ….……………… …… 16

22. EOE-034/EOE-044: Space Sciences…………………….…………………… 17

23. EOE-035/EOE-045: Polymer Science & Technology ….…………………… 17

24. EOE-036/EOE-046: Nuclear Science …………………….………………….. 18

25. EOE-037/EOE-047: Materials Science …………………….………………… 18

26. EOE-038/EOE-048: Discrete Mathematics………………….……………….. 19

27. EHU-301/EHU-401: Industrial Psychology ………………….………………. 20

28. EHU-302/EHU-402: Industrial Sociology…………………….……………….. 21

29. EHU-111: Human Values & Professional Ethics ......................................... 21

Page 2: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

2

Page 3: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

3

NEW STUDY AND EVALUATION SCHEME

B.Tech. Computer Science & Engineering

[Effective from the session 2010-11]

Year-II, Semester-III

*Human values & Professional Ethics will be offered as a compulsory audit course for which passing

marks are 40% in theory & 50% in aggregate. Students will be required to audit it with in the period of

their study. There will not be carry over facility for this course and the failed student will be required to

repeat this course (in next-semester).

S.

No.

Course

Code Subject

Periods Evaluation Scheme

Subject

Total

Cre

dit

s

Sessional Exam. ESE

L T P CT TA Total

THEORY

1. ECS-301 Digital Logic Design 3 1 0 30 20 50 100 150 4

2. EAS-301 Mathematics-III 3 1 0 30 20 50 100 150 4

3. EHU-301/

EHU-302

Industrial Psychology/ Industrial

Sociology 2 0 0 15 10 25 50 75 2

4. ECS-302 Data Structure Using C 3 1 0 30 20 50 100 150 4

5. ECS-303 Discrete Mathematical Structures 3 1 0 30 20 50 100 150 4

6. ECS-304 IT Infrastructure and its Management 3 1 0 30 20 50 100 150 4

7. EHU-111 *Human Values & Professional Ethics 2 2 0 15 10 25 50 75 -

PRACTICAL/DESIGN/DRAWING

8. ECS-351 Logic Design Lab 0 0 2 10 10 20 30 50 1

9. ECS-352 Data Structure Lab 0 0 2 10 10 20 30 50 1

10. ECS-353 Numerical Techniques 0 0 2 5 5 10 15 25 1

11. GP-301 General Proficiency - - - - - 50 - 50 1

Total 19 7 6 190 135 375 625 1000 26

L - Lecture T - Tutorial P - Practical CT - Cumulative Test TA - Teacher’s Assessment

ESE - End Semester Exam.

Page 4: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

4

NEW STUDY AND EVALUATION SCHEME

B.Tech. Computer Science & Engineering

[Effective from the session 2010-11]

Year-II, Semester-IV

*Human values & Professional Ethics will be offered as a compulsory audit course for which passing

marks are 40% in theory & 50% in aggregate. Students will be required to audit it with in the period of

their study. There will not be carry over facility for this course and the failed student will be required to

repeat this course (in next-semester).

S.

No.

Course

Code Subject

Periods Evaluation Scheme

Subject

Total

Cre

dit

s

Sessional Exam. ESE

L T P CT TA Total

THEORY

1. EHU-401/

EHU-402

Industrial Psychology/ Industrial

Sociology 2 0 0 15 10 25 50 75 2

2. EOE-041-

EOE-048 Science Based Open Elective 3 1 0 30 20 50 100 150 4

3. EEC-406 Introduction to Microprocessor 3 1 0 30 20 50 100 150 4

4. ECS-401 Computer Organization 3 1 0 30 20 50 100 150 4

5. ECS-402 Database Management Systems 3 1 0 30 20 50 100 150 4

6. ECS-403 Theory of Automata & Formal

Languages 3 1 0 30 20 50 100 150 4

7. EHU-111 *Human Values & Professional Ethics 2 2 0 15 10 25 50 75

PRACTICAL/DESIGN/DRAWING

8. ECS-456 Microprocessor Lab 0 0 2 10 10 20 30 50 1

9. ECS-452 DBMS Lab 0 0 2 10 10 20 30 50 1

10. ECS-453 Computer Organization Lab 0 0 2 5 5 10 15 25 1

11. GP-401 General Proficiency - - - - - 50 - 50 1

Total 19 7 6 190 135 375 625 1000 26

L - Lecture T - Tutorial P - Practical CT - Cumulative Test TA - Teacher’s Assessment

ESE - End Semester Exam.

Page 5: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

5

ECS-301: DIGITAL LOGIC DESIGN

L T P

3 1 0

Unit- I 08

Digital system and binary numbers: Signed binary numbers, binary codes, cyclic codes, error detecting

and correcting codes, hamming codes.

Floating point representation

Gate-level minimization: The map method up to five variable, don‟t care conditions, POS simplification,

NAND and NOR implementation, Quine Mc-Clusky method (Tabular method).

Unit- II 08

Combinational Logic: Combinational circuits, analysis procedure, design procedure, binary adder-

subtractor, decimal adder, binary multiplier, magnitude comparator, decoders, encoders, multiplexers.

Unit- III 08

Synchronous Sequential logic: Sequential circuits, storage elements: latches, flip flops, analysis of locked

sequential circuits, state reduction and assignments, design procedure.

Registers and counters: Shift registers, ripple counter, synchronous counter, other counters.

Unit- IV 08

Memory and programmable logic: RAM, ROM, PLA, PAL.

Design at the register transfer level: ASMs, design example, design with multiplexers.

Unit- V 08

Asynchronous sequential logic: Analysis procedure, circuit with latches, design procedure, reduction of

state and flow table, race free state assignment, hazards.

Text Book:

1. M. Morris Mano and M.D. Ciletti, “Digital Design”, Pearson Education, 4th Edition, 2008.

Reference Book:

1. P. Raja, “Digital Logic Design”, Umesh publications, 3rd

Edition.

2. Raj Kamal, “Basic Digital Concepts”, Pearson Education, 2006.

3. “Digital circuit & logic Design”, by Holsworth Publisher Newness, 4th Edition.

4. “Fundamentals of digital logic with verilog design”, 2nd

Edition, 2008.

EAS-301: MATHEMATICS –III

L T P 3 1 0

Unit – I 10

Function of Complex variable

Analytic function, C-R equations, Cauchy‟s integral theorem, Cauchy‟s integral formula for derivatives of

analytic function, Taylor‟s and Laurent‟s series, singularities, Residue theorem, Evaluation of real

integrals of the type 2

0).( dSinCosf and dxxf )( .

Unit – II 08

Statistical Techniques- I

Moments, Moment generating functions, Skewness, Kurtosis, Curve fitting, Method of least squares,

Fitting of straight lines, Polynomials, Exponential curves etc., Correlation, Linear, non –linear and multiple

regression analysis, Probability theory.

Unit – III

Statistical Techniques - II 08

Binomial, Poisson and Normal distributions, Sampling theory (small and large), Tests of significations:

Chi-square test, t-test, Analysis of variance (one way), Application to engineering, medicine, agriculture

etc.

Time series and forecasting (moving and semi-averages), Statistical quality control methods, Control

charts, x , R, p, np, and c charts.

Page 6: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

6

Unit – IV

Numerical Techniques – I 08

Zeroes of transcendental and polynomial equation using Bisection method, Regula-falsi method and

Newton-Raphson method, Rate of convergence of above methods.

Interpolation: Finite differences, difference tables, Newton‟s forward and backward interpolation,

Lagrange‟s and Newton‟s divided difference formula for unequal intervals.

Unit – V 08

Numerical Techniques –II

Solution of system of linear equations, Gauss- Seidal method, Crout method. Numerical differentiation,

Numerical integration , Trapezoidal , Simpson‟s one third and three-eight rules, Solution of ordinary

differential (first order, second order and simultaneous) equations by Euler‟s, Picard‟s and forth-order

Runge- Kutta mehthods.

Test Books:

1. J.N. Kapur, Mathematical Statistics, S. Chand & company Ltd.

Reference Books :

1. R.K. Jain & S.R.K. Iyenger, Advance Engineering Mathematics, Narosa Publication House,3rd

Edition.

2. Chandrika Prasad, Advanced Mathematics for Engineers, Prasad Mudralaya.

3. “Computer Based Numerical and Statistical Techniques”, by Pundir & Pundir.

4. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition 2008.

5. Devi Prasad, An introduction to Numerical Analysis, Narosa Publication house, New Delhi.

ECS-302: DATA STUCTURES USING - C

L T P 3 1 0

Unit - I 09

Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algorithm,

Time and Space Complexity, Asymptotic notations: Big-Oh, Time-Space trade-off. Abstract Data Types

(ADT).

Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and

Column Major Order, Application of arrays, Sparse Matrices and their representations.

Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists, Doubly Linked

List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial

Representation and Addition, Generalized Linked List.

Unit – II 08

Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of

Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression,

Recursion, Tower of Hanoi Problem, Simulating Recursion, Principles of recursion, Tail recursion,

Removal of recursion

Queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked

implementation of queues in C, Dequeue and Priority Queue.

Unit – III 08

Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and Dynamic

Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array and Linked

Representation of Binary trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Threaded

Binary trees, Traversing Threaded Binary trees, Huffman algorithm.

Unit – IV 08

Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices, Adjacency

List, Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search, Connected

Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transistive

Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm, Introduction to Activity

Networks.

Page 7: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

7

Unit – V 09

Searching: Sequential search, Binary Search, Comparison and Analysis

Internal Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort,

Radix Sort, Practical consideration for Internal Sorting.

Search Trees: Binary Search Trees (BST), Insertion and Deletion in BST, Complexity of Search

Algorithm, AVL trees, Introduction to m-way Search Trees, B Trees & B+ Trees

Hashing: Hash Function, Collision Resolution Strategies

Storage Management: Garbage Collection and Compaction.

Text Book:

1. Data Structure through C and C++, G.S. Baluja, Oscar Publication, 2nd

Edition.

References Books:

1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C

and C++” , PHI, 2nd

Edition.

2. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publication.

3. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education.

4. Lipschutz, “Data Structures” Schaum‟s Outline Series, TMH, 2nd

Edition.

5. G A V Pai, “Data Structures and Algorithms”, TMH.

ECS-303: DISCRETE MATHEMATICAL STUCTURES

L T P 3 1 0

Unit - I 10

Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general identities

on sets.

Relations: Definition, Operations on relations, Properties of relations, Composite Relations, Equality of

relations, Recursive definition of relation, Order of relations.

Functions: Definition Classification of functions, Operations on functions, Recursively defined functions,

Growth of Functions.

Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with Nonzero

Base cases, Proof Methods, Proof by counter-example, Proof by contradiction.

Unit- II 07

Algebraic Structures: Definition, Groups, Subgroups and order. Cyclic Groups, Cosets, Lagrange's

theorem, Normal Subgroups, Permutation and Symmetric groups. Group Homomorphisms, Definition and

elementary properties of Rings and Fields Integers Modulo n.

Unit- III 09

Partial order sets: Definition Partial order sets, Combination of partial order sets. Hasse diagram.

Lattices: Definition, Properties of lattices-Bounded, Complemented Modular and Complete lattice.

Boolean Algebra: Introduction, Axioms and Theorems of Boolean Algebra, Algebraic manipulation of

Boolean Expressions, Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits

and Boolean algebra.

Unit- IV 08

Propositional Logic: Proposition, well formed formula, Truth tables TautoIogy, Satisfiability,

Contradiction, Algebra of proposition, Theory of Inference.

Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference theory of

predicate logic.

Unit-V 08

Trees: Definition, Binary tree, Binary tree traversal, Binary search tree.

Graphs: Definition and terminology, Representation of graphs, Multigraphs Bipartite graphs, Planar

graphs.

Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths. Graph coloring Recurrence

Relation & Generating function: Recursive definition of functions, Recursive algorithms, Method of solving

recurrences.

Page 8: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

8

Combinatorics: Introduction Counting Techniques, Pigeonhole Principle Polya‟s Counting Theory.

Text Books:

1. Schaum‟s Outline of Discrete Mathematics by Seymor Lipschutz, 3rd

Edition 2010.

Reference Books:

1. Johnson-baugh, Discrete Mathematics, 6th Edition 2010.

2. Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e McGraw-Hill, 2006.

3. B. Kolman, R C Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall,

2004.

4. E. R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.

5. R. P. Grlmaldi, Discrete and Combinatorial Mathematics, 5/e Addison Wesley, 2004.

6. Wilson, Introduction to Graph Theory, 4th Edition.

ECS-304: INFORMATION TECHNOLOGY INFRASTRUCTURE AND ITS MANAGEMENT

L T P

3 1 0

UNIT- I 08

Introduction- Information Technology, Computer Hardware, Computer Software, Network and Internet,

Computing Resources.

IT Infrastructure- Design Issues, Requirements, IT System Management Process, Service Management

Process, Information System Design, IT Infrastructure Library.

UNIT- II 08

Service Delivery Process- Service Delivery Process, Service Level Management, Financial

Management, Service Management, Capacity Management, Availability Management

UNIT- III 08

Service Support Process- Service Support Process, Configuration Management, Incident Management,

Problem Management, Change Management, Release Management.

Storage Management- Backup & Storage, Archive & Retrieve, Disaster Recovery, Space Management,

Database & Application Protection, Bare Machine Recovery, Data Retention.

UNIT- IV 08

Security Management- Security, Computer and internet Security, Physical Security, Identity

Management, Access Management. Intrusion Detection, Security Information Management.

UNIT- V 08

IT Ethics- Introduction to Cyber Ethics, Intellectual Property, Privacy and Law, Computer Forensics,

Ethics and Internet, Cyber Crimes.

Emerging Trends in IT- Electronics Commerce, Electronic Data Interchange, Mobile Communication

Development, Smart Card, and Expert Systems.

Text Books:

1. Fundamental of IT Service Management: based on ITIL, by Jan Van Bon, Van Haren, Version-3.

Reference Books:

1. High Availability: Design, Techniques, and Process by Floyd Fiedad, Michal Hawkins, Prentice

Hall.

2. IT Organization: Building a World class infrastructure, by Harris Kem, Stuast Gaiup, Guy Nemiro,

Publisher: Prentice Hall.

3. IT Systems Management: Designing, Implementing and managing World Class Infrastructures

Rich Schiesser, Prentice Hall PTR.

4. ICT Infrastructure Management (IT infrastructure Library), Publishers: Stationary Office Books.

5. Security Management by Jacques A Cazemier.

Page 9: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

9

ECS-351: LOGIC DESIGN LAB

L T P

0 0 2

Objective: To understand the digital logic and create various systems by using these logics.

1. Implementation of the given Boolean function using logic gates in both SOP and POS forms.

2. Verification of state tables of RS, JK, T and D flip-flops using NAND & NOR gates.

3. Implementation and verification of Decoder/De-multiplexer and Encoder using logic gates.

4. Implementation of 4x1 multiplexer using logic gates.

5. Implementation of 4-bit parallel adder using 7483 IC.

6. Design, and verify the 4-bit synchronous counter.

7. Design, and verify the 4-bit asynchronous counter.

ECS-352: DATA STRUCTURE LAB

L T P

0 0 2

Write Program in C or C++ for following:

Array implementation of Stack, Queue, Circular Queue, List.

Implementation of Stack, Queue, Circular Queue, List using Dynamic Memory Allocation.

Implementation of Tree Structures, Binary Tree, Tree Traversal, Insertion and Deletion in BST.

Implementation of Searching and Sorting Algorithms.

Graph Implementation, BFS, DFS, Min. cost spanning tree, shortest path algorithm.

ECS-353: NUMERICAL TECHNIQUES LAB

L T P

0 0 2

Write Programs in 'C' Language:

1. To deduce error envolved in polynominal equation.

2. To Find out the root of the Algebraic and Transcendental equations using Bisection, Regula-falsi,

Newton Raphson and Iterative Methods. Also give the rate of convergence of roots in tabutar

form for each of these methods.

3. To implement Newton's Forward and Backward Interpolation formula.

4. To implement Gauss Forward and Backward, Bessel‟s. Sterlings and Evertt's Interpolation

formula.

5. To implement Newton's Divided Difference and Langranges Interpolation formula.

6. To implement Numerical Differentiations.

7. To implement Numerical Integration using Trapezoidal, Simpson 1/3 and Simpson 3/8 rule.

8. To implement Least Square Method for curve fitting.

9. To draw frequency chart like histogram, frequency curve and pie-chart etc.

10. To estimate regression equation from sample data and evaluate values of standard deviation, t-

statistics, regression coefficient, value of R for atlest two independent variables.

EEC-406: INTRODUCTION TO MICROPROCESSOR

L T P

3 1 0

Unit-I 08

Introduction:

Microprocessor evolution and types, microprocessor architecture and operation of its components,

addressing modes, interrupts, data transfer schemes, instruction and data flow, timer and timing diagram.

Interfacing devices, Architectural advancement of microprocessor. Typical microprocessor development

schemes.

Page 10: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

10

Unit-II 08

8-bit Microprocessors:

Pin diagram and internal architecture of 8085 microprocessor, registers, ALU, Control & statu, interrupt

and machine cycle.

Instruction sets, Addressing modes, Instruction formats.

Instruction Classification: data transfer, arithmetic operations, logical operations, branching operations,

machine control and assembler directives.

Unit-III 08

16-bit Microprocessor:

Architecture of 8086 microprocessor: register organization, bus interface unit, execution unit, memory

addressing, and memory segmentation.

Operating modes Instruction sets, instruction format, Types of instructions.

Interrupts: hardware and software interrupts.

Unit-IV 08

Programming:

Assembly language programming based on Intel 8085/8086.

Instructions, data transfer, arithmetic, logic, branch operations, looping, counting, indexing, programming

techniques, counters and time delays, stacks and subroutines, conditional call and return instructions.

Unit-V 08

Peripheral Interfacing:

Peripheral Devices: 8237 DMA Controller, 8255 programmable peripheral interface, 8253/8254

programmable timer/counter, 8259 programmable interrupt controller, 8251 USART and RS232C.

Text Book:

1. V.J. Vibhute, Microprocessor 8086.

2. Ray A.K, Bhurchandi K.M., "Advanced Microprocessors and Peripherals", TMH 3rd

Edition 2007.

Reference Books:

1. Gaonkar, Ramesh S, "Microprocessor Architecture, Programming and Applications with 8085",

Penram International Publishing, 4th Edition 2010.

2. Hall D.V., "Microprocessor Interfacing', TMH

3. Liu and Gibson G.A., "Microcomputer System: The 8086/8088 family", PHI

4. Aditya P. Mathur, "Introduction to Microprocessor", TMH

5. Brey. Barry B, "INTEL Microprocessors", PHI

6. Triebel, 8088 & 8086 Microprocessors Programming, Interfacing, Software, Hardware &

Application, 4th Edition.

ECS-401: COMPUTER ORGANIZATION

L T P

3 1 0

Unit- I 08

Introduction: Number representation; fixed and floating point number representation, IEEE standard for

floating point representation. Error detection and correction codes: Hamming code. Digital computer

generation, computer types and classifications, functional units and their interconnections, buses, bus

architecture, types of buses and bus arbitration. Register, bus and memory transfer.

Unit- II 08

Central Processing Unit: Addition and subtraction of signed numbers, look ahead carry adders.

Multiplication: Signed operand multiplication, Booths algorithm and array multiplier. Division and logic

operations. Floating point arithmetic operation.

Processor organization, general register organization, stack organization and addressing modes.

Unit- III 08

Control Unit: Instruction types, formats, instruction cycles and subcycles (fetch and execute etc), micro-

operations, execution of a complete instruction.

Page 11: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

11

Hardwire and microprogrammed control: microprogramme sequencing, wide branch addressing,

microinstruction with next address field, pre-fetching microinstructions, concept of horizontal and vertical

microprogramming.

Unit- IV 08

Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory

organization. ROM memories.

Cache memories: concept and design issues 9 performance, address mapping and replacement)

Auxiliary memories: magnetic disk, magnetic tape and optical disks

Virtual memory: concept implementation.

Unit- V 08

Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt hardware, types of

interrupts and exceptions.

Modes of Data Transfer: Programmed I/O, interrupt initiated I/O and Direct Memory Access., I/O channels

and processors.

Serial Communication: Synchronous & asynchronous communication, standard communication

interfaces.

Text Books:

1. M. Morris Mano,” Computer System Architecture”, Pearson Education, 3rd

Edition 2008.

Reference Books:

1. William Stalling, “Computer Organization”, PHI, 8th Edition.

2. Patterson, Computer Organisation and Design, Elsevier Pub, Latest edition.

3. John P Hays, “ Computer Organization”, McGraw Hill.

4. Tannenbaum,” Structured Computer Organization‟, PHI.

5. P. Pal chaudhry, „ Computer Organization & Design‟, PHI, 3rd

Edition.

ECS-402: DATA BASE MANAGEMENT SYSTEM

L T P

3 1 0

Unit- I 08

Introduction: An overview of database management system, database system Vs file system, Database

system concept and architecture, data model schema and instances, data independence and database

language and interfaces, data definitions language, DML, Overall Database Structure.

Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram,

mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization,

aggregation, reduction of an ER diagrams to tables, extended ER model, relationship of higher degree.

Unit- II 08

Relational data Model and Language: Relational data model concepts, integrity constraints, entity

integrity, referential integrity, Keys constraints, Domain constraints, relational algebra, relational calculus,

tuple and domain calculus.

Introduction on SQL: Characteristics of SQL, advantage of SQL. SQl data type and literals. Types of

SQL commands. SQL operators and their procedure. Tables, views and indexes. Queries and sub

queries. Aggregate functions. Insert, update and delete operations, Joins, Unions, Intersection, Minus,

Cursors, Triggers, Procedures in SQL/PL SQL.

Unit- III 08

Data Base Design & Normalization: Functional dependencies, normal forms, first, second, third normal

forms, BCNF, inclusion dependence, loss less join decompositions, normalization using FD, MVD, and

JDs, alternative approaches to database design.

Unit- IV 08

Transaction Processing Concept: Transaction system, Testing of serializability, serializability of

schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures, log

based recovery, checkpoints, deadlock handling.

Page 12: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

12

Distributed Database: distributed data storage, concurrency control, directory system.

Unit- V 08

Concurrency Control Techniques: Concurrency control, Locking Techniques for concurrency control,

Time stamping protocols for concurrency control, validation based protocol, multiple granularity, Multi

version schemes, Recovery with concurrent transaction, case study of Oracle.

Text Books:

1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill. 5th edition.

2. Elmasri, Navathe, “ Fudamentals of Database Systems”, Addision Wesley, 5th Edition.

Reference Books:

1. Date C J, “ An Introduction to Database Systems”, Addision Wesley.

2. O‟Neil, Databases, Elsevier Pub.

3. Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications.

4. Majumdar & Bhattacharya, “Database Management System”, TMH.

ECS-403: THEORY OF AUTOMATA AND FORMAL LANGUAGES

L T P

3 1 0

Unit-I 08

Introduction: Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata

(DFA)- Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA,

Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA. Equivalence of

NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other. Myhill-Nerode

Theorem.

Unit-Il 08

Regular expression (RE), Definition, Operators of regular expression and their precedence, Algebraic

laws for Regular expressions Kleen's Theorem, Regular expression to FA, DFA to Regular expression,

Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages. Application of

Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages,

FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and

Limitation of FA.

Unit-III 08

Context free grammar (CFG) and Context Free Languages (CFL): Definition, Examples, Derivation,

Derivation trees, Ambiguity in Grammer, Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless

Symbols, Simplification of CFGs. Normal forms for CFGs: CNF and GNF, Closure properties of CFLs.

Decision Properties of CFLs: Emptiness, Finiteness and Membership, Pumping lemma for CFLs.

Unit-IV 08

Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA,

Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and

CFG, CFG to PDA and PDA to CFG, Two stack PDA.

Unit-V 08

Turing machines (TM): Basic model, definition and representation, Instantaneous Description, Language

acceptance by TM, Variants of Turning Machine, TM as Computer of Integer functions, Universal TM,

Church's Thesis, Recursive and recursively enumerable languages, Halting problem, Introduction to

Undecidability, Undecidable problems about TMs. Post correspondence problem (PCP), Modified PCP,

Introduction to recursive function theory.

Text Book:

1. K.L.P. Mishra and N. Chandrasekaran, "Theory of Computer Science: Automata, Languages and

Computation", PHI, 3rd

Edition.

References Books:

1. Hopcroft, Ullman, "Introduction to Automata Theory, Languages and Computation", Pearson

Education, 3rd

Edition.

Page 13: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

13

2. Krithivasam, “Introduction to Formal Languages, Automata Theory of Computation”.

3. Mad:in J.C., "Introduction to Languages and Theory of Computations" TMH.

4. Papadimitrou, C. and Lewis, C.L "Elements ofthe Fheory of Computation" PHI.

ECS-456: MICROPROCESSOR LAB

L T P

0 0 2

1. To study 8085 microprocessor System.

2. To study 8086 microprocessor System.

3. To develop and run a programme to find out largest and smallest number.

4. To develop and run a programme for converting temperature from F to C degree.

5. To develop and run a programme to compute square root of a gwen number.

6. To develop and run a programme for arranging a sequence of number in ascending and

descending order.

7. To perform interfacing of RAM chip to 8085/8086.

8. To perform interfacing of keyboard controller.

9. To perform interfacing of DMA controller.

10. To perform interfacing of UART/USART.

ECS-452: DBMS LAB

L T P

0 0 2

1. Write the queries for Data Definition and Data Manipulation Language.

2. Write SQL queries using logical operations (=,<,>,etc)

3. Write SQL queries using SQL operators

4. Write SQL query using character, number, date and group functions

5. Write SQL queries for relational algebra

6. Write SQL queries for extracting data from more than one table

7. Write SQL queries for sub queries, nested queries

8. Write programme by the use of PL/SQL

9. Concepts for ROLL BACK, COMMIT & CHECK POINTS

10. Create VIEWS, CURSORS and TRIGGERS & write ASSERTIONS.

11. Create FORMS and REPORTS

Note:

1. The queries to be implemented on DBMS using SQL

2. Students are advised to use Developer 2000/Oracle9i or other latest version for above

experiments.. However student may use Power Builder/SQL SERVER.

Mini Projects may also be planned & carried out throughout the semester to understand important

concepts of database.

ECS-453: COMPUTER ORGANIZATION LAB

L T P

0 0 2

1. Bread Board Implementation of Flip-Flops.

2. Experiments with clocked Flip-Flop.

3. Design of Counters.

4. Bread Board implementation of counters & shift registers.

5. Implementation of Arithmetic algorithms.

6. Bread Board implementation of Adder/Subtractor (Half, Full).

7. Bread Board implementation of Binary Adder.

8. Bread Board implementation of Seven Segment Display.

Page 14: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

14

List of Open Electives for B. Tech. Courses

SCIENCE BASED OPEN ELECTIVE

EOE-O31/EOE-041 Introduction to Soft Computing (Neural Networks, Fuzzy Logic and

Genetic Algorithm)

EOE-032/EOE-042 Nano Sciences

EOE-033/EOE-043 Laser Systems and Applications

EOE-034/EOE-044 Space Sciences

EOE-035/EOE-045 Polymer Science & Technology

EOE-036/EOE-046 Nuclear Science

EOE-037/EOE-047 Material Science

EOE-038/EOE-048 Discrete Mathematics

Page 15: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

15

SCIENCE BASED OPEN ELECTIVES

EOE-031/EOE-041: INTRODUCTION TO SOFT COMPUTING

(Neural Networks, Fuzzy Logic and Genetic Algorithm)

L T P

3 1 0

Unit- I 08

Neural Networks-I (Introduction &Architecture)

Neuron, Nerve structure and synapse, Artificial Neuron and its model, activation functions, Neural

network architecture: single layer and multiplayer feed forward networks recurrent networks. Various

learning techniques; Perception and convergence rule.

Auto-associative and hetro-associative memory.

Unit- II 08

Neural Networks-II (Back propogation networks)

Architecture: perceptron model, solution, single layer artificial neural network, multiplayer perception

model; back propogation learning methods, effect of learning rule co-efficient back propagation algorithm,

factors affecting back propagation training, applications.

Unit- III 08

Fuzzy Logic-I (Introduction)

Basic concepts of fuzzy logic. Fuzzy sets and Crisp sets Fuzzy set theory and operations Properties of

fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp conversion.

Unit- IV 08

Fuzzy Logic-II (Fuzzy Membership, Rules)

Membership functions, interference in fuzzy logic, fuzzy if-then rules, Fuzzy implications and Fuzzy

algorithms, Fuzzyfications & Defuzzifications, Fuzzy Controller, Industrial applications.

Unit- V 08

Genetic Algorithm (GA)

Basic concepts, working principle, procedures of GA, flow chart of GA, Genetic representations,

(encoding) initialization and selection, Genetic operators, Mutation, Generational Cycle, applications.

Text Books:

1. S. Rajsekaran & G A. Vijayalakshmi Pal, “Neural Networks Fuzzy Logic and Genetic Algorithm

Synthesis and Applications" Prentice Hall of India.

2. N.P. Pady, "Artificial Intelligence and Intelligent Systems" Oxford University Press.

Reference Books:

3. Siman Hykin, "Neural Networks' Trentice Hall of India.

4. Timothy J Ross, "Fuzzy Logic with Engineering Applications" Wiley India.

5. Kumar Satish, "Neural Networks" Tata Me Graw Hill.

EOE-032/EOE-042: NANO SCIENCES

L T P

3 1 0

UNIT- I 06

Introduction:

Definition of Nano-Science and Nano Technology, Applications of Nano-Technology

Introduction to Physics of Solid State:

Structure: Size dependence of properties; crystal structures, face centered cubic nanoparticles;

Tetrehedrally bounded semiconductor structures, lattice vibrations.

Energy Bands: Insulators semiconductor and conductors; Reciprocal space Energy bands and gaps of

semiconductors; effective masses; Fermi Surfaces.

Localized Particles: Accepters and deep taps; mobility; Excitons.

UNIT- II 07

Quantum Theory For None Science:

Time dependent and time Independent Schrodinger wave equations.

Page 16: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

16

Particle in a box, Potential step: Reflection and tunneling (Quantum leak). Penetration of Barrier, Potential

box (Trapped particle in 3D: Nanodot), Electron trapped in 2D planef None sheet), Quantum confinerment

effect in nano materials.

Quantum Wells, Wires and Dots

Preparation of Quantum Nanostructure; Size and Dimensionality effect, Formigas Potential wells; Partial

confinement Excitons; Single electron Tunneling, Infrared electors; Quantum dot laser Superconductivity.

Properties of Individual Nano particles

Metal Nano clusters: Magic Numbers: Theoretical Modelling of Nanopraticles, geometric structure;

electronic structure; Reactivity; Fluctuations Magnetic CIusters; Bulle to Nano structure.

Semi conducting Nanoparticles: Optical properties: Photofragmentation: Coulmbic explosion

Rare Gas & Molecular Clusters: Inert gas clusters Superfluid clusters molecular clusters.

UNIT- III 08

Growth Techniques of Nanomaterials:

Lithographic and Nonlithographic techniques, Sputtering and film deposition in glow discharge, DC

sputtering technique (p-CuAIO2 deposition). Thermal evaporation technique, E-beam evaporation,

Chemical Vopour deposition (CVD), Synthesis of carbon nano-fibres and multi- walled carbon nanotubes.

Pulsed Laser Deposition Molecular beam Epitoxy. Sol-Gel Technique (No chemistry required), Synthesis

of nanowires/rods Electrodeposition, Chemical bath deposition, Ion beam deposition system. Vapor-

Liquid-Solid (VLS-) method of nanowires.

UNIT- IV 08

Methods of Measuring Properties:

Structure: Crystallography particle size determination surface structure.

Microscopy: Scanning Prob Microscopy (SPM), Atomic Force Microscopy (AFM), Field Ion Microscopy,

Scanning Electron Microscopy, Transmission Electron Microscopy (TEM).

Spectroscopy: Infra red and Raman Spectroscopy, X-ray Spectroscopy, Magnetic resonance Optical

and Vibrational Spectroscopy Luninscence.

UNIT- 5 07

Buckey Ball:

Nano structures of carbon (fullerene):

Carbon nano-tubes: Fabrication, structure, electrical, mechanical and vibrations properties and

applications.

Nano diamond. Boron Nitride Nano-tubes, single electron transistors Molecular machine Nano-

Biometrics, None Robots.

Text/Reference Books:

1. C.P. Peele, Jr. F. J. Owens, “lntroduction to Nanotechnology”.

2. “Introduction to S.S. Physis”- (latest edn.)Wiley.

3. S. Sunganp & H. Koizuoni, “Microcluster Physics”-Springor .

4. “Hanboole of Nanostructured Materials & Nanotechnology” vol. 5, Academic Press.

5. A.K. Bandyopadhyay, “Nano Materials” New Age International.

EOE-033/EOE-043: LASER SYSTEMS AND APPLICATIONS

L P T

3 1 0

UNIT- I & II 15

Introduction: Review of elementary quantum physics. Schrödinger equation concept of coherence,

absorption spontaneous emission and stimulated emission processes, relation between

Einstein's A and B coefficients population inversion, pumping, gain, optical cavities.

UNIT- III & IV 18

Lasers & Laser Systems: Main components of Laser, principle of Laser action introduction to general

lasers and thelr types. Three & four level Lasers, CW & Pulsed Lasers, atomic, ionic, molecular, excimer,

liquid and solid state Lasers and systems, short pulse generation and Measurement.

Page 17: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

17

UNIT- V 07

Applications: Laser applications in medicine and surgey, materials processing optical communication,

metrology and LIDAR and holography.

Text/ Reference Books:

1. K.R. Nambiar, “Laser Principles, Types and Application”, New Age International.

2. S.A. Ahmad, “Laser concepts and Applications”, New Age International.

EOE-034/EOE-044: SPACE SCIENCES

L P T 3 1 0

UNIT- I 04

Introduction: Introduction to space science and applications, historical development.

UNIT- II 12

Solar System: Nebular theory of formation of our Solar System. Solar wind and nuclear reaction as the

source of energy.

Sun and Planets: Brief description about shape size, period of rotation about axis and period of

revolution, distance of planets from sun, Bode's Law, Kepler's Laws of planetary motion, Newton's

deductions from Kepler's laws Newton's Law of gravitation correction of Kepler's third law, detenuination

of mass of earth, determination of mass of planets with respect to earth. Brief description of Asteroids,

Satellites and Comets.

UNIT- III 10

Stars: Stellar spectra and structure stellar evolution, nucleosynthesis and formation of elements.

Classification of stars: Harvard classification system Hertzsprung-Russel diagram Luminosity of star,

variable stars; composite stars (white dwarfs Neutron stars, black hole, star clusters, supernova and

binary stars); Chandrasekhar limit.

UNIT- IV 06

Galaxies: Galaxies and their evolution and origin, active galaxies and quasars.

UNIT- V 08

Creation of Universe: Early history of the universe, Big-Bang and Hubble expansion model of the

universe cosmic microwave background radiation, dark matter and dark energy.

Text Books/Reference Books:

1. K.S. Krishnaswami, "Astrophysics Amodern Perspective”, New Age International.

2. K.S. Krishnaswami, “Understanding cosmic Panorama”, New Age International.

EOE-035/EOE-045: POLYMER SCIENCE AND TECHNOLOGY

L T P 3 1 0

UNIT- I & II 18

POLYMERS:

Introduction, chemistry of polymer synthesis, polymer reaction kinetics, physical properties and

characterization of polymers, effect of structure on properties of polymers, organic polymers. Introduction

to high performance polymers and composites and their processing.

UNIT- III & IV 13

POLYMERIZATION:

Introduction, step-growth polymerization, free radical chain growth polymerization, emulsion

polymerization, ionic and cationic polymerization, chain statistics and rubber elasticity.

UNIT- V & VI 09

PREPARATION AND APPLICATIONS:

Preparation, properties and technical applications of thermo-plastics (PVC, PVA), thermostats (PF, UF)

and elastomers(SBR, GR-N), silicones, Application of polymers in space, ocean, electronics, medical,

agriculture, automobile, sports and building construction.

Page 18: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

18

EOE-036/EOE-046: NUCLEAR SCIENCE

L T P

3 1 0

UNIT- I 08

Nucleus and Its Basic Features:

Nuclear structure; nuclear forces and their properties, nuclear stability nuclear radius and its

measurement, nuclear spin, nuclear magnetic and electrical moments.

UNIT- II 08

Nuclear models:

Single particle model liquid drop model and semi-emperical mass formula nuclear potential and shell

model collective model.

UNIT-Ill 08

Nuclear Reaction:

Nuclear reaction and laws of conservation, Types of nuclear reaction mechanism of nuclear reaction,

nuclear fission & binuclear fusion and their explanation by liquid drop model.

UNIT-IV 08

Nuclear Decay:

Decay constant, half life period and mean life alpha decay, beta decay, gamma decay, interaction of

nuclear radiation with matter.

Nuclear Instruments-I

Mass spectrograph: General principle, Aston's Mass Spectrograph.

UNIT-V 08

Nuclear Instruments-Il

Accelerators: Van de Graph Generator Cyclotron Synchrotron.

Detectors:

G.M. Counter, Scintillation counter, cloud chamber Bubble Chamber, production and detection of

neutrons and Gamma-photon.

Application of Nuclear Techniques: Nuclear magnetic resonance, position emission topography,

radiotracer techniques and applications in material science and agriculture.

Text Books:

1. Tayal, “Nuclear Physics” Himalaya Publishing House.

2. S.N. Ghosal, “Nuclear Physics” S. Chand & Co.

3. S. B. Patel, “Nuclear Physics: An introduction”, New Age International.

4. H. B. Lai, “Introductory Nuclear Physics", United Book Depot.

5. Wang “Introductory Nuclear Physics”, PHI Learning.

Reference Books:

1. Roy & Nigam, “Nuclear Physics”, John Wiley & sons.

2. W.E. Burcham, “Nuclear Physics", Longmans Publications.

3. Green, "Nuclear Physics", McGraw Hill.

EOE-037/EOE-047: MATERIAL SCIENCE

L T P

3 1 0

UNIT- I 07

Introduction:

Historical perspective, importance of materials Brief review of & atomic concepts in Physics and

Chemistry Atomic models. Periodic table Chemical Wading.

Crystallography and imperfections:

Concept of unit cell, space lattice. Bravais lattices common crystal structures. Ammic packing factor and

density, Miller indices. X-ray crystallography techniques, imperfections. Defects & Dislocations in solids.

Page 19: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

19

UNIT- II 06

Mechanical Properties and Testing: Stress strain diagram. Ductile and brittle materials sirenss strength,

toughness, hardness, fracture, fatigue and creep Testing, such as Strength testing. Hardness testing,

Impact testing. Fatique testing, Creep testing, Non-destructive testing (NDT).

Micro Structural Exam: Microscope principle and methods. Preparation of sample and microstructure

exam and grain size determination, comparative study of microstructure of various metals and alloys,

such as Mild steel. CI, Brass.

Phase Diagram and Equilibrium Diagram: Uniary and Binary diagrams, Phase rules Types of

equilibrium diagrams; solid solution type, eutectic type and combination type Iron-carbon equilibrium

diagram.

UNIT- III 08

Ferrous materials: Iron and steel manufacture furnaces, various types of carbon steels alloy steels and

cast irons its properties and uses.

Heat Treatment: various types of heat treatment such as Annealin9, Normalizing Quenching, Tempering

and Case hardening. Time Temperature Transformation (TTT) diagrams.

Non-Ferrous metals and alloys: Non-ferrous metals, such as Cu, Al, Zn, Cr, Ni etc. and its applications.

Various types of Brass, Bronze bearing materials their properties and uses Aluminium alloys, such as

Duralumin, Other advanced materials/alloys.

UNIT- IV 07

Magnetic properties: Concept of magnetism- Dia, para, ferro magnetic materials. Hysteresis, Soft and

hard magnetic materials, Magnetic Storages.

Electric Properties: Energy band, concept of conductor, insulator and semi conductor, intrinsic and

extrinsic semi-conductors. Basic devices and their applications, diffusion of Solid.

Super conductivity and its applications, Messier effect. Type I & II superconductors. High Temp,

superconductors.

UNIT– V 09

Ceramics: Structure, types, properties and applications of ceramics Mechanical/Electrical behaviour and

processing of ceramics.

Plastics: Various types of polymers/plastics and their applications Mechanical behaviour and processing

of plastics, Future of plastics.

Other Materials: Brief description of other materials, such as optical and thermal materials, concrete,

composite materials and their uses.

Performance of materials in service: Brief theoretical consideration of fracture, fatique, and corrosion

and its control.

Text/Reference Books:

1. W.D. Callisster Jr. “Material Science & Engineering Addition"- Westy Publishing Co.

2. Van Vlash, "Elements of Material Science & Engineering", John Wiley & Sons

3. V. Raghvan, "Material Science", Prentic Hall of India.

4. Narula, "Material Science", Tata Mc. Graw Hilt

5. Srivastava, Srinivasan, "Science of Materials Engineering" New Age International.

EOE-038/EOE-048: DISCRETE MATHEMATICS

L T P 3 1 0

UNIT- I 10

Set Theory: Definition of Sets, Venn Diagrams, complements, Cartesian products, power sets, counting

principle, cardinality and countability (Countable and Uncountable sets), proofs of some general identities

on sets, pigeonhole principle.

Relation: Definition, types of relation, composition of relations, domain and range of a relation; pictorial

representation of relation, properties of relation, partial ordering relation.

Function: Definition and types of function, composition of functions, recursively defined

functions.

UNIT- II 08

Page 20: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

20

Propositional logic: Proposition logic, basic logic, logical connectives, truth tables, tautologies,

contradiction, normal forms (conjunctive and disjunctive), modus ponens and modus tollens, validity,

predicate logic, universal and existential quantification. Notion of proof; proof by implication, converse,

inverse, contrapositive, negation, and contradiction, direct proof, proof by using truth table, proof by

counter example.

UNIT- III 08

Combinatories: Mathematical induction, recursive mathematical definitions, basics of counting,

permutations, combinations, inclusion-exclusion, recurrence relations (Nth order recurrence relation with

constant coefficients, Homogeneous recurrence relations Inhomogeneous recurrence relation),

generating function (closed form expression, properties of G. F., solution of recurrence relation using G.F.

UNIT- IV 07

Algebraic Structure: Binary composition and its properties definition of algebraic structure, Groyas Semi

group, Monoid Groups, Abelian Group, properties of groups, Permutation Groups, Sub-Group, Cyclic

Group, Rings and Fields (definition and standard results).

UNIT- V 07

Graphs: Graph terminology, types of graph, connected graphs, components of graph. Euler graph

Hamiltonian path and circuits, Graph coloring, Chromatic number.

Tree: Definition, types of tree (rooted, binary), properties of trees binary search tree, tree traversing

(preorder, inorder, postorder).

Text Books:

1. “Discrete Mathematics”, Schaum‟s Series, TMH.

Reference Books:

1. Kenneth H. Rosen, "Discrete Mathematics and its Applications” Mc. Graw Hill, 2002.

2. J.P. Tremblay & R Manohar, "Discrete Mathematical Structure with Applications to Computer

Science" Mc. Graw Hill, 1975.

3. V. Krishnamurthy, "Combinatories: Theory and Applications", East West Press.

4. Seymour Lipschutz, MXipson, "Discrete Mathematics" Tata Mc. Graw Hill, 2005.

5. Kolman, Busby Ross, "Discrete Mathematical Structures”, Prentice Hall International.

EHU-301/EHU-401: INDUSTRIAL PSYCHOLOGY

L T P 2 0 0

Unit- I 07

Introduction to Industrial Psychology-Definitions & Scope. Major influences on industrial Psychology-

Scientific management and human relations schools Hawthorne Experiments.

Unit- II 06

Individual in Workplace

Motivation and Job satisfaction, stress management. Organizational culture, Leadership & group

dynamics.

Unit- III 07

Work Environment & Engineering Psychology-fatigue. Boredom, accidents and safety Job Analysis,

Recruitment and Selection-Reliability & Validity of recruitment tests.

Unit- IV 06

Performance Management: Training & Development.

References Books:

1. Miner J.B. (1992) Industrial/Organizational Psychology, N.Y.: McGraw Hill.

2. Blum & Naylor (1982) Industrial Psychology. Its Theoretical & Social Foundations CBS

Publication.

3. Aamodt, M.G. (2007) industrial/Organizational Psychology: An Applied Approach (5th edition)

Wadsworth/Thompson:Belmont, C.A.

Page 21: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

21

4. Aswathappa K (2008). Human Resource Management (fifth edition) New Delhi: Tata McGraw

Hill.

EHU-302/EHU-402: INDUSTRIAL SOCIOLOGY

L T P

2 0 0

Unit- I 06

Industrial Sociology: Nature and Scope of Industrial Sociology-Development of Industrial Sociology.

Unit- II 07

Rise and Development of Industry: Early Industrialism- Type of Productive Systems- The Manorial or

feudal system The guild system- The domestic or putting- out system- and the factory system-

Characteristics of the factory system-causes and Consequences of industrialization.

Unit-III 06

Industrialization in India. Industrial Poling Resolutions-1956.

Unit-IV 07

Contemporary Issues: Grievances and Grievance handling Procedure.

Industrial Disputes: Courses, strikes & lockouts, Industrial Relation Machinery Bipartite & Tri-partite

Agreement, Labour courts & Industrial Tribunals, Code of Discipline, Standing order.

References Books:

1. GISBERT PASCAL, Fundamentals of Industrial sociology, Tata McGraw Hill Publishing Co. New

Delhi, 1972.

2. SCHNEIDER ENGNO V., Industrial Sociology 2nd

Edition, McGraw Hill Publishing Co., New

Delhi, 1979.

3. MAMORIA C.B. And Mamoria S., Dynamics-of Industrial Relation in India.

4. SINGH G.P. and P.R.N. SINHA, Industrial Relations and Labour Legislations, New Delhi, Oxford

and IBH Publishing Co., 1977.

EHU-111: HUMAN VALUES & PROFESSIONAL ETHICS

L T P 2 0 2

Total no. of Lectures : 28

Total no. of Practical Sessions : 14 (of 2hrs each)

Content for Lectures:

Module 1: Course Introduction – Need, Basic Guidelines, Content and Process for Value

Education. [6]

1. Understanding the need, basic guidelines, content and process for Value Education

2. Self Exploration – What is it? – Its content and process; „Natural Acceptance‟ and Experiential

Validation – As the mechanism for self exploration

3. Continuous Happiness and Prosperity – A look at basic Human Aspirations

4. Right understanding, Relationship and Physical Facilities – the basic requirements for fulfillment

of aspirations of every human being with their correct priority

5. Understanding Happiness and Prosperity correctly – A critical appraisal of the current scenario

6. Method to fulfill the above human aspirations: understanding and living in harmony at various

levels

Module 2: Understanding Harmony in the Human Being – Harmony in Myself? [6]

7. Understanding human being as a co-existence of the sentient „I‟ and the material „Body‟

8. Understanding the needs of Self („I‟) and „Body‟ – Sukh and Suvindha

9. Understanding Body as an instrument of „I‟ (I being the doer, seer and enjoyer)

Page 22: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

22

10. Understanding the characteristics and activities of „I‟ and harmony in „I‟

11. Understanding the harmony of I with the Body: Sanyam and Swasthya; correct appraisal of

Physical needs, meaning of Prosperity in detail

12. Programs to ensure Sanyam and Swasthya – Practice Exercises and Case Studies will be taken

up in Practice Sessions.

Module 3: Understanding Harmony in the Family and Society – Harmony in Human – Human

Relationship [6]

13. Understanding harmony in the Family - the basic unit of human interaction

14. Understanding values in human – human relationship; meaning of Nyaya and program for its

fulfillment to ensure Ubhay-tripti; Trust (Vishwas) and Respect (Samman) as the foundational

values of relationship

15. Understanding the meaning of Vishwas; Difference between intention and competence

16. Understanding the meaning of Samman, Difference between respect and differentiation; the

other salient values in relationship

17. Understanding the harmony in the society (society being an extension of family): Samadhan,

Samridhi, Abhay, Sah-astitiva as comprehensive Human Goals

18. Visualizing a universal harmonious order in society – Undivided Society (Akhand Samaj),

Universal Order (Sarvbhaum Vyawastha) – from family to world family!

– Practice Exercises and Case Studies will be taken up in Practice Sessions.

Module 4: Understanding Harmony in the Nature and Existence – Whole existence as Co-

existence [4]

19. Understanding the harmony in the Nature

20. Interconnectedness in the mutual fulfillment among the four orders of nature – recyclability and

self-regulation in nature

21. Understanding Existence as Co-existence (Sah-astitva) of mutually interacting units in all-

pervasive space

22. Holistic perception of harmony at all levels of existence – Practice Exercises and Case Studies

will be taken up in Practice Sessions.

Module 5: Implications of the above Holistic Understanding of Harmony on Professional Ethics

[6]

23. Natural acceptance of human values

24. Definitiveness of Ethical Human Conduct

25. Basic for Humanistic Education, Humanistic Constitution and Humanistic Universal Order

26. Competence in professional ethics:

(a) Ability to utilize t he professional competence for augmenting universal human order,

(b) Ability to identify the scope and characteristics of people- friendly and eco-friendly

production systems,

(c) Ability to identify and develop appropriate technologies and management patterns for

above production systems.

27. Case studies of typical holistic technologies, management models and production systems

28. Strategy for transition from the present state to Universal Human Order:

(a) At the level of individual: as socially and ecologically responsible engineers, technologists

and managers,

(b) At the level of society: as mutually enriching institutions and organizations.

Text Book:

1. R. R. Gaur, R. Sangal, G.P. Bagaria, 2009, A Foundation Course in Value Education.

Reference Books:

1. Ivan Illich, 1974, Energy & Equity, The Trinity Press , Worcester, and HarperCollins, USA

Page 23: TABLE OF CONTENTS - ngbu 2nd Year CS Branch Syllabus.pdf · Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures Using C and C++” , ... 2nd Edition. 5

23

2. PL Dhar, RR Gaur, 1990, Science and Humanism, Commonwealth Purblishers.

3. A.N. Tripathy, 2003, Human Values, New Age International Publishers.

4. E.G. Seebauer & Robert L. Berry, 2000, Fundamentals of Ethics for Scientists & Engineers,

Oxford University Press

5. M. Govindrajran, S. Natrajan & V.S. Senthil Kumar, Engineering Ethichs (including Human

Values), Eastern Economy Edition, Prentice Hall of India Ltd.

Relevant CDs, Movies, Documentaries & Other Literature:

1. Value Education website, http://www.uptu.ac.in

2. Story of Stuff, http://www.storyofstuff.com

3. Al Gore, An Inconvenient Truth, Paramount Classics, USA

4. Charlie Chaplin, Modern Times, United Artists, USA

5. IIT Delhi, Modern Technology - The Untold Story

***