DDEEPPAAARRRTTTMMMEENNTTT T OOOFFF ...microprocessors to key boards, interfacing a microprocessor to a stepper motor. Introduction to microcontroller: Comparison of various microcontrollers

DDDEEEPPPAAARRRTTTMMMEEENNNTTT OOOFFF CCCOOOMMMPPPUUUTTTEEERRR SSSCCCIIIEEENNNCCCEEE &&& EEENNNGGGIIINNNEEEEEERRRIIINNNGGG

VII Board of Studies (BOS)

Resolutions

18th August, 2012

Minutes 7th BOS Meeting of Computer Science and Engineering,

K L University

The 7th meeting of the BOS-CSE has been conducted on August 18, 2012 at 10.00AM in

the Computer Science and Engineering department, K L University.

The following who have signed are present

Serial

Number Name

Designatio

n Institutions

1 Dr. D.V.L.N Somayajulu Professor NIT Warangal

2 Sri Muni Reddy Senior

Manager

IBM software

Labs,Banglore 3 Dr.G.Rama Krishna Professor K L University

4 Dr. K Rajasekhara Rao Professor K L University

5 Dr. V Srikanth Professor K L University

6 Dr.V.Chandra Prakash Professor K L University

7 Dr.J.K.R.Sastry Professor K L University

8 Dr.T.V.Rao Professor K L University

9 Prof.S.Venkateswarlu Professor K L University

10 Dr.K.Subramanyam Professor K L University

11 Dr.M.R.Narasinga Rao Professor K L University

12 Dr.M.S.R.Prasad Professor K L University

13 Dr.Rajeswara Rao Professor K L University

14 Dr.K.V.V.Satyanarayana Professor K L University

15 Dr.Khalim Amjed Meerja Professor K L University

16 Dr.Vijaya babu Professor K L University

17 Sri K.Rajasekhar Associate

Professor

K L University

18

Dr. V Ramakrishna Professor K L University

19 Sri K.V.D Kiran Assistant

Professor

K L University

Draft Minutes of the BOS Meeting Held on January 10, 2013 in CSE

Department, K L U.

Resolutions of BOS Meeting

1. Students will be advised on the research groups available in the department on the day of

registration and will be asked to present a seminar of his/her choice based on which

supervisor will be allotted and monitoring committee will be finalized.

2. The department BOS will go through all the rules and regulations for M.Tech by research

program and propose the necessary changes for the next batch of admissions as there

were some anomalies.

3. The BOS will categorize the subjects of B.Tech and M.Tech programs into various

research groups of the department.

4. Decided to introduce M.Tech (software engineering) and M.Tech (knowledge

engineering) programs.

5. Decided to draft the specifications of research labs as required by the research groups.

6. All the activities related to Ph.D work need to be submitted to BOS for approval.

Dr.V.SRIKANTH

Chairman BOS - CSE

CC To

Chancellor Vice Chancellor Registrar

Dean (Admin & SW) Dean (ACA) Dean (P&D)

To All BOS members

Program Structure 2011-2015

Semester -I

S

No Code Course Title L T P Cr

1 11-HS101 English 2 0 2 3

2 11-HS103 Energy and Society 3 0 0 3

3 11-BS101 Engineering Mathematics 3 1 0 4

4 11-BS103 Engineering Physics 3 0 2 4

5 11-ES101 Problem Solving Thorugh Programming 3 0 2 4

6 11-ES105 Workshop Practice 0 0 4 2

Total Credits 14 1 10 20

Semester -II

S No Code Course Title L T P Cr

1 11-HS102 Technical Communication 2 0 2 3

2 11-BS102 Advanced Engineeering Mathematics 3 0 2 4

3 11-ES102 Measurements 3 0 2 4

4 11-BS105 Ecology and Environment 2 0 0 2

5 11-BS104 Engineering Chemistry 3 0 2 4

6 11-ES103 Enginering Materials 3 0 0 3

7 11-ES104 Engg Graphics with CAD 0 0 4 2

8 11-MP101 Mini project -1 0 0 2 1


Semester -III


1 11-ES213 Mathematical Methods for Computing 3 1 0 4

2 11-ES214 Data Structures 3 0 2 4

3 11-CS201 DLD & Computer Organisation 3 1 0 4

2 11-ES215 Human Computer Interface 3 1 0 4

4 11-CS202 Object Oriented Programming 3 0 2 4

5 11-CS203 Computer Graphics 3 0 2 4

6 11-MP201 Mini Project - 2 0 0 2 1

Games Certificate 0 0 2 NC


Semester -IV


1 11-BS201 Probability and Statistics 3 1 0 4

2 11-BS207 Discrete Mathematics 3 1 0 4

3 11-CS204 Database Management System 3 0 2 4

4 11-CS205 Operating Systems 3 0 2 4

5 11-CS206 Computer Networks 3 0 2 4

6 11-CS207 Software Engineering 3 1 0 4

7 HS 1 HS 1 (ELECTIVE) 3 0 0 3

8 Soft Skills 0 0 2 NC


Industrial Training* 0 0 0 *

Semester -V


1 11-CS301 Micro Processors & Controllers 3 0 2 4

2 11-CS302 Design and Analysis of Algorithms 3 1 0 4

3 11-CS303 Internet Programming 3 0 2 4

4 11-CS304 Cryptography & Network Security 3 0 2 4

5 PE1 Professional Elective 1 3 0 0 3

6 OE-1 Open Elective 1 3 0 0 3

7 HS 1 HS1 (ELECTIVE) 3 0 0 3


Semester -VI

S

No Code Course Title L T P Cr

1 11-CS305 Automata Theory And Formal Language 3 1 0 4

2 11-CS306 Objected Oriented Analysis and Design 3 0 2 4

3 11-CS307 Parallel Processing with Open CL 3 0 2 4




7 HS 2 HS 2 (ELECTIVE) 3 0 0 3

8 11-MP301 Mini Project 3 0 0 2 1


Semester -VII


1 11-CS401 Distributed Systems 3 0 2 4

2 11-CS402 Compiler Design 3 0 2 4


4 PE-5 Professional Elective 5 3 0 0 3




8 11-TP401 Term Paper 0 0 4 2


Semester - VIII


1 11-FPS01 Project/Practice School 0 0 0 18


PROFESSIONAL ELECTIVES

S

No Code Professional Elective 1 L T P Cr

1 11-CS330 ADBMS 3 0 0 3

2 11-CS331 High Speed Networks 3 0 0 3

3 11-CS332 Enterprise programming 3 0 0 3

4 11-CS333 Requirement Engineering 3 0 0 3

5 11-CS334 Artificial Intelligence 3 0 0 3

S


1 11-

CS335 Data Warehousing 3 0 0 3

2 11-

CS336 Adhoc Networks 3 0 0 3

3 11-

CS337 WEB services 3 0 0 3

4 11-

CS338 Software testing 3 0 0 3

5 11-

CS339 Machine Learning 3 0 0 3

S


1 11-CS340 Database Security 3 0 0 3

2 11-CS341 Network Programming 3 0 0 3

3 11-CS342 Visual Programming 3 0 0 3

4 11-CS343 Software Project Management 3 0 0 3

5 11-CS344 Neural Networks and Fuzzy Logic 3 0 0 3

S


1 11-

CS430 Data Mining 3 0 0 3

2 11-

CS431 Cloud Computing 3 0 0 3

3 11-

CS432 WEB security 3 0 0 3

4 11-

CS433 Software Reliability 3 0 0 3

5 11-

CS434 Natural Language Processing 3 0 0 3

S


1 11-CS435 Big Data Analytics 3 0 0 3

2 11-CS436 Green Computing 3 0 0 3

3 11-CS437 Semantic Web 3 0 0 3

4 11-CS438 Software Architecture 3 0 0 3

5 11-CS439 Pattern Recognition 3 0 0 3

OPEN ELECTIVES

S

No Code Open Elective 1 L T P Cr

1 11-OE301 E Commerce 3 0 0 3

2 11-OE302 Indian Heritage and Culture 3 0 0 3

S


1 11-

OE310 Wireless Communications 3 0 0 3

2 11-

OE311 Visual programming 3 0 0 3

S


1 11-OE404 Operations Research 3 0 0 3

2 11-OE406 Psychology 3 0 0 3

S


1 11- Principles of Programming Languages 3 0 0 3

OE407

2 11-

OE412 Organizational Management 3 0 0 3

S


1 11-OE413 Multimedia Authoring 3 0 0 3

2 11-OE414 Embedded Systems 3 0 0 3

BS Eng Phy -4 + Engg Che -4 + Maths -16+Ecology-2 -> 26 credits

HS Eng-3+Tech com-3+Energy-3+Mgmt Ele-3+Prof Com-3+HS Ele-3->18

Credits

ES Materials-3+Measurements-4+Pro Sol. Programming-4+Workshop-2+

Graphics-2+Dept ES 1, 2&3 ->27 Credits

PC 16*4 = 64 credits

PE 5*3 = 15 Credits

OE 5*3=15 Credits

Mini Projs - 3 credits+ Indus. Training+Project/Practice school-18 +

Term paper-2 -> 23 Credits

TOTAL CREDITS = 188

Annexure - I

B.Tech (CSE) 2011-2015

FIFTH SEMESTER

SYLLABUS

Course Code: 11-CS303

Course Title: Micro Processors and Micro Controllers.

Course Structure: L-T-P : 3-0-2

Prerequisite: Digital Logic Design and Computer Organization

Syllabus:

Introduction: Microprocessor evolution and types, 8086 family overview, 8086 internal architecture,

introduction to programming 8086. Programming structure and representation formats, finding right

instructions, writing a program, addressing modes, Standard programming structures. 8086 string

instructions, writing and using procedures, writing and using assembler macros. 8086 instruction

description and assembler directives, 8086 microcomputer system, Bus structure: minimum mode of

operation. Interrupts and interrupt responses, 8259A priority interrupt controller, programmable

parallel ports and hand shake input and output, interfacing processor to 8255A, interfacing a

microprocessors to key boards, interfacing a microprocessor to a stepper motor.

Introduction to microcontroller: Comparison of various microcontrollers. 8051

microcontroller architecture. Bi-directional data ports, internal ROM and RAM, counters/timers.

Oscillator and clock. 8051 registers. Memory organizations-program memory and data memory, special

functions, registers, memory map. 8051 assembly language programming. 8051instruction sets,

addressing modes, bit level operations. Arithmetic routines, counting and timing under interrupt

control. Available I/O ports, Signals, serial data I/O – interrupts- Interfacing –keyboard and display

interfaces routines, LCD, ADC & DAC, software development system, Assembler Simulators and

Emulators, microcontroller based system development and application.

TEXT BOOK:

1. Douglas V Hall, “Micro processors and Interfacing”, 2nd Second Edition, 2006, Tata McGraw Hill

publications.

2. Kenneth J.Ayala, ’The 8051 microcontroller Architecture, Programming and applications‘.2nd edition,

Penram international Publishers (I), 1996

Reference Books:

1. Brey, “Intel Microprocessors –The 8086, 8088, 80186, 80286, 80386, 80486 Architecture,

Programming & Interfacing”, 2nd Edition, 2005, PHI.

2.Yu-Cheng Liu and Glenn A. Gibson, “Microcomputer Systems: The 8086/8088 Family Architecture,

Programming and Design”, 2nd Edition; 1995,PHI

3. Mohamed Ali Mazidi, Janice Gillispie Mazidi,” The 8051 microcontroller and embedded systems using

Assembly and C”,second edition, Pearson education /Prentice hall of India , 2007

Web Links for E-Content:

Micro Processors and Micro Controllers

1.http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-

BANG/Microprocessors%20and%20Microcontrollers/New_index1.html


Course Title: Design and Analysis of Algorithms


Prerequisite: None

Syllabus:

Introduction: Notation of Algorithm, Fundamentals of Algorithmic Problem Solving, Important

Problem Types, Fundamental Data Structures. Fundamentals of the Analysis of Algorithm

Efficiency: Analysis Framework, Asymptotic Notations and Basic Efficiency Classes,

Mathematical Analysis of Non recursive Algorithms, Mathematical Analysis of recursive

Algorithms, Fibonacci Numbers, Empirical Analysis of Algorithms, Algorithm Visualization

Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute-Force String

Matching, Closest-Pair and Convex-Hull Problems by Brute Force, Exhaustive Search Divide-

and-Conquer: Merge sort, Quick Sort, Binary Search, Binary Tree Traversal and Related

Properties, Multiplication of Large Integers and Strassen’s Matrix Multiplication, Closest-Pair

and Convex-Hull Problems by Divide-and –Conquer Decrease-and-Conquer: Insertion Sort,

Depth-First Search and Breadth- First Search, Topological Sorting, Algorithms for Generating

Combinational Objects, Decrease-by-a-Constant-Factor Algorithms, Variable-size-Decrease

Algorithms Transform-and-Conquer: Presorting, Gaussian Elimination, Balanced Search

Tree, Heaps and Heap sort, Horner’s Rule and Binary Exponentiation, Problem Reduction

Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in String Matching,

Hashing, B-Trees Dynamic Programming: Computing a Binomial Coefficient, Warshall’s

and Floyd’s Algorithms, Optimal Binary Search Trees, The Knapsack Problem and Memory

Functions Greedy Technique: Prim’s Algorithms, Kruskal’s Algorithms, Dijkstra’s

Algorithms, Huffman Trees Limitations of Algorithm Power: Lower-Bound Arguments,

Decision Trees, P, NP, and NP- Complete Problems, Challenges of Numerical Algorithms

Coping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound,

Approximating Algorithms for NP-hard Problems, Algorithms for Solving Nonlinear Equations

TEXT BOOKS:

1. L Ellis Horowitz, Sartaj Sahni, ‘Fundamentals of Computer Algorithms’, Galgotia

Publications, 2001.

REFERENCE BOOKS:

1) Introduction to Design and Analysis of Algorithms by Anany Levitin -2007,

2nd Edition, Pearson Education

2. Aho, Hopcroft & Ullman, ‘The Design and Analysis of Computer Algorithms’,Addison

Wesley, 1974.


Design and Analysis of Algorithms

1.http://www.cdeep.iitb.ac.in/nptel/Computer%20Science/Design%20and%20Analysis%20o

f%20Algorithms/Course%20Objectives.html


Course Title: Internet Programming


Prerequisite: Object Oriented - Programming

Syllabus:

Introduction to Java, Classes: Declaring Objects, methods, Constructors, This keyword. Inheritance:

Types of Inheritance, using Super, Multi level Hierarchy, Method Overriding, Dynamic Method Dispatch.

Packages & Interfaces: Access Protection, importing Packages, Exception handling: Types of Exception,

Uncaught Exception, Try and catch, Throw, Finally. Multithreaded Programming: creating Thread,

Thread Priorities, Synchronizing threads, Inter Thread Communication, Event handling.

Three-Tier Application, Client-Server Application, Middle Tier, Client Tier.

Introduction to HTML and XHTML. Jscript: Introduction to Scripting, Control Structures-I, Control

Structures-II, Functions, Arrays, Objects, Protection, Dynamic HTML: Cascading Style Sheets

(CSS), Object model and Collections, Event model, Filters and transitions. DHTML: Data Binding with

Tabular Data control, Structured Graphics Activex control, Sequence and sprite active control, Client side

scripting with VB Script, Web servers: Microsoft Internet Information Services, Apache Web Server.

Active server pages: .Net Overview, Web forms, Session Tracking, Asp.Net and XML, Demonstration of

sample web pages

Text Books:

1. Herbert Schildt, ‘The Complete Reference Java2’, 5th Edition (TMH)

2. Deitel & Deitel & Nieto, “Internet & World Wide Web – How to Program”, PEA, 3rd Edition,

2002.

Reference Books:

1. E. Balaguruswamy, ‘Programming with JAVA’, 2nd Edition (TMH), 1999.

2. Daniel Minoli, ‘Internet & Intranet Engineering Technologies-Protocols and Applications’,

TMH, 1999.


Internet Programming

1. http://nptel.iitm.ac.in/video.php?subjectId=106105084.


Course Title: Cryptography & Network Security


Prerequisite: None

Syllabus:

Introduction: Security Trends, The OSI Security Architecture, Security Attacks, Security Services, Security

Mechanisms, A Model for Network Security, Recommended Reading & Web Sites. Classical Encryption

Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Rotor

Machines, Steganography. Block Ciphers & the Data Encryption Standard: Block Cipher Principles, The

Data Encryption Standard, The Strength of DES, Differential & Linear Cryptanalysis, Block Cipher Design

Principles. Advanced Encryption Standard: Evaluation Criteria for AES, The AES Cipher.

More on Symmetric Ciphers: Multiple Encryption & Triple DES, Block Cipher Modes of Operation, Stream

Ciphers & RC4. Confidentiality Using Symmetric Encryption: Placement of Encryption Function, Traffic

Confidentiality, Key Distribution, Random Number Generation. Public – Key Cryptography & RSA:

Principles of Public – key Cryptosystems, The RSA Algorithm. Key Management; Other Public-Key

Cryptosystems: Key Management, Diffie – Hellman Key Exchange, Elliptic Curve Arithmetic, Elliptic Curve

Cryptography. Message Authentication & Hash Functions: Authentication Requirements, Authentication

Functions, Message Authentication Codes, Hash Functions, Security of Hash Functions & Macs. Hash &

AC Algorithms: Secure Hash Algorithm, Whirlpool, HMAC, CMAC. Digital Signatures & Authentication

Protocols: Digital Signatures, Authentication Protocols, Digital Signature Standard. Authentication

Applications: Kerberos, X.509 Authentication Service, Public – Key Infrastructure. Electronic Mail

Security: Pretty Good Privacy, S/MIME. IP Security: IP Security Overview, IP Security Architecture,

Authentication Header, Encapsulating Security Payload, Combining Security Associations, Key

Management.

Web Security: Web Security Considerations, Secure Socket Layer & Transport Layer Security, Secure

Electronic Transaction.

Firewalls: Firewall Design Principles, Trusted Systems, Common Criteria for Information Technology

Security Evaluation.

TEXT BOOKS:

1) ‘Cryptography and Network Security’, William Stallings, 4th Edition, Prentice Hall, 2006.

Reference Books:

1) ‘Network Security: Private Communication in a Public World’, Charlie Kaufman,

Radia Perlman Mike Speciner, Publisher: Prentice Hall 2/E.

2) ‘Cryptography and Network Security’, Atul Kahate, Publisher TATA McGraw- Hill Publishing Co Edition

2003.

3) ‘Fundamentals of Network Security’, Eric Maiwald, Publisher TATA McGraw-Hill Publishing Co 2003

4) Rick Lehtinen, Deborah Russell & G.T.Gangemi Sr., SPD O’REILLY 2006.

5) Network Security Essentials (Applications and Standards) by William Stallings, Pearson Education.


Cryptography & Network Security

1. http://nptel.iitm.ac.in/courses/106105031/

Annexure - II

B.Tech (CSE) 2011-2015

SIXTH SEMESTER

SYLLABUS


Course Title: Automata Theory and Formal Languages


Prerequisite: None

Syllabus:

Finite Automata: An informal picture of FA, DFA, NFA, and FA with - transitions.

Regular expressions and languages: Regular expressions, FA and regular expressions, Algebraic laws of

regular expressions. Properties of Regular Languages: Proving languages not to be regular, Closure

properties of regular languages, Decision properties of regular languages, Equivalence and minimization

of Automata. Context – free grammars and languages: Context – Free grammars, Parse trees, Ambiguity

in grammars and languages. Pushdown Automata: Definition of the PDA, the languages of a PDA,

Equivalence of PDA’s and CFG’s, Deterministic PDA. Properties of Context – Free languages: Normal

forms for CFGs, The pumping lemma for CFLs, Closure properties of CFls, Decision properties of CFLs

.Introduction to Turing machines: Problems that computer can not solve, The Turing machines,

Programming techniques for Turing machines, Extensions to basic Turing machine, Restricted Turing

machine. Undecidability: A language that is not recursively enumerable, An undecidable problem that is

RE, Undecidable problems about Turing machines.

TEXT BOOK:

1. John E. Hopcroft, Rajeev Motwani and Jeffery D. Ullman: ‘Introduction to Automata theory, Languages

and Computation’, 3rd Edition. 2008, Pearson Education

REFERENCE BOOKS:

1. KLP Mishra & N.Chandrasekharan, ‘Theory of Computation’.,3rd Edition,2007, PHI

2. Harry R Lewis, Christos H Papadimitriou: ‘Elements of the theory of computation’, Second Edition.,

1997, PHI/Pearson Education, New Delhi.


Automata Theory and Formal Languages

1.http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-%20Guwahati/afl/index.htm


Course Title: Object Oriented Analysis and Design


Prerequisite: Software Engineering

Syllabus:

Overview of OOAD, Objects and UML; UML structure; UML building blocks; UML common

mechanisms; Architecture., Unified Process (UP), Rational Unified Process; Instantiating UP for a

project; UP Axioms; UP structure; UP phases. The requirements workflow. Software requirements –

meta model; Requirements Workflow Detail, Use case modeling; UP activity: Identifying Actors and

Use Cases; UP activity: Detail a use case; Use case specification; Requirements tracing; When to apply

use case Modeling, Advanced use case modeling; Actor generalization; Use case generalization; The

analysis workflow; Analysis artifacts – Meta model; Analysis workflow detail; Analysis model ,Objects

and classes; Finding analysis classes; UP activity: Analyze a use case; What are analysis classes? Finding

classes; creating a first-cut analysis model. Relationships; Advanced generalization. Analysis package,UP

activity: Interaction diagrams; Sequence diagrams; Combined fragments and operators; Communication

diagrams. Advanced use case realization; Interaction occurrences; Interruptible activity regions;

Exception handling; Expansion nodes; Interaction overview diagrams. The design workflow; Design

artifacts – metamodel; Design workflow detail; UP activity: Architectural design. Design classes; UP

activity: Design a class; How to refine analysis relationships; One-to-one associations; Many-to-one

associations; One-to-many associations; Collections; Reified relationships; Exploring composition with

structured classes. Interfaces and components; UP activity: Design a subsystem,Provided and required

interfaces; Interface realization vs. inheritance; Ports; Interfaces and component-based development;

What is a component? Component stereotypes; Subsystems; Finding interfaces; Designing with

interfaces; Advantages and disadvantages of interfaces. Use case realization-design; Interaction diagrams

in design; Modeling concurrency; Subsystem interactions; Timing diagrams; State machines;. Advanced

state machines; Composite states;Implementation workflow detail; Artifacts. Deployment; UP activity:

Architectural implementation; The deployment diagram;. Introduction to OCL.

Text Book:

1. Jim Arlow, Ila Neustadt, “UML 2 and the Unified Process”, Practical Object-Oriented Analysis

and Design, 2nd Edition 2005, Pearson Education.

Reference Books:

1. Booch, Rumbaugh, Jacobson, “The Unified Modeling Language Users manual”, Pearson

Education, 1999.

.

2. Simon Bennett, Steve McRobb and Ray Farmer, Object-Oriented Systems Analysis and Design

Using UML -, Second Edition, 2004, Tata McGraw-Hili Edition.


Object Oriented Analysis and Design

1. http://nptel.iitm.ac.in/syllabus/syllabus.php?subjectId=106106111


Course Title: Parallel processing


Prerequisite: Computer Organisation

Syllabus:

Parallel hardware and parallel software –some background, modifications of the von

Neumann model, parallel hardware, parallel software parallel program design, writing and

running parallel programs. Distributed memory programming with MPI-getting started, the

trapezoidal rule in MPI, dealing with I/O, collective communication, MPI derived data types,

performance evaluation of MPI programs, A parallel sorting algorithm . Shared memory

programming with pthreads –processes, threads and pthreads , hello, world, matrix vector

multiplication, critical sections, busy waiting, mutexes, producer consumer synchronization and

semaphores , barriers and condition variables, read write locks, caches, cache coherence and

false sharing, thread safety. Shared memory programming with openMP-getting started, the

trapezoidal rule, scope of variables, the reduction clause, the parallel for directive, more about

loops in openMP:sorting , scheduling loops, producers and consumers, caches, cache coherence

and false sharing, thread safety. An Overview of GPU Programming; An Overview of GPU Memory

Hierarchy Features;Introduction to Heterogeneous Computing – OpenCL; The OpenCL Kernel, The

OpenCL Memory Model, The OpenCL Execution Model; OpenCL Platform and Devices; OpenCL

Execution Environment, An Overview of OpenCL API; Heterogeneous Programming in OpenCL, An

Overview of CUDA enabled NVIDIA GPUs, Introduction to CUDA C, Parallel Programming in CUDA

C.

Text Book:

1. Peter S. Pacheco, An Introduction to Parallel Programming, 1st Edition, Elsevier, 2011.

2. Benedict R Gaster, Lee Howes, David R Kaeli Perhaad Mistry Dana Schaa, Heterogeneous

Computing with OpenCL, 1st Edition, MGH, 2011.

References:

1. NVIDIA Development Technology “CUDA API REFERENCE

MANUAL”,April2012,Version4.2

2. KHRONOS OpenCL Working Group”The OpenCL Specification”, Version1.1.


Parallel processing

1. http://nptel.iitm.ac.in/courses/106104024/

Documents

DDEEPPAAARRRTTTMMMEENNTTT T OOOFFF ...microprocessors to key boards, interfacing a microprocessor to a stepper motor. Introduction to microcontroller: Comparison of various microcontrollers