Professional Documents
Culture Documents
Through C/C++
By
Yaman Singhania
http://www.computercareer.in
http://www.computercareer.in/
http://www.computercareer.in/
http://www.computercareer.in/
Common Terms
Data : Data are the Raw Facts and Figures. Data word is always plural.
Information : Processed Data which have some meaningful values is called information.
Entity : Entity is Anything which have certain property and Attributes.
Domain : Domain is Set of Values which the Attributes can have.
Record : Collection of Homogeneous Entities are Record.
File : Collection of Homogeneous Records.
Key : A key is used to uniquely identify the record. Key is of following types:
Primary Key : Primary key uniquely identifies the identify a record in database table.
Unique Key : The Unique constraint uniquely identifies each record in a database table.
The Unique and Primary Key constraints both provide a guarantee for uniqueness for a
column or set of columns. A Primary Key constraint automatically has
a Unique constraint defined on it.
Candidate Key : A Candidate Key is a set of one or more fields/columns that can identify a
record uniquely in a table. There can be multiple Candidate Keys in one table. Each
Candidate Key can work as Primary Key.
Download : TURBO C
http://www.computercareer.in/
Types of Array
1. One -Dimentional
2. Two -Dimentional
3. Multi Dimentional
http://www.computercareer.in/
Array
How to Declare?
Int a[50];
For Input and To print, We Use Loops ( for, while, do - while, do) .
Write A Program to take Input from User and Print the Array.
int a[5], i;
for( ( i = 0 ; i < = a[ i ] ; i++)
{
printf( Enter 5 numbers in an Array /n );
scanf(%d, &a[ i ]);
}
for( i = 0; i < = a[ i ] ; i++)
{
printf(%d, a[ i ]);
}}
DOWNLOAD : TURBO C
http://www.computercareer.in/
Array Program s
Write A Program to Perform Linear Search in An Array?
Download Our TURBO C
Write A Program to Perform Selection Sort in An Array?
to Perform Codings.
Write A Program to Perform Binary Search in An Array?
Write A Program to Perform Insertion Sort in An Array?
Write A Program to Perform Bubble Sort in An Array?
Write A Program to Illustrate Address Manipulation in 2-D Array?
To Learn Array, It is Necessary to Learn ALL THESE ARRAY PROGRAMS on Tips. Use Our Turbo C.
#include(iostream.h>
#include<conio.h>
int Lsearch(int[ ],int,int);
int main( )
{ For more, and To Learn All the Array Programs,
Please Visit : http://www.computercareer.in/blog
OR
Click Here
http://www.computercareer.in/
http://www.computercareer.in/
http://www.computercareer.in/
http://www.computercareer.in/
2. Circular Queue
4. DeQueue (Doubled-Ended Queue)
http://www.computercareer.in/
Linked List
A Linked List is a data structure consisting of a group of nodes which together
represent a sequence.
http://www.computercareer.in/
http://www.computercareer.in/
Tree
A Tree is a Non-linear data structure made up of nodes or vertices and edges
without having any cycle. The tree with no nodes is called the Null or
Empty tree. A tree that is not empty consists of a root node and potentially
many levels of additional nodes that form a hierarchy.
Binary Tree - A binary tree is one in which each
node has at most two descendants. A node
can have just one but it cant have more than two.
Insertion in Binary Search Trees :
To insert any element in Binary Search Tree, we have
to compare with the root of node. If found Greater,
then insert at Right of root node. If found Smaller, then
Insert at left of root node.
http://www.computercareer.in/
Tree
Deletion from A Binary Tree
There are four possible cases that we need to consider :
1. No node in the Tree contains specified Data.
2. Node containing the data has no children.
3. Node containing the data has exactly one child.
4. Node containing the data has two children.
Kindly Check Our Blog for Programs related to Tree Data Structure.
http://www.computercareer.in/blog
http://www.computercareer.in/
Graph
A Non-Linear Data Structure that consist of a set of nodes called Vertexes and a
set of edges that relate the nodes to each other is called Graph.
Type of Graph :
Directed Graph When Edges in a Graph have A Direction, the graph is called
Diagraph or Directed Graph.
UnDirected Graph When Edges in a Graph has no direction, the graph is called
UnDirected Graph.
Graphs can be represented as array, linked lists and queues.
Check Our blog, http://www.computercareer.in/blog
http://www.computercareer.in/
Yaman Singhania
Thanks
For Watching
Visit : http://www.computercareer.in
http://www.facebook.com/Ysinghania500