BCA-401 RELATIONAL DATABASE MANAGEMENT SYSTEM

INTRODUCTION TO DATABASE SYSTEMS: Overview and History of DBMS. File System vs DBMS. Advantage of DBMS. Describing and Storing Data in a DBMS. Queries in DBMS. Transaction management and Structure of a DBMS. Components of DBMS; The 3 level architecture of DBMS – Hierarchical, Network, and Relational Model; Distributed Database; KB-DBMS; OODBMS (Basic Concepts).

ENTITY RELATIONSHIP MODEL: Overview of Data Design Entities, Attributes and Entity Sets, Relationship and Relationship Sets. Features of the ER Model-Key Constraints, Participation Constraints, Weak Entities, Class Hierarchies, Aggregation, Conceptual Database, Design with ER Model-Entity vs Attribute, Entity vs Relationship Binary vs Ternary Relationship and Aggregation vs ternary Relationship, Conceptual Design for a Large Enterprise.

RELATIONSHIP ALGEBRA AND CALCULUS: Relationship Algebra Selection and Projection, Set Operations Renaming, Joint, Division, Relation Calculus, Expressive Power of Algebra and Calculus.

SQL QUERIES PROGRAMMING AND TRIGGERS: The Forms of a Basic SQL Query, Union, Intersection and Exception, Nested Queries, Correlated Nested Queries, Set-Comparison Operations, Aggregate Operators, Null Values and Embedded SQL, Dynamic SQL, ODBC and JDBC, Triggers and Active Databases.

SCHEMA REFINEMENT AND NORMAL FORMS: Introduction to Schema Refinement, Functional Dependencies, Boyce-Codd Normal Forms, Third Normal Form, Normalization-Decomposition into BCNF, Decomposition into 3-NF.

Introduction to Digital Circuits: The Basic Computer; The Von-Neumann Architecture, Instruction Execution: An Example, Instruction Cycle Interrupts, Interrupts and Instruction Cycle, Computers: Then and Now, The Beginning, First Generation Computers, Second Generation Computers, Third Generation Computers, Later Generations.

The Data Representation: Data Representation, Number Systems, Decimal Representation in Computers, Alphanumeric Representation, Data Representation for Computation, Error Detection and Correction Codes.

Principles of Logic Circuits I: Logic Gates, Logic Circuits, Combinational Circuits, Canonical and Standard Forms, Minimization of Gates, Design of Combinational Circuits, Examples of Logic Combinational Circuits, Adders, Decoders, Multiplexer, Encoder, Programmable Logic Array, Read Only Memory ROM.

Principles of Logic Circuits II: Sequential Circuits: The Definition, Flip Flops, Basic Flip-Flops, Excitation Tables, Master Slave Flip Flops, Edge Triggered Flip-flops, Sequential Circuit Design, Examples of Sequential Circuits, Registers, Counters: Asynchronous Counters, Synchronous Counters, RAM, Design of a Sample Counter.

Basic Computer Organisation: The Memory System: The Memory Hierarchy, RAM, ROM, DRAM, Flash Memory, Secondary Memory and Characteristics, Hard Disk Drives, Optical Memories, CCDs, Bubble Memories, RAID and its Levels, The Concepts of High Speed Memories, Cache Memory, Cache Organisation, Memory Interleaving, Associative Memory.

The Input/Output System: Input / Output Devices or External or Peripheral Devices, The Input Output Interface, the Device Controllers and its Structure, Device Drivers, Input Output Techniques, Programmed Input / Output, Interrupt-Driven Input / Output, Interrupt-Processing, DMA (Direct Memory Access), Input Output Processors, External Communication Interfaces.

The Central Processing Unit: Instruction Set Architecture; Instruction Set Characteristics, Instruction Set Design Considerations, Operand Data Types, Types of Instructions, Number of Addresses in an Instruction, Addressing Schemes, Types of Addressing Schemes, Immediate Addressing, Direct Addressing, Indirect Addressing, Register Addressing, Register Indirect Addressing, Indexed Addressing Scheme, Base Register Addressing, Relative Addressing Scheme, Stack Addressing, Instruction Set and Format Design Issues, Instruction Length, Allocation of Bits Among Opcode and Operand, Variable Length of Instructions, Example of Instruction Format.

Registers, Micro-Operations and Instruction Execution: Basic CPU Structure, Register Organization, Programmer Visible Registers, Status and Control Registers, General Registers in a Processor, Micro-operation Concepts, Register Transfer Micro-operations, Arithmetic Micro-operations, Logic Micro-operations, Shift Micro-operations, Instruction Execution and Micro-operations, Instruction Pipelining.

ALU Organisation: ALU Organisation, A Simple ALU Organisation, A Sample ALU Design, Arithmetic Processors.

The Control Unit: The Control Unit, The Hardwired Control, Wilkes Control, The Micro-Programmed Control, The Micro-Instructions, Types of Micro-Instructions, Control Memory Organisation, Micro-Instruction Formats, The Execution of Micro-Program.

Introduction to Data Structure and Application of Data Structure

Algorithms and Analysis of Algorithms: Definition, Structure and Properties of Algorithms, Development of an Algorithm, Data Structures and Algorithms, Data Structure – Definition and Classification, Efficiency of Algorithms, Apriori Analysis, Asymptotic Notations, Time Complexity of an Algorithm using O Notation, Polynomial Vs Exponential Algorithms, Average, Best and Worst case Complexities, Analyzing Recursive Programs, Open source software development process.

Linked List, Linked Stacks and Linked Queues: Singly Linked Lists, Circularly Linked Lists, Doubly Linked Lists, Multiply Linked Lists, Applications of Linked Lists, Introduction to Linked Stack and Linked Queues, Operations on Linked Stacks and Linked Queues, Dynamic Memory Management and Linked Stack, Implementations of Linked Representations, Applications of Linked Stacks and Linked Queues.

Arrays, Stacks and Queues: Array Operations, Number of Elements in an Array, Representation of Arrays in Memory, Applications of Array, Stack-Introduction, Stack Operations, Applications of Stack, Queues-Introduction, Operations on Queues, Circular Queues, Other Types of Queues, Applications of Queues, Polynomials & Sparse Matrix.

Trees, Binary Trees, BST, AVL Trees and B Trees: Trees: Definition and Basic Terminologies, Representation of Trees, Binary Trees: Basic Terminologies and Types, Representation of Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Applications, BST & AVL Trees: Introduction, Definition and Operations, B Trees: Introduction, m-way search trees: Definition and Operations.

Graphs: Introduction, Definitions and Basic Terminologies, Representations of Graphs, Graph Traversals, Single-Source Shortest-Path Problem, Minimum Cost Spanning Trees.

Sorting: Understanding Internal and External Sorting.

Internal Sorting: Insertion Sort, Bubble Sort, Shell Sort, Quick Sort, 2-way Merge Sort, Heap Sort, Sorting on Several Keys.

Searching: Introduction, Binary Search, Transpose Sequential Search, Interpolation Search.

UNIT-I

COMBINATORICS: Permutation and Combination, Repetition and Constrained Repetition, Binomial Coefficients, Binomial Theorem.

UNIT-II

Frequency distributions, Histograms and frequency polygons, Measures of central tendency: Mean, Mode, Median, Dispersion, Mean deviation and standard deviation. Moments, Skewness, Kurtosis.

UNIT-III

Elementary Probability Theory: Definition, Conditional probability, Probability distribution, Mathematical expectation.

Theoretical Distribution: Binomial, Poisson and Normal distribution, Relation between the binomial, Poisson and Normal distribution.

UNIT-IV

Correlation and Regression: Linear Correlation, Measure of Correlation, Least Square Regression lines.

Curve Fitting: Method of least square, least square line, least squares Parabola. Chi-square test: Definition of chi-square; Significance test: contingency test, coefficient of contingency.

UNIT-V

Basic of Sampling Theory: Sample mean and variance, Students t-test, Test of Hypotheses and significance, Degree of freedom, Z-test, Small and large sampling, Introduction to Monte Carlo method.