Storage Management [Data Structure] In case of large voluminous data, every byte of space is important and plays a major factor in determining the cost of the resources. Programs that are run on computer systems will use variables that are stored in main memory for manipulation of data. When a variable is defined, a calculated …
Searching Techniques Files and Records: A record is a collection of related information and Collection of records is called a file. Ordered and unordered ———————————– Unordered– There is no relation between the records Ordered –The keys are ordered in a specific fashion to enhance searching. Keys: Specific field in a record to differentiate each record …
Sorting Techniques Sorting is a process to arrange the records in the file in an order(either ascending or descending) with respect to the key. Sorting can be divided into two types of categories called internal and external sorting based on location of records at the time of sorting. The characteristics of sorting methods are – …
Introduction to Graphs The limitation of tree is that it cannot represent many to many relation. This limitation is overcome by using Graph. Definition of a Graph ——————————- Graphs is a data structure consisting of a set of vertices (or nodes) A set of edges (or links) connecting the vertices G = (V, E) where V …
Advanced Trees ———————— Definition of an AVL tree: An AVL tree is a binary search tree which has the following properties: 1. The sub-trees of every node differ in height by at most one. 2. Every sub-tree is an AVL tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamically balanced trees …
Introduction to Trees [Data Structure] ——————————————————- A tree is a finite set of one or more nodes There is a specially designated node called the root Remaining nodes are partitioned into n>=0 disjoint sets T1,…..Tn, where each of these sets is a tree. The sets T1,…. Tn are called subtrees of the root. Terminologies …
Data Structure : Linked List, Stack and queues Creating and Managing Linked Lists ————————————————– List generally refers to a sequential organization of items like an array. Array allocates memory of size, which we determine in the beginning itself. Later this can be used for storing values. A linked list is a chain of structures in …
Operations : Data Structure 1. Operations on List Data Structure Insertion : It is the process of inserting new element or data to a list. Inserting an element in lists is easier, as the place of insertion is known prior. An element can be inserted anywhere in the list. 2. Deletion : An element can …
Data Structures A data structure is a logical method of representing data in memory. Data structure is strictly described as an instance of an Abstract Data Type (ADT). An Abstract Data Type is defined as a mathematical model of a user-defined type along with the operations performed on that model. Data Structure Strengths Weaknesses Array …
File – a place on disc where group of related data is stored. E.g. your C programs, executable, word file, excel file etc. High-level programming languages support file operations. Operations on file. Naming Opening Reading Writing Closing When to use File Handling? Large data volumes E.g. physical experiments, human genome, population records etc. Need for store/retrieve …
Functions and Pointers in C language A function is a unit or module within a program that can be called as and when necessary and as many times as we wish within a program to solve a particular task. When program becomes complex, it is difficult handle or debug, so the complex program can be …
