Scribd Logo
Upload

Welcome to Scribd!

  • 1 - Introduction To Dsa

    Uploaded by

    vishnu
    12 views28 pages
    This document outlines the key topics of a course on data structures and algorithms, including an introduction to computer science concepts like abstraction, procedural abstraction, abstract data types, and information hiding. It also lists Python data types and structures like lists, strings, tuples, sets, and dictionaries that will be covered, as well as control structures, functions, classes and objects, with a hands-on activity involving classes and objects.

    Original Description:

    Original Title

    1_INTRODUCTION TO DSA

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the key topics of a course on data structures and algorithms, including an introduction to computer science concepts like abstraction, procedural abstraction, abstract data types, and information hiding. It also lists Python data types and structures like lists, strings, tuples, sets, and dictionaries that will be covered, as well as control structures, functions, classes and objects, with a hands-on activity involving classes and objects.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views28 pages

    1 - Introduction To Dsa

    Uploaded by

    vishnu
    This document outlines the key topics of a course on data structures and algorithms, including an introduction to computer science concepts like abstraction, procedural abstraction, abstract data types, and information hiding. It also lists Python data types and structures like lists, strings, tuples, sets, and dictionaries that will be covered, as well as control structures, functions, classes and objects, with a hands-on activity involving classes and objects.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 28

    DATA STRUCTURES AND

    ALGORITHMS
    MTE 2151
    COURSE OUTCOMES
    WHAT IS COMPUTER SCIENCE?
    • Study of problems, problem-solving, and the solutions that come out
    of the problem-solving process
    • A computer scientist’s goal is to develop an algorithm, a step-by-step
    list of instructions for solving any instance of the problem
    • Also the study of abstraction.
    • Abstraction allows us to view the problem and solution in such a way as to
    separate the so-called logical and physical perspectives.
    • Eg: An automobile driver and a mechanic have different perspectives of the
    same automobile
    • What’s the analogy with Computer Science?
    PROCEDURAL ABASTRACTION

    Details of the procedure are not known or considered


    ABSTRACT DATA TYPES
    • ADT, is a logical description of how we view the data and the
    operations that are allowed without regard to how they will be
    implemented.
    • The idea is that by encapsulating the details of the implementation,
    we are hiding them from the user’s view.
    • This is called information hiding.
    GETTING STARTED WITH PYTHON
    LISTS
    STRINGS
    TUPLES
    SETS
    DICTIONARIES
    CONTROL STRUCTURES
    FUNCTIONS
    CLASSES AND OBJECTS
    HANDS ON ACTIVITY ON CLASSES AND
    OBJECTS

    You might also like