Do you like Data Structures ?
Note: will be updated once a day. This thread is for those who like Data structures. You can discuss anything related to DS ,post any codes related to DS or ask any doubts. 📣📣 study materials https://en.m.wikipedia.org/wiki/Data_structure http://www.geeksforgeeks.org/data-structures/ https://www.tutorialspoint.com/data_structures_algorithms/data_structures_basics.htm Codes 1. concept: STACK https://code.sololearn.com/cIFgkGygB9Fb/?ref=ap https://code.sololearn.com/WPF9ko5p10IQ/?ref=app
12/22/2017 2:21:44 AMAnnie
46 AnswersNew Answer
💛~CONTRIBUTIONS~💛 for the best reading experience : uncheck the Dark theme. https://code.sololearn.com/WPF9ko5p10IQ/?ref=app contributors: 1. Coding Angel (myself) 2.Mohamed (Top contributor)🎖️🏆 3. Sneha Chavan 4.H Chiang 5.Abhi Varshini 6. Divesh Singh(Code BST) 7. Morpheus (code DS) sorry for the spelling mistakes.
A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. ... In computer programming, a data structure may be selected or designed to store data for the purpose of working on it with various algorithms.
what are data structures used for ? //& what it is 😅
Yes and I am happy with the lessons about Data Structures provided by Sololearn 🤗
thnx ☺@abhi , //example :: MySQL uses table data structure for managing data
Nice!!!! Awesome idea and better thread to improve coding skills in Data Structures....
Who @Warnell ?
Here's my implementation of Binary Search Tree DS in py: https://code.sololearn.com/cVQ0iyYqy7eA/?ref=app
@Jackson ok I respect your opinion
Great discussion! Another thing I would like to add is to consider the idea of using queues as well. As a few above have discussed, Stacks are last in first out (LIFO) structures, whereas Queues are linear, first in first out (FIFO) structures. Relating this to real world applications, in electrical and computer engineering, microprocessors make use of the stack to store locations useful to the program counter, whereas queues can be useful to determine the order for interrupts to be executed, if multiple interrupts are received in a given time.
Another data structure to consider is graphs. Since the post is lengthy, I have written it in a code file (which is a text file). https://code.sololearn.com/c91asluNpY0L/?ref=app
Data Structures 💞💝
push n pop is very easy to understand..... once if you understand the concept you can easily write code for that.... you can understand it by 👉 first in last out 👈 first push data can pop last only.... stack is simply means storage (in cylindrical shape bin).. you can store(#push) data into it until its capabilities... once it full n then also you are passing data into it it becomes #overloaded, and have possibility of data lost you can take out data this procedure known as #pop you can pop data until data remains in the bin if data is not available in bin, you simply cannot take any data you can take place both push and pop simultaneously....
@Shivam I have taken several computer science and computer engineering courses since high school, such as HTML, C, C++, Java, and assembly language. SoloLearn helped me brush up on my skills for the high level languages, as you generally do not use all of your programming language skills at one time. I also would like to learn other programming languages from scratch using SoloLearn. Once you learn a high level language, you can easily learn more, as the logic is similar in all of them.
@Jerico your post reminded me, another application for trees is Huffman Codes, which are a method for data compression. You convert characters into strings of 1's and 0's based on the tree, taking into account the most frequently used characters, and give those the shortest strings (so, if A and E are popular, give them 2 bit strings, instead of making each letter in the alphabet 5 bits, for example). The way to ensure you don't have confusion over whether you are starting a new character string is to use Prefix Codes (which is another name for Huffman Codes), and, counterintuitively, it means no letter's code can be the beginning of another. This is where the tree comes into play. For example, if B is 001, then A cannot be 00 as the decoder wouldn't know if 00 is a whole character or the beginning of B.
there is a tutorial on data structures I need to read first before I can answer if I like them or not but they are helpful so I will say they are important!!
Most courses in SoloLearn do not cover much past arrays in DataStructures hence it make sense to start with an array. But from my experience, it really starts with objects/structures. What is an array, if not just an defined amount of chunk of memory set aside. Hence we can easily access it via index. Hashmap discussed in Java tutorial as a DataStructure similar to an array but bigger. It stores and retrieves via hashing a key, therefore it is quick. But it needs a lot more space than it needs because of collisions (keys with really close Hashes). Hence it is a bad choice if memory is at a premium. Another thing is, if memory had to be dynamically allocated, they will not be next to each other. Hence cost of going down the list goes up but allocation costs goes “down” via linkable objects. They can create stacks, queques, binary trees, graphs.... However to truly appreciate DataStructures, we need some Discrete Math. It helps us choose the best data structure and way (program/algorithm) to use it.
Hi angel! I knew data structure, its one of my subject back then. Its more of Computing of 1's and 0's for the most part! And I trully enjoyed that subject with ending a highest grade. hehe