Course Name : MICROCONTROLLER
Course Code : IT 307
L T P : 3 0 2
Lecture wise breakup No. of lectures
TYPES OF MEMORY (4)
Code Memory ,Internal RAM , External RAM ,Special Function Registers (SFRs) ,Bit Memory
SPECIAL FUNCTION REGISTERS (4)
What are SFRs? Types of SFRs ,Standard SFR,Descriptions ,Non-Standard SFRs
BASIC REGISTERS: (4)
The Accumulator, "R" Registers, B Register,Data Pointer (DPTR) ,Program Counter (PC) ,Stack Pointer (SP)
ADDRESSING MODES (4)
Immediate Addressing,Direct Addressing , Indirect Addressing , External Direct Addressing , External Indirect Addressing
PROGRAM FLOW (4)
Conditional Branching, Direct Jumps, Direct Calls, Return from Subroutines,Interrupts
LOW-LEVEL INFORMATION (3)
Instruction Set, Timing, and Low-Level Info
TIMERS (16)
How Timers Count, Measuring Time .How Long do Timers Take to Count? ,Timer SFRs ,TMOD SFR ,Mode 0 - 13-bit Timer, Mode 1-16-bit Timer, Mode 2 - Auto-reload Timer ,Mode 3 - Split Timer ,TCON SFR ,Initializing a Timer ,Reading a Timer ,Reading a Timer Value , Detecting a Timer Overflow ,Timing the Length of an Event ,Timers as Event Counters ,
8 - Serial Port Operation : Setting the Serial Port Mode , Setting the Baud Rate , writing to the Serial Port ,Reading from the Serial Port
INTERRUPTS (8)Events that trigger Interrupts ,Setting Up Interrupts ,Polling Sequence , Interrupt Priorities ,What Happens When an Interrupt Occurs? ,What Happens When an Interrupt Ends? ,Serial Interrupts ,Register Protection , Common Bugs in Interrupts
Course Name : DATA MINING & WARE HOUSING
Course Code : IT 308
L T P : 3 0 2
Lecture wise breakup No of Lectures
Data ware housing Definition and characteristics, need for data warehousing DBMS vs. data warehouse, OLAP
(5)
Multidimensional data model, data cubes, Schemas for multidimensional databases, OLAP operations
(6)
Data Marts, Metadata, data warehouse architecture
(6)
Data preprocessing- cleaning, integration and transformation, Data reduction
(5)
Data mining definition, issues in data mining, Data mining primitives
(6)
Data Mining query language
(4)
Data Mining Techniques- Concept description
(4)
Association rule mining
(4)
Classification – decision tree, Bayesian, neural networks, Genetic algorithm, Support vector machines, Fuzzy techniques
(4)
Mining multimedia databases, Text databases, web mining
(5)
Commercial Importance of DW, applications of data mining, data mining, data mining in
(5)
business process, Embedded data mining.
BOOKS:
1. Data Mining – Concepts & Techniques; Jiawei Han & Micheline Kamber , Morgan Kaufmann Publishers
2 Data Warehousing in the Real World; Sam Anahory & Dennis Murray; Pearson Education
REFERENCES:
1. “Data Mining” by Pieter Adrians, Dolf Zantinge, Addison Wesley, 2000.
2. Data Mining; Pieter Adriaans & Dolf Zantinge; 1997, Pearson
3. Data Warehousing, Data Miniing and OL T P; Alex Berson, 1997, McGraw Hill.
- Data warehousing System; Mallach; 2000, McGraw Hill.
- Building the Data Warehouses; W.H. Longhman, C. Klelly, John Wiley & Sons.
- “Data Warehousing: Concepts, Techniques, Products and Applications”, by C.S.R. Prabhu, Prentice Hall of India.
Course Name : ADVANCED ALGORITHMS
Course Code : IT 309
L T P : 3 0 2
Lecture wise breakup No. of lectures
INTRODUCTION (2)
Algorithm concepts, Analyzing and design, Pseudocode conventions, asymptotic efficiency of algorithms, asymptotic notations and their properties.
RECURSION (2)
Recurrence equations and method of solving recurrences, substitution method, recursion tree method and master method.
PROBABILISTIC ANALYSIS AND RANDOMIZED ALGORITHMS (4)
Probabilistic analysis concepts, hiring problem and its probabilistic analysis.
SORTING (4)
Heap sort and heaps as priority queues, quick sort, randomized quick sort, sorting in linear time.
SELECTION PROBLEM (3)
Medians and order statistics.
SEARCHING (3)
Searching using hash tables, collision resolution, hash functions, open addressing using linear probing, quadratic probing and double hashing.
DYNAMIC PROGRAMMING (6)
Deterministic & probabilistic, greedy algorithms, amortized analysis.
ADVANCED DATA STRUCTURES (6)
B trees, B+ trees, data structures for disjoint sets.
GRAPH ALGORITHMS (6)
Breadth First and Depth First Search, minimum spanning trees, shortest path algorithms: single source and all pair, max flow problem and its solutions.
LINEAR PROGRAMMING (3)
Algorithms for linear programming, DFT and FFT.
STRING MATCHING (5)
Rabin Karp algorithm, Knuth-Morris-Pratt algorithm.
NP-COMPLETENESS CONCEPTS (5)
Polynomial time verification, NP-completeness and reducibility, showing problems to be NP-complete like Clique problem, vertex cover problem etc. Approximation algorithms of these problems.
BOOK:
1. Cormen, Leiserson, Rivest, Stein, “Introduction to Algorithms”, Prentice Hall of India.
REFERENCES:
1. Brassard, Bratley, “Fundamentals of algorithms”, Prentice Hall of India.
2. Knuth, “The Art of Computer Programming”, Vol I-III, Pearson Education.
Course Name : ADVANCED COMPUTER ARCHITECTURE
Course Code : IT 310
L T P : 3 0 2
Rationale:
The objective of this course is to provide the knowledge of parallel processing and vector processing.
Lecture wise break up No. of lectures
REVIEW OF COMPUTER ARCHITECTURES (2)
A Taxonomy of MIMD Computers, Multi-vector and SIMD, Computers, Vector Supercomputers SIMD Supercomputers
PRAM AND VLSI MODELS (1)
Parallel Random Access Machines, VLSI Complexity Model
ARCHITECTURAL DEVELOPMENT TRACKS (1)
Multiple –Processor Tracks, Multi-vector and SIMD Tracks, Multithreaded and Dataflow Tracks
CONDITIONS AND PARALLELISM (2)
Data and Resource Dependences, Hardware and Software parallelism, the role of Compilers
PROGRAM PARTITIONING AND SCHEDULING (1)
Grain Sizes and Latency, Grain Packing and Scheduling, Static Multiprocessor Scheduling
PROGRAM FLOW MECHANISMS (2)
Control flow Mechanism, Demand-Driven Mechanism, Comparison of Flow Mechanisms, System Interconnect Architectures: Network properties and Routing, Static Connection networks, Dynamic Connection Networks
PERFORMANCE METRICS AND MEASURES (2)
Parallelism Profile in Programs, Harmonic mean Performance, Efficiency, Utilization and Quality, Standard Performance Measures
SPEEDUP PERFORMANCE LAWS (1)
Amdahl’s law for a fixed workload, Gustafron’s Law for Sealed problems
SCALABILITY ANALYSIS AND APPROACHES (2)
Scalability metrics and Goals, Evolution of Scalable Computers
ADVANCE PROCESSOR TECHNOLOGY (2)
Instruction set architecture, CISC and RISC Scalar processors
SUPERSCALAR AND VECTOR PROCESSORS (2)
Superscalar Processors, The VLIW Architecture, Vector and Symbolic processors
MEMORY HIERARCHY TECHNOLOGY (3)
Hierarchical Memory Technology Inclusion, Coherence and Locality, Memory Capacity Planning.
MULTIPROCESSOR SYSTEM INTERCONNECTS (2)
Hierarchical Bus system, Crossbar Switch and Multiport Memory, Multistage and Combining networks
CACHE COHERENCE AND SYNCHRONIZATION MECHANISMS (2)
The cache coherence problem, Snoopy bus protocol, Hardware Synchronization Mechanisms
VECTOR PROCESSING PRINCIPLES (2)
Vector Instruction Types , Vector Access Memory Schemes
MULTIVECTOR MULTIPROCESSORS (2)
Performance- Directed Design rules, Cray Y – MP,C-90 and NTP
SIMD COMPUTER ORGANIZATION (3)
Implementation Models, The CM-2 architecture
SOFTWARE FOR PARALLEL PROGRAMMING (3)
Shared-variable Model, Message-passing Model, Data-parallel Model, Object-Oriented Model, Functional and Logic Models
PARALLEL LANGUAGES AND COMPILERS (3)
Language features for parallelism, Parallel Language Constructs, Optimizing Compilers for parallelism
PARALLEL PROGRAMMING ENVIRONMENT (3)
Software Tools and Environment , Y-MP, Paragon and CM-5 Environment, Visualization and Performance Tuning
SYNCHRONIZATION AND MULTIPROCESSING MODES (3)
Principles of synchronization, Multiprocessor execution Models , Shared-Variable Program Structures, Locks for Protected access, Semaphores and Applications, Monitors and Applications, Message-passing program Development, Distributing the Computation, Synchronous Message passing, Asynchronous message passing
MAPPING PROGRAMS ON TO MULTICOMPUTERS (5)
Domain Decomposition Techniques, Control Decomposition techniques, Heterogeneous processing
BOOKS: -
1. Kai Hwang: Advance Computer Architecture- Parallelism, Scalability and Programmability, McGraw-Hill International Edition, Computer Series, 1993.
REFERENCES:
1. Michael J. Quinn: Parallel Computing – theory and Practice, McGraw Hill International Edition, Computer Science Series, 2nd Edition, 1994.
2. S.G. Akl: Design and Analysis of parallel algorithms, Prentice hall, Englewood Cliff NJ.
3. S. Lakshmivarahan and S.K. Dhall: Analysis and Design of Parallel Algorithms-arithmetic and Matrix Problems, McGraw Hill International Edition, Computer Science Series. 1990.
4. A practical approach to parallel Computing by S K Ghosal, Universities press (India) Limited.
Course Name : WINDOWS PROGRAMMING Course Code : IT 324
L T P : 3 0 2
Pr-req. : --
Rationale:
This course offers a good understanding of working, advantages, structure, compiling of windows programs.
Lecture wise break up No of Lectures
INTRODUCTION (4)
Working of Windows programs, Advantages of Windows, Structure of Windows program, Compiling a windows program, Windows Memory Management, Windows Message Format, Understanding Windows.H file, WinMain() function and parameters, Hungarian Notation, Creating a programs window, Adding a Message Loop
WIN32 ARCHITECTURE (4)
Windows Operating Systems, Dynamic Link Libraries, Win32 API, Kernel Objects, Win32 Memory Management, Win32 Program Flow, SDK Windows Programs, Console Programs, Windows Versions, Error Information, MFC Without the Wizards
TEXT AND GRAPHICS OUTPUT (3)
Text and Graphics Output – Character mode versus Graphics Mode, Device Context, Windows GDI, The WM_PAINT Message, Changing the device context, Device Context settings, Graphics Output
WINDOW CONTROLS (4)
Window Controls – What is Window, Types of Window controls, CreateWindow() function, static controls, Sending a message to a control, Button Controls, Processing Button Control Messages and notification codes, List Boxes, ScrollBars, Combo Boxes, Scroll Bars Attached to a Window
PROGRAMMING THE MOUSE (4)
Taming a mouse – The WM_MOUSEMOVE Message, Notification codes with WM_MOUSEMOVE, Mouse button Messages, Non client Mouse Messages, Capturing the Mouse, Changing the mouse cursor shape
CHILD AND POPUP WINDOWS, MENUS, DIALOG BOXES (7)
Child and Popup Windows – Creating a Child Window, Sending Messages to Child windows, Fixed Child Windows, Popup Windows, Menus – Creating Menus, Menus defined as Resource Data, Menu loading and Memory options, Menu Items, Popup Menus, Determining Menu Item Status, Creating a Menu as program operates, Creating a menu containing bitmaps, System Menu, Dialog Boxes – What is a dialog box, How Dialog Box works, Designing a Dialog Box, Using the Dialog Box, Dialog Box Function, Exchanging data with a dialog Box, Modal, modeless and System Modal Dialog Boxes, Creating a Modeless Dialog Box
DYNAMIC LINK LIBRARIES (3)
Dynamic vs. Static Libraries, DLLs to Manage Resources, Explicit and Implicit Linking, Linking to C Language DLLs from C++ Programs, MFC Regular and Extension DLLs
THREADS USING MFC (4)
Win32 Processes and Threads, MFC Thread Encapsulation, User Interface and Worker Threads, MFC Thread Synchronization, Thread Safety
INTERPROCESS DATA COMMUNICATION (3)
Interprocess Communication in Win32, Memory-Mapped Files, WM_COPYDATA, Mail slots, Named Pipes
COM FUNDAMENTALS (4)
Interfaces, Classes and Objects, Globally Unique Identifiers, Servers, Registration, Instantiating an Object, Object Lifetime and Interface Negotiation, Initializing COM, COM Client Programming Model
DATABASE PROGRAMMING (8)
Form Views and Data Entry, Introduction to ODBC, Using ODBC at the API Level, Parameterized Queries, Joins, MFC Database Classes, ActiveX Data Objects, Universal Data Access, ODBC and OLE DB, ADO Object Model, Database Programming Using ADO
BOOKS:
1. Windows Programming Primer Plus By Jim Conger
REFERENCES:
1. Programming Windows, Fifth Edition by Charles Petzold
2. Win32 System Programming by Johnson M. Hart
3. Win32 Programming (Addison-Wesley Advanced Windows Series) by Brent E. Rector, Joseph M. NewcomerCourse Name : COMPUTER GRAPHICS Course Code : IT 325L T P : 3 0 2
Rationale:
Students will understand the fundamental graphical operations and the implementation on computer. Understand the mathematics behind computer graphics, including the use of spline curves and surfaces.Lecture wise breakup No. of lectures
GRAPHICS HARDWARE: (5)
Vector and Raster CRTs, Display Controllers and Processors, Graphics Input Devices.
TWO-DIMENSIONAL GEOMETRIC TRANSFORMATIONS: (5)
Coordinate Systems, Homogenous Coordinates, Basic Transformations: Translation, Scaling, Rotation and other transformations. Composite Transformations.
RASTER SCAN CONVERSION ALGORITHMS: (5)
Line Drawing Algorithms, Circle Drawing Algorithms, Region filling Algorithms.
TWO-DIMENSIONAL VIEWING & CLIPPING: (5)
Windowing and Viewing Transformations, Line Clipping algorithms, Polygon Clipping, Curve Clipping and Text clipping.
3-D GRAPHICS: (5)
Three dimensional object representations: Curves and Surfaces
THREE-DIMENSIONAL GEOMETRIC TRANSFORMATIONS: (5)
Basic Transformations: Translation, Scaling, Rotation. Composite transformations
THREE-DIMENSIONAL VIEWING : (5)
Modeling and Coordinate Transformations, Projections: Parallel and Perspective Transformations
VISIBLE SURFACE DETECTION: (5)
Hidden surface removal algorithms
ILLUMINATION MODELS: (3)SHADING: (4)
Gouraud Shading, Phong Shading
INTERACTIVE COMPUTER GRAPHIC TECHNIQUES: (3)
BOOK:
1. Computer Graphics: By Donald Hearn, M. Pauline Baker
REFERENCES:
1. Principles of Interactive Computer graphics: By W.M. Newman, R.Sproull
2. Fundamentals of Interactive Computer Graphics: By J.D. Foley, A. Van Dam
3. Computer Graphics Using OPEN GL: By F.S. Hill Jr.
Home