DSA 3 DAYS Part 1

-

 1) Algorithms
        Definition- 
        Syntax-
2) Flow Chart 
        Definition-
        Representation- 
        


3) Basics Analysis on Algorithm
     Complexity 
        a) Time Complexity 
               Example- 
                   loop = On 
        b) Space Complexity 
                Example-
                    Pointer = O1
    Type of Complexity 
        a) Best Case ( Ω )
                Explane- 
        b) Average Case ( θ )
                 Explane- 
        c) Worst Case ( O ) 
                 Explane- 

4) Complexity of Algorithm
        a) Time Complexity 
               Example- 
                   loop = On 
        b) Space Complexity 
                Example-
                    Pointer = O1

5) Introduction and Definition of Data Structure

        Introduction of Data Structure

    
        A data structure is a specialized way to organize, manage, and store data in a computer so that it         can be accessed and modified efficiently. Data structures are fundamental building blocks of                    computer science and are used in nearly every software application, from operating systems to                 search engines and video games.

        The choice of a particular data structure depends on the type of operation you need to perform,                 such as searching, inserting, deleting, or traversing data. Using the right data structure can                     optimize the performance of these operations and minimize resource consumption.

        Definition of Data Structure

        A data structure can be defined as:

    A logical or mathematical way of organizing data in a computer to use it effectively.

        Data structures provide a systematic approach to handle large volumes of data, enabling efficient             manipulation and retrieval. They are implemented using algorithms and can be classified based on         their behavior and organization.


    Own Example 
    

        Information - text, Number, Symbols (Collection of any Tings ) 
        Data -  1,2,3,4,5,6,7,8,9   (Arrangement of information )
        Data Structure - [1],[2],[3]... (Using Sum Rules To arrange the Data )

    Fracturs
    1) Searching 
    2) Insertion 
    3) Deletion 
    4) Traversing  
    5) Edit Data 
    6) Handling
6)  Classification of Data Structure 
        https://softgamestudiodsa.web.app/DSA_Course_3
7)  Classification of Data 
    Chat GPT 
8) Arrays


9) Various types of Data Structure

     https://softgamestudiodsa.web.app/DSA_Course_3

10) Static and Dynamic Memory Allocation,
        Chat GPT 

11) Function, 
    Chat GPT 
12) Recursion
     a) Direct Reclusion
            Function Call Its Self Again and Again 
    b) In Direct Recursion 
               More then One Function Call one and other muchly    

    a) Direct Reclusion 

        i) Tail Reclusion
                Reclusion function is last statement of any Function Body 
        ii) Head Reclusion 
                Reclusion function is first statement of any function Body And any other statement is not                         present in top of Reclusion Function    

        iii) Tree Reclusion 
                Reclusion Function call it self more then 1 time at a same function 

        iv) Nested Reclusion 
                The Reclusion function call another Reclusion function in our self 
                  Syntax-  Fun(Fun(n-1)) 



    


         

Comments

Post a Comment

Popular posts from this blog

Keyword , Identifier, Indentation, Comments & Documentation

-
Keyword : In Python, a  keyword  is a special word that has a specific meaning and purpose in the language. These words are reserved, which means you can’t use them for anything other than their intended purpose. For example, you can’t use a keyword as a variable name. Here are a few examples of Python keywords and what they do: if : Used to make a decision. For example,  if x > 0: . for : Used to create a loop. For example,  for i in range(10): . def : Used to define a function. For example,  def my_function(): . True  and  False : Represent boolean values.  I dentifier : In Python, an  identifier  is simply a name you give to things like variables, functions, classes, or modules. It’s like a label that helps you refer to these elements in your code. Here are some key points about identifiers: Must start with a letter or an underscore (_) : For example,  name ,  _value . Cannot start with a number : For example,  1name...
Read more

DSA Lab 8 program

-
 Program for implementing multiple stack. # include < stdio.h > # include < stdlib.h > struct stack {     int maxstack;     int * stack;     int top; }; int isEmpty ( struct stack * ptr ) {     if ( ptr -> top == - 1 ) {         return 1 ;     } else {         return 0 ;     } } int isFull ( struct stack * ptr ) {     if ( ptr -> top == ptr -> maxstack - 1 ) {         return 1 ;     } else {         return 0 ;     } } int peek ( struct stack * ptr ) {     return ptr -> stack [ ptr -> top ]; } int pop ( struct stack * ptr ) {     if ( isEmpty (ptr) ) {         printf ( " Stack Underflow! Cannot pop from the stack \n " ) ;         return - 1 ;     } else {         in...
Read more

DSA Lab 7 Program

-
 Program for implementing Stack using array # include < stdio.h > int maxstack = 10 ; int stack [ 10 ]; int top = - 1 ; int empty (){     if (top == - 1 ){         return 1 ;     }     else {         return 0 ;     } } int full (){     if (top == maxstack){         return 1 ;     }     else {         return 0 ;     } } int peek (){     return stack [top]; } int pop (){     int data;     if ( ! empty () ){         data = stack [top];         top -= 1 ;         printf ( " The data has been Deleted. Your data is %d \n " , data) ;         return data;     }     else {         printf ( " The data Can't be Deleted. Becouse stack is empty \n " ) ;   ...
Read more