Course Name: PHYSICS - II Course Code: PY 201 Pre-requisite: PY 101 Lecture-wise breakup

Credits:

L T P:

4 0 0

(No. of Lectures)

1. QUANTUM MECHANICS & ATOMS Quantum theory of light, X-rays production, spectrum & diffraction (Braggs law), photoelectric effect, Compton effect, pair production, photons & gravity, black holes, deBroglie hypothesis, particle diffraction, uncertainty principle and applications (7) Postulates of quantum mechanics, Schrodinger theory, time-dependent and timeindependent Schrodinger equation, wave function, Born interpretation and normalization, expectation values (3) Particle in a box (infinite potential well), finite potential step and barrier problems, tunneling, linear harmonic oscillator (one-dimensional) (4) Hydrogen atom, radiative transitions and selection rules, electron spin, Stern-Gerlach experiment, Spin-orbit coupling, exclusion principle, symmetric and antisymmetric wavefunctions (6) ADDITIONAL TOPICS FOR HONOURS STUDENTS: -decay, Zeeman effect, Correspondence Principle, Angular Momentum in Quantum Mechanics 2. NUCLEAR PHYSICS Natural radioactivity, successive radioactive transformations, radioactive equilibrium, radioactive series, radiometric dating (3) Nuclear force and its characteristics, Elementary description of shell model, explanation of magic numbers, liquid drop model and semi-empirical binding energy formula (3) Nuclear fission, fission products, mass and energy distribution of fission products, neutron emission and energy distribution of neutrons emitted in fission, theory of fission process, nuclear reactors classification, neutron cycle in thermal reactors and fourfactor formula for neutron reproduction, nuclear fusion controlled thermonuclear reactions. (5) ADDITIONAL TOPICS FOR HONOURS STUDENTS: Artificial radioactivity and its applications, -decay (energy spectrum & discovery of neutrino), Fusion Reactions in stars 3. STATISTICAL PHYSICS Maxwell-Boltzmann statistics, molecular energies in an ideal gas, Bose-Einstein and Fermi-Dirac statistics, black body radiation, Rayleigh-Jeans and Plancks radiation laws, free electrons in a metal, electron-energy distribution, Fermi energy, electronic specific heat, conduction in metals, thermionic emission (9) ADDITIONAL TOPICS FOR HONOURS STUDENTS: Specific heat of solids, Bose-Einstein condensation

4. SOLIDS AND SEMICONDUCTOR PHYSICS Band theory of solids, Kronig-Penney Model (qualitative), conductors, insulators and semiconductors, p-type and n-type semiconductors, statistics of electrons and holes, Hall effect (for single as well as both type of charge carriers) (5) ADDITIONAL TOPICS FOR HONOURS STUDENTS: p-n junction, rectifier, LED, tunnel diode 5. SUPER CONDUCTIVITY Occurrence, destruction of super conductivity, Meissner effect, type I and type II Super-conductors; heat capacity, isotope effect, thermodynamical considerations, London equations & penetration depth, coherence length, BCS theory (elementary description), applications of superconductors. (5) ADDITIONAL TOPICS FOR HONOURS STUDENTS: High temperature superconductivity, Josephson junctions TEXT BOOK: Concepts of Modern Physics, by Arthur Beiser (McGraw-Hill)

REFERENCE BOOKS: 1. Nuclear Physics, by I. Kaplan (Addison-Wesley) 2. Solid State Physics, by C. Kittel (Wiley Eastern) 3. Solid State Physics, by S.O. Pillai (New Age International) 4. Introduction to Modern Physics, by Richtmyer, Kennard & Cooper ( McGraw Hill) 5. Introduction to Modern Physics, by Mani & Mehta (East West Press) Modern Physics, by Bernstein, Fishbane & Gasiorowicz (Pearson Education)

Course Name: Course Code: Pre-requisite:

PHYSICS LAB PY 202 None Credits: 2 L T P: 0 0 3

Lecture-wise breakup TWELVE EXERCISES OUT OF THE FOLLOWING:

(No. of Lectures)

1. Familiarization with various measuring instruments Vernier calipers, screw gauge, spherometer, spectrometer etc. 2. To find the wavelength of sodium light using Fresnels biprism. 3. (i) To determine the wavelength of He-Ne laser using transmission grating. (ii) To determine the slit width using the diffraction pattern. 4. To determine the wave length of sodium light by Newtons rings method. (3)

(3) (3)

(3)

5. To determine the wave length of sodium light using a diffraction grating. (3) 6. To find the specific rotation of sugar solution using a Bi-quartz Polarimeter. (3) 7. To find the energy band gap of the given semiconductor by four probe method. (3) 8. To find the angle of prism and the angle of minimum deviation with the help of a spectrometer, and hence to determine the refractive index of the material of the prism. (3) 9. To design a method to draw equipotential lines with various geometries of electrodes kept at different potentials. (3) 10. To study the Hall effect of a given semiconductor. 11. To determine the dielectric constant of the given materials. 12. To study the photoelectric effect. 13. To study the B-H curve of the ferromagnetic materials. (3) (3) (3) (3)

14. To design a hollow prism and used it find the refractive index of a given liquid. (3) TEXT BOOKS: 1. Practical Physics, by Gupta & Kumar (Pragati Prakashan) 2. B.Sc. Practical Physics, by C.L.Arora (S. Chand)

Course Name: DATA STRUCTURES Course ID: IT 210/210H L T P: 4 0 0

Design Points: 02 No. Lectures

Unit - I Introduction: Basic Terminology, Elementary Data Organization, Structure operations, Algorithm Complexity and Time-Space trade-off. (04) Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation, application of arrays, Character String in C, Character string operation, Array as Parameters, Ordered List, Sparse Matrices and Vectors. (04) Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack, Linked Representation of Stack, Operations Associated with Stacks, Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack, Applications of recursion in problems like Tower of Hanoi. (08)

UNIT - II Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, D-queues and Priority Queues. (06) Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and Compaction. (06) UNIT III Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, Traversing Threaded Binary trees, Huffman algorithm. (06) Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. (04) UNIT IV Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on Different Keys, Practical consideration for Internal Sorting. (04) Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm, Path Length, AVL Trees, B-trees. (04) UNIT - V Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees. (04) File Structures: Physical Storage Media File Organization, Organization of records into Blocks, Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Tree index Files, Indexing and Hashing Comparisons. (06)

IT 210H The students opting for honour course shall be given advanced problems based course contents covered. In addition they shall be required to solve real/ practical problem in the existing systems. Text Books: 1. Horowitz and Sahani, Fundamentals of data Structures, Galgotia Publication Pvt. Ltd., New Delhi. 2. R. Kruse etal, Data Structures and Program Design in C, Pearson Education Asia, Delhi- 2002 3. A. M. Tenenbaum, Data Structures using C & C++, Prentice-Hall of India Pvt. Ltd., New Delhi. Reference Books: 1. K Loudon, Mastering Algorithms with C, Shroff Publisher & Distributors Pvt. Ltd.

2. Bruno R Preiss, Data Structures and Algorithms with Object Oriented Design Pattern in C++, Jhon Wiley & Sons, Inc. 3. Adam Drozdek, Data Structures and Algorithms in C++, Thomson Asia Pvt. Ltd.(Singapore)

COURSE NAME COURSE CODE CREDITS LTP

: : : :

COMPUTER ARCHITECTURE & ORGANIZATION IT 211 4 400

LECTURE WITH BREAKUP WITH NO. OF LECTURES: BASICS (07) Introduction to number system, Various codes like BCD, Gray codes, Basic gates and truth tables, introduction to computers with block diagrams, Impact of technology. LOGIC DESIGN TECHNIQUES (08) Designing combinational logic using Karnaughs maps with building blocks of basic gates, Mulitplexers, de-multiplexers, decoders, encoders, arithmetic/logic unit, instruction codes, computers registers and instructions, timing, and control, instructions cycle, memory reference instruction, I-O interruption Basic sequential logic blocks of flip-flops, registers, shift registers and counters, Finite state Machine using state tables COMPUTER ARITHMETIC (06) Adder and subtractor circuits, Booth Multiplication Algorithm, Performance bench marks. CONTROL PATH DESIGN (06) Sequence counter method, Micro programmed controllers address sequencing, symbolic microinstructions. CENTRAL PROCESSING UNIT (07) Registers General register organization, stack organization, instructions formats, address instructions, addressing modes, data transfer and manipulations, program control, RISC instruction set design, three address instructions and arithmetic pipelines with example of floating point adder, instructions pipelines , advanced pipelining using instruction level parallelism MEMORY ORIGINATION (06) Memory device characteristics, random access memory, serial access memory, virtual memory, associative memory, cache memory, memory management hardware. I/O ORGANIZATION (04) I/O interface asynchronous data transfer, DMA interrupt, I/O processor BOOK: 1.M. Morris Mano, Computer system & Architecture PHI REFERENCES: 1. Hayes .J.P, Computer architecture and organization,

2.M.Morris and Charles R. Kinre , Logic and computer design Fundamentals . PHI 1995

IT 211H, COMPUTER ARCHITECTURE & ORGANIZATION Overview of Computer Architecture, Taxonomy of MIMD Computers, Multi-vector and SIMD, Computers, Vector Supercomputers SIMD Supercomputers, Superscalar Processors, The VLIW Architecture, Vector and Symbolic processors

COURSE NAME COURSE CODE CREDITS LTP

: : : :

DESIGN AND ANALYSIS OF ALGORITHMS IT 212 04 400 NO. OF LECTURES

LECTURE WISE BREAKUP

BASIC CONCEPTS OF ALGORITHMS (8) Introduction Notion of Algorithm Fundamentals of Algorithmic Solving Important Problem types Fundamentals of the Analysis Framework Asymptotic Notations and Basic Efficiency Classes. MATHEMATICAL ASPECTS AND ANALYSIS OF ALGORITHMS (6) Mathematical Analysis of Non-recursive Algorithm Mathematical Analysis of Recursive Algorithm ANALYSIS OF SORTING AND SEARCHING ALGORITHMS (8) Brute Force Selection Sort and Bubble Sort Sequential Search and Brute-force string matching Divide and conquer Merge sort Quick Sort Binary Search Binary treeTraversal and Related Properties Decrease and Conquer Insertion Sort Depth first Search and Breadth First Search. ALGORITHMIC DESIGN TECHNIQUES Greedy approach- knapsack problem, minimum cost spanning trees, shortest path Problem (4) Divide and conquer- General Method, Strassens Matrix multiplication. (4) Dynamic programming- knapsack problem, traveling salesperson problem, shortest path problems (4) Backtracking- N-queens problem, knapsack problem (6) Branch and Bound- knapsack problem, traveling salesperson problem. (4) LIMITATIONS OF ALGORITHM POWER Lower Bound Arguments Decision Trees P,NP and NP Complete problems (6)

BOOKS: 1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, PHI 2. Fundamentals of Computer Algorithms,Horowitz and Sahni, Galgothia publications. REFERENCES: 1. Sara Baase and Allen Van Gelder, Computer Algorithms - Introduction to Design and Analysis, Pearson Education Asia, 2003. 2. A.V.Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis Of Computer Algorithms, Pearson Education Asia, 2003

COURSE NAME COURSE CODE CREDITS LTP

: : : :

DIGITAL ELECTRONICS AND DESIGN ENN 207 04 4 00 NO. OF LECTURES

LECTURE WISE BREAKUP

BINARY SYSTEMS (3) Digital Systems, Binary Numbers, Number Base Conversions, Octal And Hexadecimal Numbers, Complements, Signed Binary Numbers, Binary Codes, Binary Storage Registers and , Binary logic. BOOLEAN ALGEBRA AND LOGIC GATES (3) Basic Definitions, Axiomatic Definition Of Boolean Algebra, Basic Theorems And Properties Of Boolean Algebra, Boolean Functions, Canonical And Standard Forms, Other Logical Operations, Digital logic gates, Integrated circuits. GATE LEVEL MINIMIZATION (3) The Map Method, Four-Variable Map, Five-Variable Map, Product Of Sums Simplification, DontCare conditions, NAND and NOR Implementation. COMBINATIONAL LOGIC (3) Combinational Circuits, Analysis Procedure, Design Procedure, Binary AdderSubstractor, Decimal Adder, Binary Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers. SYNCHRONOUS SEQUENTIAL LOGIC (4) Sequential Circuits, Latches, Flip-Flops, Analysis Of Clocked Sequential Circuits, State Reduction And Assignment, Design Procedure. REGISTERS AND COUNTERS (5) Registers, Shift Registers, Ripple Counters, Synchronous Counters, Other Counters MEMORY AND PROGRAMMABLE LOGIC (5) Introduction, Random-Access Memory, Memory Decoding, Error Detection And Correction, Read-Only Memory, Programmable Logic Array, Programmable Array Logic, Sequential programmable Devices. ASYNCHRONOUS EQUENTIAL LOGIC (5) Introduction, Analysis Procedure, Circuits With Latches, Design Procedure, Reduction

Of State And Flow Tables, Race- Free State Assignment, Hazards, Design Example. DIGITAL INTEGERATED CIRCUITS (5) Introduction, Special Characteristics, Bipolar- Transistor Characteristics, RTL And DTL Circuits, Transistor-Transistor Logic, Emitter-Coupled Logic, Metal- Oxide Semiconductor, Complementary MOS, CMOS Transmission Gate Circuits, SwitchLevel Modeling. BOOK: 1. Mano, M. Morris, Digital Design, Third Edition, Pearson Education, Singapore, 2002 REFERENCES: 1. Floyd, Thomas L., Digital Fundamentals, Seventh Edition, Pearson Education, Singapore, 2002 2. Gothmann, William H., Digital Electronics, Second Edition, PHI, New Delhi, 2000 3. Jain, R.P., Modern Digital Electronics, Third Edition, TMH, New Delhi, 2003 4. B Holdsworth, Digital Logic Design, Second Edition, TMH, New Delhi, 1991. 5. Nripendran N. Biswas, Logic Design Theory, PHI, New Delhi, 1993 6. Leach, D. P., Albert P. Malvino, Digital Principles and Applications, Fifth Edition, TMH, 1995 Course Name : SIGNALS AND SYSTEMS Course Code : ENN 203 Credits : 4 LTP : 400 Rationale: After going through this course students would be able to analyze signals for communication systems in time and frequency domain. It would enable them to troubleshoot the communication systems hence with. Lecture wise break up No of Lectures SIGNALSAND SYSTEMS (05) Signals and their classification, size of the signal, continuous and discrete time signals, Systems and their classification, signal operations on elementary CT/DT signals: Shifting, flipping, multiplication, addition, modulation, windows and pulse, Impulse. Continuous and discrete time systems and their applications. FOURIER SERIES (09) Overview of trigonometric, compact and exponential fourier series, Fourier spectrum of signals, properties of fourier series components, distribution of average power in frequencies, parsevals theorem. FOURIER TRANSFORM (15) Aperiodic signal representation by Fourier integral, concept of continuous and discrete spectrum, essential and absolute bandwidth, convolution, correlation, auto-correlation and cross-correlation and their properties, energy spectral density, power spectral density,

calculation of the energy and power signal respectively, sampling theorem, properties of Fourier transform and applications RANDOM SIGNAL THEORY AND NOISE (12) Sample space, random variables-discrete and continuous variable, conditional probability, probability density function, cumulative density function and their properties, noise and its types, white noise, noise calculations, noise figure and its calculations for cascaded networks, nose equivalent temperature, optimum detection and matched filters. INFORMATION THEORY (09) Concept of information, entropies of discrete system, rate of transmission-redundancy, efficiency and information rate, channel capacity theorem, source encoding including Huffman encoding, Shannon coding theorem, comparisons of analog and digital communication systems on the basis of the ideal channel capacity theorem. BOOK: 1. Modern Digital & Analog Communication Systems by B.P.Lathi, pub. Oxford Univ. Press, 3rd Edition

REFERENCES:

Signal And System by M.J.Robert, TMH, Third Edition. Signals and systems by A.V.Oppenheim & A.S. willisky, 2nd edition, Pearson education. Introduction to Communication Theory by P.D. Sharma Signals and systems by HAWI.P. HSU, Schaum Series by TMH