Data structure and Algorithm

NOTE: Before going deep into data structure, you should have a good knowledge of programming either in C or in C++ or Java or Python etc

A data structure is a particular way of organizing data in a computer so that it can be used effectively. For example, we can store a list of items having the same data-type using the array data structure.
Notes
Data Structure Unit I 
Data Structure Unit - II
Data Structure Unit III 
Data Structure Unit - IV
Data Structure Unit - V

In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory and languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?"

IT6006 Data Analytics syllabus

IT6006 Data Analytics

Introduction to Big Data Platform – Challenges of conventional systems - Web data – Evolution of Analytic scalability

, analytic processes and tools, Analysis vs reporting - Modern data analytic tools, Stastical concepts: Sampling distributions, resampling, statistical inference, prediction error.

UNIT II DATA ANALYSIS
Regression modeling, Multivariate analysis, Bayesian modeling, inference and Bayesian networks, Support vector and kernel methods, Analysis of time series: linear systems analysis, nonlinear dynamics - Rule induction - Neural networks: learning and generalization, competitive learning, principal component analysis and neural networks; Fuzzy logic: extracting fuzzy models from data, fuzzy decision trees, Stochastic search methods.

UNIT III MINING DATA STREAMS
Introduction to Streams Concepts – Stream data model and architecture - Stream Computing, Sampling data in a stream – Filtering streams – Counting distinct elements in a stream – Estimating moments – Counting oneness in a window – Decaying window - Realtime Analytics Platform(RTAP) applications - case studies - real time sentiment analysis, stock market predictions.

UNIT IV FREQUENT ITEMSETS AND CLUSTERING
Mining Frequent itemsets - Market based model – Apriori Algorithm – Handling large data sets in Main memory – Limited Pass algorithm – Counting frequent itemsets in a stream – Clustering Techniques – Hierarchical – K- Means – Clustering high dimensional data – CLIQUE and PROCLUS – Frequent pattern based clustering methods – Clustering in non-euclidean space – Clustering for streams and Parallelism.

UNIT V FRAMEWORKS AND VISUALIZATION
MapReduce – Hadoop, Hive, MapR – Sharding – NoSQL Databases - S3 - Hadoop Distributed file systems – Visualizations - Visual data analysis techniques, interaction techniques; Systems and applications:

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 )