CS453 Lecture 1 Introduction to Compiling
Compilers
Analysis of the source program
The phase of a compiler
Cousins of the compiler
The grouping of phases
Compiler-construction tools
CS453 Lecture 1
1
1.1 Compilers
A compiler is a program that reads a prog

Chapter 9 Relations
Fall 2012
Relations
Structure in discrete mathematics
Represent the relationship between elements of
sets
A subset of the Cartesian product of the sets
A=cfw_1,2
B=cfw_1,2,3
R1=cfw_(1,1),(2,2), R2=cfw_(1,1),(1,2),(1,3)
Solve proble

Chapter 12 Boolean Algebra
Fall 2012
Boolean Algebra
Boolean algebra provides the operations and
the rules for working with the set cfw_0, 1.
Boolean algebra just generalizes the rules of
propositional logic to sets other than cfw_T,F.
e.g., to the set

Chapter 10 Graphs
Fall 2012
What are Graphs?
Discrete structures that consists of vertices and
edges connecting these vertices.
Not the chart or plot
with coordinate system
But like this
Applications of Graphs
Graphs can be used to model and solve the
pr

Mathematical Reasoning
(1.6,1.7)
Chapter 5 Induction and
Recursion (5.1 5.4)
CS200 Fall 2012
Mathematical Reasoning
Reasoning
Lead us from Hypothesis (premises) to conclusion
Mathematic reasoning
Reasoning in mathematics
Apply mathematical rules to m

Chapter 13
Modeling Computation
Fall 2012
Modeling Computation
Models
Created and used to study how the tasks are carried out by
computation to solve problems
e.g. How the computation of adding two binary numbers are
carried out
Three structures
Gram

Chapter 13
Modeling Computation
Fall 2012
Modeling Computation
Models
Created and used to study how the tasks are carried out by
computation to solve problems
e.g. How the computation of adding two binary numbers are
carried out
Three structures
Gram

Chapter 3 Algorithms
Chapter 4 Number Theory and
Cryptography
CS200
Fall 2012
3.1 Algorithms
Algorithms
An algorithm is a finite sequence of precise
instructions for performing a computation or for
solving a problem.
There are several properties that al

HOME WORK 2
ID : 12900
select e.LastName employee,e.MGR MANAGER from Emp_Test e,Emp_Test m where
e.Emp_id=m.mgr_id;
select e.LastName employee,e.MGR MANAGER from Emp_Test e,Emp_Test1 m where
e.Emp_Id=m.Mgr_Id(+);

HOME WORK 4
ID : 12900
1) Difference between function and procedure?
a). Functions can be used in typical SQL statements
like SELECT, INSERT, UPDATE, DELETE, MERGE, while procedures can't.
b) Functions are normally used for computations where as procedure

This document specifies on how to install 10.2.0.4 patchset on top of 10.2.0.1
binaries and upgrading database from 10.2.0.1 to 10.2.0.4
Below are the server and database specifications I used
OS : Oracle Enterprise Linux 4.7
Database : Oracle 10.2.0.1
ST

Duplicate a Database Using RMAN in Oracle Database
11g Release 2
This article is an update of a previous Oracle 9i article.
Introduction
Backup-Based Duplication
Active Database Duplication
Related articles.
Direct NFS (DNFS) Clonedb in Oracle Database 11

How to configure Oracle RMAN backup for the
first time
RMAN is a oracle utility to backup, restore & recovery of database.
The following Steps will be demonstrated the configuration of oracle RMAN
backup (for first time configuration)
Lets assume the data

Oracle 11g rman Catalog Setup
Here are the steps to create RMAN catalog in 11g database
1)Create tablespace for RMAN repository
2)create RMAN owner user
3)Grant privileges to the RMAN Repository owner
4)create catalog using RMAN catalog command tool
5)Reg

CS457(U)_16663_HOMEWORK2_VENUGOPAL_SIRIGIRI
1. Write a query to display all columns of scott.emp table, but only those JOB
as clerk and salary less than 1500. The result should be sorted by the ename
and salary in ascending order.
Ans: The query to displa

CS457(U)_17319_Homework2_Miriyala Leela Venkatesh
1. Write a query to display all columns of scott.emp table, but only those
JOB as clerk and salary less than 1500. The result should be sorted by the
ename and salary in ascending order.
Syntax: select * f

Chapter 2 Basic Structures
2.1 Sets
2,2 Set operations
2.3 Functions
2.4 Sequences and summations
2.1 Sets
Sets
A set is an unordered collection of
objects.
The set is the fundamental discrete
structure on which all other discrete
structures are built.

CS200
Discrete Logic
Week 1 - 1
Fall 2012
Discrete
Discrete
the opposite of continuous
something that is separate; distinct; individual.
http:/en.wikipedia.org/wiki/Discrete
http:/www.fao.org/docrep/009/a
0238e/A0238E02.htm
Logic
a particular method o

CS453 Lecture 2 A Simple One-Pass Compiler
Overview
Syntax definition
Syntax-directed translation
Parsing
A translator for simple expressions
Lexical analysis
Incorporating a symbol table
Abstract stack machines
Putting the techniques together
CS453 Lectu

CS453 Lecture 3 Lexical Analysis
The role of the lexical analyzer
Input buffering
Specification of tokens
Recognition of tokens
Finite automata
Nondeterministic finite automata
Deterministic finite automata
Conversion of an NFA into a DFA
CS453 Lecture 3

CS453 Lecture 6 Syntax Analysis
FIRST and FOLLOW
LL(1) Grammars
Bottom-Up Parsing
Stack Implementation of Shift-Reduce Parsing
Operator-Precedence Parsing
Error Recovery in Operator-Precedence Parsing
CS453 Lecture 6
1
6.1 FIRST and FOLLOW
FIRST and FOLLO

CS453 Lecture Four Regular Expression and Automata
From a regular expression to an NFA
Time-Space Tradeoffs
Design of A Lexical Analyzer Generator
Optimization of DFA-Based Pattern Matchers
Decision Problems
Other Applications of Automata
CS453 Lecture 4

CS453 Lecture 5 Syntax Analysis
Introduction to Context Free Grammar
The role of the parser
Context Free Grammars
Parser Trees and Derivations
Writing a grammar
Non-Context Free Grammar
Top-Down Parsing
Transition Diagrams
CS453 Lecture 5
1
CS453 Lec5 Syn

CS453 Lecture 7 Syntax Analysis
LR Parser
LR Grammar
SLR Grammar
SALR Grammar
LALR Grammar
Parser Generator
CS453 Lecture 7
1
7.1 LR Parsers
LR Parser
Bottom-up syntax analysis can be used to parse a large class of context-free grammar. The
technique is c

CS453 Lecture 8 Syntax-Directed Translation
Syntax-Directed Definitions
Construction of Syntax Trees
Bottom up Evaluation of S-Attributed Definitions
L-Attributed Definitions
Top-Down Translations
Bottom-up Evaluation of Inherited Attributes
Implementing

Introduction to Makefile
Alex Yang
Northwestern Polytechnic University
Fremont CA
Copyright 2015, All Rights Reserved
1. Compilation in command line
Program1:
a.cpp - a.h(included)
|- f();
#include <stdio.h>
#include "a.h"
void f()
cfw_
a+;
printf("0\n",a

Linux Commands-II Tutorial
Alex Yang
Northwestern Polytechnic University
Fremont CA
Copyright 2015, All Rights Reserved
1. Find File
% locate inittab
/ fast search
% locate locate
% touch /root/newfile
% locate newfile
% find /root -name newfile
/can't fi

Linux Commands Tutorial
Alex Yang
Northwestern Polytechnic University
Fremont CA
Copyright 2015, All Rights Reserved
1. Introduction to Linux
1.1 UNIX & Linux History
In 1965, MIT/GE/AT&T developed Multics OS
In 1969, AT&T Bell Lab developed Unix. TCP/IP

Linux Commands-I Tutorial
Alex Yang
Northwestern Polytechnic University
Fremont CA
Copyright 2015, All Rights Reserved
1. Introduction to Linux
1.1 UNIX & Linux History
In 1965, MIT/GE/AT&T developed Multics OS
In 1969, AT&T Bell Lab developed Unix. TCP/I

Ans:-
1st Ans:-
2nd Ans:Where comm is null;
3rd Ans:-
and length(ename)>4;
4th Ans:-
Orderby ename and sal;
5th Ans:Select , , ,sal from emp where replace(job,analyst,clerk) and
6th Ans:(a) Select file_name,substr(file_name),1,instr

CS457_Homework1
1. Create table student with fields student ID, Student Name, Student City, Student State, Student
Zip, and Student Joining Date.
2. Insert 3 rows
a. 1st row your student ID, Name and details (insert joining date as your joining date in NL

CS457_Homework3
1. Create emp table and insert data using below attached image
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
Create emp1 table same as emp copy structure and data.
Create emp2 table same as emp copy only structure without data.
Display empno, ename, sal