Skip to main content

How to start learning Web-development

Post a Comment

Data structure and algorithm main topic

Data structure and algorithm main topic -

Data structure - 

It is the way to arrange data in main memory for efficient use and more reliable use and in different way you can explain it way to organize data in computer memory so that we can use in a effective way for example : store a list of items having the same data-type using the array data structure

Algorithm -

A sequence of steps to solve a given problem or statement  or you can say a certain way of procedure to solve a problem or given question step by step to get accurate output algorithm sort the items in a certain way thats called algorithm \

for example - lets we take an array 

a[4]-1,7,9,2

sort array is - 1,2,7,9

Time complexity -

Time taken by algorithm by running scalling or in other word you say number of operation to complete its task (consider each operation take same time) algorithm which complete the task in less number of operation is consider more efficient in term of time complexity 

Asymptotic Notations -

The  languages that allow us to analyze an algorithm’s running time by identifying its behavior as the input size for the algorithm increases and algorithm efficiency and performance in a meaningful way. It describes the behaviour of time or space complexity for large instance characteristics

Type of Asymptotic Notations -

1. Big-O -

Big-O notation is a standard metric that is used to measure the performance of functions and it  notation is a standard metric that is used to measure the performance of functions.Big-O notation is a standard metric that is used to measure the performance of functions.

2. Big-Omega -

big Omega(Ω) function is used in computer science to describe the performance or complexity of an algorithm and The function g(n) is Ω(f(n)) iff there exists a positive real constant c and a positive integer n0 such that g(n) ≥ c f(n) for all n > n0

3. Big Theta -

asymptotically tight bound and f(n) = o(g(n)),if there exists constant c1, c2, and n0 such that c1.


The three case are :

Best Case Analysis-

  the minimum number of steps on input data of n elements in a funcation are called best case analysis .

Worst Case Analysis -

worst case happens when the item we are searching is in the last position of the array or the item is not in the array. we need to go through all n items in the array. The worst case runtime is, therefore, O(n).Worst case performance is more important than the best case performance in case of linear search because of the following reasons.

1.The item we are searching is rarely in the first position. If the array has 1000 items from 1 to 1000. If we randomly search the item from 1 to 1000, there is 0.001 percent chance that the item will be in the first position.

2.Most of the time the item is not in the array (or database in general).

Average Case Analysis - 

we calculate it.

Comments

Post a Comment

Popular posts from this blog

Funcation in c++ programming example in detail

Friend Funcation- 1. Adding to complex number in friend function #include<iostream> using namespace std; class container { float a,b; public: void get() { cout<<endl<<"Enter value for A="; cin>>a; cout<<endl<<"Enter value for B="; cin>>b; } void disp() { cout<<endl<<a; cout<<endl<<b; } friend container addition(container,container); }; container addition(container X,container y) { container Z; Z.a=X.a+y.a; Z.b=X.b+y.b; return Z; } int main() { container P,Q,R; P.get(); P.disp(); Q.get(); Q.disp(); R=addition(P,Q); R.disp(); return 0; } Output - Enter value for A=12 Enter value for B=12 12 12 Enter value for A=1 Enter value for B=1 1 1 13 13 2.  If class one is friend function of two it not means that two is friend functio...
1 comment
Read more

Cpp programming tutorial 1

C++ language - This is a very similar to c language and it have all the concept of c language and their is more in c plus plus it have many new concept like classes and object was introduced here constructor , destructor many more concept was in c plus plus and because c plus plus have more enhancement and more simple to use it also object oriented programming .  OOPs concept with example - The meaning of object oriented programming(oops) is it works on concept of classes and object or in other word oops concept is based on class and object . class is a body to create object in object oriented it treat data as a critical element and decompose the problem in object and build data function according to the object and in object oriented programming we can use it for protecting data and for privacy of data so not all variable can access it . BENEFIT OF OBJECT ORIENTED PROGRAMMING - 1. Because of hiding data method we secure our data and system for accessing all variable . 2. It have...
Post a Comment
Read more

C++ programming tutorial 3

 Control statement in c++ programming - 1. For loop statement in c++ programming -  In this loops we run a single part of code many times this used for simple our programming and in less code , time work done is same . Syntax - for(int i =0; i< x ; i++){ ..... } Code -  // For loop in c++ language  #include <iostream> using   namespace  std; int   main () {      int   i  ,  a ;      cout << "Loop was start Below " << endl ;      cout << "Enter the value of a:" << endl ;      cin >> a ;      for ( i = 0 ; i <= a ; i ++ )     {          cout <<   "this is a number count :" <<   i << endl ;     }  ...
Post a Comment
Read more