Cursors
For every SQL statement execution certain area in
memory is allocated.
PL/SQL allow you to name this area. This private
SQL area is called context area or cursor.
Cursors allow the programmer to retrieve data
from a table and perform actions on
Chapter 17: Recovery System
Chapter 17: Recovery System
Failure Classification
Storage Structure
Recovery and Atomicity
Log-Based Recovery
Shadow Paging
Recovery With Concurrent Transactions
Buffer Management
Failure with Loss of Nonvolatile Storage
Advan
#include<graphics.h>
#include<conio.h>
#include<process.h>
#include<iostream.h>
#include<stdio.h>
#include<dos.h>
extern short int user1=1,user2=0;
extern short int array[8][8]=cfw_0,0,0,0,0,0,0,0,
cfw_0,0,0,0,0,0,0,0,
cfw_0,0,0,0,0,0,0,0,
cfw_0,0,0,2,2,0
TERM PAPER
ON
TICKET WINDOW AND AUTOMATION SYSTEM
FOR
FOUNDATION OF COMPUTING (CSE 101)
SUBMITTED TO:
SUBMITTED BY:
MISS SUKHDILPREET KAUR
UTKARSH SINGH
R246B33
B.TECH(CSE)-MBA
Acknowledgement
I am very thankful and expressing my deep sense of gratitude
t
SCIENTIFIC CALCULATOR
SUBMITED TO:
Ms. Sukhdilpreet Kaur
SUBMITED BY:
Name: Anuj Sharma &Naman
Roll NO.:R246A16 & R246A11
Regn.No.: 10802451 &10800991
AKNOWLEDGMENT
First and the foremost I would like to thank to my almighty
for giving me courage to bring
FORMAT OF TERM PAPER
1.
2.
3.
4.
Title page of project report
Table of contents
Introduction
Proposed system
i.
Description
ii.
System requirements
5.
Requirement Analysis
6.
System Design
7.
Source code
8.
Testing
9.
Future scope of project
OF
(TIC TAC T
SYNOPSIS
FOUNDATION OF COMPUTING
CSE-101
TOPIC:-Progress report of student management system
DOA:-Dec 4,2008
DOS:-Dec 6,2008
Submitted to:
Submitted by:
Shafali mam
Prabh simran singh
Roll no :- R238B53
Reg no:-10800439
Class:-B-TECH cse
Code:-150
CONTENT
Historical Examples of Effective Communication
Analysis 1.1
The introduction of The Declaration of Independence contains some of the world's most
oft quoted words. The introduction opens by stating the purpose of the document-to
declare the causes that co
MVC ARCHITECTURE
Model view controller is a software architectural pattern for implementing user interfaces on
computer. It divides a given software application into three interconnected parts, so as to separate
internal representations of information fro
Module 6
Knowledge Representation and Logic (First Order Logic)
Version 1 CSE IIT, Kharagpur
Lesson 15
Inference in FOL - I
Version 1 CSE IIT, Kharagpur
6.2.8 Resolution
We have introduced the inference rule Modus Ponens. Now we introduce another inferenc
Module 6
Knowledge Representation and Logic (First Order Logic)
Version 1 CSE IIT, Kharagpur
Lesson 14
First Order Logic - II
Version 1 CSE IIT, Kharagpur
6.2.5 Herbrand Universe
It is a good exercise to determine for given formulae if they are satisfied/
Module 6
Knowledge Representation and Logic (First Order Logic)
Version 1 CSE IIT, Kharagpur
6.1 Instructional Objective
Students should understand the advantages of first order logic as a knowledge representation language Students should be able to conv
Module
5
Knowledge
Representation and
Logic
(Propositional Logic)
Version 1 CSE IIT, Kharagpur
Lesson
12
Propositional Logic
inference rules
Version 1 CSE IIT, Kharagpur
5.5 Rules of Inference
Here are some examples of sound rules of inference. Each can
Module
5
Knowledge
Representation and
Logic
(Propositional Logic)
Version 1 CSE IIT, Kharagpur
5.1 Instructional Objective
Students should understand the importance of knowledge representation in intelligent
agents
Students should understand the use of f
Module 4
Constraint satisfaction problems
Version 1 CSE IIT, Kharagpur
Lesson 10
Constraint satisfaction problems - II
Version 1 CSE IIT, Kharagpur
4.5 Variable and Value Ordering
A search algorithm for constraint satisfaction requires the order in which
Module 4
Constraint satisfaction problems
Version 1 CSE IIT, Kharagpur
4.1 Instructional Objective
The students should understand the formulation of constraint satisfaction problems Given a problem description, the student should be able to formulate it
Module 3
Problem Solving using Search(Two agent)
Version 1 CSE IIT, Kharagpur
Lesson 8
Two agent games : alpha beta pruning
Version 1 CSE IIT, Kharagpur
3.5 Alpha-Beta Pruning
ALPHA-BETA pruning is a method that reduces the number of nodes explored in Min
Module
3
Problem Solving
using Search(Two agent)
Version 1 CSE IIT, Kharagpur
3.1 Instructional Objective
The students should understand the formulation of multi-agent search and in detail
two-agent search.
Students should b familiar with game trees.
Give
Module 2
Problem Solving using Search(Single agent search)
Version 1 CSE IIT, Kharagpur
Lesson 6
Informed Search Strategies-II
Version 1 CSE IIT, Kharagpur
3.3 Iterative-Deepening A*
3.3.1 IDA* Algorithm
Iterative deepening A* or IDA* is similar to iterat
Module 2
Problem Solving using Search(Single agent search)
Version 1 CSE IIT, Kharagpur
Lesson 5
Informed Search Strategies-I
Version 1 CSE IIT, Kharagpur
3.1 Introduction
We have outlined the different types of search strategies. In the earlier chapter w
Module 2
Problem Solving using Search(Single agent search)
Version 1 CSE IIT, Kharagpur
Lesson 4
Uninformed Search
Version 1 CSE IIT, Kharagpur
2.4 Search
Searching through a state space involves the following: A set of states Operators and their costs St
Module
2
Problem Solving
using Search(Single agent search)
Version 1 CSE IIT, Kharagpur
2.1 Instructional Objective
The students should understand the state space representation, and gain familiarity
with some common problems formulated as state space sea
Module 1
Introduction
Version 1 CSE IIT, Kharagpur
Lesson 2
Introduction to Agent
Version 1 CSE IIT, Kharagpur
1.3.1 Introduction to Agents
An agent acts in an environment.
Percepts
Agent
Environment Environment
Actions
An agent perceives its environment
Module 1
Introduction
Version 1 CSE IIT, Kharagpur
1.1 Instructional Objectives
Understand the definition of artificial intelligence Understand the different faculties involved with intelligent behavior Examine the different ways of approaching AI Look
Problem Solving, Problem Spaces
and Problem Characteristics
1
Problem Representation in AI
Before a solution can be found, the prime
condition is that the problem must be very
precisely defined. The most common
methods of problem representation in AI
are:
Turing Test
The "standard interpretation" of the Turing Test, in which
player C, the interrogator, is tasked with trying to determine
which player - A or B - is a computer and which is a human.
The interrogator is limited to using the responses to written