Sharon Gerson and Steven Gerson. Technical Writing: Process and Product (8th Edition), London: Longman, 2013
Rentz, Kathryn, Marie E. Flatley& Paula Lentz. Lesikar’s Business Communication Connecting in a Digital world, McGraw-Hill, Irwin.2012
Allan & Barbara Pease. The Definitive Book of Body Language,New York, Bantam,2004
Jones, Daniel. The Pronunciation of English, New Delhi, Universal Book Stall.2010
Sharma, Sangeeta& Mishra, Binod. Communication Skills for Engineers and Scientists, New Delhi: PHI Learning, 2009, rpt 2012
Probability spaces, conditional probability, independence; Discrete random variables, Independent random variables, the multinomial distribution, Poisson approximation to the binomial distribution, infinite sequences of Bernoulli trials, sums of independent random variables; Expectation of Discrete Random Variables, Moments, Variance of a sum, Correlation coefficient, Chebyshev's Inequality.
Continuous random varibales and their properties, distribution functions and densities, normal, exponential and gamma densities.
Bivariate distributions and their properties, distribution of sums and quotients, conditional densities, Bayes' rule.
Measures of Central tendency: Moments, skewness and Kurtosis - Probability distributions: Binomial, Poisson and Normal - evaluation of statistical parameters for these three distributions, Correlation and regression – Rank correlation.
Curve fitting by the method of least squares- fitting of straight lines, second degree parabolas and more general curves. Test of significance: Large sample test for single proportion, difference of proportions, single mean, difference of means, and difference of standard deviations.
Test for single mean, difference of means and correlation coefficients, test for ratio of variances
Chi-square test for goodness of fit and independence of attributes.
Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall, 2003 (Reprint).
S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.
W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd
Ed., Wiley, 1968.
N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2010.
B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000.
Veerarajan T., Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi, 2010.
Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures- Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list, etc.
Stacks and Queue: Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation, Application of queues.
Tree: Definitions - Height, depth, order, degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree.
Graphs: Introduction, Classification of graph: Directed and Undirected graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)-Kruskal, Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between different graph algorithms. Application of graphs.
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of various sorting techniques. Searching: Basic Search Techniques: Sequential search, Binary search, Comparison of search methods. Hashing & Indexing. Case Study: Application of various data structures in operating system, DBMS etc.
AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.
Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.
Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
Jean – Paul Trembly , Paul Sorenson, “An Introduction to Data Structure with application”, TMH.
Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.
Basic Concepts of Data and Information, Overview of Information Systems, File organization and access methods; Introduction to DBMS, Difference between DBMS and traditional file storage system. Characteristics of DBMS. Data Models, Schemas and Instances, DBMS architecture, Components of DBMS. Data Independence. Study of Entity Relationship Model, Type of attributes, Entity types, Relationship and Cardinalities, Participation, Roles and constraints.
Relational Data Model: Domains, Tuples, Attributes, Relations, keys and types of keys, Integrity Constraints, Relational Algebra: Queries using Select operation, project operation, renaming, joins, union, intersection, difference, division, and product etc. Relational Calculus, Tuple calculus. Query Language: SQL –basic SQL queries, functions, constraints, joins and nested queries, QBE (Query By Example), Indexing, and PL/SQL.
Normalization Theory and Database methodologies: Relation Schemas, Functional Dependencies- Definition and rules of axioms, Normal forms- 1NF, 2NF, 3NF and BCNF, Dependency preservation, properties, loss less join decomposition. Query Processing and Optimization: Various algorithms to implement select, project & join operation of relational algebra, complexity measures.
Transaction Processing: Introduction to Concurrency and Recovery, Read and Write Operations, Transaction properties, Transaction states, Schedules, Serializability, types of serializability and test for serializability, Concurrency Control: Types of Locks, Timestamp Based, Validation Based etc. Multiversion schemes, Recovery: Basic concepts, techniques based on deferred update and immediate update, Shadow paging, check points.
Storage structure: Secondary Storage Devices, RAID, Heap Files and Sorted files, Hashing techniques, Indexing techniques: Bitmap Indices, Case Study of any contemporary DBMS.
Korth H.F. &Silberschatz A., Sudarshan, “Database Systems”, McGraw-Hill, Sixth edition, 2010.
Elmasri R., Navathe S.B., “Fundamentals of Database Systems”, The Benjamin/ Cummings Publishing Company. Inc., 2004.
Date C.J., “An Introduction to Database Systems”, Addision Wesley, 8th edition, 2003
Oracle 9i, The Complete Reference, Oracle Press.
Alexis Leon, Mathews Leon, “Database Management Systems”, Leon Press Chennai and Vikas Publishing House Private Limited, New Delhi, 2002.
New Scheme Based On AICTE Flexible Curricula CSE-Data Science, III-Semester
Introduction to Object Oriented Thinking & Object Oriented Programming: Comparison with Procedural Programming, features of Object oriented paradigm– Merits and demerits of OO methodology; Object model; Elements of OOPS, IO processing, Data Type, Type Conversion, Control Statement, Loops, Arrays.
Encapsulation and Data Abstraction- Concept of Objects: State, Behavior & Identity of an object; Classes: identifying classes and candidates for Classes Attributes and Services, Access modifiers, Static members of a Class, Instances, Message passing, and Construction and destruction of Objects.
Relationships – Inheritance: purpose and its types, ‘is a’ relationship; Association, Aggregation. Concept of interfaces and Abstract classes.
Polymorphism: Introduction, Method Overriding & Overloading, static and run time Polymorphism. Virtual Function, friend function, Static function, friend class.
Strings, Exceptional handling, Introduction of Multi-threading and Data collections. Case study like: ATM, Library management system.
Timothy Budd, “An Introduction to Object-Oriented Programming”, AddisonWesley Publication, 3rd Edition.
Cay S. Horstmann and Gary Cornell, “Core Java: Volume I, Fundamentals”, Prentice Hall publication.
G. Booch, “Object Oriented Analysis& Design”, Addison Wesley.
James Martin, “Principles of Object Oriented Analysis and Design”, Prentice Hall/PTR.
Peter Coad and Edward Yourdon, “Object Oriented Design”, Prentice Hall/PTR.
Herbert Schildt, “Java 2: The Complete Reference”, McGraw-Hill Osborne Media.
New Scheme Based On AICTE Flexible Curricula CSE-Data Science, III-Semester
To write a Python program to find GCD of two numbers.
To write a Python Program to find the square root of a number by Newton’s Method.
To write a Python program to find the exponentiation of a number.
To write a Python Program to find the maximum from a list of numbers.
To write a Python Program to perform Linear Search
To write a Python Program to perform binary search.
To write a Python Program to perform selection sort.
To write a Python Program to perform insertion sort.
To write a Python Program to perform Merge sort.
To write a Python program to find first n prime numbers.
To write a Python program to multiply matrices.
To write a Python program for command line arguments.
To write a Python program to find the most frequent words in a text read from a file.
To write a Python program to simulate elliptical orbits in Pygame.
To write a Python program to bouncing ball in Pygame.
Sharon Gerson and Steven Gerson. Technical Writing: Process and Product (8th Edition), London: Longman, 2013
Rentz, Kathryn, Marie E. Flatley& Paula Lentz. Lesikar’s Business Communication Connecting in a Digital world, McGraw-Hill, Irwin.2012
Allan & Barbara Pease. The Definitive Book of Body Language,New York, Bantam,2004
Jones, Daniel. The Pronunciation of English, New Delhi, Universal Book Stall.2010
Sharma, Sangeeta& Mishra, Binod. Communication Skills for Engineers and Scientists, New Delhi: PHI Learning, 2009, rpt 2012
Probability spaces, conditional probability, independence; Discrete random variables, Independent random variables, the multinomial distribution, Poisson approximation to the binomial distribution, infinite sequences of Bernoulli trials, sums of independent random variables; Expectation of Discrete Random Variables, Moments, Variance of a sum, Correlation coefficient, Chebyshev's Inequality.
Continuous random varibales and their properties, distribution functions and densities, normal, exponential and gamma densities.
Bivariate distributions and their properties, distribution of sums and quotients, conditional densities, Bayes' rule.
Measures of Central tendency: Moments, skewness and Kurtosis - Probability distributions: Binomial, Poisson and Normal - evaluation of statistical parameters for these three distributions, Correlation and regression – Rank correlation.
Curve fitting by the method of least squares- fitting of straight lines, second degree parabolas and more general curves. Test of significance: Large sample test for single proportion, difference of proportions, single mean, difference of means, and difference of standard deviations.
Test for single mean, difference of means and correlation coefficients, test for ratio of variances
Chi-square test for goodness of fit and independence of attributes.
Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall, 2003 (Reprint).
S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.
W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd
Ed., Wiley, 1968.
N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2010.
B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000.
Veerarajan T., Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi, 2010.
Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures- Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list, etc.
Stacks and Queue: Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation, Application of queues.
Tree: Definitions - Height, depth, order, degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree.
Graphs: Introduction, Classification of graph: Directed and Undirected graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)-Kruskal, Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between different graph algorithms. Application of graphs.
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of various sorting techniques. Searching: Basic Search Techniques: Sequential search, Binary search, Comparison of search methods. Hashing & Indexing. Case Study: Application of various data structures in operating system, DBMS etc.
AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.
Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.
Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
Jean – Paul Trembly , Paul Sorenson, “An Introduction to Data Structure with application”, TMH.
Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.
Basic Concepts of Data and Information, Overview of Information Systems, File organization and access methods; Introduction to DBMS, Difference between DBMS and traditional file storage system. Characteristics of DBMS. Data Models, Schemas and Instances, DBMS architecture, Components of DBMS. Data Independence. Study of Entity Relationship Model, Type of attributes, Entity types, Relationship and Cardinalities, Participation, Roles and constraints.
Relational Data Model: Domains, Tuples, Attributes, Relations, keys and types of keys, Integrity Constraints, Relational Algebra: Queries using Select operation, project operation, renaming, joins, union, intersection, difference, division, and product etc. Relational Calculus, Tuple calculus. Query Language: SQL –basic SQL queries, functions, constraints, joins and nested queries, QBE (Query By Example), Indexing, and PL/SQL.
Normalization Theory and Database methodologies: Relation Schemas, Functional Dependencies- Definition and rules of axioms, Normal forms- 1NF, 2NF, 3NF and BCNF, Dependency preservation, properties, loss less join decomposition. Query Processing and Optimization: Various algorithms to implement select, project & join operation of relational algebra, complexity measures.
Transaction Processing: Introduction to Concurrency and Recovery, Read and Write Operations, Transaction properties, Transaction states, Schedules, Serializability, types of serializability and test for serializability, Concurrency Control: Types of Locks, Timestamp Based, Validation Based etc. Multiversion schemes, Recovery: Basic concepts, techniques based on deferred update and immediate update, Shadow paging, check points.
Storage structure: Secondary Storage Devices, RAID, Heap Files and Sorted files, Hashing techniques, Indexing techniques: Bitmap Indices, Case Study of any contemporary DBMS.
Korth H.F. &Silberschatz A., Sudarshan, “Database Systems”, McGraw-Hill, Sixth edition, 2010.
Elmasri R., Navathe S.B., “Fundamentals of Database Systems”, The Benjamin/ Cummings Publishing Company. Inc., 2004.
Date C.J., “An Introduction to Database Systems”, Addision Wesley, 8th edition, 2003
Oracle 9i, The Complete Reference, Oracle Press.
Alexis Leon, Mathews Leon, “Database Management Systems”, Leon Press Chennai and Vikas Publishing House Private Limited, New Delhi, 2002.
New Scheme Based On AICTE Flexible Curricula CSE-Data Science, III-Semester
Introduction to Object Oriented Thinking & Object Oriented Programming: Comparison with Procedural Programming, features of Object oriented paradigm– Merits and demerits of OO methodology; Object model; Elements of OOPS, IO processing, Data Type, Type Conversion, Control Statement, Loops, Arrays.
Encapsulation and Data Abstraction- Concept of Objects: State, Behavior & Identity of an object; Classes: identifying classes and candidates for Classes Attributes and Services, Access modifiers, Static members of a Class, Instances, Message passing, and Construction and destruction of Objects.
Relationships – Inheritance: purpose and its types, ‘is a’ relationship; Association, Aggregation. Concept of interfaces and Abstract classes.
Polymorphism: Introduction, Method Overriding & Overloading, static and run time Polymorphism. Virtual Function, friend function, Static function, friend class.
Strings, Exceptional handling, Introduction of Multi-threading and Data collections. Case study like: ATM, Library management system.
Timothy Budd, “An Introduction to Object-Oriented Programming”, AddisonWesley Publication, 3rd Edition.
Cay S. Horstmann and Gary Cornell, “Core Java: Volume I, Fundamentals”, Prentice Hall publication.
G. Booch, “Object Oriented Analysis& Design”, Addison Wesley.
James Martin, “Principles of Object Oriented Analysis and Design”, Prentice Hall/PTR.
Peter Coad and Edward Yourdon, “Object Oriented Design”, Prentice Hall/PTR.
Herbert Schildt, “Java 2: The Complete Reference”, McGraw-Hill Osborne Media.
New Scheme Based On AICTE Flexible Curricula CSE-Data Science, III-Semester
To write a Python program to find GCD of two numbers.
To write a Python Program to find the square root of a number by Newton’s Method.
To write a Python program to find the exponentiation of a number.
To write a Python Program to find the maximum from a list of numbers.
To write a Python Program to perform Linear Search
To write a Python Program to perform binary search.
To write a Python Program to perform selection sort.
To write a Python Program to perform insertion sort.
To write a Python Program to perform Merge sort.
To write a Python program to find first n prime numbers.
To write a Python program to multiply matrices.
To write a Python program for command line arguments.
To write a Python program to find the most frequent words in a text read from a file.
To write a Python program to simulate elliptical orbits in Pygame.
To write a Python program to bouncing ball in Pygame.