FOURTH SEMESTER DATABASE MANAGEMENT SYSTEMS (BTCS4T01) Course Objectives: 1. To understand the fundamental concepts, historical perspectives, current trends, structures, operations and functions of different components of Databases. 2. To understand the concepts provided by Relational Algebra, Relational Calculus and SQL and able to specify queries on any database using them. 3. To recognize the importance of database analysis and design in the implementation of any database application. 4. To understand how to perform the normalization process of relations before implementation. 5. To describe the role of transaction processing in a database system 6. To understand various concurrency control mechanisms for a database system. To describe the roles of recovery and security in a database system Course Outcomes: 1. An understanding of basic concepts and current trends of different database systems. 2. An ability to write relational algebra and Relational calculus expressions. 3. An ability to use Standard Query Language and its various versions 4. An ability to design and develop a database that is in specified normal form and transaction processing. 5. An ability to use different concurrency control techniques while implementing real time applications and the importance of backup and recovery techniques. 6. An ability to build Database systems that can handle real world problems. Unit-I History of DBMS, Where can be used?, File vs. DBMS, Advantages of DBMS, Describing Storing Data in DBMS,Structure of aDBMS, Database Languages for DDL and DML, Database users and Administrator, Transaction Management,Query Processor. Unit-II Database Design and ER Diagrams, How it works of Design Models?, Attributes and Entity Sets, Relationships and Relationship sets, Additional Features of ER Models, Conceptual Design with ER Models, Conceptual Design for Large Enterprise, Introduction to UML. Unit-III Relational Model, Constraints and Types, Querying in Relational Data, Logical Database Design, Views and its operations, Form of Basic SQL Query, Nested Queries, Correlated Nested Queries, Set Comparison Operators, Aggregate Operators, Logical Connectivity Operators, Joins and Types. Unit-IV Schema Refinement-Problems Caused by Redundancy-Decompositions-Problem Related to Decomposition, Normalizations and Types, Overview of Transaction, Transaction State, implementation of Atomicity and Durability, Concurrent Execution, Serializability, Recoverability.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
FOURTH SEMESTER
DATABASE MANAGEMENT SYSTEMS (BTCS4T01)
Course Objectives:
1. To understand the fundamental concepts, historical perspectives, current trends, structures,
operations and functions of different components of Databases.
2. To understand the concepts provided by Relational Algebra, Relational Calculus and SQL and
able to specify queries on any database using them.
3. To recognize the importance of database analysis and design in the implementation of any
database application.
4. To understand how to perform the normalization process of relations before implementation.
5. To describe the role of transaction processing in a database system
6. To understand various concurrency control mechanisms for a database system.
To describe the roles of recovery and security in a database system
Course Outcomes:
1. An understanding of basic concepts and current trends of different database systems.
2. An ability to write relational algebra and Relational calculus expressions.
3. An ability to use Standard Query Language and its various versions
4. An ability to design and develop a database that is in specified normal form and transaction
processing.
5. An ability to use different concurrency control techniques while implementing real time applications
and the importance of backup and recovery techniques.
6. An ability to build Database systems that can handle real world problems.
Unit-I
History of DBMS, Where can be used?, File vs. DBMS, Advantages of DBMS, Describing Storing Data in
DBMS,Structure of aDBMS, Database Languages for DDL and DML, Database users and Administrator,
Transaction Management,Query Processor.
Unit-II
Database Design and ER Diagrams, How it works of Design Models?, Attributes and Entity Sets,
Relationships and Relationship sets, Additional Features of ER Models, Conceptual Design with ER Models,
Conceptual Design for Large Enterprise, Introduction to UML.
Unit-III
Relational Model, Constraints and Types, Querying in Relational Data, Logical Database Design, Views and
its operations, Form of Basic SQL Query, Nested Queries, Correlated Nested Queries, Set Comparison
Operators, Aggregate Operators, Logical Connectivity Operators, Joins and Types.
Unit-IV
Schema Refinement-Problems Caused by Redundancy-Decompositions-Problem Related to Decomposition,
Normalizations and Types, Overview of Transaction, Transaction State, implementation of Atomicity and
2. Database System Concepts, Silberschatz, Korth, McGraw hill, V edition.
References:
1. Database System Design, Implementation and Management, Peter Rob & Carlos Coronel 7th
Edition.
2. Fundamentals of Database Systems, Elmastri Navrate Pearson Education.
3. Introduction to Database Systems, C.J.Date Pearson Education.
OPERATING SYSTEMS (BTIT4T01)
COURSE OBJECTIVES:
1 To understand the fundamental concepts and techniques of Operating Systems.
2 To study the concepts in process management and concurrency control mechanisims
3 to understand the concepts in memory managements and deadlocks
4 to study on file management and storage structres
COURSE OUTCOMES:
1 an ability to understand basic concepts of operating system.
2 an ability to describe process management ,scheduling and concurrency control
mechanisims.
3 an ability to analyze memory management and deadlocks.
4 an ability to compare various file systems and Disk Scheduling UNIT-I: Computer System and Operating System Overview: Overview of computer operating systems, operating
systems functions, protection and security, distributed systems, special purpose systems, operating systems
structures and systems calls, operating systems generation. UNIT-II: Process Management – Process concept- process scheduling, operations, Inter process communication.
Multi Thread programming models. Process scheduling criteria and algorithms, and their evaluation. UNIT-III: Concurrency: Process synchronization, the critical- section problem, Peterson’s Solution, synchronization
Hardware, semaphores, classic problems of synchronization, monitors, and Synchronization examples UNIT-IV: Memory Management: Swapping, contiguous memory allocation, paging, structure of the page table,
UNIT V : FUNCTIONAL PROGRAMMING LANGUAGES: Introduction to lambda calculus, fundamentals of
functional programming languages, Programming with Scheme, – Programming with ML,
UNIT VI : LOGIC PROGRAMMING LANGUAGES: Introduction to logic and logic programming,
– Programming with Prolog, multi - paradigm languages TEXT BOOKS: 1. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition,
Addison Wesley, 2012. 2. Programming Langugaes, Principles & Paradigms, 2ed, Allen B Tucker, Robert E Noonan, TMH
REFERENCES: 1. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press, 2009.
2. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall, 1998.
3. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009.
4. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth Edition, Springer, 2003
Swarnandhra College of Engineering & Technology (Autonomous), Seetharampuram, Narsapur-534280
B.TECH/IT/2014
FORMAL LANGUAGES AND AUTOMATA THEORY (BTCS4T04)
COURSE OBJECTIVES:
1 To impart the basic concepts of theory of automata, languages and computation. 2 To develop understanding about machines for sequential computation, formal languages and
grammars,and classification of feasible and intractable problems.
COURSE OUTCOMES:
1 Ability to prove the equivalence of languages described by finite state
machines and regular expressions.
2 Ability to construct pushdown automata and the equivalent context free
grammars.
3 Ability to understand how to use Turing Machines to represent computable
functions.
4 Ability to define classes P, NP, the notions of polynomial time reduction.
UNIT 1.
Finite Automata and Regular Expressions: Basic Concepts of Finite State Systems, Deterministic
and Non-Deterministic Finite Automata, Finite Automata with e-moves, Regular Expressions,
Minimization of Finite Automata, Mealy and Moore Machines, Two-Way Finite Automate.
UNIT2. Regular sets & Regular Grammars: Basic Definitions of Formal Languages and Grammars, Regular
Sets and Regular Grammars, Closure Properties of Regular Sets, Pumping Lemma for Regular Sets,
Decision Algorithm for Regular Sets, Myhill-Nerode Theorem, Minimization of Finite Automata.
UNIT3.
Context Free Grammars and Languages: Context Free Grammars and Languages, Derivation Trees,
Simplification of Context Free Grammars, Normal Forms, Pumping Lemma for CFL, closure
properlties of CFL’s, Decision Algorithm for CFL.
UNIT4.
Push down Automata and Deterministic CFL: Informal Description, Definitions, Push-Down Automata
and Context free Languages, Parsing and Push-Down Automata.
UNIT5.
Universal Turing Machines and Undecidability: Design and Techniques for Construction of Turing