Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Data Structure and Algorithm Job Preparation

    Uploaded by

    Projukti Barta
    This document discusses key concepts for data structure and algorithm job preparation including defining data structures as a way to store and retrieve data systematically. It notes common data structures like lists, arrays, stacks and queues and explains that algorithms are step-by-step procedures to solve problems. It also covers analyzing algorithms based on time and space efficiency and asymptotic analysis to determine best, average, and worst case scenarios using notations like Ω(n), Ο(n) and Θ(n). Finally, it defines linear data structures as those with sequentially arranged data that can be accessed in order like arrays and lists.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Data Structure and Algorithm Job Preparation

    Uploaded by

    Projukti Barta
    14 views1 page
    This document discusses key concepts for data structure and algorithm job preparation including defining data structures as a way to store and retrieve data systematically. It notes common data structures like lists, arrays, stacks and queues and explains that algorithms are step-by-step procedures to solve problems. It also covers analyzing algorithms based on time and space efficiency and asymptotic analysis to determine best, average, and worst case scenarios using notations like Ω(n), Ο(n) and Θ(n). Finally, it defines linear data structures as those with sequentially arranged data that can be accessed in order like arrays and lists.

    Original Description:

    Certified

    Original Title

    Day-01

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses key concepts for data structure and algorithm job preparation including defining data structures as a way to store and retrieve data systematically. It notes common data structures like lists, arrays, stacks and queues and explains that algorithms are step-by-step procedures to solve problems. It also covers analyzing algorithms based on time and space efficiency and asymptotic analysis to determine best, average, and worst case scenarios using notations like Ω(n), Ο(n) and Θ(n). Finally, it defines linear data structures as those with sequentially arranged data that can be accessed in order like arrays and lists.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    14 views1 page

    Data Structure and Algorithm Job Preparation

    Uploaded by

    Projukti Barta
    This document discusses key concepts for data structure and algorithm job preparation including defining data structures as a way to store and retrieve data systematically. It notes common data structures like lists, arrays, stacks and queues and explains that algorithms are step-by-step procedures to solve problems. It also covers analyzing algorithms based on time and space efficiency and asymptotic analysis to determine best, average, and worst case scenarios using notations like Ω(n), Ο(n) and Θ(n). Finally, it defines linear data structures as those with sequentially arranged data that can be accessed in order like arrays and lists.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Data Structure and Algorithm Job Preparation

    What is data-structure?

    Data structure is a way of defining, storing & retriving of data in a structural & systemetic way. A
    data structure may contain different type of data items.

    What are various data-structures available?

    Data structure availability may vary by programming languages. Commonly available data
    structures are list, arrays, stack, queues, graph, tree etc.

    What is algorithm?

    Algorithm is a step by step procedure, which defines a set of instructions to be executed in


    certain order to get the desired output.

    Why we need to do algorithm analysis?

    A problem can be solved in more than one ways. So, many solution algorithms can be derived
    for a given problem. We analyze available algorithms to find and implement the best suitable
    algorithm.

    What are the criteria of algorithm analysis?

    An algorithm are generally analyzed on two factors − time and space. That is, how
    much execution time and how much extra space required by the algorithm.

    What is asymptotic analysis of an algorithm?

    Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of


    its run-time performance. Using asymptotic analysis, we can very well conclude the best case,
    average case and worst case scenario of an algorithm.

    What are asymptotic notations?

    Asymptotic analysis can provide three levels of mathematical binding of execution time
    of an algorithm –
    Best case is represented by Ω(n) notation.
    Worst case is represented by Ο(n) notation.
    Average case is represented by Θ(n) notation.

    What is linear data structure?

    A linear data-structure has sequentially arranged data items. The next time can be located in
    the next memory address. It is stored and accessed in a sequential manner. Array and list are
    example of linear data structure.

    18/10/2020

    You might also like