Data Structures notes
32 notes by 24 users
This Data Structures page gathers over 30 notes by more than 20 GoConqr users, covering recursion, queues, Python lists and more. University students and professional candidates can use them to practise data structures, while school students can revise topics and teachers can find ready-made material. The notes span school and university levels. Pick a topic and explore the notes.
Select topic
Notes
-
Slide Notes Chapter 15 Iterators CSIS B What is an iterator? It is something that allows you to step through and traverse a collection of data. It is like a pointer or a cursor, it goes through looking at each thing on the list. There are different types of...
-
Slide Notes Chapter 15 Iterators CSIS B What is an iterator? It is something that allows you to step through and traverse a collection of data. It is like a pointer or a cursor, it goes through looking at each thing on the list. There are different types of...
-
Syllabus + Introduction Data Struct. - 2019.01.14
-
Sorted Lists Chapter 16 CSISB Specifications of an Abstract Data Type Sorted List Duplicate entries are allowed, to make things easier The sorting must determine where in a list is the element added Can ask if list contains specified entry Must be...
-
coding Binary tree [Script] subject Coding casino 100 points DESCRIPTION Please read the Binary tree question before attempting this problem. Input First line contains an integer d, the depth ...
-
Data structure and algorithms Introduction to data structure: A data structure is a way to store and organize data in a computer, so that it can be use efficiently. two ways to represent data structure: 1. Mathematical / logical models: the abstra...
-
python Python - Data Structure Computers store and process data with extraordinary speed and accuracy. So it is highly essential that the data is stored efficiently and can be accessed fast. Also, the processing of data shou...
-
Unit 2 Notes Recursion aims to solve a large problem by solving increasingly smaller instances of the problem. The Droste effect is an example of recursion in art. One of the common examples of recursion used in programming is a f...
-
Dictionary
-
Python Lists - The LIst is like an array but can contain many data types. Creating Lists: # Python program to demonstrate # Creation of List # Creating a List List = [] print("Intial blank List: ")&nb...
-
Queues Basics Of Queues Fundamental Rules of Queues:Items are added to the back.Items are Removed from the front.Queues also need to have front and back pointers, so that the values don't always have to have their positions ...
-
The Four Basic Data Structures - created from Mind Map Lists Tuples Sets
-
Heaps - created from Mind Map del-min-removes the the root of the heap and returns it. swaps min with the last element of the heap removes latest calls heapify on first. heapify Assumption that the heap is broken only on one node. The nodes left a...
-
STACKS Sequential collection of elements that follow LAST IN FIRST OUT(LIFO) structure Last element to be inserted is the first element to be removed Abstract data type. Defined by its behavior rather than being a mathematic...
-
Data structures links
-
Maps in ES6
-
HEAP Heap Heap is almost completed binary trees. It can have one child only which says almost but everything should start from left to right. min-heap where the root is min. max heap: storage9) we store it by using a linke...
-
Data Structures 2019.01.24 Begin at Slide 24 from Chapter00.pdf Linked Chain of Nodes or Singly Linked List: We need to know the beginning which is pointed by the head pointer See in class code Vectors: Vectors can b...
-
Priority Queue Priority Queue can be implemented using Arrays, linkedlist or heaps. http://www.geeksforgeeks.org/priority-queue-set-1-introduction/ A typical priority queue supports following operations.insert(item, priority):&...
-
1D and 2D Arrays 1D Arrays - Day One Notes Slots start at 0. Example: For 7 slots... 0 - 6. Count on fingers. 0, 1, 2, 3, 4, 5, 6 = 7 Size x Largest index is x-1 Example: 10 = 11 and 9 = 10 No Negatives&n...
-
One-Dimensional Arrays One-Dimensional arrays It's a set of values of the same type that have an index in order to be identified, for exampleArray[Size];They can be viewed as a bunch of values ordered in a columnThe 1st position is represen...
-
Graph Algorithms Cycle detection in a directed and undirected graph differs. In a directed graph, we use DFS and store the currently visited nodes in a stack and find a back edge. whereas in a undirected graph, we just mark every node...
-
Binary Search tree O(log n) Binary Search Tree : Property : Any node in the tree must have lower in the left sub tree and higher values in the right sub tree. Basic operations include: SEARCH MINIMUM MAXIMUM PREDECESSOR SUCCESSOR IN...
-
Mostrar una pila en C
-
linked list a linked list is made up of nodes . linked list is a linear data structure nodes consists of two parts - 1.data 2.link to next node to declare nodes we use strucures struct node ...
-
Queue Sequential data structures that follow first in first out (FIFO) principle. Abstract data structure. Defined by its behavior rather than being a mathematical model. Supports two major operations: Enqueue - adds ...
-
Insert elements into a queue in C
-
Programming And Data Structure - created from Mind Map Unit 2: Arrays One Dimensional Arrays Array Manipulation
-
Delete elements from the queue in C
-
Data Structure definition & Classification - creado desde un Mapa Mental Non-primitive data structure Primitive data structure What is a data?
-
Circular Queue Size of the queue is fixed. First element is connected to the last element. has fixed memory
-
Binary Tree - created from Mind Map Hierarchical has a Root and subtrees to the right and left
More Data Structures resources
About data structures notes
GoConqr OriginalUsing data structures notes
The notes on this page cover structures and operations, from queues and sorted lists to heaps and iterators. Dictionary introduces key-value pairs, while Python includes examples of creating lists. Other notes cover recursion, binary trees and graph algorithms.
For a clear starting point, try Queues. It sets out where items are added and removed, as well as the role of front and back pointers. If you are working with Python, the notes in Python offer a starting point for lists.
Plan your revision
Read a note on one structure, then write down its key features in your own words. Return to the note to check what you remembered. You could compare the rules in Queues with the notes on sorted lists, where entries are placed according to their order.
When you want a visual overview or a chance to test your recall, switch to a mind map or quiz on the Data Structures unit page. Choose a note to begin your next revision session.
Frequently asked questions
Which note is a good place to start?
Try Queues if you want to focus on one structure. It explains that items are added at the back and removed from the front, and introduces front and back pointers. For Python practice, the Python notes include examples of creating lists.
Are these notes free to use?
Yes. Every note listed here is free to open and study without an account. The resources were made by GoConqr users. A free account also lets you make your own quizzes, mind maps, flashcards and notes, and save quiz scores.
What topics and levels do the notes cover?
The collection spans school and university levels, with notes on topics including recursion, queues, iterators, sorted lists and graph algorithms. University students and professional candidates can use it alongside their study, while school students can revise a topic and teachers can find material to use.