RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

CB-301 FORMAL LANGUAGE & AUTOMATA THEORY

Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of languages.

Regular languages and finite automata: Regular expressions and languages, deterministic finite automata (DFA) and equivalence with regular expressions, nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars andequivalence with finite automata, properties of regular languages, Kleene’s theorem, pumping lemma forregular languages, Myhill-Nerode theorem and its uses, minimization of finite automata.

Context-free languages and pushdown automata: Context-free grammars (CFG) and languages (CFL), Chomsky and Greibachnormal forms, nondeterministic pushdown automata (PDA) and equivalence with CFG,parse trees, ambiguity in CFG, pumping lemma for context- free languages, deterministicpushdown automata, closure properties of CFLs.

Context-sensitive languages:Context-sensitive grammars (CSG) and languages, linear bounded automata andequivalence with CSG.

Turing machines: The basic model for Turing machines (TM), Turingrecognizable(recursively enumerable) and Turing-decidable (recursive) languages and theirclosure properties, variants of Turing machines, nondeterministic TMs and equivalence withdeterministic TMs, unrestricted grammars and equivalence with Turing machines, TMsas enumerators.

Undecidability: Church-Turing thesis, universal Turing machine, theuniversal and diagonalization languages, reduction between languages and Rice s theorem,undecidable problems about languages.

Basic Introduction to Complexity:Introductory ideas on Time complexity of deterministic and nondeterministic Turing machines, P and NP, NP- completeness, Cook’s Theorem, other NP - Complete problems.

Laboratory

1. YACC, the parser-generating tool(Chapter 5 of Introduction to Automata Theory, Languages, and Computation John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman.)

   Text Books:

2. Introduction to Automata Theory, Languages, and Computation John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman.

Reference Books:

1. Elements of the Theory of Computation, Harry R. Lewis and Christos H. Papadimitriou.

2. Automata and Computability, Dexter C. Kozen.

3. Introduction to the Theory of Computation, Michael Sipser.

4. Introduction to Languages and the Theory of Computation, John Martin.

5. Computers and Intractability: A Guide to the Theory of NP Completeness, M. R. Garey and

D. S. Johnson.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

CB 302- COMPUTER ORGANIZATION & ARCHITECHTURE

Revision of basics in Boolean logic and Combinational/Sequential Circuits. Functional blocks of a computer: CPU, memory, input-output subsystems, control unit.

Instruction set architecture of a CPU: Registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. Outlining instruction sets of some common CPUs.

Data representation: Signed number representation, fixed and floating point representations, character representation.

Computer arithmetic: Integer addition and subtraction, ripple carry adder, carry look-ahead adder, etc. multiplication – shift-and-add, Booth multiplier, carry save multiplier, etc. Division restoring and non-restoring techniques, floating point arithmetic, IEEE 754 format.

Introduction to x86 architecture.

CPU control unit design: Hardwired and micro-programmed design approaches, design of a simple hypothetical CPU.

Memory system design: Semiconductor memory technologies, memory organization.

Peripheral devices and their characteristics: Input-output subsystems, I/O device interface, I/O transfers – program controlled, interrupt driven and DMA, privileged and non-privileged instructions, software interrupts and exceptions. Programs and processes – role of interrupts in process state transitions, I/O device interfaces – SCII, USB

Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards.

Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache coherency.

Memory organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs. block size, mapping functions, replacement algorithms, write policies.

Lab:

1. Circuits on breadboard or simulators

   1. Implementation of Combinational Digital/Boolean Circuits: Adder, Subtractor, Multiplication Module, Division Module, Multiplexer, Demultiplexer, Encoder, Decoder.

   2. Implementation of Sequential Circuits: Counters, Linear Feedback Shift Registers (LFSR)

2. C/C++ programming to understand the formats of char, int, float, double, long etc.

3. Machine language programming on x86 or higher version kits or simulators:

1. Add/subtract/multiplication/division/GCD/LCM

2. Accessing some specific memory locations/ports

3. Counting odd and even integers from a series of memory locations

4. Printing values of selected registers

5. Handing interrupts

   Text Books:

   1. Computer System Architecture M. M. Mano:, 3rd ed., Prentice Hall of India, New Delhi, 1993.

   2. Computer Organization and Design: The Hardware/Software Interface, David A. Patterson and John L. Hennessy.

   3. Computer Organization and Embedded Systems, Carl Hamacher.

Reference Books:

1. Computer Architecture and Organization, John P. Hayes.

2. Computer Organization and Architecture: Designing for Performance, William Stallings.

3. Computer System Design and Architecture, Vincent P. Heuring and Harry F. Jordan.

   RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

   New Scheme Based On AICTE Flexible Curricula

   III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

   CB303-OBJECT ORIENTED PROGRAMMING + Lab

   Procedural programming, An Overview of C: Types Operator and Expressions, Scope and Lifetime, Constants, Pointers, Arrays, and References, Control Flow, Functions and Program Structure, Namespaces, error handling, Input and Output (C-way), Library Functions (string, math, stdlib), Command line arguments, Pre-processor directive

   Some difference between C and C++: Single line comments, Local variable declaration within function scope, function declaration, function overloading, stronger type checking, Reference variable, parameter passing – value vs reference, passing pointer by value or reference, #define constant vs const, Operator new and delete, the typecasting operator,Inline Functions in contrast to macro, default arguments

   The Fundamentals of Object Oriented Programming: Necessity for OOP, Data Hiding, Data Abstraction, Encapsulation, Procedural Abstraction, Class and Object.

   More extensions to C in C++ to provide OOP Facilities: Scope of Class and Scope Resolution Operator, Member Function of a Class, private, protected and public Access Specifier, this Keyword, Constructors and Destructors, friend class, error handling (exception)

   Essentials of Object Oriented Programming: Operator overloading, Inheritance – Single and Multiple, Class Hierarchy, Pointers to Objects, Assignment of an Object to another Object, Polymorphism through dynamic binding, Virtual Functions, Overloading, overriding and hiding, Error Handling

   Generic Programming: Template concept, class template, function template, template specialization

   Input and Output: Streams, Files, Library functions, formatted output

   Object Oriented Design and Modelling: UML concept, Use case for requirement capturing, Class diagram, Activity diagram and Sequence Diagram for design, Corresponding C++ code from design

   Laboratory

   1. Parameter passing: passing parameter by value vs by reference, passing array as constant pointer

   2. Function overloading: writing string operations like strcat and strncat, strcpy and strncpy as overloaded functions.

   3. Dynamically allocating space for a pointer depending on input and doing this repeatedly, depending on different inputs and finally de-allocating the pointer.

   4. Define class complex with all possible operations: constructor, destructor, copy constructor, assignment operator with the data members stored as pointer to integers.

   5. Define class vector of integers with all possible operations like constructor, destructor, copy constructor and assignment operators

   6. Define class matrix of integers with all possible operations like constructor, destructor, copy constructor and assignment operators

   7. Define class matrix of integers using vector, with all possible operations like constructor, destructor, copy constructor and assignment operators

   8. Define class stack, queue, linked-list, array, set using some data-type (int) with data members kept as private and functions kept in both protected and public sections.

   9. Define class complex with all possible operators: constructor, destructor, copy constructor, assignment operator and operators >, <, >=, <=, ==, ++ (pre and post), +, +=, ( ), with the data members stored as pointer to integers.

   10. Define class vector of integers with all possible operations like constructor, destructor, copy constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post), +, +=, ( )

   11. Define class matrix of integers with all possible operations like constructor, destructor, copy constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post), +, +=, ( ).

   12. Define class matrix of integers using vector, with all possible operations like constructor, destructor, copy constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post),

       +, +=, ( ).

   13. Define stack and queue inherited from array class, with standard functions and operators

   14. Define a class called ‘array’ with data type passed as template type with constructor, destructor, copy constructor and assignment operators and index operator.

   15. Define template functions for compare and use it in the algorithms like bubble sort, insertion sort, merge sort.

   16. Formatted input-output examples

   17. Input manipulators

   18. Overriding operators <<, >>

   19. Define class model for complex number, student class, book class and show it using UML diagram as well as concrete class.

   20. Show behavioural modelling through sequence diagram and activity diagram for workflow in a typical log-in, log-out situation.

Text Books:

1. The C++ Programming Language, Bjarne Stroustrup, Addison Wesley.

2. C++ and Object-Oriented Programming Paradigm, Debasish Jana, PHI Learning Pvt. Ltd.

Reference Books:

1. Programming – Principles and Practice Using C++, Bjarne Stroustrup, Addison Wesley.

2. The Design and Evolution of C++, Bjarne Stroustrup, Addison Wesley.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

CB304-COMPUTATIONAL STATISTICS

Multivariate Normal Distribution: Multivariate Normal Distribution Functions, Conditional Distribution and its relation to regression model, Estimation of parameters.

Discriminant Analysis: Statistical background, linear discriminant function analysis, Estimating linear discriminant functions and their properties.

Principal Component Analysis: Principal components, Algorithm for conducting principal component analysis, deciding on how many principal components to retain, H-plot.

Factor Analysis: Factor analysis model, Extracting common factors, determining number of factors, Transformation of factor analysis solutions, Factor scores.

Clustering: Introduction, Types of clustering, Correlations and distances, clustering by partitioning methods, hierarchical clustering, overlapping clustering, K-Means Clustering- Profiling and Interpreting Clusters

Laboratory

Python Concepts, Data Structures, Classes: Interpreter, Program Execution, Statements, Expressions, Flow Controls, Functions, Numeric Types, Sequences and Class Definition, Constructors, Text & Binary Files - Reading and Writing

Data Wrangling: Combining and Merging Datasets, Reshaping and Pivoting, Data Transformation, String Manipulation, Regular Expressions

Data Aggregation, Group Operations, Time series:GoupBy Mechanics, Data Aggregation, Groupwise Operations and Transformations, Pivot Tables and Cross Tabulations, Time Series Basics, Data Ranges, Frequencies and Shifting

Visualization in Python: Matplotlib package, Plotting Graphs, Controlling Graph, Adding Text, More Graph Types, Getting and setting values, Patches

Text Books:

1. An Introduction to Multivariate Statistical Analysis, T.W. Anderson.

2. Applied Multivariate Data Analysis, Vol I & II, J.D. Jobson.

3. Statistical Tests for Multivariate Analysis, H. Kris.

4. Programming Python, Mark Lutz.

5. Python 3 for Absolute Beginners, Tim Hall and J-P Stacey.

6. Beginning Python: From Novice to Professional, Magnus Lie Hetland. Edition, 2005

COMPUTATIONAL STATISTICS + Lab (continued)

Reference Books:

1. Regression Diagnostics , Identifying Influential Data and Sources of Collinearety, D.A. Belsey, E. Kuh and R.E. Welsch

2. Applied Linear Regression Models, J. Neter, W. Wasserman and M.H. Kutner.

3. The Foundations of Factor Analysis, A.S. Mulaik.

4. Introduction to Linear Regression Analysis, D.C. Montgomery and E.A. Peck.

5. Cluster Analysis for Applications, M.R. Anderberg.

6. Multivariate Statistical Analysis, D.F. Morrison.

7. Python for Data Analysis, Wes Mc Kinney.

   RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

   New Scheme Based On AICTE Flexible Curricula

   III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

   CB305-DATATBASE MANGEMENT SYSTEMS

   Introduction: Introduction to Database. Hierarchical, Network and Relational Models.

   Database system architecture: Data Abstraction, Data Independence, Data DefinitionLanguage (DDL), Data Manipulation Language (DML).

   Data models: Entity-relationship model, network model, relational and object orienteddata models, integrity constraints, data manipulation operations.

   Relational query languages: Relational algebra, Tuple and domain relational calculus,SQL3, DDL and DML constructs, Open source and Commercial DBMS - MYSQL,ORACLE, DB2, SQL server.

   Relational database design: Domain and data dependency, Armstrong's axioms, Functional Dependencies, Normal forms, Dependency preservation, Lossless design.

   Query processing and optimization: Evaluation of relational algebra expressions, Queryequivalence, Join strategies, Query optimization algorithms.

   Storage strategies: Indices, B-trees, Hashing.

   Transaction processing: Concurrency control, ACID property, Serializability ofscheduling, Locking and timestamp based schedulers, Multi-version and optimisticConcurrency Control schemes, Database recovery.

   Database Security: Authentication, Authorization and access control, DAC, MAC andRBAC models, Intrusion detection, SQL injection.

   Advanced topics: Object oriented and object relational databases, Logical databases, Webdatabases, Distributed databases, Data warehousing and data mining.

   Laboratory

   1. C implementation of a Database Editor.

   2. Download standard data of reasonable size (Unit level data of various rounds of NSS surveys) form internet and implement various SQL commands.

Text Books:

1. Database System Concepts. Abraham Silberschatz, Henry F. Korth and S. Sudarshan.

Reference Books:

1. Principles of Database and Knowledge – Base Systems, Vol 1 by J. D. Ullman.

2. Fundamentals of Database Systems. R. Elmasri and S. Navathe.

3. Foundations of Databases. Serge Abiteboul, Richard Hull, Victor Vianu.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

CB-301 FORMAL LANGUAGE & AUTOMATA THEORY

Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of languages.

Regular languages and finite automata: Regular expressions and languages, deterministic finite automata (DFA) and equivalence with regular expressions, nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars andequivalence with finite automata, properties of regular languages, Kleene’s theorem, pumping lemma forregular languages, Myhill-Nerode theorem and its uses, minimization of finite automata.

Context-free languages and pushdown automata: Context-free grammars (CFG) and languages (CFL), Chomsky and Greibachnormal forms, nondeterministic pushdown automata (PDA) and equivalence with CFG,parse trees, ambiguity in CFG, pumping lemma for context- free languages, deterministicpushdown automata, closure properties of CFLs.

Context-sensitive languages:Context-sensitive grammars (CSG) and languages, linear bounded automata andequivalence with CSG.

Turing machines: The basic model for Turing machines (TM), Turingrecognizable(recursively enumerable) and Turing-decidable (recursive) languages and theirclosure properties, variants of Turing machines, nondeterministic TMs and equivalence withdeterministic TMs, unrestricted grammars and equivalence with Turing machines, TMsas enumerators.

Undecidability: Church-Turing thesis, universal Turing machine, theuniversal and diagonalization languages, reduction between languages and Rice s theorem,undecidable problems about languages.

Basic Introduction to Complexity:Introductory ideas on Time complexity of deterministic and nondeterministic Turing machines, P and NP, NP- completeness, Cook’s Theorem, other NP - Complete problems.

Laboratory

1. YACC, the parser-generating tool(Chapter 5 of Introduction to Automata Theory, Languages, and Computation John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman.)

   Text Books:

2. Introduction to Automata Theory, Languages, and Computation John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman.

Reference Books:

1. Elements of the Theory of Computation, Harry R. Lewis and Christos H. Papadimitriou.

2. Automata and Computability, Dexter C. Kozen.

3. Introduction to the Theory of Computation, Michael Sipser.

4. Introduction to Languages and the Theory of Computation, John Martin.

5. Computers and Intractability: A Guide to the Theory of NP Completeness, M. R. Garey and

D. S. Johnson.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

CB 302- COMPUTER ORGANIZATION & ARCHITECHTURE

Revision of basics in Boolean logic and Combinational/Sequential Circuits. Functional blocks of a computer: CPU, memory, input-output subsystems, control unit.

Instruction set architecture of a CPU: Registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. Outlining instruction sets of some common CPUs.

Data representation: Signed number representation, fixed and floating point representations, character representation.

Computer arithmetic: Integer addition and subtraction, ripple carry adder, carry look-ahead adder, etc. multiplication – shift-and-add, Booth multiplier, carry save multiplier, etc. Division restoring and non-restoring techniques, floating point arithmetic, IEEE 754 format.

Introduction to x86 architecture.

CPU control unit design: Hardwired and micro-programmed design approaches, design of a simple hypothetical CPU.

Memory system design: Semiconductor memory technologies, memory organization.

Peripheral devices and their characteristics: Input-output subsystems, I/O device interface, I/O transfers – program controlled, interrupt driven and DMA, privileged and non-privileged instructions, software interrupts and exceptions. Programs and processes – role of interrupts in process state transitions, I/O device interfaces – SCII, USB

Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards.

Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache coherency.

Memory organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs. block size, mapping functions, replacement algorithms, write policies.

Lab:

1. Circuits on breadboard or simulators

   1. Implementation of Combinational Digital/Boolean Circuits: Adder, Subtractor, Multiplication Module, Division Module, Multiplexer, Demultiplexer, Encoder, Decoder.

   2. Implementation of Sequential Circuits: Counters, Linear Feedback Shift Registers (LFSR)

2. C/C++ programming to understand the formats of char, int, float, double, long etc.

3. Machine language programming on x86 or higher version kits or simulators:

1. Add/subtract/multiplication/division/GCD/LCM

2. Accessing some specific memory locations/ports

3. Counting odd and even integers from a series of memory locations

4. Printing values of selected registers

5. Handing interrupts

   Text Books:

   1. Computer System Architecture M. M. Mano:, 3rd ed., Prentice Hall of India, New Delhi, 1993.

   2. Computer Organization and Design: The Hardware/Software Interface, David A. Patterson and John L. Hennessy.

   3. Computer Organization and Embedded Systems, Carl Hamacher.

Reference Books:

1. Computer Architecture and Organization, John P. Hayes.

2. Computer Organization and Architecture: Designing for Performance, William Stallings.

3. Computer System Design and Architecture, Vincent P. Heuring and Harry F. Jordan.

   RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

   New Scheme Based On AICTE Flexible Curricula

   III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

   CB303-OBJECT ORIENTED PROGRAMMING + Lab

   Procedural programming, An Overview of C: Types Operator and Expressions, Scope and Lifetime, Constants, Pointers, Arrays, and References, Control Flow, Functions and Program Structure, Namespaces, error handling, Input and Output (C-way), Library Functions (string, math, stdlib), Command line arguments, Pre-processor directive

   Some difference between C and C++: Single line comments, Local variable declaration within function scope, function declaration, function overloading, stronger type checking, Reference variable, parameter passing – value vs reference, passing pointer by value or reference, #define constant vs const, Operator new and delete, the typecasting operator,Inline Functions in contrast to macro, default arguments

   The Fundamentals of Object Oriented Programming: Necessity for OOP, Data Hiding, Data Abstraction, Encapsulation, Procedural Abstraction, Class and Object.

   More extensions to C in C++ to provide OOP Facilities: Scope of Class and Scope Resolution Operator, Member Function of a Class, private, protected and public Access Specifier, this Keyword, Constructors and Destructors, friend class, error handling (exception)

   Essentials of Object Oriented Programming: Operator overloading, Inheritance – Single and Multiple, Class Hierarchy, Pointers to Objects, Assignment of an Object to another Object, Polymorphism through dynamic binding, Virtual Functions, Overloading, overriding and hiding, Error Handling

   Generic Programming: Template concept, class template, function template, template specialization

   Input and Output: Streams, Files, Library functions, formatted output

   Object Oriented Design and Modelling: UML concept, Use case for requirement capturing, Class diagram, Activity diagram and Sequence Diagram for design, Corresponding C++ code from design

   Laboratory

   1. Parameter passing: passing parameter by value vs by reference, passing array as constant pointer

   2. Function overloading: writing string operations like strcat and strncat, strcpy and strncpy as overloaded functions.

   3. Dynamically allocating space for a pointer depending on input and doing this repeatedly, depending on different inputs and finally de-allocating the pointer.

   4. Define class complex with all possible operations: constructor, destructor, copy constructor, assignment operator with the data members stored as pointer to integers.

   5. Define class vector of integers with all possible operations like constructor, destructor, copy constructor and assignment operators

   6. Define class matrix of integers with all possible operations like constructor, destructor, copy constructor and assignment operators

   7. Define class matrix of integers using vector, with all possible operations like constructor, destructor, copy constructor and assignment operators

   8. Define class stack, queue, linked-list, array, set using some data-type (int) with data members kept as private and functions kept in both protected and public sections.

   9. Define class complex with all possible operators: constructor, destructor, copy constructor, assignment operator and operators >, <, >=, <=, ==, ++ (pre and post), +, +=, ( ), with the data members stored as pointer to integers.

   10. Define class vector of integers with all possible operations like constructor, destructor, copy constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post), +, +=, ( )

   11. Define class matrix of integers with all possible operations like constructor, destructor, copy constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post), +, +=, ( ).

   12. Define class matrix of integers using vector, with all possible operations like constructor, destructor, copy constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post),

       +, +=, ( ).

   13. Define stack and queue inherited from array class, with standard functions and operators

   14. Define a class called ‘array’ with data type passed as template type with constructor, destructor, copy constructor and assignment operators and index operator.

   15. Define template functions for compare and use it in the algorithms like bubble sort, insertion sort, merge sort.

   16. Formatted input-output examples

   17. Input manipulators

   18. Overriding operators <<, >>

   19. Define class model for complex number, student class, book class and show it using UML diagram as well as concrete class.

   20. Show behavioural modelling through sequence diagram and activity diagram for workflow in a typical log-in, log-out situation.

Text Books:

1. The C++ Programming Language, Bjarne Stroustrup, Addison Wesley.

2. C++ and Object-Oriented Programming Paradigm, Debasish Jana, PHI Learning Pvt. Ltd.

Reference Books:

1. Programming – Principles and Practice Using C++, Bjarne Stroustrup, Addison Wesley.

2. The Design and Evolution of C++, Bjarne Stroustrup, Addison Wesley.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

CB304-COMPUTATIONAL STATISTICS

Multivariate Normal Distribution: Multivariate Normal Distribution Functions, Conditional Distribution and its relation to regression model, Estimation of parameters.

Discriminant Analysis: Statistical background, linear discriminant function analysis, Estimating linear discriminant functions and their properties.

Principal Component Analysis: Principal components, Algorithm for conducting principal component analysis, deciding on how many principal components to retain, H-plot.

Factor Analysis: Factor analysis model, Extracting common factors, determining number of factors, Transformation of factor analysis solutions, Factor scores.

Clustering: Introduction, Types of clustering, Correlations and distances, clustering by partitioning methods, hierarchical clustering, overlapping clustering, K-Means Clustering- Profiling and Interpreting Clusters

Laboratory

Python Concepts, Data Structures, Classes: Interpreter, Program Execution, Statements, Expressions, Flow Controls, Functions, Numeric Types, Sequences and Class Definition, Constructors, Text & Binary Files - Reading and Writing

Data Wrangling: Combining and Merging Datasets, Reshaping and Pivoting, Data Transformation, String Manipulation, Regular Expressions

Data Aggregation, Group Operations, Time series:GoupBy Mechanics, Data Aggregation, Groupwise Operations and Transformations, Pivot Tables and Cross Tabulations, Time Series Basics, Data Ranges, Frequencies and Shifting

Visualization in Python: Matplotlib package, Plotting Graphs, Controlling Graph, Adding Text, More Graph Types, Getting and setting values, Patches

Text Books:

1. An Introduction to Multivariate Statistical Analysis, T.W. Anderson.

2. Applied Multivariate Data Analysis, Vol I & II, J.D. Jobson.

3. Statistical Tests for Multivariate Analysis, H. Kris.

4. Programming Python, Mark Lutz.

5. Python 3 for Absolute Beginners, Tim Hall and J-P Stacey.

6. Beginning Python: From Novice to Professional, Magnus Lie Hetland. Edition, 2005

COMPUTATIONAL STATISTICS + Lab (continued)

Reference Books:

1. Regression Diagnostics , Identifying Influential Data and Sources of Collinearety, D.A. Belsey, E. Kuh and R.E. Welsch

2. Applied Linear Regression Models, J. Neter, W. Wasserman and M.H. Kutner.

3. The Foundations of Factor Analysis, A.S. Mulaik.

4. Introduction to Linear Regression Analysis, D.C. Montgomery and E.A. Peck.

5. Cluster Analysis for Applications, M.R. Anderberg.

6. Multivariate Statistical Analysis, D.F. Morrison.

7. Python for Data Analysis, Wes Mc Kinney.

   RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

   New Scheme Based On AICTE Flexible Curricula

   III Semester Bachelor of Technology (B.Tech.)-Computer Science and Business System (CSBS) W.e.f. July 2021

   CB305-DATATBASE MANGEMENT SYSTEMS

   Introduction: Introduction to Database. Hierarchical, Network and Relational Models.

   Database system architecture: Data Abstraction, Data Independence, Data DefinitionLanguage (DDL), Data Manipulation Language (DML).

   Data models: Entity-relationship model, network model, relational and object orienteddata models, integrity constraints, data manipulation operations.

   Relational query languages: Relational algebra, Tuple and domain relational calculus,SQL3, DDL and DML constructs, Open source and Commercial DBMS - MYSQL,ORACLE, DB2, SQL server.

   Relational database design: Domain and data dependency, Armstrong's axioms, Functional Dependencies, Normal forms, Dependency preservation, Lossless design.

   Query processing and optimization: Evaluation of relational algebra expressions, Queryequivalence, Join strategies, Query optimization algorithms.

   Storage strategies: Indices, B-trees, Hashing.

   Transaction processing: Concurrency control, ACID property, Serializability ofscheduling, Locking and timestamp based schedulers, Multi-version and optimisticConcurrency Control schemes, Database recovery.

   Database Security: Authentication, Authorization and access control, DAC, MAC andRBAC models, Intrusion detection, SQL injection.

   Advanced topics: Object oriented and object relational databases, Logical databases, Webdatabases, Distributed databases, Data warehousing and data mining.

   Laboratory

   1. C implementation of a Database Editor.

   2. Download standard data of reasonable size (Unit level data of various rounds of NSS surveys) form internet and implement various SQL commands.

Text Books:

1. Database System Concepts. Abraham Silberschatz, Henry F. Korth and S. Sudarshan.

Reference Books:

1. Principles of Database and Knowledge – Base Systems, Vol 1 by J. D. Ullman.

2. Fundamentals of Database Systems. R. Elmasri and S. Navathe.

3. Foundations of Databases. Serge Abiteboul, Richard Hull, Victor Vianu.