Advanced Microprocessors & Peripherals

CS010 506: Advanced Microprocessors & Peripherals

SYLLABUS

 Module I (15 hours):

8086 Architecture, Block diagram – Addressing modes – Instructions set of 8086 – data transfer – arithmetic – branch – loop – flag manipulation – shift & rotate – string instructions – writing simple program in 8086.

Module II (9 hours):

Additional features of 80286 – protected mode memory addressing – Additional features of 80386 – Paging mechanism (Flat memory model) – Additional features of Pentium Processors – Brief study of latest processors of Intel & AMD – Dual core processor(Brief idea only) .

Note: Architecture not required for the processors discussed in this module.

Module III: Peripherals (11 hours):

Study of motherboards – Different types of ports, slots and connectors – Processor Bus, AGP, PCI – Add-on cards – USB – Hard Disk Interfaces – IDE, ATA, Power supply – SMPS – function & operations.

Module IV: Storage Devices (15 hours):

Magnetic data storage: Principles – Hard disks – Cylinders – Clusters – Tracks and Sectors – Disk formatting – Partitioning – Hard disk drive operation – Data Transfer rates – Data addressing – CHS addressing – Logical Block Addressing.

Optical storage: CD Technology, CD ROM, CD-R, CD-RW, Interface – Magneto optical

drives – DVD – RAID – Blu-ray disc.

Module V (10 hours):

Memory: Parity – ECC – Memory Addressing – 640 KB barrier – Extended and Expanded memory – HMA – Video memory – Flash Memory – Pen drive – Advanced memory technologies.

Reference Books:

1. A K Ray, K M Bhurchandi, “Advanced Microprocessors and Peripherals”, Tata McGraw Hill,

New Delhi, 2nd Edition, 2010.-DOWNLOAD

2. Barry B.Brey, “The Intel Microprocessors”, PHI, New Delhi, Sixth Edition, 2004.-DOWNLOAD OR DOWNLOAD TORRENT

3.  K.K Tripathi, Rajesh K Gangwar, “Microprocessor and Its Application”, Acme Learning,2010

Chapter1      Chapter2        Chapter3      Chapter4     Chapter5     Chapter6      Chapter7     Chapter8

Operating Systems

CS010 505: Operating Systems

SYLLABUS

Module I (8 hours):

Introduction: Operating System – Batch, Multiprogrammed, Time-sharing and Real time systems – Operating system structure – Operating system operations System Structures: Operating system service – System calls – System Programs – System structure – Simple structure, Layered approach – Kernel, Shell.

Module II (12 hours):

Process Management: Process concept – Process state, PCB – Process scheduling – Operations on processes – Interprocess communication – Multithreading –Benefits, Models Process Scheduling: Basic concepts – Preemptive scheduling, Dispatcher – Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling.

Module III (16 hours):

Process Synchronization: The Critical-Section problem – Peterson’s solution –Synchronization Hardware – Semaphores – Classic problems of synchronization – Monitors Deadlocks: System model – Deadlock characterization – Methods for handling deadlocks – Prevention, Avoidance and Detection – Recovery from deadlock.

Module IV (14 hours):

Memory Management: Resident Monitor – Dynamic loading – Swapping – Contiguous memory allocation – Paging – Basic, Multi-level Paging – Segmentation Virtual Memory – Demand Paging – Page Replacement algorithms – Allocation of Frames – Thrashing – Cause of thrashing.

Module V (10 hours):

File System: File concept – Access methods – Directory structure – Directory implementation – Linear list, Hash table – Disk scheduling

Case study: Linux system.

Reference Books:

1. Abraham Silberschatz, Peter B.Galvin and Greg Gagne, “Operating System Concepts”, John

Wiley & Sons Inc, 8th Edition 2010.-DOWNLOAD OR DOWNLOAD

2. D M Dhamdhere, “Operating Systems A Concept-based Approach”, Tata McGraw Hill, New

Delhi, 2nd Edition, 2010.-DOWNLOAD

DIGITAL SIGNAL PROCESSING

CS010 504(EC) DIGITAL SIGNAL PROCESSING

SYLLABUS

Module 1: (12 Hrs):

Introduction to Signals & Systems:- Continuous Time Signals and Discrete Time Signals- Generation of Discrete Time Signals – Sampling, Elementary Discrete Time Signals- Operations on Discrete Time Signals- Convolution- Discrete Time Systems -Properties of Discrete Time Systems-Linearity, Time invariance-Causality-Stability- Linear Time Invariant (LTI) Systems Difference Equation representation of LTI Systems -The Z transform-Properties of Z transform- Inverse Z transform-System Transfer function.

Module 2: (12 Hrs):

Frequency Domain Representation of Discrete Time Signals:- Discrete Time Fourier Transform (DTFT) properties, Discrete Fourier Transform(DFT) properties& Fast Fourier Transform( FFT) Decimation in Time &Decimation in Frequency algorithms.

Module 3(13Hrs):

Finite Impulse Response Filter:- FIR Filters with Linear Phase, Need of Linear Phase, FIR Filter Design Methods- Fourier Series Method – Window Method- Design of FIR Filters using Rectangular, Triangular,Hamming, Hanning, Blackmann and Kaiser Windows. Realization of FIR Filter- Direct, Linear Phase and Cascade Realizations.

Module 4: (13 Hrs):

Infinite Impulse Response Filters:- Steps in IIR Filter Design, Conversion of Analog Filter to Digital Filter- Impulse Invariant and Bilinear Transformations, Analog Filter Design Approximations- Butterworth and Chebyshev Approximations., Realization of IIR Filter- Direct, Cascade and Parallel Realizations.

Module 5(10 Hrs):

Introduction to DSP Chips: - Basic Architecture of a DSP chip, Case Study: TMS 320, TigerSHARC Processors (Overview of Architecture and Features) Applications of DSP:- Audio Signal Processing and Compression, Image Processing- JPEG Compression, Video Compression, Speech Processing and Recognition, Weather Forecasting, RADAR, (Brief idea only)

Text Books:

1. Oppenheim A.V.Schafer R.W. Discrete-Time Signal Processing- PrenticeHall/Pearson.-   DOWNLOAD

2. Andreas Antoniou Digital Signal Processing Tata McGrawHill-     DOWNLOAD

Database Management Systems

CS010 503: Database Management Systems

Syllabus

Module I (10 hours):

Basic Concepts - Purpose of Database Systems- 3 Schema Architecture and Data Independence- Components of DBMS –Data Models, Schemas and Instances-Data Modeling using the Entity Relationship Model-Entity types, Relationship Types, Weak Entity Types .

Module II (14 hours):

Relational Model Concepts –Constraints – Entity Integrity and Referential Integrity, Relational Algebra -Select, Project, Operations from Set Theory, Join, OuterJoin and Division - Tuple Relational Calculus.

SQL- Data Definition with SQL - Insert, Delete and Update Statements in SQL, Defining Domains, Schemas and Constraints, Constraint Violations - Basic Queries in SQL - Select Statement, Use of Aggregate functions and Group Retrieval, Nested Queries, Correlated Queries – Views.

Module III (12 hours):

Oracle Case Study : The Basic Structure of the Oracle System – Database Structure and its Manipulation in Oracle- Storage Organization in Oracle.- Programming in PL/SQL- Cursor in PL/SQL - Assertions – Triggers.

Indexing and Hashing Concepts -: Ordered Indices, Hash Indices, Dense and Sparse Indices, Multi Level Indices, Cluster Index, Dynamic Hashing.

Module IV (11 hours):

Database Design– Design Guidelines– Relational Database Design – Functional Dependency- Determination of Candidate Keys, Super Key, Foreign Key, Normalization using Functional Dependencies, Normal Forms based on Primary keys- General Definitions of First, Second and Third Normal Forms. Boyce Codd Normal Form– Multi-valued Dependencies and Forth Normal Form – Join Dependencies and Fifth Normal Form – Pitfalls in Relational Database Design.

Module V (13 hours):

Introduction to Transaction Processing- Transactions- ACID Properties of Transactions-Schedules- Serializability of Schedules- Precedence Graph- Concurrency Control – Locks and Timestamps-Database Recovery Query processing and Optimization- Translating SQL Queries into a Relational Algebra

Computing Select, Project and Join ,

Object Relational Databases-Distributed Databases-Different Types-Fragmentation and Replication Techniques-Functions of DDBMS.

Reference Books:

1. Elmsari and Navathe, Fundamentals of Database System, Pearson Education Asia,

5th Edition, New Delhi, 2008.-       DOWNLOAD OR DOWNLOAD

2. Henry F Korth, Abraham Silbershatz , Database System Concepts, Mc Graw Hill

6td Edition, Singapore, 2011. -      DOWNLOAD

3. C.J.Date , An Introduction to Database Systems, Pearson Education Asia, 7th Edition, New

Delhi. -                                           DOWNLOAD OR DOWNLOAD

Principles of Management (POM)

EN010 502(ME): Principles of Management

Syllabus

Module I (12 hours):

Management Concepts: Vision, Mission, Goals and Objectives of management-MBOScientific management- Functions of management- Planning- Organizing- Staffing- Directing- Motivating- Communicating- Coordinating- Controlling- Authority and Responsibility- Delegation- Span of control- Organizational structure- Line, Line and staff and Functional relationship.

Module II (12 hours):

Personnel Management: Definition and concept- Objectives of personnel management- Manpower planning- Recruitment and Selection of manpower- Training and development of manpower- Labour welfare- Labour turnover- Quality circle- Industrial fatigue- Industrial disputes-Method of settling disputes- Trade unions.

Module III (12 hours)

Production management: Objectives and scope of production management- Functions of production department- production management frame work- product life cycle-Types of production- Production procedure- Project planning with CPM and PERT- Basic concepts in network.

Module IV (12 hours):

Financial Management: Objectives and Functions of Financial Management- Types of Capital- Factors affecting working capital- Methods of financing. Cost Management: Elements of cost- Components of cost- Selling Price of a product.

Module V (12 hours):

Sales and Marketing Management: Sales management- Concept- Functions of sales department- Duties of sales engineer- Selling concept and Marketing concept- Marketing- Definition and principles of marketing- Marketing management and its functions- Sales forecasting- Pricing- Advertising- Sales promotion- Channels of distribution- Market research.

Text Books

1. Koontz and Weihrich, Essentials of Management, Tata McGraw Hill.
2. Mahajan M., Industrial Engineering and Production Management, Dhanpat Rai and Co.
3. Kemthose and Deepak, Industrial Engineering an Management, Prentice Hall of India.

Reference Books
1. Martand Telsang, Industrial Engineering and Production Management.
2. Khanna O.P., Industrial Engineering and Management, Dhanpat Rai and Co.
3. Philip Kotler, Marketing Management, Prentice Hall of India.
4. Sharma S. C. & Banga T. R., Industrial Organisation and Engineering Economics, Khanna Publishers.
5. Prasanna Chandra, Financial Management, Tata McGraw Hill.

4th semester Theory of computation PPT's

     (Click to Download PPT)
 

Introduction and Chapter 1: Fundamentals

Chapter 2: Finite Automata

Chapter 3: Closure Properties for Regular Languages

Chapter 4: DFA Applications

Chapter 5: Nondeterministic Finite Automata

Chapter 6: NFA Applications

Chapter 7: Regular Expressions

Chapter 8: Regular Expression Applications

Chapter 9: Advanced Topics in Regular Languages

Chapter 10: Grammars

Chapter 11: Non-Regular Languages

Chapter 12: Context-Free Languages

Chapter 13: Stack Machines

Chapter 14: Stack Machine Applications

Chapter 15: Turing Machines

Chapter 16: Computability

Chapter 17: Uncomputability 

Chapter 18: Cost Models

PPT set-2 

Click to Downoad PPT	Size
Lecture1.ppt	39K
Lecture2.ppt	221K
Lecture3.ppt	745K
Lecture4.ppt	274K
Lecture5.ppt	272K
Lecture7.ppt	248K
Lecture8.ppt	54K
Lecture9.ppt	111K
Lecture10.ppt	79K
Lecture11.ppt	837K
Lecture12.ppt	15K
Lecture14.ppt	1.4M
Lecture14a.ppt	1.1M
Lecture15.ppt	71K
Lecture16.ppt	731K
Lecture17.ppt	1.5M
Lecture17.ppt	711K
Lecture18.ppt	320K
Lecture23.ppt	120K
Lecture23b.ppt	153K
Lecture24.ppt	82K
Lecture25.ppt	103K
Lecture25b.ppt	57K
Lecture27.ppt	117K

Engineering Mathematics III

Syllabus:


MODULE 1 Fourier series ( 12 hours)

Dirichlet conditions – Fourier series with period 2 π and 2l – Half range sine and cosine series –
Harmonic Analysis – r.m.s Value

MODULE 2 Fourier Transform ( 12 hours)

Statement of Fourier integral theorem – Fourier transforms – derivative of transforms- convolution
theorem (no proof) – Parsevals identity

MODULE 3 Partial differential equations ( 12 hours)

Formation by eliminating arbitrary constants and arbitrary functions – solution of Lagrange’s equation –
Charpits method –solution of Homogeneous partical differential equations with constant coefficients.

MODULE 4 Probability distribution ( 12 hours)

Concept of random variable , probability distribution – Bernoulli’s trial – Discrete distribution – Binomial
distribution – its mean and variance- fitting of Binominal distribution – Poisson distribution as a limiting
case of Binominal distribution – its mean and variance – fitting of Poisson distribution – continuous
distribution- Uniform distribution – exponential distribution – its mean and variance – Normal
distribution – Standard normal curve- its properties.

MODULE 5 Testing of hypothesis ( 12 hours)

Populations and Samples – Hypothesis – level of significance – type I and type II error – Large samples
tests – test of significance for single proportion, difference of proportion, single mean, difference of mean
– chi –square test for variance- F test for equality of variances for small samples.

Note :  Please login with 4shared account to download.

Study Materials:

MODULE 1 :-

TEXT 1

TEXT 2

TEXT 3

MODULE 2 :-

TEXT 1

Mathematical equations

Integral Equations

4th semester Microprocessor Systems study material

SYLLABUS

CS010405: Microprocessor Systems

Teaching scheme Credits: 4

Module I (10 hours)

Architecture of 8085 – Registers. Instruction set of 8085 - Instruction Types – Arithmetic – Logic data transfer, Branch, Stack, I/O and Machine Control instructions - Addressing Modes - Direct and Indirect Addressing - Immediate Addressing - Implicit Addressing.

Module II (12 hours)

Subroutines - Stack Operations - Call Return sequence- Programming Examples. Timing and control unit – The fetch operation – Machine cycle and T- State instruction and data flow. Address space partitioning - Memory mapped I/O - I/O mapped I/O.

Module III (14 hours)

Interrupts of 8085 - Hardware & Software Interrupts – Enabling, Disabling and masking of interrupts – Polling – HALT & HOLD states – Programmable interrupt controller – 8259.

Module IV (12 hours)

Data transfer schemes - Programmed data transfer - synchronous and asynchronous transfer - interrupt driven data transfer – DMA data transfer. Study of Interfacing ICs – 8257,8255 programmable peripheral interface (compare it with 8155).

Module V (12 hours)

Programmable interval timer 8253, 8251 -,Interfacing Keyboard and display devices, Hardware and Software approach – USART 8251. (interfacing chips functions and internal block diagram only).

You can download MG University BTech Microprocessor systems free notes from here.

DOWNLOAD

4th semester Theory of computation study material

                                                                         SYLLABUS

CS 010 406: Theory of Computation

Teaching scheme Credits: 4

Module I (10 hours)

Proving techniques-Mathematical induction -Diagonalization principle –Pigeonhole principle- Functions – Primitive recursive and partial recursive functions – Computable and non computable functions—-Formal representation of languages – Chomsky Classification.

Module II (13 hours)

Introduction to Automata theory – Definition of Automation – Finite Automata –Language acceptability by Finite Automata –Deterministic and Nondeterministic finite automation - Regular Expressions – Finite Automation with ∈-Transitions –Conversion of NFA to DFA - Minimisation of DFA-DFA to Regular Expressions conversion-pumping lemma for regular languages – Applications of finite automata-NFA with o/p ( moore /mealy).

Module III (12 hours)

Context Free Grammar –Simplification of CFG-Normal forms-Chomsky Normal form and Greibach Normal form- pumping lemma for Context free languages- Applications of PDA - Pushdown Automata – Formal definition – Language acceptability by PDA through empty stack and final state – Deterministic and nondeterministic PDA – designing of PDA.

Module IV (13 hours)

Turing Machines – Formal definition – Language acceptability by TM –TM as acceptors, Transducers - designing of TM- Two way infinite TM- Multi tape TM - Universal Turing Machines- Church’s Thesis-Godelization.- - Time complexity of TM - Halting Problem - Rice theorem - Post correspondence problem-Linear Bounded Automata.

Module V (12 hours)

Complexity classes- Tractable problems– Class P –P Complete-Reduction problem - Context grammar nonempty-Intractable problems- Class NP – NP Complete- Cooks theorem-Reduction problems-SAT-Clique-Hamiltonian-TSP-Vertex Cover-NP Hard problems.

You can download MG University BTech Theory of computation free notes from here.

 

DOWNLOAD

Reference Books:-

1. Theory of Computer Science, K.L.P. Mishra, N. Chandrashekharan ,-  DOWNLOAD

2.Introduction to Automata
Theory Languages & Computation , John Hopcroft, Rajeev Motwani & Jeffry Ullman:

DOWNLOAD

4th semester SIGNALS AND COMMUNICATION SYSTEMS study material

SYLLABUS

CS010 404 SIGNALS AND COMMUNICATION SYSTEMS

Teaching scheme Credits: 4

Module 1 (15 hrs):-

Introduction to Signals:- Continuous Time Signals- Discrete Time Signals- Signal Operations- Properties of Signals(Periodicity and Symmetry), Frequency Domain Representation of Continuous Time Signals-Continuous Time Fourier Series(CTFS)- Definition- properties- Examples, Continuous Time Fourier Transform(CTFT)- Definition- Properties – Examples- Concept of Frequency Spectrum, Sampling- The Sampling Theorem(proof not required)- Quantisation.

Module 2 (12 hrs):-

Communication Systems:- Architecture of a Typical Communication System – Basic problems in Signal Transmission - Noise – Types of Noise- Internal and External Noise, Cross Talk- Typical parameters of Communication Systems- Signal propagation Delay, Signal to Noise Ratio, Attenuation, Bandwidth Communication Channels:- Twisted Pairs- Coaxial Cables- Fiber Optic Cables- Capacity of a Noisy Channel- Shannon Hartley Theorem.

Module 3: (15 Hrs):-

Modulation- Need for Modulation

Analog Modulation- Types of analog modulation- Amplitude Modulation, Frequency modulation, Phase modulation, Pulse Modulation Schemes- Pulse Amplitude modulation(PAM), Pulse Width Modulation(PWM), Pulse Position Modulation(PPM), Pulse Code Modulation(PCM),Delta modulation, Sample problems based on different modulation methods.

Digital modulation;- Amplitude Shift Keying(ASK), Frequency Shift keying(FSK),Phase Shift Keying(PSK), Quadrature Amplitude modulation (QAM), Differential Phase Shift Keying(DPSK).

Module 4: (8 Hrs):-

Multiplexing:-Time Division Multiplexing(TDM)- Frequency Division Multiplexing(FDM)- Wavelength Division multiplexing(WDM).
Switching:- Circuit, Packet and Message Switching Schemes, Case Study:- SONET( Basic ideas only)- Datagrams and virtual Circuits.
Digital Transmission:- Analog to Digital Converter(ADC), Serial and parallel Transmission- Simplex, Half Duplex and Full Duplex Transmissions.

Module 5: (10 Hrs):-

Error Correction and Detection;- Line Coding Schemes- Block Coding- Convolution Coding- Hamming Codes
Transmission Codes:- Different Character Codes- ASCII, EBCDIC, Baudot Code, Bar Coding, Parity Coding.

You can download MG University BTech signals and communication system free notes from here.

Reference books:-

1. Data Communication and Networking , Behrouz Forouzan - DOWNLOAD

4th semester Data Structures and Algorithms study material

SYLLABUS

CS010 403: Data Structures and Algorithms

Teaching scheme Credits: 4

Module I (10 hours)

Principles of programming – System Life Cycle - Performance Analysis and Measurements- Time and Space complexity-Complexity calculation of simple algorithms. Hashing:- Static Hashing-Hash Tables-Different Hash Functions-Mid Square - Division-Folding-Digit Analysis, Collision-Collision Resolution Techniques.

Module II (12hours)

Study of basic data structures – Arrays- Structures-Sparse matrix – Stacks – Queues- Circular queues- Priority queues - Dqueues. Evaluation of expressions – Polynomial representation using arrays.

Module III (12hours)

Linked Lists - Linked stacks and queues - Doubly linked lists – Polynomial representation using linked lists, Garbage collection and Compaction.

Module IV (14 hours)

Trees - Binary Trees – Tree Traversal – Inorder - Preorder and Postorder, Search trees - AVL Trees, height balanced trees, Multiway search Trees- B Trees-B+ Trees. Graphs – Depth first and breadth first search.

Module V (12 hours)

Sorting methods: Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort, External sorting methods.

    You can download MG University BTech CSE 4th semester DataStructure free notes from here.

DOWNLOAD

4th semester Object Oriented Programming study material

SYLLABUS

CS010 402: Object Oriented Programming

Teaching scheme Credits: 4

Module I (8 hours)

Introduction to OOP - Evolution of object oriented languages - Need of Objects - Definition of Object Oriented Language – Classes and Objects – Creating and Using Classes and objects – Member functions and variables – Constructors –multiple and parameterized constructors ,copy constructors –constructors with default arguments- Destructors.

Module II (13 hours)

Inheritance and Access Control - Member access control in classes – Friend functions and classes – Extending classes - Public Private and Protected Inheritance – Classification of Inheritance – Single – Multiple – Multilevel – Hierarchical – Hybrid.

Module III (14 hours)

Polymorphism – Runtime and compile time polymorphism – overloading functions and operators – selecting friend member function for operator overloading - Virtual methods – pure virtual methods – Abstract classes - applications of abstract classes.

Module IV (13 hours)

Virtual Destructors – Virtual Base Classes - Template- class templates and function templates- Creating and using templates – Namespaces-Dynamic Objects - Dynamic object allocation - Inline functions. Exception Handling-basics of exception handling-exception handling mechanism- Throwing and Catching Mechanism-Rethrowing and Specifying exceptions.

Module V (12 hours)

Data file operations –opening and closing files-reading and writing from file-Classes and file operations-Other object oriented languages – Java – Object oriented features in Java – Comparison with C++-Object oriented system development-object oriented notations and graphs-object oriented analysis-object oriented design.

You can download MG University B Tech Object Oriented Programming free notes from here.

DOWNLOAD

Reference books : -

1. Object Oriented Programming in C ++, 3rd Edition - DOWNLOAD

2. Object oriented Programming with C++,E. Balaguruswamy - DOWNLOAD