Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Data structure for fledgling learners
Rating: 4.2 out of 5(31 ratings)
2,389 students

Data structure for fledgling learners

Data Structure and Algorithms
Created byChetan Dhotre
Last updated 2/2022
English

What you'll learn

  • In this course student will get to learn basics of data structure in python.
  • Ability to analyze algorithms and algorithm correctness.
  • Ability to summarize searching and sorting techniques
  • Ability to describe stack,queue and linked list operation. 4 Ability to have knowledge of treeand graphs concepts.

Course content

2 sections8 lectures43m total length
  • Introduction2:45

    after watching this lecture students will be able to learn basics of data structure like tuples , list, dictionary , 2d array etc.

  • overview of object oriented programming1:54

    they will get overview of object oriented programming like object, class & function

  • Binary Tree10:51

    after watching this video you will learn how data is kept in data structure . you will learn about left sub tree & right sub tree and the parent node

  • Nodes5:52

    after watching this video you will get to know about nodes

Requirements

  • Minimum requirement is python language
  • And Object oriented programming

Description

in computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. data structure are generally based on the ability of a computer to fetch and store data at any place in its memory In this course you are going to learn about basics of data structures like linked list , nodes , heaps , binary tree , selection sort , dictionary , tuples & list . Data structure provides the right way to organize information in the digital space. The data structure is a key component of Computer Science and is largely used in the areas of Artificial Intelligence, operating systems, graphics, etc.

Searching: We can search for any element in a data structure.

Sorting: We can sort the elements of a data structure either in an ascending or descending order.

Insertion: We can also insert the new element in a data structure.

Updation: We can also update the element, i.e., we can replace the element with another element.

Deletion: We can also perform the delete operation to remove the element from the data structure.

Some of the Advantages :

Efficiency: If the choice of a data structure for implementing a particular ADT is proper, it makes the program very efficient in terms of time and space.

Reusability: The data structure provides reusability means that multiple client programs can use the data structure.

Abstraction: The data structure specified by an ADT also provides the level of abstraction. The client cannot see the internal working of the data structure, so it does not have to worry about the implementation part. The client can only see the interface

Who this course is for:

  • Students , especially computor & IT engineering.
  • Anyone who wants to learn basics of data structure