### Data structure Overview

What is mean by data structure ? Lets have brief introduction about data structure, Lets us takes an example ,in our room we have different Read More »

### Algorithm

What is An Algorithm? An algorithm is a sequence of unambiguous instructions which can be used to solve the problem . In addition every algorithm Read More »

### Overview of Recursion

Overview of Recursion: A function must be able to call itself. For example, let us consider the function factr() shown below, which computers the factorial of Read More »

### Differences between recursion and iteration

Differences between recursion and iteration: Both involve repetition. Both involve a termination test. Both can occur infinitely. Try Now Data Structure MCQs Data structure-Recursion MCQ Read More »

### Algorithm Asymptotic Analysis

in The Previous Post We have Learned What is algorithm? In Computer Science we have some problem which we have to solve, but before writing Read More »

### Basic Concepts of Complexity Classes – P-NP-NP-HARD-NP-Complete

In This section lets understand the Basic concept of NP Hard & NP Complete Algorithm   NP-Hard and NP-Complete Problems An algorithm A is of Read More »

In this Post, the list data structure is presented. This structure can be used as the basis for the implementation of other data structures (stacks, queues etc.). Read More »

Linked List Concepts A linked list is a non-sequential collection of data items. It is a dynamic data structure. For every data item in a Read More »

### Single Linked List In Brief

Single Linked List In Brief: A linked list allocates space for each element separately in its own block of memory called a “node”. The list Read More »

Another alternative is to allocate the nodes in blocks. In fact, if you know the maximum size of a list a head of time, you Read More »

A double linked list is a two-way list in which all nodes will have two links. This helps in accessing both successor node and predecessor Read More »

Concept: It is just a single linked list in which the link field of the last node points back to the address of the first Read More »

### Circular Double Linked List Concept in brief

Concept: A circular double linked list has both successor pointer and predecessor pointer in circular manner. The objective behind considering circular double linked list is Read More »

### Comparison of Linked List Variations

The major disadvantage of doubly linked lists (over singly linked lists) is that they require more space (every node has two pointer fields instead of Read More »

### Data Structure :Stack Overview

Data structure Stack:There are certain situations in computer science that one wants to restrict insertions and deletions so that they can take place only at Read More »

1 2 3