CS6801 Multi – Core Architectures and Programming

CS6801 Multi – Core Architectures and Programming

CS6801 Syllabus Multi Core Architectures and Programming

CS6801 Syllabus Multi Core Architectures and Programming Regulation 2013 Anna University free download. Multi Core Architectures and Programming CS6801 Syllabus pdf free download.

UNIT I MULTI-CORE PROCESSORS 9 CS6801 Syllabus MCAP Multi Core Architectures and Programming

Single core to Multi-core architectures – SIMD and MIMD systems – Interconnection networks – Symmetric and Distributed Shared Memory Architectures – Cache coherence – Performance Issues – Parallel program design.

UNIT II PARALLEL PROGRAM CHALLENGES 9 CS6801 Syllabus MCAP Multi Core Architectures and Programming

Performance – Scalability – Synchronization and data sharing – Data races – Synchronization primitives (mutexes, locks, semaphores, barriers) – deadlocks and livelocks – communication between threads (condition variables, signals, message queues and pipes).

UNIT III SHARED MEMORY PROGRAMMING WITH OpenMP 9 CS6801 Syllabus Multi Core Architectures and Programming

OpenMP Execution Model – Memory Model – OpenMP Directives – Work-sharing Constructs – Library functions – Handling Data and Functional Parallelism – Handling Loops – Performance Considerations.

UNIT IV DISTRIBUTED MEMORY PROGRAMMING WITH MPI 9 CS6801 Syllabus Multi Core Architectures and Programming

MPI program execution – MPI constructs – libraries – MPI send and receive – Point-to-point and Collective communication – MPI derived datatypes – Performance evaluation

UNIT V PARALLEL PROGRAM DEVELOPMENT 9 CS6801 Syllabus Multi Core Architectures and Programming

Case studies – n-Body solvers – Tree Search – OpenMP and MPI implementations and comparison.

IT6006 Data Analytics Notes

IT6006 Data Analytics Notes

Theory of Computation

Theory of Computation

S. No	Topics/ Units to be covered
1	Conditional and Control statements Statements and Blocks, if-else, else-if, switch
2	Conditional and Control statements while, for, do-while, break and continue, goto and labels
3	Functions Basics, Functions returning values, External Variables, Scope rules
4	Functions Header file, Static variables, Register variables, Block Structure, Initialization, Recursion
5	Arrays One Dimensional Arrays, Two Dimensional Arrays, Multi Dimensional Arrays
6	Preprocessor C Preprocessor Directives, #define Statement, #include Statement, Conditional Compilation
7	Pointers Pointers and Addresses, Pointers and Arrays, Address Arithmetic, Pointer Arrays, Pointers to Pointers, Initialization of Pointer Arrays
8	Variation in pointer declarations Complication Declaration Function Pointers Pointer to Functions
9	Function with Variable number of arguments Pointer and Function Arguments, Character Pointers and Functions, Command Line Arguments
10	Structures Basics of Structures, Structures and Functions, Array of Structures
11	Structures Pointers to Structures, Self Referential Structures
12	Structures Table lookup, typedef
13	Unions Basics of Unions, Bit Fields
14	File Handling Concepts Redirecting I/O to a File, End of File
15	File Manipulations fopen, fclose, stdin, stdout, stderr, exit functions
16	File Manipulations Renaming and Removing Files
17	File read – write – binary and Stdio fprintf, fscanf, fgetc, fputc functions
18	Structures Basics of Structures, Structures and Functions, Array of Structures
19	Abstract Data Types (ADTs) Introduction
20	List ADT Array-based implementation, Linked list implementation
21	Singly linked lists Programming Details – Insertion
22	Singly linked lists Programming Details – Deletion, Find Operations
23	Circularly linked lists Implementation
24	Doubly-linked lists Implementation
25	Applications of lists Polynomial Manipulation – Insertion, Deletion
26	Applications of lists Polynomial Manipulation – Merge, Traversal
27	Applications of lists Radix Sort, Multilists

CS6006 Game Programming 2 Marks with Answers

CS6006 Game Programming Syllabus Notes Question Papers 2 Marks with Answers Question Bank with answers Anna University

Anna University CS6006 Game Programming Notes Syllabus 2 marks with answers Part A Question Bank with answers

Anna University CS6006 Game Programming Syllabus Notes 2 marks with the answer is provided below. CS6006 Notes Syllabus all 5 units notes are uploaded here. here CS6006 Game Programming Syllabus notes download link is provided and students can download the CS6006 Syllabus and Lecture Notes and can make use of it.

CS6006 Notes - Click here (UPDATED)

CS6006 2 marks with answers - Click here (2-Marks - 1 )

GRAPHICS FOR GAME PROGRAMMING

UNIT I 3D GRAPHICS FOR GAME PROGRAMMING 9

3D Transformations, 
Quaternions, 
3D Modeling and Rendering, 
Ray Tracing, 
Shader Models, 
Lighting, Color, 
Texturing, Camera and 
Projections, 
Culling and Clipping, 
Character Animation, 
Physics-based Simulation, 
Scene Graphs.

UNIT II GAME ENGINE DESIGN 9

Game engine architecture, 

Engine support systems, 

Resources and File systems, 

Game loop and real-time simulation, 
Human Interface devices, 

Collision and rigid body dynamics, 

Game profiling.

UNIT III GAME PROGRAMMING 9

Application layer, 
Game logic, 
Game views, 
managing memory, 
controlling the main loop,
 loading and caching game data, 
User Interface management, 
Game event management.

UNIT IV GAMING PLATFORMS AND FRAMEWORKS 9

2D and 3D Game development using Flash, DirectX, Java, Python, Game engines - DX Studio, Unity

UNIT V GAME DEVELOPMENT 9

Developing 2D and 3D interactive games using DirectX or Python – Isometric and Tile Based Games, Puzzle games, Single Player games, and Multi Player games

·         Mike Mc Shaffrfy and David Graham, “Game Coding Complete”, Fourth Edition, Cengage Learning, PTR, 2012.

·         Jason Gregory, “Game Engine Architecture”, CRC Press / A K Peters, 2009.

·         David H. Eberly, “3D Game Engine Design, Second Edition: A Practical Approach to Real-Time Computer Graphics” 2nd Editions, Morgan Kaufmann, 2006.

REFERENCES:

·         Ernest Adams and Andrew Rollings, “Fundamentals of Game Design”, 2nd Edition Prentice Hall / New Riders, 2009.

·         Eric Lengyel, “Mathematics for 3D Game Programming and Computer Graphics”, 3rd Edition, Course Technology PTR, 2011.

·         Jesse Schell, The Art of Game Design: A book of lenses, 1st Edition, CRC Press, 2008.

CS6006 Game Programming

UNIT I 3D GRAPHICS FOR GAME PROGRAMMING 9

3D Transformations, Quaternions, 3D Modeling and Rendering, Ray Tracing, Shader Models, Lighting, Color, Texturing, Camera and Projections, Culling and Clipping, Character Animation, Physics-based Simulation, Scene Graphs.

UNIT II GAME ENGINE DESIGN 9

Game engine architecture, Engine support systems, Resources and File systems, Game loop and real-time simulation, 
Human Interface devices, Collision and rigid body dynamics, Game profiling.

UNIT III GAME PROGRAMMING 9

Application layer, Game logic, Game views, managing memory, controlling the main loop, loading and caching game 
data, User Interface management, Game event management.

UNIT IV GAMING PLATFORMS AND FRAMEWORKS 9

2D and 3D Game development using Flash, DirectX, Java, Python, Game engines - DX Studio, Unity

UNIT V GAME DEVELOPMENT 9

Developing 2D and 3D interactive games using DirectX or Python – Isometric and Tile Based Games, Puzzle games, Single Player games, and Multi Player games

·         Mike Mc Shaffrfy and David Graham, “Game Coding Complete”, Fourth Edition, Cengage Learning, PTR, 2012.

·         Jason Gregory, “Game Engine Architecture”, CRC Press / A K Peters, 2009.

·         David H. Eberly, “3D Game Engine Design, Second Edition: A Practical Approach to Real-Time Computer Graphics” 2nd Editions, Morgan Kaufmann, 2006.

REFERENCES:

·         Ernest Adams and Andrew Rollings, “Fundamentals of Game Design”, 2nd Edition Prentice Hall / New Riders, 2009.

·         Eric Lengyel, “Mathematics for 3D Game Programming and Computer Graphics”, 3rd Edition, Course Technology PTR, 2011.

·         Jesse Schell, The Art of Game Design: A book of lenses, 1st Edition, CRC Press, 2008.

CS6601 Distributed system

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: IV/III Date:

Internal Assessment – I

PART – A 5x 2=10

1. Define distributed systems?(CO1)
2. Give examples of distributed systems . (CO1)
3. What is meant by interprocess Communication? (CO2)
4. What is the difference between RMI and RPC? (CO2)
5. Define Intranet.(CO1)

Part b

6. a. Explain the Differences between intranet and internet (5) (CO1)

b. Write in detail about resources of Distributed system (8) (CO1)

OR

6. Explain the various challenges of distributed systems (13) (CO1)

7. a. Explain the Communication between distributed objects (8) (CO2)

b. Explain in detail about Events and Notifications (5) (CO2)

OR

7. Explain in detail about Remote Procedure call with a case study (13) (CO2)

Part C

8 Write in detail about www (14)

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: IV/III Date:

Internal Assessment – I

PART – A 5x 2=10

1. Write the following (i)HTTP (ii) HTML (iii) URL (CO1)
2. What are the uses of web services? (CO1)
3. Define Datagram. (CO2)
4. What is the use of UDP? (CO2)
5. Define internet (CO1)

Part B

6. a. Explain the Differences between intranet and internet (5) (CO1)

Write in detail about resources of Distributed system (8) (CO1)

OR

6. Explain the various challenges of distributed systems (13) (CO1)

7. a. Explain the Communication between distributed objects (8) (CO2)

b. Explain in detail about Events and Notifications (8) (CO2)

OR

Explain in detail about Remote Procedure call with a case study (13) (CO2)

Part C

8. Write in detail about www (8) (CO1)

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – II

PART – A 5x 2=10

1. Define Datagram.(CO2)
2. What is the use of UDP? (CO2)
3. What are core OS Components? (CO3)
4. What is meant by cluster? (CO3)
5. What is the use of cryptography? (CO3)

Part B

6.Explain about the group and Client server communication (13) (CO2)

OR

6. Explain the various type communications with examples(13)(CO2)

7. Explain about the Andrew file system. (13) (CO3)

OR

7.Describe Operating system architecture (13) (CO3)

Part C

8. Explain about the Andrew file system. (14) (CO3)

INSTITUTE OF TECHNOLOGY

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – II

PART – A 5x 2=10

1. What are the methods provides by datagram socket? (CO2)
2. What are the characteristic of network hidden by streamabstraction? (CO2)
3. What is meant by invocation performance? (CO3)
4. Difference between monolithic and micro kernels(CO3)

Part B

6. a. Explain characteristics of interprocess communication. (5) (CO2)

b. Explain UDP datagram communication (8) (CO2)

OR

6. Explain in detail about Remote Procedure call with a case study (13)(CO2)

7. a. Discuss about threads in distributed systems (5) (CO3)

b. Discuss about the distributed file system. (8) (CO3)

OR

7. Explain about the file server architecture. (13) (CO3)

Part C

8. Describe detail about Java RMI with simple example (14)

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – III

PART – A 5x 2=10

1. What is the Name Spaces?(CO4)
2. What is the domain name system? (CO4)
3. Define Concurrency control. (CO5)
4. What is meant by nested transactions? (CO5)

Part B

6.Explain the case study of X.500 directory services. (13) (CO4)

OR

6.Explain about the Events and process state. (13) (CO4)

7.Describe in detail about distributed deadlocks (13) (CO5)

OR

7.Explain the concurrency control in distributed transactions (13) (CO5)

Part C

8. Describe detail about CODA with simple example (14) (CO4)

Department of Computer Science and Engineering

Sub. Name: Distributed System                                              Sub.Code: CS6601

Max.Marks: 50                                                                                      Time: 90 min

Department: Computer Science and Engineering                        Sem/Year: VI/III Date:

Internal Assessment – III

PART – A 5x 2=10

1. Define strict two phase locking. (CO4)
2. Define deadlock. (CO4)
3. Difference between validation phase and update phase(CO5)
4. Define time stamp ordering. (CO5)

Part B

6.Explain in detail about Name services (13) (CO4)

OR

6.Explain the case study of Global name services. (13) (CO4)

7. Explain about distributed deadlocks (13) (CO5)

OR

7. Describe in detail about distributed deadlocks (13) (CO5)

Part C

8. Describe detail about CODA with simple example (14) (CO4)