DDM Lab Sy
DDM Lab Sy
PO’s PSO’s
CO’s 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 3 - - - - 2 3 3 1 2 1 1
2 2 2 1 1 1 - - - 2 2 3 1 3 2 2
3 2 1 2 1 - - - - 2 1 1 3 1 2 1
4 2 1 2 2 - - - - 2 1 2 2 1 3 3
5 3 2 2 1 1 - - - 3 2 1 2 2 2 1
AVG 2 1 2 2 1 - - - 2 2 2 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
COURSE OBJECTIVES:
To understand the database development life cycle
To learn database design using conceptual modeling, Normalization
To implement database using Data definition, Querying using SQL
manipulation and SQL programming
To implement database applications using IDE/RAD tools
To learn querying Object-relational databases
SUGGESTIVE EXPERIMENTS
1. Database Development Life cycle:
Problem definition and Requirement
analysis Scope and Constraints
2. Database design using Conceptual modeling (ER-EER) – top-down
approach Mapping conceptual to relational database and validate
using Normalization
3. Implement the database using SQL Data definition with constraints, Views
4. Query the database using SQL Manipulation
5. Querying/Managing the database using SQL Programming
- Stored Procedures/Functions
- Constraints and security using Triggers
6. Database design using Normalization – bottom-up approach
7. Develop database applications using IDE/RAD tools (Eg., NetBeans,VisualStudio)
8. Database design using EER-to-ODB mapping / UML class diagrams
9. Object features of SQL-UDTs and sub-types, Tables using UDTs, Inheritance, Method
definition
10.Querying the Object-relational database using Objet Query language
COURSE OUTCOMES
After the completion of this course, students will be able to:
CO1:Understand the database development life cycle
CO2:Design relational database using conceptual-to-relational mapping, Normalization
CO3:Apply SQL for creation, manipulation and retrieval of data
CO4:Develop a database applications for real-time problems
1
CO5:Design and query object-relational databases
TOTAL : 45 PERIODS
2
HARDWARE:
Standalone Desktops
SOFTWARE:
PostgreSQL
LIST OF EXPERIMENTS:
1. Implement basic search strategies – 8-Puzzle, 8 - Queens problem, Cryptarithmetic.
2. Implement A* and memory bounded A* algorithms
3. Implement Minimax algorithm for game playing (Alpha-Beta pruning)
4. Solve constraint satisfaction problems
5. Implement propositional model checking algorithms
6. Implement forward chaining, backward chaining, and resolution strategies
7. Build naïve Bayes models
8. Implement Bayesian networks and perform inferences
9. Mini-Project
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Design and implement search
strategies CO2: Implement game playing and
CSP techniques CO3: Develop logical
reasoning systems
CO4: Develop probabilistic reasoning systems