2D Array An array of arrays or a 2D array is organized as matrices. It can be represented as a collection of rows and columns and is used to implement a relational database look-alike data structure. For holding the bulk of data at once, a 2D array provides an easy way. This data can then … Read more
Array A collection of similar types of data items stored at contiguous memory locations is called an array. Being a derived data type in C programming language, an array can store the primitive type of data such as int, char, double, float, etc. The data element of an array can be randomly accessed by using … Read more
Structure A composite data type used to define a grouped list of variables, to be placed under one name in a block of memory is called structure. Thus, by using a single pointer to the structure, we can get access to different variables. Syntax: struct structure_name { data_type member1; data_type member2; . . data_type member; … Read more
Pointer To point the address of the value stored anywhere in the computer memory, a pointer is used. Dereferencing the pointer is to obtain the value stored at the location. The performance for a repetitive process is improved by the pointer. Such processes include: Traversing String Lookup Tables Control Tables Tree Structures Pointer Details: Pointer … Read more
Asymptotic Analysis The method of defining the mathematical bound of its run-time performance to easily conclude the average case, best case, and the worst-case scenario of an algorithm, is called the asymptotic analysis of the algorithm, in mathematical analysis. In simple words, the asymptotic analysis of the algorithm is used to mathematically calculate the running … Read more
Algorithm A procedure having well-defined steps for solving a particular problem is called an algorithm. Or in other words, an algorithm can be defined as a finite set of logic or instructions, written in order to accomplish a certain predefined task. Being just a solution (logic) of a problem, and not the complete program or … Read more
Data Structure The data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently. It is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. Arrays, Linked List, Stack, Queue, etc., … Read more
Doubly linked list: Items can navigate in both forward and backword directions. Linked list operations Insertion: Adds an element at the beginning of the list. Deletion: Deletes an element at the beginning of the list. Display: Displays the complete list. Search: Searches an element using the given key. Delete: Deletes an element using the given … Read more
Singly linked list: Items can navigate in forward direction only. Linked list operations Insertion: Adds an element at the beginning of the list. Deletion: Deletes an element at the beginning of the list. Display: Displays the complete list. Search: Searches an element using the given key. Delete: Deletes an element using the given key. Linked … Read more
Linked list A linked list is a linear collection of data elements, in which linear order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is … Read more