Do you Know About Fractal art?

Fractal art is created by calculating fractal objects and representing the calculation results as still images, animations, music, or other media. Fractal art is usually created indirectly with the assistance of fractal-generating software, iterating through three phases: setting parameter...s of appropriate fractal software, executing the possibly lengthy calculation and evaluating the product. In some cases, other graphics programs are used to further modify the images produced. This is called post-processing.
The funniest thing about fractal art that it is made by programmers.

Some Common Algorithm

1.Algorithm of find the Factorial Number:

1.Start

2. (Input)Read N

3. Set

Product=1

Mult=N

4.(Repeat This Loop to 6)

While(Mult<=1)

5.Product=Product Mult(Partial Product)

6.Mult=Mult-1(End of Loop)

7.(output) Write factorial of N product.

8. End.

2.Algorithm Of Fibonacci Number:

Fibonacci(n)

{

If(n<=1) Then

Write(n)

Else

{

fnm1=0; fnm2=1;

for(i=2 to n do)

{

fn=fnm1+fnm2

fnm1=fnm2

fnm2=fn

write(fn);

}

}

Try it best.

Project name: University Thesis paper

Project title: versitythisis.com

Project Time:  4to6 month.

Objective: Create a good collection of university thesis paper for research, rating, and publish thesis around the world.

Short description:

This project will collect, organizing and publishing the university project Thesis paper. Every student who create and pass from the thesis semester student can submit his thesis paper in this site.

 

Project Material:

Hardware: Computer, Internet, Thesis paper.

Software: MSword, Msacces, Adobe Dreamweaver, Photoshop, Illustrator, Personal web server, other needed software.

Other: It’s depending on work.

Full Description:

Every university’s student was done project and student submit there thesis paper. We will organized the thesis paper which already marked by teacher’s. Then we will publish this thesis. The thesis paper’s all right reserved by student who created this thesis.

 There three types of registeration:

1. Teacher

2. Student

3. User

First   a page will appear that contain this kind of field

1. Fullname 2.Username or email address: 3.password 4.confirm password. 5. Choose your Type

 

Then a link will send to applicant email address. Then he clicks the link then his account active.

Field appears by his type. Full list of category are shown here:

Field	Teacher	Student	User
Full name	Yes	Yes	Yes
Address	Yes	Yes	Yes
Phone number	Yes	Yes	Yes
National Id	Yes	Yes	Yes
Education Institute name	Yes	Yes	No
Department	Yes	Yes	No
Designation	Yes	No	No
Designation id	Yes	No	No
Class id	No	Yes	No
Photo	Yes	Yes	Yes
Agreement	Yes	Yes	yes
Country	Yes	Yes	Yes
Date of birth	Yes	Yes	yes

 

All of this page must be submitted. But Thing can change any time.

In the button thesis subject when click then a dropdown box will appear where all of the department will show. Applicant will choose any link.

 

 

The permission of any thesis:

Permission	Teacher	Student	Other
Thesis submit	Yes	Yes	No
Thesis remark	Yes	Yes	No
Full thesis download	Yes	No	No
Partial thesis download	Yes	Yes	Yes
Thesis Edit	No*	Yes**	No
Thesis comment	Yes	No	Yes
Thesis rating	Yes	No	Yes

*only applicant thesis can edit

**only student can change his thesis

Attention please: Copyright to who submitted thesis.

To submit any thesis you may need this requirement:

Thesis Subject: On the submit time thesis writer must define Thesis subject.

Thesis title: Every thesis has a title.

Thesis short description: Here you need short description write about thesis. This will show by the teacher.

Thesis: It’s your thesis.

Thesis summery: The summery of your thesis.

Other information:

Thesis submits date, Thesis mark, and teacher name. Thesis time. Etc.

Group Thesis: This feature will help to submit a group thesis. Just add your name and add your group member with there user name then a link will go to their email address. If they click this link thesis will group by the team. All of group student can show this thesis  in there account.

 

 

Learn Algorithem part-3

Recursive Algorithms:

 

A recursive function is a function that is defined in terms of itself. Similarly, an algorithm is said to be recursive if the same algorithm is invoked in the body. An algorithm that calls itself is direct recursive. Algorithm A is said to be indirect recursive if it calls another algorithm which in tern calls A. These recursive mechanisms are extremely powerful, but even more importantly; many times they can express an otherwise complex process very clearly. 

 

 

 

The following algorithm is Recursive function for sum:

 

Algorithm RSum (a, n)

{

            if (N<=0) then return 0.0;

            else return RSum(a, n-1) + a[n];

}

Learning Algorithm(part-2)

The following algorithm finds and returns the maximum of n given numbers:

 

Algorithm Max (A, n)

// A is an array of size n.

{

            Result: = A [1];

            For I : = 2 to n do

               If A [i]  > Result then Result : = A [i]

            Return Result;

}

In this algorithm (named Max), A and n are procedure parameters, Result and I are local variables.

 

Performance Analysis:

 

There are many criteria upon which we can judge an algorithm. For instance:

 

1. Does it do what we want it to do?
2. Does it work correctly according to the original specifications of the task?
3. Is there documentation that describes how to use it and how it works?
4. Are procedures created in such a way that they perform logical sub functions?
5. Is the code readable?

 

Space/Time Complexity:

 

The space complexity of an algorithm is the amount of memory it needs to run to completion. The time complexity of an algorithm is the amount of computer time it needs to run to completion.

 

The following algorithm is Iterative function for sum:

 

Algorithm Sum (a, n)

{

            s : = 0.0;

            for i : = 1 to n do

               s : = s + a[i];

            return s;

}

learning:ALGORITHM

Introduction:

 

An algorithm is finite of instructions that, it followed, accomplishes a particular task. In addition, all algorithms must satisfy the following criteria:

 

1. Input. Zero or more quantities are externally supplied.
2. Output. At least one quantity is produced
3. Definiteness. Each instruction is clear and unambiguous.
4. Finiteness. If we trace out the instructions of an algorithm, then for all cases, the algorithm terminates after a finite number of steps.
5. Effectiveness. Every instruction must be very basic so that it can be carried out , in principle, by a person using only pencil and paper. It is not enough that each operation be definite as in criterion 3; it also must be feasible.

 

 

An algorithm is composed of a finite set of steps, each of which may require one or more operations. The possibility of a computer carrying out these operations necessities that certain constraints be placed on the type of operations an algorithm can include.

 

The Study of algorithms includes many important and active areas of research. There are four distinct areas of study one can identify:

 

1. How to devise algorithms:   Creating an algorithm is an art which may never be fully automated. Study various design techniques that have been proven to be useful in that have often yielded good algorithms. By mastering these design strategies, it will become easier for anyone to devise new and useful algorithm.

 

2. How to validate algorithms: Once an algorithm is devised, it is necessary to show that it computes the correct answer for all possible legal inputs. We refer to this process as algorithm validation. Once the validity of the method has been shown, a program can be written and a second phase begins. This phase is referred to as program proving or sometimes program verification.

 

3. How to analyze algorithms: This field of study is called analysis of algorithms. Analyze of algorithms or performance analysis refers to the task of determining how much computing time and storage an algorithm requires. This is a challenging area which requires great challenging mathematical skill.

 

4. How to test a program: Testing a program consists of two phases: debugging and profiling. Debugging is the process of executing programs on sample data sets to determine whether faulty result occurs and if so, to correct them. Profiling or performance measurement is the process of executing a correct program on data sets and measuring the time and space it takes to compute the results.    

 

TERROR JOKEs

What will happen
if u throw an AMPLIFIER into the sea?
TSUNAMI will be created
since an amplifier converts
small waves into bigger wave

Life is nothing without LOVE,
Love is emotion & Kiss is practical,
don’t get emotional, yar just b practical
So STOP loving and START Kissing.

5 points that prove you are a normal student

1:unnecessary talk on phone and messages
2:Plan each day to study but end of the day KAL SAY PAKA
3:you have all the data but you work before the dead line
4:right now you are thinking of forwarding this message to your friends
5:on each point you smile because it’s true.

When I open my eyes every morning
I pray to God that everyone should
have a friend like you….
Why should only i suffer!!! ha ha ha

Hi i am marrying next week
there will be a small party and
only few persons will be invited
Hey don’t bring any gift
just bring SOMEONE to marry me

Sardar: Will U marry , after I die.
Wife : No I will live with my sister.

Wife : Will U marry , after I die.
Sardar: No I will also live with ur sister.

Future plans of childrens:
Teacher asks children, what do u wish 2 do in future?
Adnan: I want 2 b a pilot.
Wakeel: I want 2 b a doctor.
Bina: I want 2 b a good mother.
Shariq : I want 2 help Bina