THANKS SHUSMA FOR INFORMING ME
our HOD said foll will cum 4 theory paper:
50 mrks-dbms,20 mks-program,20 mks-ado-db connection..,10 mks-gui
Friday, December 5, 2008
Tuesday, November 11, 2008
ANIMATED DATA STRUCTURE MUST SEE !!!!!
ANIMATED DATA STRUCTURE MUST SEE !!!!!
download the link and open the html files 2 see the applets
http://rapidshare.com/files/162644503/ds.zip
download the link and open the html files 2 see the applets
http://rapidshare.com/files/162644503/ds.zip
TECH - MAX DATA STRUCTURE & ALGORITHM IN JAVA FOR IT
TECH - MAX DATA STRUCTURE & ALGORITHM IN JAVA FOR IT
http://rapidshare.com/files/162643848/DSA_Programs.zip
http://rapidshare.com/files/162643848/DSA_Programs.zip
DATA STRUCTURE & FILES IN JAVA PROGRAM
DATA STRUCTURE & FILES IN JAVA PROGRAM for computer branch
http://rapidshare.com/files/162643849/DSF_Programs.zip
http://rapidshare.com/files/162643849/DSF_Programs.zip
DATA STRUCTURE IN JAVA PROGRAM
DATA STRUCTURE IN JAVA PROGRAM by robert lafore program
http://rapidshare.com/files/162643847/Data_Structures_Java_Examples.zip
http://rapidshare.com/files/162643847/Data_Structures_Java_Examples.zip
TECH MAX JAVA PROGRAMS
TECH MAX JAVA PROGRAMS
check the below link
http://rapidshare.com/files/162643850/Programs.zip
check the below link
http://rapidshare.com/files/162643850/Programs.zip
Monday, November 10, 2008
TIME TABLE FOR EXAM (NOT CONFIIRMED)
4 DEC ---EDC
12 ----DSA
17--------DLDA
22--------GUI
9JAN ----MATHS
any ERROE of CHANGE pls let me know at jekintrivedi@gmail.com
12 ----DSA
17--------DLDA
22--------GUI
9JAN ----MATHS
any ERROE of CHANGE pls let me know at jekintrivedi@gmail.com
Sunday, November 9, 2008
TECH MAX Data Structure & Algorithm in java Syllabus
TECH MAX Data Structure & Algorithm in java Syllabus
Table of Contents Data Structure & Algorithms(M)
Chapter 1: Revisiting Java Programming Construct 1-1 to 1-136
1.1 Classes and Objects 1-1
1.1.1 The General Form of a Class 1-1
1.1.2 Declaration of Instance Variables , 1-2
1.1.3 Declaring Objects ~ 1-3
1.1.4 Accessing Instance Variables 1-4
1.1.5 Assigning Object Reference Variables 1-6
1.2 Class Methods 1-7
1.2.1 Returning a Value 1-9
1.2.2 Method that Takes Parameters : 1-11
1.3 Expressions 1-12
......................................................................................•..........................................
1.4 Control Flow ........................................•...•.....................................................................................
1-15
1.4.1 Selection Control Statements 1-15
1.4.1.1 The if statement 1-15
1.4.1.2 The if-else statement 1-17
1.4.1.3 The Switch Statement ; : 1-18
1.4.2 Iteration Statements 1-20
1.4.2.1 The While Statement 1-20
1.4.2.2 The do-while Loop 1-21
1.4.2.3 The for Loop 1-22
1.4.3 Jump Statements 1-24
1.4.3.1 The break Statement 1-25
1.4.3.2 The Continue Statement 1-28
1.4.3.3 The Return Statement 1-29
1.5 Arrays 1-30
1.5.1 One-Dimensional Arrays 1-30
1.5.1.1 Declaring Arrays 1-30
1.5.1.2 Creating Arrays 1-31
1.5.1.3 Initializing Arrays 1-32
1.5.1.4 A Simple Program on One-Dimensional Array 1-33
1.5.1.5 Array Length ; 1-34
1.5.2 Multidimensional Arrays 1-35
1.5.2.1 A Simple Program on Multidimensional Array : 1-36
1.5.2.2 Uneven (or Irregular) Multidimensional Arrays 1-37
1.5.2.3 Programs on Array 1-37
1.6 Input and Output 1-47
1.6.1 Streams 1-47
1.6.2 Predefined Streams 1-49
1.6.3 Reading Input from Console 1-50
Packages ; 1-52
•.7.1 Creating a Package 1-52 __•.
2' Q..ASSPATH Environmental Variable 1-53
Table of Contents
2
Data Structure & Algorithms (M)
1.7.3 Access Protection 1-55
1.7.4 Programs on Packages 1-56
1.7.5 Importing Packages 1-60
1.7.6 Hiding Classes 1-65
1.7.7 Java Application Programming Interface Packages 1-66
1.7.8 The java.lang Package : 1-66
1.8 True/False Questions 1-68
1.9 MuH'iple Choice Questions 1-69
.10 Debugging Exercises 1-73
.11 Programs 1-90
Chapter 2 : Object Oriented Design and Analysis of Algorithms
2-1 to 2-144
2.1 Inheritance 2-1
2.1.1 Defi nition 2-2
2.1.2 Forms of Inheritance ; 2-2
2.1.3 Single inheritance 2-3
2.1.4 Inheritance and Member Accessibility 2-5
2.1.5 A More Practical Example 2-8
2.1.6 Super Class Variable can Reference a Subclass Object 2-11
2.1.7 Using Super 2-13
2.1.7.1 Using Super to Call Superclass Constructors 2-13
2.1.7.2 A second use for Super 2-16
2.1.8 Multilevel Inheritance 2-18
2.1.9 When Constructors are Called 2-22
2.1.10 Method Overriding 2-23
2.1.11 Dynamic Method Dispatch : 2-29
2.1.12 A More Practical Example 2-30
2.2 The Keyword 'final' ..........................•........................................ _ 2-35
2.2.1 final Variables and Methods 2-35
2 .. 2.2 final Class 2 -35
, 3 Abstract Class 2-35
* 4 A Practical Examples 2-36
5 Interfaces : 2 -43
2.5.1 Introduction 2 -43
2.5.2 Defining Interfaces 2-44
2.5.3 Implementing Interfaces 2-45
2.5.4 Accessing Implementations through Interface References 2-47
2.5.5 Partial Implementations 2-48
2.5.6 Extending Interfaces 2-48
2.5.7 Accessing Interface Variables 2-50
2.5.8 A More Practical Example 2-51
Casting '" 2 -5 3
2.6.1 Casting in Expressions 2.:.53
Table of Contents
3
Data Structure & Algorithms (M)
2.7 Exception Handling 2-56
2.7.1 Exception Handling Mechanism 2-56
2.7.2 Exception Types 2-58
2.7.3 Derault Exception Handler 2-59
2.7.4 try and Catch ...................................................................•..•.....•................................. 2-60
2.7.5 Catching Multiple Exceptions , , ..........••..............•.............. 2-62
2.7.6 Nested try Statements 2-65
2.7.7 Throwing Exceptions (throw) 2-67
2.7.8 The throws Keyword 2-69
2.7.9 The rinally Keyword .............................................................................................•...... 2-70
2. 7.10 Java's Exceptions 2-74
2.7.11 Creating Our Own.Exception 2-75
2.8 Recursion and Other Design Patterns : 2-77
2.8.1 Recursive Derinition and Processes 2-77
2.8.2 Desi gn Patterns , 2 -86
2.9 A Igori thm , , , 2 -87
2.1 0 Pseudo Code 2 -89
2.11 Analysis or Algorithm : 2-90
2.11.1 What is Analysis or Algorithm ? 2-90
2.11.1.1 Time Complexity .............................................•........................................................... 2-91
2.11.1.2 Space Complexity 2-91
2.11.2 Types or Analysis ...............•............................................................................•............ 2-91
2.11.3 Order or Magnitude or an Algorithm 2-91
2.11.4 Worst Case, Average Case and Best Case Running Time or an Algorithm 2-93
2.11.5 Mathematical Notation ror Determination or the Running Time of
an Algorithm , 2 -9 3
2.11.5.1 Big-Oh Notation- '0' Notation 2-94
2.11.5.2 Omega Notation- '0' Notation 2-95
2.11.5.3 Theta Notation- 'e' Notation ............................................................•...................... 2-95
2.11.5.4 Properties or the Asymptotic Notations 2-97
2.11.6 Assumption while Finding the Time Complexity 2-98
2.11.7 Case Study or Worst, Best and Average Case Analysis or Algorithms .......•...... 2-98
2.12 Simple Justirication Techniques 2-99
2.12.1 By example , , 2-99
2.12.2 The "Contra" Attack ....................................................................•........................... 2-100
2.12.3 Induction and Loop Invariants 2-101
2 .13 True/False Questi ons 2-102
2.14 Multiple Choice Questions 2-104
2.15 Debugging Exercises 2-109
2.16 Programs 2-120
2.17 Solved Examples , 2-127
2.18 P~evious University Questions and Answers 2-141
Table of Contents 4 Data Structure & Algorithms (M)
Chapter 3 : Stacks, Queues and Recursion 3-1 to 3-160
3J Data Structure 3-1
3.1.1 Types of Data Structure 3-1
3.2 Recursion 3-4
3.2.1 Definition 3-4
3.2.2 Property of Recursive Definitions or Algorithms 3-6
3.2.3 Recursion in Java 3-6
3.2.4 Efficiency of Recursion 3-11
3.2.5 Comparisonbetween Itet'ation and Recursion 3-12
3.3 Stack 3-12
3.3.1 Definition 3-12
3.3.2 Operati ons 3-13
3.3.2.1 Push" and "Pop" : 3-13
3.3.2.2 "Empty" and "Stacktop" 3-14
3.3.3 Array Implementation of the Stack 3-15
3.3.4 Implementation of Stack using Java Built in Class 'Stack' , 3-18
3.3.5 Applications of Stack : 3-20
3.3.5.1 Evaluating a Postfix Expression 3-21
3.3.5.2 Converting an Expression from Infix to Postfix 3-29
Queue 3-39
3.4.1 Definition 3-40
3.4.2 Operations 3-40
3.4.3 Representing Queue in' Java' 3-41
3.4.4 Circular Queue 3-45
3.4.4.1 'Java' Implementation of "Circular Queue" 3-47
3.4.5 Deque 3-51
3.4.5.1 Operations on Deque 3-51
3.4.6 Application of Queue : 3-53
~.5 What is Linked List ? 3-54
3.5.1 Definition 3-54
3.5.2 Operations on Linked Lists 3-55
3.5.3 Linked List as a Data Structure 3-59
3.5.3.1 Attaching Node at the Specified Position 3-60
3.5.3.2 Deleting the Node from Specified Position 3-60
3.5.4 Header Node 3-61
3.5.5 Implementation of Linked Lists 3-62
3.5.5.1 Static Implementation ,.3-62
3.5.5.2 DynamicImplementation 3-72
3.5.6 Linked Implementation of Stack 3-80
3.5.7 Linked Implementation of Queues 3-86
3.5.8 Circular Linked List 3-90
3.5.8.1 Operations on Circular Linked List 3-90
Table of Contents
5 Data Structure & Algorithms (M) li
3.5.8.2 'Stack using Circular Linked List 3-99
3.5.8.3 Queue using Circular Linked List 3-99
3.5.8.4 Application of Circular Linked List 3-99
3.5.8.5 Header Node 3-105
3.5.9 DoublyLinkedList 3-106
3.5.9.1 Operations on DoublyLinked List 3-107
3.6 Previous University Questions and Answers 3-141
4-1 to 4-26
Chapter 4 : Vectors, Lists and Sequences
4.1 Vectors and Array Lists 4-1
4.1.1 Vector ADT 4-1
4.1.2 Simple Array-Based Implementation 4-2
4.1.3 Extendable Array Implementation 4-3
4.1.4 The java.util.ArrayList and java.util.Vector Classes 4-5
4.2 List 4-12
4.2.1 The List Abstract Data Type 4-13
4.2.2 DoublyLinked List Impiementation 4-16
4.3 Sequences 4-19
4.3.1 Implementation of Sequence with a DoublyLinked List 4-20
4.3.2 Implementation of Sequence with an Array 4-22
4.4 Favorite Lists and the Move-to-Front Heuristic 4-22
4.4.1 Introduction 4-22
4.4.2 Using a List with the Move-to-Front Heuristic 4-23
4.4.3 Implementation of a Favorite List using the Move-to-front Heuristic 4-24
5'"1 to 5-60
Chapter 5 : Trees
5.1 Basic Tree Concepts 5-1
5.1.1 Tree 5-1
5.1.2 Different Terms Related to Tree 5-2
5.1.2.1 Leaf 5-2
5.1.2.2 Father and Son 5-2
5.1.2.3 Ancestor and Descendant 5-2
5.1.2.4 Brother 5-2
5.1.2.5 Level ,........•.....................................................................................................................
5-2
5.1.2.6 Depth 5-2
5.1.3 Binary Tree 5-2
5.1.4 Types of Binary Trees 5-3
5.1.4.1 Strictly .......................................•.............................................................
Binary Tree 5-3
5.1.4.2 Complete Binary Tree 5-3
5.1.4.3 Almost Complete Binary Tree 5-4
5.2 Operations on Binary Trees 5-4
5.3 Binary Tree Traversal 5-6
5.3.1 Preorder Traversal 5-6
~able of Contents 6
Data Structure & Algorithms (M)
5.3.2 Inorder Traversal 5-9
5.3.3 Postorder Traversal 5-11
-4
Applications of Binary Trees 5-13
5.4.1 Binary Search Tree 5-13
5.4.2 Expression Tree 5-15
:.5
Binary Tree Representations ; 5-19
5.5.1 Implicit 'Array Representation of Binary Trees ....................•................................5-19
5.5.2 DynamicNode Representation 5-24
5.5.3 Choosinga BinaryTree Representation 5-28
Binary Tree Traversals in 'C' 5-28
5.6.1 Recursive Binary Tree Traversal 5-28
5.6.2 Non Recursive Binary Tree Traversal Algorithms 5-32
5.6.2.1 Non-recursive Method for Inorder Traversal of Binary Tree 5-32
5.6.2.2 Non-recursive Method for Preorder Traversed of Binary Tree 5-40
-7
Threaded Binary Trees 5-47
Previous University Questions and Answers 5-53
apter 6 : Priority Queue 6-1 to 6-27
Priority Queue 6-1
6.1.1 Definition 6-1
6.1.2 Types of Priority Queues 6-1
6.1.2.1 Ascending Priority Queue 6-1
6.1.2.2 Descending Priority Queue 6-2
6.1.3 Implementation of Priority Queue 6-2
6.1.4 1 Java' Implementation of Priority Queue (Third Solution) 6-3
2 Priority Queue using Linked List 6-8
6.2.1 Implementation with An Unsorted Linked List 6-8
6.2.2 Implementation with sorted linked List 6-16
6.2.3 Comparison , : 6-24
3 Adaptable Priority Queue , 6-25
6.3.1 Operations ; 6-25
6.3.2 Location Aware Entries 6-26
6.3.3 Sorted List Implementation 6-26
6.3.4 Heap Implementation 6-26
Heap as A Priority Queue 6-27
apter 7 : Map and Dictionaries 7-1 to 7-47
The Map Abstract Data Type h •••••••7-1
7.1:1 Maps in the java.util Packege 7-3
7.1.2 A Simple List -Based Map Implementant 7-3
2 Hash Tables 7-5
7.2.1 Bucket array 7-5
7.2.2 Hashing 7-6
Table of Contents 7
Data Structure & Algorithms (M)
7.2.2.1 Hash Function , , 7-6
7.2.2.2 Hashing Methods , " 7-8
7.2.2.3 Hash Clashor Hash Collision 7-11
7.2.2.4 Addressi ng 7-11
7.2.2.4.1 Linear Probing , , 7-11
7.2.2.4.2 Quadratic Probe 7-18
7.2.2.4.3 Pseudorandom CollisionResolution 7-19
7.2.2.4.4 KeyOffset , 7-22
7.2.2.5 Chaining :: 7-22
7.2.2.6 Bucket Hashing 7-24
7.2.2.7 Hashing in External Storage 7-24
7.2.2.8 DynamicHashing : 7-26
7.3 The Dictionary Abstract Data Type 7-28
7.3.1 List-Based Dictionaries and Audit Trails 7-29
7.3.2 Hash Table Dictionary Implementation 7-31
7.3.3 Ordered Search Tables and Binary Search 7-32
7.4 Skip Lists , 7-40
7.4.1 Searching in a Skip List 7-42
7.4.2 Insertion in a Skip List 7-43
7.4.3 Removalina Skip List 7-45
7.5 Extensions and Applications of Dictionaries 7-45
7.5.1 Location -Aware Dictionary Entries 7-45
7.5.2 The Ordered Dictionary ADT 7-46
7.5.3 Application of Ordered Dictionaries 7-4-.
8-1 to 8-138
Chapter 8 : Search Trees
8.1 Binary Searc h Tree 8-.
8.1.1 Definition 8-:
8.1.2 Advantages of Binary Search Tree 8-Z
8.1.3 Searching an Element in Binary Search Tree 8-,
8.1.4 Inserting an element into a Binary Search Tree -
8.1.5 Deleting an element from a Binary Search Tree
w_
8.1.6 Program for Binary Search Tree S
8.1.7 Efficiency of Binary Search Tree Operation 8-Z
8.2 AVLTrees 8-2
8.2.1 Definition 8
8.2.2 Height Balanced Tree -.
8.2.3 Balance Factor :;;
8.2.4 Structure of a Node in AVLTree 5
8.2.5 Insertion of a Node into an AVLTree ; 5
8.2.6 Rotate Left , 5
8.2.7 Rotate Right , , .
8.2.8 Single Rotation and Double Rotation , :
Table of Contents 8 Data Structure & Algorithms (M)
8.2.9 'Java' Function for Insertion of an Element
8.2.10 'Java' Function to Find Height of AVL Tree
8.2.11 'Java' Function to Rotate Right
8.2.12 'Java' Function to Rotate Left
8.2.13 'Java' Function for RR
8.2.14 'Java' Function for LL
8.2.15 'Java' Function for LR
8.2.16 ' Java' Function for RL
8.2.17 Program for AVL Tree
8.2.18 Examples
8.3
Splay Tree
8.3.1 Def inition
8.3.2 The Splay Operation
8.3.3 Operations
8.3.4 Examples
8.4 Red Black Trees
8.4.1 Defi nition
8.4.2 Lemma :
8.4.3 Operations
8.4.3.1 Inserti on
8.4.3.2 Removal
< •••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••
8.4.4 Complexity
8.4.5 Example
3. 5
Multi way Searc h Trees
8.5.1 Def initi 0n
8.5.2 Searching a Multiway Tree
8.5.3 Traversing a Multiway Tree
8.5.4 Inserting in a Multiway Tree
8.5.5 B -Trees
8.5.6 Deletion in Multiway Search Trees
8.5.7 Efficiency of Multiway Search Trees
8.5.8 Examples
2-4 tree
8.6.1 Defi nition
8.6.2 Height of a (2,4) Tree
8.6.3 Operations
8.6.3.1 Insertion
8.6.3.2 Deletion
into an AVL Tree 8:..31
8-32
8-32
8-32
8-33
8-33
8-33
8-33
8-33
8-39
8-55
8-5 5
8-55
8-57
8-60
8-73
8-73
8-73
8-74
8-74
8-76
8-80
8-80
8-9 4
8-94
8-97
8-98
8-99
8-107
8-114
: 8-116
8-116
8-124
8-124
8-125
8-126
8-126
8-131
9-1 to 9-116
pter 9 : Sorting, Sets and Selection
Sorting -General Concepts 9-1
Exchange Sort (Bubble, Quick) 9-3
9.2.1 Bubble Sort 9-3
Table of Contents 9
Data Structure & Algorithms (M)
9.2.2 Quick Sort/ Partition Exchange Sort 9-16
9.3 Insertion Sort 9-36
9.3.1 Simple Insertion 9-36
9.3.2 Shell Sort 9-41
9.4 Selection and Tree Sorting 9-49
9.4.1 Straight Selection Sort 9-49
9.4.2 Binary Tree Sort 9-55
9.5 Heap Sort 9-65
9.6 Merge Sort 9-76
9.7 Radix Sort 9-85
9.8 Bucket Sort 9-9 3
9.9 Comparison of Sorting Algorithms 9-97
9.10 The Set ADT and Union/Find Structure 9-98
9.10.1 Set Implementation 9-98
9.10.2 Partition with Union-FindOperations 9-104
9.11 Solved Examples '.9-106
9.12 Previous University Questions and Answers 9-112
10-1 to 10-52
Chapter 10: Text Processing
10.1 Stri ng Operations 10-1
10.1.1 The String Constructors 10-1
10.1.2 String Arrays 10-4
10.1.3 String Concatenation 10-4
10.1.3.1 Concatenation of Strings 10-4
10.1.3.2 String Concatenation with other Data Types ~ 10-5
10.1.3.3 One Practical use of String Concatenation 10-6
10.1.4 Stri ng Methods 10-6
10.1.4.1 String Length 10-9
10.1.4.2 Changingthe Case of Characters within String : 10-9
10.1.4.3 Modifying String 10-10
10.1.4.3.1 substri ng() 10-10
10.1.4.3.2 concat() 10-11
10.1.4.3.3 replace() 10-12
10.1.4.3.4 trim{) 10-13
10.1.4.4 Character Extraction 10-14
10.1.4.4.1 char At() 10-14
10.1.4.4.2 getChars() 10-14
10.1.4.4.3 getBytes() 10-16
10.1.4.4.4 toCharArrayO 10-16
10.1.4.5 String Comparison ; 10-17
10.1.4.5.1 equals( ) and equalsIgnoreCase() 10-17
10.1.4.5.2 reg ion.\\atches() 10-18
10.1.4.5.3 startsWith() and endsWith() 10-19
T::"'e of Contents
10
Data Structure & Algorithms (M)
10.1.4.5.4 equals( ) Versus ==
10-20
10.1.4.5.5 CompareTo() and compareTolgnoreCase()
10-21
10.1.4.6 Searching Strings
10-24
10.1.4.7 String Conversion
10-26
10.1.4.8 Data conversion
: 10-28
10.1.5 Stri ngBuffer
10-29
10.1.5.1 StringBuffer Constructors
10-29
10.1.5.2 StringBuffer Methods 10-29
Pattern Matching Algorithm : 10-36
10.2.1 Brute force Pattern Matching
10-37
10.2.2 The Knuth Morris Pratt Algorithm 10-38
Tries 10-43
Huffman Algorithm
10-44
10.4.1 Huffman Encoding
10-44
10.4.2 Construction of Huffman Tree 10-45
Text Similarity Testing 10-48
10.5.1 Longest Common Subsequence Problem
10-48
10.5.2 Dynamic Programming
10-48
10.5.3
Applying Dynamic Programming to the LCS Problem 10-49
11-1 to 11-135
.er 11 : Graphs
Introduction 11-1
Concepts and Terminology 11-2
11.2.1 Graph :
11-2
11.2.2 Undirected Graph
11-2
11.2.3 Directed Graph
11-3
11.2.4 Connected Graph
".......•....................................... 11-4
11.2.5 Degree of a Node
11-5
11.2.6 Paths in a Graph
11-6
11.2.7 Weighted Graph
11-6
11.2.8 Multi graph
11-7
11.2.9 Subgraph
11-7
11.2.10 Directed Acyclic Graphs
11-8
11.2.11 Spanning .Trees
11-9
11.2.11.1 Minimal Spanning Tree
11-9
11.2.11.2 Applications of Spanning Tree 11-10
Representation of Graphs 11-10
11.3.1 Graph Representation using Adjacf'.ncy Matrix
11-10
11.3.2 Linked Representation of Graph 11-12
Graph Traversal 11-15
11.4.1 Depth-first-Search
11-15
11.4.1.1 Algorithm for Df S
11-19
11.4.1.2 Program to Demonstrate Depth first Search using Adjacency Matrix 11-19
Table of Contents 11
Data Structure & Algorithms (M)
11.4.1.3 Program to Demonstrate Depth First Search using Linked List 11-26
11.4.1.4 DFS Spann'lI'Iglree 11-35
11.4.1.5 Efficiency of DFS · 11-36
11.4.2 Breadth-First Search (BFS) 11-36
11.4.2.1 Algorithm for BFS 11-39
11.4.2.2 Program to Demonstrate Breadth First Search using Adjacency Matrix 11-39
11.4.2.3 Program to Demonstrate Breadth First Search using Linked List 11
11.4.2.4 BFS Spanning Tree 11-5:
11.4.2.5 Efficiency of BFS 11-5
11.5 Shortest Path Problem 11-5
11.5.1 Dijkstra's Shortest Path Algorithm 11-5
11.5.2 ExampIe 11-:0;;
11.5.3 Program for Dijkstra's Shortest Path 11
11.5.4 Efficiency of Dijkstra's Algorithm 11
11.6 Mini mum Spanning Tree 11
11.6.1 Prim's Algorithm 11
11.6.1.1 Algorithm u
11.6.1.2 Example !:
11.6.1.3 Program for Prim's Algol·jthm .; :~
11.6.1.4 Efficiency for Prim's Algorithm :!
11.6.2 Kruskal's Algorithm _ :.~
11.6.2.1 Kruskal's Algorithm .
11.6.2.2 ExampIe _._
11.6.2.3 Program for Kruskal's Algorithm _
11.6.2.4 Efficiency of Kruskal's Algorithm .
11.7 Solved Examples .
11.8 Previous University Questions and Answers .
Table of Contents Data Structure & Algorithms(M)
Chapter 1: Revisiting Java Programming Construct 1-1 to 1-136
1.1 Classes and Objects 1-1
1.1.1 The General Form of a Class 1-1
1.1.2 Declaration of Instance Variables , 1-2
1.1.3 Declaring Objects ~ 1-3
1.1.4 Accessing Instance Variables 1-4
1.1.5 Assigning Object Reference Variables 1-6
1.2 Class Methods 1-7
1.2.1 Returning a Value 1-9
1.2.2 Method that Takes Parameters : 1-11
1.3 Expressions 1-12
......................................................................................•..........................................
1.4 Control Flow ........................................•...•.....................................................................................
1-15
1.4.1 Selection Control Statements 1-15
1.4.1.1 The if statement 1-15
1.4.1.2 The if-else statement 1-17
1.4.1.3 The Switch Statement ; : 1-18
1.4.2 Iteration Statements 1-20
1.4.2.1 The While Statement 1-20
1.4.2.2 The do-while Loop 1-21
1.4.2.3 The for Loop 1-22
1.4.3 Jump Statements 1-24
1.4.3.1 The break Statement 1-25
1.4.3.2 The Continue Statement 1-28
1.4.3.3 The Return Statement 1-29
1.5 Arrays 1-30
1.5.1 One-Dimensional Arrays 1-30
1.5.1.1 Declaring Arrays 1-30
1.5.1.2 Creating Arrays 1-31
1.5.1.3 Initializing Arrays 1-32
1.5.1.4 A Simple Program on One-Dimensional Array 1-33
1.5.1.5 Array Length ; 1-34
1.5.2 Multidimensional Arrays 1-35
1.5.2.1 A Simple Program on Multidimensional Array : 1-36
1.5.2.2 Uneven (or Irregular) Multidimensional Arrays 1-37
1.5.2.3 Programs on Array 1-37
1.6 Input and Output 1-47
1.6.1 Streams 1-47
1.6.2 Predefined Streams 1-49
1.6.3 Reading Input from Console 1-50
Packages ; 1-52
•.7.1 Creating a Package 1-52 __•.
2' Q..ASSPATH Environmental Variable 1-53
Table of Contents
2
Data Structure & Algorithms (M)
1.7.3 Access Protection 1-55
1.7.4 Programs on Packages 1-56
1.7.5 Importing Packages 1-60
1.7.6 Hiding Classes 1-65
1.7.7 Java Application Programming Interface Packages 1-66
1.7.8 The java.lang Package : 1-66
1.8 True/False Questions 1-68
1.9 MuH'iple Choice Questions 1-69
.10 Debugging Exercises 1-73
.11 Programs 1-90
Chapter 2 : Object Oriented Design and Analysis of Algorithms
2-1 to 2-144
2.1 Inheritance 2-1
2.1.1 Defi nition 2-2
2.1.2 Forms of Inheritance ; 2-2
2.1.3 Single inheritance 2-3
2.1.4 Inheritance and Member Accessibility 2-5
2.1.5 A More Practical Example 2-8
2.1.6 Super Class Variable can Reference a Subclass Object 2-11
2.1.7 Using Super 2-13
2.1.7.1 Using Super to Call Superclass Constructors 2-13
2.1.7.2 A second use for Super 2-16
2.1.8 Multilevel Inheritance 2-18
2.1.9 When Constructors are Called 2-22
2.1.10 Method Overriding 2-23
2.1.11 Dynamic Method Dispatch : 2-29
2.1.12 A More Practical Example 2-30
2.2 The Keyword 'final' ..........................•........................................ _ 2-35
2.2.1 final Variables and Methods 2-35
2 .. 2.2 final Class 2 -35
, 3 Abstract Class 2-35
* 4 A Practical Examples 2-36
5 Interfaces : 2 -43
2.5.1 Introduction 2 -43
2.5.2 Defining Interfaces 2-44
2.5.3 Implementing Interfaces 2-45
2.5.4 Accessing Implementations through Interface References 2-47
2.5.5 Partial Implementations 2-48
2.5.6 Extending Interfaces 2-48
2.5.7 Accessing Interface Variables 2-50
2.5.8 A More Practical Example 2-51
Casting '" 2 -5 3
2.6.1 Casting in Expressions 2.:.53
Table of Contents
3
Data Structure & Algorithms (M)
2.7 Exception Handling 2-56
2.7.1 Exception Handling Mechanism 2-56
2.7.2 Exception Types 2-58
2.7.3 Derault Exception Handler 2-59
2.7.4 try and Catch ...................................................................•..•.....•................................. 2-60
2.7.5 Catching Multiple Exceptions , , ..........••..............•.............. 2-62
2.7.6 Nested try Statements 2-65
2.7.7 Throwing Exceptions (throw) 2-67
2.7.8 The throws Keyword 2-69
2.7.9 The rinally Keyword .............................................................................................•...... 2-70
2. 7.10 Java's Exceptions 2-74
2.7.11 Creating Our Own.Exception 2-75
2.8 Recursion and Other Design Patterns : 2-77
2.8.1 Recursive Derinition and Processes 2-77
2.8.2 Desi gn Patterns , 2 -86
2.9 A Igori thm , , , 2 -87
2.1 0 Pseudo Code 2 -89
2.11 Analysis or Algorithm : 2-90
2.11.1 What is Analysis or Algorithm ? 2-90
2.11.1.1 Time Complexity .............................................•........................................................... 2-91
2.11.1.2 Space Complexity 2-91
2.11.2 Types or Analysis ...............•............................................................................•............ 2-91
2.11.3 Order or Magnitude or an Algorithm 2-91
2.11.4 Worst Case, Average Case and Best Case Running Time or an Algorithm 2-93
2.11.5 Mathematical Notation ror Determination or the Running Time of
an Algorithm , 2 -9 3
2.11.5.1 Big-Oh Notation- '0' Notation 2-94
2.11.5.2 Omega Notation- '0' Notation 2-95
2.11.5.3 Theta Notation- 'e' Notation ............................................................•...................... 2-95
2.11.5.4 Properties or the Asymptotic Notations 2-97
2.11.6 Assumption while Finding the Time Complexity 2-98
2.11.7 Case Study or Worst, Best and Average Case Analysis or Algorithms .......•...... 2-98
2.12 Simple Justirication Techniques 2-99
2.12.1 By example , , 2-99
2.12.2 The "Contra" Attack ....................................................................•........................... 2-100
2.12.3 Induction and Loop Invariants 2-101
2 .13 True/False Questi ons 2-102
2.14 Multiple Choice Questions 2-104
2.15 Debugging Exercises 2-109
2.16 Programs 2-120
2.17 Solved Examples , 2-127
2.18 P~evious University Questions and Answers 2-141
Table of Contents 4 Data Structure & Algorithms (M)
Chapter 3 : Stacks, Queues and Recursion 3-1 to 3-160
3J Data Structure 3-1
3.1.1 Types of Data Structure 3-1
3.2 Recursion 3-4
3.2.1 Definition 3-4
3.2.2 Property of Recursive Definitions or Algorithms 3-6
3.2.3 Recursion in Java 3-6
3.2.4 Efficiency of Recursion 3-11
3.2.5 Comparisonbetween Itet'ation and Recursion 3-12
3.3 Stack 3-12
3.3.1 Definition 3-12
3.3.2 Operati ons 3-13
3.3.2.1 Push" and "Pop" : 3-13
3.3.2.2 "Empty" and "Stacktop" 3-14
3.3.3 Array Implementation of the Stack 3-15
3.3.4 Implementation of Stack using Java Built in Class 'Stack' , 3-18
3.3.5 Applications of Stack : 3-20
3.3.5.1 Evaluating a Postfix Expression 3-21
3.3.5.2 Converting an Expression from Infix to Postfix 3-29
Queue 3-39
3.4.1 Definition 3-40
3.4.2 Operations 3-40
3.4.3 Representing Queue in' Java' 3-41
3.4.4 Circular Queue 3-45
3.4.4.1 'Java' Implementation of "Circular Queue" 3-47
3.4.5 Deque 3-51
3.4.5.1 Operations on Deque 3-51
3.4.6 Application of Queue : 3-53
~.5 What is Linked List ? 3-54
3.5.1 Definition 3-54
3.5.2 Operations on Linked Lists 3-55
3.5.3 Linked List as a Data Structure 3-59
3.5.3.1 Attaching Node at the Specified Position 3-60
3.5.3.2 Deleting the Node from Specified Position 3-60
3.5.4 Header Node 3-61
3.5.5 Implementation of Linked Lists 3-62
3.5.5.1 Static Implementation ,.3-62
3.5.5.2 DynamicImplementation 3-72
3.5.6 Linked Implementation of Stack 3-80
3.5.7 Linked Implementation of Queues 3-86
3.5.8 Circular Linked List 3-90
3.5.8.1 Operations on Circular Linked List 3-90
Table of Contents
5 Data Structure & Algorithms (M) li
3.5.8.2 'Stack using Circular Linked List 3-99
3.5.8.3 Queue using Circular Linked List 3-99
3.5.8.4 Application of Circular Linked List 3-99
3.5.8.5 Header Node 3-105
3.5.9 DoublyLinkedList 3-106
3.5.9.1 Operations on DoublyLinked List 3-107
3.6 Previous University Questions and Answers 3-141
4-1 to 4-26
Chapter 4 : Vectors, Lists and Sequences
4.1 Vectors and Array Lists 4-1
4.1.1 Vector ADT 4-1
4.1.2 Simple Array-Based Implementation 4-2
4.1.3 Extendable Array Implementation 4-3
4.1.4 The java.util.ArrayList and java.util.Vector Classes 4-5
4.2 List 4-12
4.2.1 The List Abstract Data Type 4-13
4.2.2 DoublyLinked List Impiementation 4-16
4.3 Sequences 4-19
4.3.1 Implementation of Sequence with a DoublyLinked List 4-20
4.3.2 Implementation of Sequence with an Array 4-22
4.4 Favorite Lists and the Move-to-Front Heuristic 4-22
4.4.1 Introduction 4-22
4.4.2 Using a List with the Move-to-Front Heuristic 4-23
4.4.3 Implementation of a Favorite List using the Move-to-front Heuristic 4-24
5'"1 to 5-60
Chapter 5 : Trees
5.1 Basic Tree Concepts 5-1
5.1.1 Tree 5-1
5.1.2 Different Terms Related to Tree 5-2
5.1.2.1 Leaf 5-2
5.1.2.2 Father and Son 5-2
5.1.2.3 Ancestor and Descendant 5-2
5.1.2.4 Brother 5-2
5.1.2.5 Level ,........•.....................................................................................................................
5-2
5.1.2.6 Depth 5-2
5.1.3 Binary Tree 5-2
5.1.4 Types of Binary Trees 5-3
5.1.4.1 Strictly .......................................•.............................................................
Binary Tree 5-3
5.1.4.2 Complete Binary Tree 5-3
5.1.4.3 Almost Complete Binary Tree 5-4
5.2 Operations on Binary Trees 5-4
5.3 Binary Tree Traversal 5-6
5.3.1 Preorder Traversal 5-6
~able of Contents 6
Data Structure & Algorithms (M)
5.3.2 Inorder Traversal 5-9
5.3.3 Postorder Traversal 5-11
-4
Applications of Binary Trees 5-13
5.4.1 Binary Search Tree 5-13
5.4.2 Expression Tree 5-15
:.5
Binary Tree Representations ; 5-19
5.5.1 Implicit 'Array Representation of Binary Trees ....................•................................5-19
5.5.2 DynamicNode Representation 5-24
5.5.3 Choosinga BinaryTree Representation 5-28
Binary Tree Traversals in 'C' 5-28
5.6.1 Recursive Binary Tree Traversal 5-28
5.6.2 Non Recursive Binary Tree Traversal Algorithms 5-32
5.6.2.1 Non-recursive Method for Inorder Traversal of Binary Tree 5-32
5.6.2.2 Non-recursive Method for Preorder Traversed of Binary Tree 5-40
-7
Threaded Binary Trees 5-47
Previous University Questions and Answers 5-53
apter 6 : Priority Queue 6-1 to 6-27
Priority Queue 6-1
6.1.1 Definition 6-1
6.1.2 Types of Priority Queues 6-1
6.1.2.1 Ascending Priority Queue 6-1
6.1.2.2 Descending Priority Queue 6-2
6.1.3 Implementation of Priority Queue 6-2
6.1.4 1 Java' Implementation of Priority Queue (Third Solution) 6-3
2 Priority Queue using Linked List 6-8
6.2.1 Implementation with An Unsorted Linked List 6-8
6.2.2 Implementation with sorted linked List 6-16
6.2.3 Comparison , : 6-24
3 Adaptable Priority Queue , 6-25
6.3.1 Operations ; 6-25
6.3.2 Location Aware Entries 6-26
6.3.3 Sorted List Implementation 6-26
6.3.4 Heap Implementation 6-26
Heap as A Priority Queue 6-27
apter 7 : Map and Dictionaries 7-1 to 7-47
The Map Abstract Data Type h •••••••7-1
7.1:1 Maps in the java.util Packege 7-3
7.1.2 A Simple List -Based Map Implementant 7-3
2 Hash Tables 7-5
7.2.1 Bucket array 7-5
7.2.2 Hashing 7-6
Table of Contents 7
Data Structure & Algorithms (M)
7.2.2.1 Hash Function , , 7-6
7.2.2.2 Hashing Methods , " 7-8
7.2.2.3 Hash Clashor Hash Collision 7-11
7.2.2.4 Addressi ng 7-11
7.2.2.4.1 Linear Probing , , 7-11
7.2.2.4.2 Quadratic Probe 7-18
7.2.2.4.3 Pseudorandom CollisionResolution 7-19
7.2.2.4.4 KeyOffset , 7-22
7.2.2.5 Chaining :: 7-22
7.2.2.6 Bucket Hashing 7-24
7.2.2.7 Hashing in External Storage 7-24
7.2.2.8 DynamicHashing : 7-26
7.3 The Dictionary Abstract Data Type 7-28
7.3.1 List-Based Dictionaries and Audit Trails 7-29
7.3.2 Hash Table Dictionary Implementation 7-31
7.3.3 Ordered Search Tables and Binary Search 7-32
7.4 Skip Lists , 7-40
7.4.1 Searching in a Skip List 7-42
7.4.2 Insertion in a Skip List 7-43
7.4.3 Removalina Skip List 7-45
7.5 Extensions and Applications of Dictionaries 7-45
7.5.1 Location -Aware Dictionary Entries 7-45
7.5.2 The Ordered Dictionary ADT 7-46
7.5.3 Application of Ordered Dictionaries 7-4-.
8-1 to 8-138
Chapter 8 : Search Trees
8.1 Binary Searc h Tree 8-.
8.1.1 Definition 8-:
8.1.2 Advantages of Binary Search Tree 8-Z
8.1.3 Searching an Element in Binary Search Tree 8-,
8.1.4 Inserting an element into a Binary Search Tree -
8.1.5 Deleting an element from a Binary Search Tree
w_
8.1.6 Program for Binary Search Tree S
8.1.7 Efficiency of Binary Search Tree Operation 8-Z
8.2 AVLTrees 8-2
8.2.1 Definition 8
8.2.2 Height Balanced Tree -.
8.2.3 Balance Factor :;;
8.2.4 Structure of a Node in AVLTree 5
8.2.5 Insertion of a Node into an AVLTree ; 5
8.2.6 Rotate Left , 5
8.2.7 Rotate Right , , .
8.2.8 Single Rotation and Double Rotation , :
Table of Contents 8 Data Structure & Algorithms (M)
8.2.9 'Java' Function for Insertion of an Element
8.2.10 'Java' Function to Find Height of AVL Tree
8.2.11 'Java' Function to Rotate Right
8.2.12 'Java' Function to Rotate Left
8.2.13 'Java' Function for RR
8.2.14 'Java' Function for LL
8.2.15 'Java' Function for LR
8.2.16 ' Java' Function for RL
8.2.17 Program for AVL Tree
8.2.18 Examples
8.3
Splay Tree
8.3.1 Def inition
8.3.2 The Splay Operation
8.3.3 Operations
8.3.4 Examples
8.4 Red Black Trees
8.4.1 Defi nition
8.4.2 Lemma :
8.4.3 Operations
8.4.3.1 Inserti on
8.4.3.2 Removal
< •••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••
8.4.4 Complexity
8.4.5 Example
3. 5
Multi way Searc h Trees
8.5.1 Def initi 0n
8.5.2 Searching a Multiway Tree
8.5.3 Traversing a Multiway Tree
8.5.4 Inserting in a Multiway Tree
8.5.5 B -Trees
8.5.6 Deletion in Multiway Search Trees
8.5.7 Efficiency of Multiway Search Trees
8.5.8 Examples
2-4 tree
8.6.1 Defi nition
8.6.2 Height of a (2,4) Tree
8.6.3 Operations
8.6.3.1 Insertion
8.6.3.2 Deletion
into an AVL Tree 8:..31
8-32
8-32
8-32
8-33
8-33
8-33
8-33
8-33
8-39
8-55
8-5 5
8-55
8-57
8-60
8-73
8-73
8-73
8-74
8-74
8-76
8-80
8-80
8-9 4
8-94
8-97
8-98
8-99
8-107
8-114
: 8-116
8-116
8-124
8-124
8-125
8-126
8-126
8-131
9-1 to 9-116
pter 9 : Sorting, Sets and Selection
Sorting -General Concepts 9-1
Exchange Sort (Bubble, Quick) 9-3
9.2.1 Bubble Sort 9-3
Table of Contents 9
Data Structure & Algorithms (M)
9.2.2 Quick Sort/ Partition Exchange Sort 9-16
9.3 Insertion Sort 9-36
9.3.1 Simple Insertion 9-36
9.3.2 Shell Sort 9-41
9.4 Selection and Tree Sorting 9-49
9.4.1 Straight Selection Sort 9-49
9.4.2 Binary Tree Sort 9-55
9.5 Heap Sort 9-65
9.6 Merge Sort 9-76
9.7 Radix Sort 9-85
9.8 Bucket Sort 9-9 3
9.9 Comparison of Sorting Algorithms 9-97
9.10 The Set ADT and Union/Find Structure 9-98
9.10.1 Set Implementation 9-98
9.10.2 Partition with Union-FindOperations 9-104
9.11 Solved Examples '.9-106
9.12 Previous University Questions and Answers 9-112
10-1 to 10-52
Chapter 10: Text Processing
10.1 Stri ng Operations 10-1
10.1.1 The String Constructors 10-1
10.1.2 String Arrays 10-4
10.1.3 String Concatenation 10-4
10.1.3.1 Concatenation of Strings 10-4
10.1.3.2 String Concatenation with other Data Types ~ 10-5
10.1.3.3 One Practical use of String Concatenation 10-6
10.1.4 Stri ng Methods 10-6
10.1.4.1 String Length 10-9
10.1.4.2 Changingthe Case of Characters within String : 10-9
10.1.4.3 Modifying String 10-10
10.1.4.3.1 substri ng() 10-10
10.1.4.3.2 concat() 10-11
10.1.4.3.3 replace() 10-12
10.1.4.3.4 trim{) 10-13
10.1.4.4 Character Extraction 10-14
10.1.4.4.1 char At() 10-14
10.1.4.4.2 getChars() 10-14
10.1.4.4.3 getBytes() 10-16
10.1.4.4.4 toCharArrayO 10-16
10.1.4.5 String Comparison ; 10-17
10.1.4.5.1 equals( ) and equalsIgnoreCase() 10-17
10.1.4.5.2 reg ion.\\atches() 10-18
10.1.4.5.3 startsWith() and endsWith() 10-19
T::"'e of Contents
10
Data Structure & Algorithms (M)
10.1.4.5.4 equals( ) Versus ==
10-20
10.1.4.5.5 CompareTo() and compareTolgnoreCase()
10-21
10.1.4.6 Searching Strings
10-24
10.1.4.7 String Conversion
10-26
10.1.4.8 Data conversion
: 10-28
10.1.5 Stri ngBuffer
10-29
10.1.5.1 StringBuffer Constructors
10-29
10.1.5.2 StringBuffer Methods 10-29
Pattern Matching Algorithm : 10-36
10.2.1 Brute force Pattern Matching
10-37
10.2.2 The Knuth Morris Pratt Algorithm 10-38
Tries 10-43
Huffman Algorithm
10-44
10.4.1 Huffman Encoding
10-44
10.4.2 Construction of Huffman Tree 10-45
Text Similarity Testing 10-48
10.5.1 Longest Common Subsequence Problem
10-48
10.5.2 Dynamic Programming
10-48
10.5.3
Applying Dynamic Programming to the LCS Problem 10-49
11-1 to 11-135
.er 11 : Graphs
Introduction 11-1
Concepts and Terminology 11-2
11.2.1 Graph :
11-2
11.2.2 Undirected Graph
11-2
11.2.3 Directed Graph
11-3
11.2.4 Connected Graph
".......•....................................... 11-4
11.2.5 Degree of a Node
11-5
11.2.6 Paths in a Graph
11-6
11.2.7 Weighted Graph
11-6
11.2.8 Multi graph
11-7
11.2.9 Subgraph
11-7
11.2.10 Directed Acyclic Graphs
11-8
11.2.11 Spanning .Trees
11-9
11.2.11.1 Minimal Spanning Tree
11-9
11.2.11.2 Applications of Spanning Tree 11-10
Representation of Graphs 11-10
11.3.1 Graph Representation using Adjacf'.ncy Matrix
11-10
11.3.2 Linked Representation of Graph 11-12
Graph Traversal 11-15
11.4.1 Depth-first-Search
11-15
11.4.1.1 Algorithm for Df S
11-19
11.4.1.2 Program to Demonstrate Depth first Search using Adjacency Matrix 11-19
Table of Contents 11
Data Structure & Algorithms (M)
11.4.1.3 Program to Demonstrate Depth First Search using Linked List 11-26
11.4.1.4 DFS Spann'lI'Iglree 11-35
11.4.1.5 Efficiency of DFS · 11-36
11.4.2 Breadth-First Search (BFS) 11-36
11.4.2.1 Algorithm for BFS 11-39
11.4.2.2 Program to Demonstrate Breadth First Search using Adjacency Matrix 11-39
11.4.2.3 Program to Demonstrate Breadth First Search using Linked List 11
11.4.2.4 BFS Spanning Tree 11-5:
11.4.2.5 Efficiency of BFS 11-5
11.5 Shortest Path Problem 11-5
11.5.1 Dijkstra's Shortest Path Algorithm 11-5
11.5.2 ExampIe 11-:0;;
11.5.3 Program for Dijkstra's Shortest Path 11
11.5.4 Efficiency of Dijkstra's Algorithm 11
11.6 Mini mum Spanning Tree 11
11.6.1 Prim's Algorithm 11
11.6.1.1 Algorithm u
11.6.1.2 Example !:
11.6.1.3 Program for Prim's Algol·jthm .; :~
11.6.1.4 Efficiency for Prim's Algorithm :!
11.6.2 Kruskal's Algorithm _ :.~
11.6.2.1 Kruskal's Algorithm .
11.6.2.2 ExampIe _._
11.6.2.3 Program for Kruskal's Algorithm _
11.6.2.4 Efficiency of Kruskal's Algorithm .
11.7 Solved Examples .
11.8 Previous University Questions and Answers .
SYLLABUS FOR DBMS & GUI
SYLLABUS FOR DATABASE MANAGEMENT SYSTEM and GRAPHICAL USER INTERFACE USING VISUAL BASIC 6.0
1. Data base concepts and, Systems
Introduction- Purpose of Database Systems, Views of data, Data Models, Database language, Transaction Management, Storage Management, Database Administrator, Database Users, Overall System Structure, Different types of Database Systems
2. E-R Model
BasIc Concepts, Design issues, Mapping Constraints , Keys, E-R Diagram, Weak Entity set, Extelided E-R features, Design Of an E-R Database Schema, Reduction of an E-R schema to Tables
3. Relational Model
Structure of Relationa! Database, The Relational Algebra, View's SOL Background, Basic Structure, SET operations, Aggregate functions, Null Values, Nested Sub queriE::s, Derived Relations Views. Modification of Database, Joined Relations, DOL, Other SOL features
4. Transaction
Transaction Concepts, Stdte, Impieinentations of Atolilicity and durability, Concurrent Executions, Serializability, Recoverabillty, Tracsact:on Definaton In SOL.
5. Concurrency Control Lock based protocol, Timestamp based protocol, Validation based protocol, Deadlock Handing, Insert and Delete operations, Concurrency in index structure
re classification, Recovery and Atomicity, Log based recovery, ShadowlFc1lU .
6.Recovery System
Failure classification , Recovery & atomicity, log based rec, Shadow paging
7 Graphical ,User Interface
MurphY 's Lavv of G U I Design, Features of G U I, Icons and graphics, identifying visual cues, clear communication, color selection, GUI standard, :);clnrling GUI Design \Alork.
8.Visual programming
Sharing Data and Code
. \'Jorking with Pr'ojects, introduction to Basic language, Using inbuilt controls ~-':ld AdveX controls, creating and using classes, Introduct:on to Collections, USing and creating ActiveX Components, dynamic data exchange, object !~:lking and embedding
Creating visual softvvo.;e entities
'I,'\/orking With text, graphics, working with files, file management, set ial :~ommunication, multimedia control interfaces,
Programming for the Internet
Using ,u,ctiveX controls on the web-the inlernet transfer control for HTTP, F'TP
D2tabase programming
~)ata basE:' basics, Visual Basic's database tools, Database designing and programming, DAO, RDO, ODBC,,ADO, OLE DB, Relat:onal databases, the Data Object ;v1ode!s, form and fields validation, Client Server Programming, COM-DCOM.
1. Data base concepts and, Systems
Introduction- Purpose of Database Systems, Views of data, Data Models, Database language, Transaction Management, Storage Management, Database Administrator, Database Users, Overall System Structure, Different types of Database Systems
2. E-R Model
BasIc Concepts, Design issues, Mapping Constraints , Keys, E-R Diagram, Weak Entity set, Extelided E-R features, Design Of an E-R Database Schema, Reduction of an E-R schema to Tables
3. Relational Model
Structure of Relationa! Database, The Relational Algebra, View's SOL Background, Basic Structure, SET operations, Aggregate functions, Null Values, Nested Sub queriE::s, Derived Relations Views. Modification of Database, Joined Relations, DOL, Other SOL features
4. Transaction
Transaction Concepts, Stdte, Impieinentations of Atolilicity and durability, Concurrent Executions, Serializability, Recoverabillty, Tracsact:on Definaton In SOL.
5. Concurrency Control Lock based protocol, Timestamp based protocol, Validation based protocol, Deadlock Handing, Insert and Delete operations, Concurrency in index structure
re classification, Recovery and Atomicity, Log based recovery, ShadowlFc1lU .
6.Recovery System
Failure classification , Recovery & atomicity, log based rec, Shadow paging
7 Graphical ,User Interface
MurphY 's Lavv of G U I Design, Features of G U I, Icons and graphics, identifying visual cues, clear communication, color selection, GUI standard, :);clnrling GUI Design \Alork.
8.Visual programming
Sharing Data and Code
. \'Jorking with Pr'ojects, introduction to Basic language, Using inbuilt controls ~-':ld AdveX controls, creating and using classes, Introduct:on to Collections, USing and creating ActiveX Components, dynamic data exchange, object !~:lking and embedding
Creating visual softvvo.;e entities
'I,'\/orking With text, graphics, working with files, file management, set ial :~ommunication, multimedia control interfaces,
Programming for the Internet
Using ,u,ctiveX controls on the web-the inlernet transfer control for HTTP, F'TP
D2tabase programming
~)ata basE:' basics, Visual Basic's database tools, Database designing and programming, DAO, RDO, ODBC,,ADO, OLE DB, Relat:onal databases, the Data Object ;v1ode!s, form and fields validation, Client Server Programming, COM-DCOM.
Tuesday, November 4, 2008
MERIT LIST PROGRAM
thanks to siddhart for mailing me
follow the below link
http://rapidshare.com/files/160608725/MERIT_LIST.rar
follow the below link
http://rapidshare.com/files/160608725/MERIT_LIST.rar
LIBRARY MANAGEMENT PROJECT
follow the below link :
http://rapidshare.com/files/160607048/library.zip
thanks to siddhart for mailing me
http://rapidshare.com/files/160607048/library.zip
thanks to siddhart for mailing me
PAYROLL PROJECT
THANKS TO ANVITH FOR MAILING IT 2 ME
the following ling contains the payroll project
http://rapidshare.com/files/160574933/payroll.rar
the following ling contains the payroll project
http://rapidshare.com/files/160574933/payroll.rar
EXTRA DBMS PRACTICALS TO DOWNLOAD
JUST FOLLOW THIS LINK 2 THE SITE
http://rapidshare.com/files/160573247/DBMS.rar
THIS CONTAINS ALL THE PRACTICALS TAKEN BY DHEERAJ SIR ON EXTRA LECTURES AND SATURDAY LECTURES
LIST OF PRACTICALS INCLUDED IS
1.DATABASE CONNECTIVITY USIND ADO
2.DATABASE CONNECTIVITY USIND DAO
3.DATABASE CONNECTIVITY USIND RDO
4.FLEXI GRID PROGRAM
5.BINARY FILE MANAGEMENT PROGRAM
6.MDI FORM PROGRAM
and many more
HOPE U WILL FIND IT USEFUL
http://rapidshare.com/files/160573247/DBMS.rar
THIS CONTAINS ALL THE PRACTICALS TAKEN BY DHEERAJ SIR ON EXTRA LECTURES AND SATURDAY LECTURES
LIST OF PRACTICALS INCLUDED IS
1.DATABASE CONNECTIVITY USIND ADO
2.DATABASE CONNECTIVITY USIND DAO
3.DATABASE CONNECTIVITY USIND RDO
4.FLEXI GRID PROGRAM
5.BINARY FILE MANAGEMENT PROGRAM
6.MDI FORM PROGRAM
and many more
HOPE U WILL FIND IT USEFUL
INCOME TAX PROJECT
DATABASE MANAGEMENT SYSTEM(DBMS) AND GRAPHICAL USER INTERFACE(GUI) PROJECT
PROJECT OF INCOME TAX CALCULATOR
the link is
http://rapidshare.com/files/160587444/incometax.rar
PROJECT OF INCOME TAX CALCULATOR
the link is
http://rapidshare.com/files/160587444/incometax.rar
Wednesday, October 29, 2008
10 DATABASE MANAGEMENT SYSTEM AN GRAPHICAL USER INTERFACE USING VISUAL BASIC 6.0
'DATABASE MANAGEMENT SYSTEM AN GRAPHICAL USER INTERFACE USING VISUAL BASIC 6.0
'EXP NO 10 ACTIVE X PROGRAMMING
'**************CODE FOR FORM1*********************
Private Sub Command1_Click()
Print AddressCtl1.AddressText
End Sub
'*********CODE FOR ADDRESS CONTROL*******
Private Sub UserControl_Resize()
With UserControl
'Enforce minimum dimensions
If .Height < 3615 Then .Height = 3615
If .Width < 2175 Then .Width = 2175
'Resize objects on the control
txtName.Width = .ScaleWidth - 500
txtStreet.Width = .ScaleWidth - 500
txtCity.Width = .ScaleWidth - 500
txtZip.Width = .ScaleWidth / 2 - 500
txtState.Width = .ScaleWidth / 2 - 500
'Move the Zipcode text box
txtZip.Left = .ScaleWidth / 2 + 160
lblZip.Left = .ScaleWidth / 2 + 160
End With
End Sub
Public Property Get AddressText() As String
Dim s As String
s = txtName & vbCrLf
s = s & txtStreet & vbCrLf
s = s & txtCity & vbCrLf
s = s & txtState & vbCrLf
s = s & txtZip
AddressText = s
End Property
Sunday, October 26, 2008
SARDAR OF THE DAY
Bomb and Sardar
2 sardaron ko 2 bomb mile,
1st Sardar: chal police ko de k aate hain.
2 sardar: agar koi bomb raaste me phat gaya to?
1st sardar: jhoot bol denge ki 1 hi mila tha
2 sardaron ko 2 bomb mile,
1st Sardar: chal police ko de k aate hain.
2 sardar: agar koi bomb raaste me phat gaya to?
1st sardar: jhoot bol denge ki 1 hi mila tha
Student Vs Professor
After having failed his exam in "Logistics and Organization" , a student goes and confronts his lecturer about it.
Student: "Sir, do you really understand anything about the subject?"
Professor: "Surely I must. Otherwise I would not be a professor!"
Student: "Great, well then I would like to ask you a question.
If you can give me the correct answer, I will accept my mark as is and go. If you however do not know the answer, I want you give me an "A" for the exam. "
Professor: "Okay, it's a deal. So what is the question?"
Student: "What is legal, but not logical, logical, but not legal, and neither logical, nor legal?"
Even after some long and hard consideration, the professor cannot give the student an answer, and therefore changes his exam mark into an "A", as agreed.
Afterwards, the professor calls on his best student and asks him the same question.
He immediately answers: "Sir, you are 63 years old and married to a 35 year old woman, which is legal, but not logical. Your wife has a 25 year old lover, which is logical, but not legal. The fact that you have given your wife's lover an "A", although he really should have failed, is neither legal, nor logical."
Student: "Sir, do you really understand anything about the subject?"
Professor: "Surely I must. Otherwise I would not be a professor!"
Student: "Great, well then I would like to ask you a question.
If you can give me the correct answer, I will accept my mark as is and go. If you however do not know the answer, I want you give me an "A" for the exam. "
Professor: "Okay, it's a deal. So what is the question?"
Student: "What is legal, but not logical, logical, but not legal, and neither logical, nor legal?"
Even after some long and hard consideration, the professor cannot give the student an answer, and therefore changes his exam mark into an "A", as agreed.
Afterwards, the professor calls on his best student and asks him the same question.
He immediately answers: "Sir, you are 63 years old and married to a 35 year old woman, which is legal, but not logical. Your wife has a 25 year old lover, which is logical, but not legal. The fact that you have given your wife's lover an "A", although he really should have failed, is neither legal, nor logical."
Solid Interview !!----Toooo Funny :-))
Interviewer:Tell me about yourself.
Candidate:I am Rameshwar Kulkarni. I did my Tele Communication engineering from BabanRao Dhole-Patil Institute of Technology.
Interviewer:BabanRao Dhole-Patil Institute of Technology? I had never heard of this college before!
Candidate:Great! Even I had not heard of it before getting an admission into it .. What happened is - due to cricket world cup I scored badly! In 12th.I was getting a aid seat in a good college. But my father said (I prefer to call him 'baap') - "I can not invest so much of money".(The baap actually said - "I will never waste so much of money on you"). So I had to join this college. Frankly speaking this name - babanRao Dhole-Patil, can at the most be related to a Shetakari Mahavidyalaya.
Interviewer:ok, ok. It seems you have taken 6 years to complete your engineering.
Candidate:Actually I tried my best to finish it in 4 years. But you know, these cricket matches and football world cup, and tennis tournaments. It is difficult to concentrate. So I flunked in 2nd and 3rd year. So in all I took 4 + 2 = 7 years.
Interviewer:But 4+2 is 6.
Candidate:Oh, is it? You know I always had KT in maths. But I will try to keep this in mind. 4+2 is 6, good, thanks. These cricket matches really affect exams a lot. I think they should ban it.
Interviewer: Good to know that you want cricket matches to be banned.
Candidate:No, no... I am talking about Exams!!
Interviewer:Ok, What is your biggest achievement in life?
Candidate:Obviously, completing my Engineering. My mom never thought I would complete it. In fact, when I flunked in 3rd year, she was looking for a job for me in BEST (Bus corporation in Maharashtra) through some relative.
Interviewer:Do you have any plans of higher study?
Candidate:he he he... Are you kidding? Completing 'lower' education itself was so much of pain!!
Interviewer:Let's talk about technical stuff. On which platforms have you worked?
Candidate:Well, I work at SEEPZ, so you can say Andheri is my current platform. Earlier I was at Vashi center. So Vashi was my platform then. As you can see I have experience of different platforms! (Vashi and Andheri are the places in Mumbai)
Interviewer:And which languages have you used?
Candidate:Marathi, Hindi, English. By the way, I can keep quiet in German, French, Russian and many other languages.
Interviewer:Why VC is better than VB?
Candidate:It is a common sense - C comes after B. So VC is a higher version than VB. I heard very soon they are coming up with a new language VD!
Interviewer:Do you know anything about Assembly Language?
Candidate:Well, I have not heard of it. But I guess, this is the language our ministers and MPs use in assembly.
Interviewer:What is your general project experience?
Candidate:My general experience about projects is - most of the times they are in pipeline!
Interviewer:Can you tell me about your current job?
Candidate:Sure, Currently I am working for Bata InfoTech ltd. Since joining BIL, I am on Bench. Before joining BIL, I used to think that Bench was another software like Windows.
Interviewer:Do you have any project management experience?
Candidate:No, but I guess it shouldn't be difficult. I know Word and Excel. I can talk a lot. I know how to dial for International phone call and use speaker facility. And very important - I know few words like-'Showstoppers ' , 'hotfixes', 'SEI-CMM','quality','versioncontrol','deadlines' , 'Customer Satisfaction' etc. Also I can blame others for my mistakes!
Interviewer:What are your expectations from our company?
Candidate:Not much.
1. I should at least get 40,000 in hand..
2. I would like to work on a live EJB project. But it should not have deadlines. I personally feel that pressure affects natural talent.
3. I believe in flexi-timings.
4. Dress code is against basic freedom, so I would like to wear t-shirt and jeans.
5. We must have sat-sun off. I will suggest Wednesday off also, so as to avoid breakdown due to overwork.
6. I would like to go abroad 3 times a year on short term preferably 1-2 months) assignments. Personally I prefer US, Australia and Europe. But considering the fact that there is Olympics coming up in China in the current year, I don't mind going there in that period. As you can see I am modest and don't have many expectations. So can I assume my selection?
Interviewer:he he he ha ha ha. Thanks for your interest in our organization. In fact I was never entertained so much before. Welcome to INFOSYS..
The fellow was appointed in a newly created section 'Stress Management' in the HRD of Infosys.
Candidate:I am Rameshwar Kulkarni. I did my Tele Communication engineering from BabanRao Dhole-Patil Institute of Technology.
Interviewer:BabanRao Dhole-Patil Institute of Technology? I had never heard of this college before!
Candidate:Great! Even I had not heard of it before getting an admission into it .. What happened is - due to cricket world cup I scored badly! In 12th.I was getting a aid seat in a good college. But my father said (I prefer to call him 'baap') - "I can not invest so much of money".(The baap actually said - "I will never waste so much of money on you"). So I had to join this college. Frankly speaking this name - babanRao Dhole-Patil, can at the most be related to a Shetakari Mahavidyalaya.
Interviewer:ok, ok. It seems you have taken 6 years to complete your engineering.
Candidate:Actually I tried my best to finish it in 4 years. But you know, these cricket matches and football world cup, and tennis tournaments. It is difficult to concentrate. So I flunked in 2nd and 3rd year. So in all I took 4 + 2 = 7 years.
Interviewer:But 4+2 is 6.
Candidate:Oh, is it? You know I always had KT in maths. But I will try to keep this in mind. 4+2 is 6, good, thanks. These cricket matches really affect exams a lot. I think they should ban it.
Interviewer: Good to know that you want cricket matches to be banned.
Candidate:No, no... I am talking about Exams!!
Interviewer:Ok, What is your biggest achievement in life?
Candidate:Obviously, completing my Engineering. My mom never thought I would complete it. In fact, when I flunked in 3rd year, she was looking for a job for me in BEST (Bus corporation in Maharashtra) through some relative.
Interviewer:Do you have any plans of higher study?
Candidate:he he he... Are you kidding? Completing 'lower' education itself was so much of pain!!
Interviewer:Let's talk about technical stuff. On which platforms have you worked?
Candidate:Well, I work at SEEPZ, so you can say Andheri is my current platform. Earlier I was at Vashi center. So Vashi was my platform then. As you can see I have experience of different platforms! (Vashi and Andheri are the places in Mumbai)
Interviewer:And which languages have you used?
Candidate:Marathi, Hindi, English. By the way, I can keep quiet in German, French, Russian and many other languages.
Interviewer:Why VC is better than VB?
Candidate:It is a common sense - C comes after B. So VC is a higher version than VB. I heard very soon they are coming up with a new language VD!
Interviewer:Do you know anything about Assembly Language?
Candidate:Well, I have not heard of it. But I guess, this is the language our ministers and MPs use in assembly.
Interviewer:What is your general project experience?
Candidate:My general experience about projects is - most of the times they are in pipeline!
Interviewer:Can you tell me about your current job?
Candidate:Sure, Currently I am working for Bata InfoTech ltd. Since joining BIL, I am on Bench. Before joining BIL, I used to think that Bench was another software like Windows.
Interviewer:Do you have any project management experience?
Candidate:No, but I guess it shouldn't be difficult. I know Word and Excel. I can talk a lot. I know how to dial for International phone call and use speaker facility. And very important - I know few words like-'Showstoppers ' , 'hotfixes', 'SEI-CMM','quality','versioncontrol','deadlines' , 'Customer Satisfaction' etc. Also I can blame others for my mistakes!
Interviewer:What are your expectations from our company?
Candidate:Not much.
1. I should at least get 40,000 in hand..
2. I would like to work on a live EJB project. But it should not have deadlines. I personally feel that pressure affects natural talent.
3. I believe in flexi-timings.
4. Dress code is against basic freedom, so I would like to wear t-shirt and jeans.
5. We must have sat-sun off. I will suggest Wednesday off also, so as to avoid breakdown due to overwork.
6. I would like to go abroad 3 times a year on short term preferably 1-2 months) assignments. Personally I prefer US, Australia and Europe. But considering the fact that there is Olympics coming up in China in the current year, I don't mind going there in that period. As you can see I am modest and don't have many expectations. So can I assume my selection?
Interviewer:he he he ha ha ha. Thanks for your interest in our organization. In fact I was never entertained so much before. Welcome to INFOSYS..
The fellow was appointed in a newly created section 'Stress Management' in the HRD of Infosys.
9 CLASS IN VB
'AIM : PROGRAM TO IMPLEMENT CLASS MODULES IN VISUAL BASIC
'NAME : JEKIN . J . TRIVEDI
'CLASS : SE - IT(B5) ROLL NO : 67
'*************************CODE FOR STUDENT CLASS MODULE ****************
Private m_studentid As String
Private m_firstname As String
Private m_lastname As String
Private m_majorcode As String
Private m_yearlevel As String
Private m_birthdate As Date
Property Get StudentID() As String
StudentID = m_studentid
End Property
Property Let StudentID(ByVal strnewvalue As String)
'Raise an error if an invalid assignment is attempted
If Len(strnewvalue) = 0 Then Err.Raise 5 'Ivalid procedure
'argument else stored in the private member variable
m_studentid = strnewvalue
End Property
Property Get firstname() As String
firstname = m_firstname
End Property
Property Let firstname(ByVal strnewvalue As String)
'raise an error if an inalid assignment is attempted
If Len(strnewvalue) = 0 Then Err.Raise 5 'invalid procedure argument
'else store in the private member variable
m_firstname = strnewvalue
End Property
Property Get lastname() As String
lastname = m_lastname
End Property
Property Let lastname(ByVal strnewvalue As String)
'raise an error if an inalid assignment is attempted
If Len(strnewvalue) = 0 Then Err.Raise 5 'invalid procedure argument
'else store in the private member variabel
m_lastname = strnewvalue
End Property
Property Get Majorcode() As String
Majorcode = m_majorcode
End Property
Property Let Majorcode(ByVal strnewvalue As String)
If Len(strnewvalue) = 0 Or Len(strnewvalue) > 1 Then Err.Raise 5
'End If
m_majorcode = strnewvalue
End Property
Property Get yearlevel() As String
yearlevel = m_yearlevel
End Property
Property Let yearlevel(ByVal strnewvalue As String)
Dim vartemp As Variant
Dim found As Boolean
For Each vartemp In Array("Freshman", "sophomore", "Junior", "Senior")
If InStr(1, strnewvalue, vartemp, vbTextCompare) Then
found = True
Exit For
End If
Next
If Not found Then Err.Raise 5
m_yearlevel = strnewvalue
End Property
Property Get birthdate() As Date
birthdate = m_birthdate
End Property
Property Let birthdate(ByVal datnewvalue As Date)
If datnewvalue >= Now Then Err.Raise 1001, , "Future Date!"
m_birthdate = datnewvalue
End Property
'*************************CODE FOR FORM1 ****************
'Declare object of student class
Dim ostudent As Student
Private Sub Command1_Click()
Set ostudent = New Student
'Use the object student
ostudent.StudentID = "990680"
ostudent.firstname = "Dhiraj"
ostudent.lastname = "Vanmali"
ostudent.Majorcode = "A"
ostudent.yearlevel = "Senior"
ostudent.birthdate = "19-9-2008"
Print "Student ID :" & ostudent.StudentID & vbCrLf
Print "First Name :" & ostudent.firstname & vbCrLf
Print "Last Name :" & ostudent.lastname & vbCrLf
Print "Major Code:" & ostudent.Majorcode & vbCrLf
Print "Year: " & ostudent.yearlevel & vbCrLf
Print "Date of Birth:" & ostudent.birthdate
Set ostudent = Nothing
End Sub
'NAME : JEKIN . J . TRIVEDI
'CLASS : SE - IT(B5) ROLL NO : 67
'*************************CODE FOR STUDENT CLASS MODULE ****************
Private m_studentid As String
Private m_firstname As String
Private m_lastname As String
Private m_majorcode As String
Private m_yearlevel As String
Private m_birthdate As Date
Property Get StudentID() As String
StudentID = m_studentid
End Property
Property Let StudentID(ByVal strnewvalue As String)
'Raise an error if an invalid assignment is attempted
If Len(strnewvalue) = 0 Then Err.Raise 5 'Ivalid procedure
'argument else stored in the private member variable
m_studentid = strnewvalue
End Property
Property Get firstname() As String
firstname = m_firstname
End Property
Property Let firstname(ByVal strnewvalue As String)
'raise an error if an inalid assignment is attempted
If Len(strnewvalue) = 0 Then Err.Raise 5 'invalid procedure argument
'else store in the private member variable
m_firstname = strnewvalue
End Property
Property Get lastname() As String
lastname = m_lastname
End Property
Property Let lastname(ByVal strnewvalue As String)
'raise an error if an inalid assignment is attempted
If Len(strnewvalue) = 0 Then Err.Raise 5 'invalid procedure argument
'else store in the private member variabel
m_lastname = strnewvalue
End Property
Property Get Majorcode() As String
Majorcode = m_majorcode
End Property
Property Let Majorcode(ByVal strnewvalue As String)
If Len(strnewvalue) = 0 Or Len(strnewvalue) > 1 Then Err.Raise 5
'End If
m_majorcode = strnewvalue
End Property
Property Get yearlevel() As String
yearlevel = m_yearlevel
End Property
Property Let yearlevel(ByVal strnewvalue As String)
Dim vartemp As Variant
Dim found As Boolean
For Each vartemp In Array("Freshman", "sophomore", "Junior", "Senior")
If InStr(1, strnewvalue, vartemp, vbTextCompare) Then
found = True
Exit For
End If
Next
If Not found Then Err.Raise 5
m_yearlevel = strnewvalue
End Property
Property Get birthdate() As Date
birthdate = m_birthdate
End Property
Property Let birthdate(ByVal datnewvalue As Date)
If datnewvalue >= Now Then Err.Raise 1001, , "Future Date!"
m_birthdate = datnewvalue
End Property
'*************************CODE FOR FORM1 ****************
'Declare object of student class
Dim ostudent As Student
Private Sub Command1_Click()
Set ostudent = New Student
'Use the object student
ostudent.StudentID = "990680"
ostudent.firstname = "Dhiraj"
ostudent.lastname = "Vanmali"
ostudent.Majorcode = "A"
ostudent.yearlevel = "Senior"
ostudent.birthdate = "19-9-2008"
Print "Student ID :" & ostudent.StudentID & vbCrLf
Print "First Name :" & ostudent.firstname & vbCrLf
Print "Last Name :" & ostudent.lastname & vbCrLf
Print "Major Code:" & ostudent.Majorcode & vbCrLf
Print "Year: " & ostudent.yearlevel & vbCrLf
Print "Date of Birth:" & ostudent.birthdate
Set ostudent = Nothing
End Sub
DBMS 6 :FILE MANAGEMENT
'file management
Private Sub Command1_Click()
'create file
Dim filesystemobject, textstream As Object
Set filesystemobject = CreateObject("scripting.filesystemobject")
Set textstream = filesystemobject.createtextfile("c:\raja.txt", True)
textstream.write ("Hi")
End Sub
Private Sub Command2_Click()
'move file
Dim filesystemobject, textstream As Object
Set filesystemobject = CreateObject("scripting.filesystemobject")
filesystemobject.movefile "c:\raja.txt", "c:\vcet\raja.txt"
End Sub
Private Sub Command3_Click()
'copy file
Dim filesystemobject, textstream As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
filesysteamobject.copyfile "c:\vcet\raja.txt", "c:\raja.txt"
End Sub
Private Sub Command4_Click()
'delete file
Dim filesysteamobject, fileobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
filesysteamobject.Deletefile "c:\vcet\raja.txt"
End Sub
Private Sub Command5_Click()
'get file creatad date
Dim filesysteamobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
Set fileobject = filesysteamobject.getfile("c:\raja.txt")
MsgBox "c:\raja.txt" & vbctrf & "was created" & fileobject.datecreated & vbctrf
End Sub
Private Sub Command6_Click()
'get file last accessed date
Dim filesysteamobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
Set fileobject = filesysteamobject.getfile("c:\raja.txt")
MsgBox "c:\raja.txt" & vbctrf & "was last accessed" & fileobject.datelastaccessed & vbctrf
End Sub
Private Sub Command7_Click()
'get file last modified date
Dim filesysteamobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
Set fileobject = filesysteamobject.getfile("c:\raja.txt")
MsgBox "c:\raja.txt" & vbctrf & "was last modified date " & fileobject.datelastmodified & vbctrf
End Sub
Private Sub Command8_Click()
'get file length
Dim filesysteamobject As Object
MsgBox "the c:\raja.txt fle" & Str(FileLen("c:\raja.txt")) & "bytes long"
End Sub
Private Sub Command1_Click()
'create file
Dim filesystemobject, textstream As Object
Set filesystemobject = CreateObject("scripting.filesystemobject")
Set textstream = filesystemobject.createtextfile("c:\raja.txt", True)
textstream.write ("Hi")
End Sub
Private Sub Command2_Click()
'move file
Dim filesystemobject, textstream As Object
Set filesystemobject = CreateObject("scripting.filesystemobject")
filesystemobject.movefile "c:\raja.txt", "c:\vcet\raja.txt"
End Sub
Private Sub Command3_Click()
'copy file
Dim filesystemobject, textstream As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
filesysteamobject.copyfile "c:\vcet\raja.txt", "c:\raja.txt"
End Sub
Private Sub Command4_Click()
'delete file
Dim filesysteamobject, fileobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
filesysteamobject.Deletefile "c:\vcet\raja.txt"
End Sub
Private Sub Command5_Click()
'get file creatad date
Dim filesysteamobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
Set fileobject = filesysteamobject.getfile("c:\raja.txt")
MsgBox "c:\raja.txt" & vbctrf & "was created" & fileobject.datecreated & vbctrf
End Sub
Private Sub Command6_Click()
'get file last accessed date
Dim filesysteamobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
Set fileobject = filesysteamobject.getfile("c:\raja.txt")
MsgBox "c:\raja.txt" & vbctrf & "was last accessed" & fileobject.datelastaccessed & vbctrf
End Sub
Private Sub Command7_Click()
'get file last modified date
Dim filesysteamobject As Object
Set filesysteamobject = CreateObject("scripting.filesystemobject")
Set fileobject = filesysteamobject.getfile("c:\raja.txt")
MsgBox "c:\raja.txt" & vbctrf & "was last modified date " & fileobject.datelastmodified & vbctrf
End Sub
Private Sub Command8_Click()
'get file length
Dim filesysteamobject As Object
MsgBox "the c:\raja.txt fle" & Str(FileLen("c:\raja.txt")) & "bytes long"
End Sub
Sunday, October 19, 2008
Wednesday, October 8, 2008
DBMS PRACTICAL 4 TRANSACTION
SQL> create table emp57(emp_id int,name varchar(20),dept_id int);
create table emp57(emp_id int,name varchar(20),dept_id int)
*
ERROR at line 1:
ORA-00955: name is already used by an existing object
SQL> create table emp257(emp_id int,name varchar(20),dept_id int);
Table created.
SQL> create table dept257(dept_id int,dept_name varchar(20));
Table created.
SQL> insert into emp257 values(01,'MAYANK SHARMA',101);
1 row created.
SQL> insert into emp257 values(02,'BHUSHAN TALEKAR',102);
1 row created.
SQL> insert into emp257 values(03,'SAURABH SHETTY',103);
1 row created.
SQL> insert into emp257 values(04,'ADITYA LOHIA',104);
1 row created.
SQL>
SQL> insert into emp257 values(05,'SACHIN JOSHI',105);
1 row created.
SQL> insert into dept257 values(101,'INFT');
1 row created.
SQL> insert into dept257 values(102,'EXTC');
1 row created.
SQL> insert into dept257 values(103,'MECH');
1 row created.
SQL> insert into dept257 values(104,'COMP');
1 row created.
SQL> insert into dept257 values(105,'INST');
1 row created.
SQL> select * from emp257;
EMP_ID NAME DEPT_ID
---------- -------------------- ----------
1 MAYANK SHARMA 101
2 BHUSHAN TALEKAR 102
3 SAURABH SHETTY 103
4 ADITYA LOHIA 104
5 SACHIN JOSHI 105
SQL> select * from dept257;
DEPT_ID DEPT_NAME
---------- --------------------
101 INFT
102 EXTC
103 MECH
104 COMP
105 INST
SQL> rollback work;
Rollback complete.
SQL> select * from emp257;
no rows selected
SQL> select * from dept257;
no rows selected
SQL> begin transaction;
2 insert into emp257 values(01,'MAYANK SHARMA',101);
3 insert into dept257 values(101,'INFT');
4 commit work;
4 commit work;
5 /
commit work;
*
ERROR at line 4:
ORA-06550: line 4, column 12:
PLS-00103: Encountered the symbol "end-of-file" when expecting one of the
following:
begin case declare end exception exit for goto if loop mod
null pragma raise return select update while with
DBMS PRACTICLE 2:- DATA MANIPULATION LANGUAGE
PRACTICLE 2:- DATA MANIPULATION LANGUAGE
SQL> create table practicle265(emp_id int primary key,name varchar(20) not null,address varchar(
salary decimal(10,2));
Table created
SQL> insert into practicle265 values(01,'mayank sharma','bhayandar',100000);
1 row created.
SQL> insert into practicle265 values(02,'bhushan talekar','vasai',100000);
1 row created.
SQL> insert into practicle265 values(03,'saurabh shetty','dahisar',100000);
1 row created.
SQL> insert into practicle265 values(04,'khyati vashi','bhayandar',100000);
1 row created.
SQL> insert into practicle265 values(05,'aditya lohia','vasai',100000);
1 row created.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
SQL>
SQL>
SQL> select emp_id from practicle265;
EMP_ID
----------
1
2
3
4
5
SQL> select emp_id from practicle265 where emp_id=1;
EMP_ID
----------
1
SQL> select * from practicle265 where name='mayank sharma';
EMP_ID NAME ADDRESS SALARY
---------- ------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
SQL> select * from practicle265 where name<>'mayank sharma';
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
SQL> select * from practicle265 where salary>10000;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
SQL> select * from practicle265 where emp_id=2 or name='mayank sharma';
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
SQL> select * from practicle265 where emp_id=2 and name='mayank sharma';
no rows selected
SQL> insert into practicle265(emp_id,name) values(6,'akshay mahtre');
1 row created.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
6 akshay mahtre
6 rows selected.
SQL> update practicle265 set address='poisar',salary=10205 where emp_id=6;
1 row updated.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
6 akshay mahtre poisar 10205
6 rows selected.
SQL> update practicle265 set address='bhayandar' where emp_id=5;
1 row updated.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia bhayandar 100000
6 akshay mahtre poisar 10205
6 rows selected.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
3 saurabh shetty dahisar 10000
4 khyati vashi bhayandar 10000
5 aditya lohia bhayandar 10000
6 akshay mahtr poisar 10000
6 rows selected.
SQL> update practicle265 set salary=15000 where emp_id>4;
2 rows updated.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
3 saurabh shetty dahisar 10000
4 khyati vashi bhayandar 10000
5 aditya lohia bhayandar 15000
6 akshay mahtr poisar 15000
6 rows selected.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
3 saurabh shetty dahisar 10000
4 khyati vashi bhayand 10000
SQL> delete from practicle265 where emp_id>2;
2 rows deleted.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
SQL> delete from practicle265;
2 rows deleted.
SQL> select * from practicle265;
no rows selected
SQL> create table practicle265(emp_id int primary key,name varchar(20) not null,address varchar(
salary decimal(10,2));
Table created
SQL> insert into practicle265 values(01,'mayank sharma','bhayandar',100000);
1 row created.
SQL> insert into practicle265 values(02,'bhushan talekar','vasai',100000);
1 row created.
SQL> insert into practicle265 values(03,'saurabh shetty','dahisar',100000);
1 row created.
SQL> insert into practicle265 values(04,'khyati vashi','bhayandar',100000);
1 row created.
SQL> insert into practicle265 values(05,'aditya lohia','vasai',100000);
1 row created.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
SQL>
SQL>
SQL> select emp_id from practicle265;
EMP_ID
----------
1
2
3
4
5
SQL> select emp_id from practicle265 where emp_id=1;
EMP_ID
----------
1
SQL> select * from practicle265 where name='mayank sharma';
EMP_ID NAME ADDRESS SALARY
---------- ------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
SQL> select * from practicle265 where name<>'mayank sharma';
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
SQL> select * from practicle265 where salary>10000;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
SQL> select * from practicle265 where emp_id=2 or name='mayank sharma';
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
SQL> select * from practicle265 where emp_id=2 and name='mayank sharma';
no rows selected
SQL> insert into practicle265(emp_id,name) values(6,'akshay mahtre');
1 row created.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
6 akshay mahtre
6 rows selected.
SQL> update practicle265 set address='poisar',salary=10205 where emp_id=6;
1 row updated.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia vasai 100000
6 akshay mahtre poisar 10205
6 rows selected.
SQL> update practicle265 set address='bhayandar' where emp_id=5;
1 row updated.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 100000
2 bhushan talekar vasai 100000
3 saurabh shetty dahisar 100000
4 khyati vashi bhayandar 100000
5 aditya lohia bhayandar 100000
6 akshay mahtre poisar 10205
6 rows selected.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
3 saurabh shetty dahisar 10000
4 khyati vashi bhayandar 10000
5 aditya lohia bhayandar 10000
6 akshay mahtr poisar 10000
6 rows selected.
SQL> update practicle265 set salary=15000 where emp_id>4;
2 rows updated.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
3 saurabh shetty dahisar 10000
4 khyati vashi bhayandar 10000
5 aditya lohia bhayandar 15000
6 akshay mahtr poisar 15000
6 rows selected.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
3 saurabh shetty dahisar 10000
4 khyati vashi bhayand 10000
SQL> delete from practicle265 where emp_id>2;
2 rows deleted.
SQL> select * from practicle265;
EMP_ID NAME ADDRESS SALARY
---------- -------------------- -------------------- ----------
1 mayank sharma bhayandar 10000
2 bhushan talekar vasai 10000
SQL> delete from practicle265;
2 rows deleted.
SQL> select * from practicle265;
no rows selected
DBMS PRATICLE 1:- DATA DEFINATION LANGUAGE
PRATICLE 1:- DATA DEFINATION LANGUAGE
SQL> create table practicle257(rollno int primary key,name varchar(30) not null);
Table created.
SQL> insert into practicle257 values(1,'mayank sharma');
1 row created.
SQL> insert into practicle257 values(2,'aditya lohia');
1 row created.
SQL> select * from practicle257;
ROLLNO NAME
------------- ------------------------------
1 mayank sharma
2 aditya lohia
SQL> alter table practicle257 add(address varchar(20));
Table altered.
SQL> select * from practicle257;
ROLLNO NAME ADDRESS
---------- ------------------------------ --------------------
1 mayank sharma
2 aditya lohia
SQL> alter table practicle257 drop column address;
Table altered.
SQL> select * from practicle257;
ROLLNO NAME
------------ ------------------------------
1 mayank sharma
2 aditya lohia
SQL> create table practicle257(rollno int primary key,name varchar(30) not null);
Table created.
SQL> insert into practicle257 values(1,'mayank sharma');
1 row created.
SQL> insert into practicle257 values(2,'aditya lohia');
1 row created.
SQL> select * from practicle257;
ROLLNO NAME
------------- ------------------------------
1 mayank sharma
2 aditya lohia
SQL> alter table practicle257 add(address varchar(20));
Table altered.
SQL> select * from practicle257;
ROLLNO NAME ADDRESS
---------- ------------------------------ --------------------
1 mayank sharma
2 aditya lohia
SQL> alter table practicle257 drop column address;
Table altered.
SQL> select * from practicle257;
ROLLNO NAME
------------ ------------------------------
1 mayank sharma
2 aditya lohia
DBMS PRACTICAL 3 VIEW DEFINATION LANGUAGE
PRACTICAL 3:- VIEW DEFINITION LANGUAGE
SQL> create table emp57(emp_id varchar(10) primary key , emp_name varchar(20) not
null , address var
char(20) , desig varchar(20) , d_o_b date , d_o_j date , salary decimal(10,2));
Table created.
SQL> select * from emp57;
no rows selected
SQL> insert into emp57 values('01','MAYANK
SHARMA','BHAYANDAR','ENGINEER','04-AUG-89','20-AUG-08',20
000);
1 row created.
SQL> insert into emp57 values('02','ADITYA
LOHAI','BHAYANDAR','ENGINEER','04-AUG-89','20-AUG-08',150
00);
1 row created.
SQL> insert into emp57 values('03','BHUSHAN
TALEKAR','BHAYANDAR','ENGINEER','27-MAR-89','2-MAY-08',1
5000);
1 row created.
SQL> insert into emp57 values('04','SAURAB
SHETTY','DAHISAR','MANAGER','27-JAN-89','02-MAY-08',15000
);
1 row created.
SQL> insert into emp57 values('05','KHYATI
VASHI','BHAYANDAR','MANAGER','29-JAN-89','02-MAY-08',1500
0);
1 row created.
SQL> select * from emp57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
SQL> create view manager57 as(select * from emp57);
View created.
SQL> select * from manager57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
SQL> create view peon57 as(select emp_id,emp_name from emp57);
View created.
SQL> select * from peon57;
EMP_ID EMP_NAME
---------- --------------------
01 MAYANK SHARMA
02 ADITYA LOHAI
03 BHUSHAN TALEKAR
04 SAURAB SHETTY
05 KHYATI VASHI
SQL> insert into emp57 values('06','SANKET
TANDEL','VASAI','ENGINEER','29-MAY-89','02-AUG-09',15000)
;
1 row created.
SQL> select * from emp57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
6 rows selected.
SQL> select * from manager57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
6 rows selected.
SQL> select * from peon57;
EMP_ID EMP_NAME
---------- --------------------
01 MAYANK SHARMA
02 ADITYA LOHAI
03 BHUSHAN TALEKAR
04 SAURAB SHETTY
05 KHYATI VASHI
06 SANKET TANDEL
SQL> create view manager57 as(select * from emp57);
View created.
SQL> select * from manager57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
SQL> create view peon57 as(select emp_id,emp_name from emp57);
View created.
SQL> select * from peon57;
EMP_ID EMP_NAME
---------- --------------------
01 MAYANK SHARMA
02 ADITYA LOHAI
03 BHUSHAN TALEKAR
04 SAURAB SHETTY
05 KHYATI VASHI
SQL> insert into emp57 values('06','SANKET TANDEL','VASAI','ENGINEER','29-MAY-89','02-AUG-09',15000)
;
1 row created.
SQL> select * from emp57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
6 rows selected.
SQL> select * from manager57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
6 rows selected.
SQL> select * from peon57;
EMP_ID EMP_NAME
---------- --------------------
01 MAYANK SHARMA
02 ADITYA LOHAI
03 BHUSHAN TALEKAR
04 SAURAB SHETTY
05 KHYATI VASHI
06 SANKET TANDEL
6 rows selected.
SQL> SQL> select * from peon57;
SP2-0734: unknown command beginning "SQL> selec..." - rest of line ignored.
SQL>
SQL> EMP_ID EMP_NAME
SP2-0734: unknown command beginning "EMP_ID ..." - rest of line ignored.
SQL> ---------- --------------------
SQL> 01 MAYANK SHARMA
SQL> 02 ADITYA LOHAI
SQL> 03 BHUSHAN TALEKAR
SQL> 04 SAURAB SHETTY
SQL> 05 KHYATI VASHI
SQL> 06 SANKET TANDEL
SQL>
SQL>
SQL>
SQL>
SQL> insert into manager57 values('07','ASHOK JANGID','BHAYANDAR','ENGINEER','01-MAY-89','22-AUG-09'
,15000);
1 row created.
SQL> select * from manager57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
07 ASHOK JANGID BHAYANDAR ENGINEER
01-MAY-89 22-AUG-09 15000
7 rows selected.
SQL> select * from emp57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
07 ASHOK JANGID BHAYANDAR ENGINEER
01-MAY-89 22-AUG-09 15000
7 rows selected.
SQL> select * from peon57;
EMP_ID EMP_NAME
---------- --------------------
01 MAYANK SHARMA
02 ADITYA LOHAI
03 BHUSHAN TALEKAR
04 SAURAB SHETTY
05 KHYATI VASHI
06 SANKET TANDEL
07 ASHOK JANGID
7 rows selected.
SQL> insert into peon57 values('08','ISHA VERMA');
1 row created.
SQL> select * from peon57;
EMP_ID EMP_NAME
---------- --------------------
01 MAYANK SHARMA
02 ADITYA LOHAI
03 BHUSHAN TALEKAR
04 SAURAB SHETTY
05 KHYATI VASHI
06 SANKET TANDEL
07 ASHOK JANGID
08 ISHA VERMA
8 rows selected.
SQL> select * from emp57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
07 ASHOK JANGID BHAYANDAR ENGINEER
01-MAY-89 22-AUG-09 15000
08 ISHA VERMA
8 rows selected.
SQL> select * from manager57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
07 ASHOK JANGID BHAYANDAR ENGINEER
01-MAY-89 22-AUG-09 15000
08 ISHA VERMA
8 rows selected.
SQL> create view secretary57 as(select emp_name,address from emp57);
View created.
SQL> select * from secretary57
2
SQL> select * from secretary57;
EMP_NAME ADDRESS
-------------------- --------------------
MAYANK SHARMA BHAYANDAR
ADITYA LOHAI BHAYANDAR
BHUSHAN TALEKAR BHAYANDAR
SAURAB SHETTY DAHISAR
KHYATI VASHI BHAYANDAR
SANKET TANDEL VASAI
ASHOK JANGID BHAYANDAR
ISHA VERMA
8 rows selected.
SQL> select * from emp57;
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
01 MAYANK SHARMA BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 20000
02 ADITYA LOHAI BHAYANDAR ENGINEER
04-AUG-89 20-AUG-08 15000
03 BHUSHAN TALEKAR BHAYANDAR ENGINEER
27-MAR-89 02-MAY-08 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
04 SAURAB SHETTY DAHISAR MANAGER
27-JAN-89 02-MAY-08 15000
05 KHYATI VASHI BHAYANDAR MANAGER
29-JAN-89 02-MAY-08 15000
06 SANKET TANDEL VASAI ENGINEER
29-MAY-89 02-AUG-09 15000
EMP_ID EMP_NAME ADDRESS DESIG
---------- -------------------- -------------------- --------------------
D_O_B D_O_J SALARY
--------- --------- ----------
07 ASHOK JANGID BHAYANDAR ENGINEER
01-MAY-89 22-AUG-09 15000
08 ISHA VERMA
8 rows selected.
SQL> insert into secretary57 values('kusum sharma','miraroad');
insert into secretary57 values('kusum sharma','miraroad')
*
ERROR at line 1:
ORA-01400: cannot insert NULL into ("SYSTEM"."EMP57"."EMP_ID")
Subscribe to:
Posts (Atom)
English to Chinese BETA
English to French
English to German
English to Italian
English to Japanese BETA
English to Korean BETA
English to Russian BETA 
English to Spanish
Posts
