Visit: https://financeclub.viden.io
Knowledge in Data Structures & algorithms
Sunny
Data Structures Unit 1
This contains the basic introduction about data structures. some basic terms which are used in data structures are described here. Types of data structure , operations performed on data structures. Characteristics of an algorithm, lack of ambiguity and should consume less space.
Rose Shukla
Data Structures Unit 3 Stack
This attachment contains knowledge about basic terminologies used in linear data structure. This contains terms used in stack and definition and description of stack. also it has various operations performed on stack. Insertion in stack using push operation. Deletion in stack using pop operation. Description of terms like maxstack, i.e. the maximum no. of elements any stack can hold. Also has information about array representation of stack using various notations like polish and non-polish notation. Prefix notation, postfix notation and infix notation. Evaluation of postfix expression. Evaluation of infix notation.
Data Structures Unit 4 Queue
This attachment contains knowledge about basic terminologies used in linear data structure. This contains terms used in queue. The basic operations on queue. Insertion in queue and deletion in queue. Front and rear in queue. Linked representation in queue.
Data analysis
This also clearly explains you availablity.
yashwanth masna
TREE
Trees can be used to store data that has an inherent hierarchical structure. For example, an operating system may use a tree for directories, files and folders in its file management system. Trees are dynamic, which means that it is easy to add and delete nodes.
Ananya Nigotia
GRAPH
Graphs are used to define the flow of computation and to represent networks of communication. Graphs are also used to represent data organization. Graph transformation systems work on rule-based in-memory manipulation of graphs.
Queue
Queue is useful in CPU scheduling, Disk Scheduling. When multiple processes require CPU at the same time, various CPU scheduling algorithms are used which are implemented using Queue data structure. When data is transferred asynchronously between two processes.
Introduction to Data Structures
Data structure is a process through which data is stored and arranged in the disk space of the computer or memory storage, in a way that the data can be easily used and manipulated in the future. It is an effective way of performing various operations related to data management.
Linked List
Linked List makes insertion and deletion operations are Easier. Efficient Memory Utilization ,i.e no need to pre-allocate memory. Faster Access time,can be expanded in constant time without memory overhead. Linear Data Structures such as Stack,Queue can be easily implemeted using Linked list.