# Even Odd

Given a linked list now we are to check if the length of the linked list is even odd.

Continue reading Checking if the length of linked list is even odd

Given a linked list now we are to check if the length of the linked list is even odd.

Continue reading Checking if the length of linked list is even odd

Given a linked list you have to display the linked list from the end i.e in the reverse order. Suppose you have 5->6->7->8->9 you have to print it as 9->8->7->6->5.

Continue reading Display a linked list from the end (last element)

Suppose you have a linked list you have to find the middle point of the linked list.

Algorithm

- Find the length of the linked list.
- Find the middle point.

**Database:**A collection of related data**Data :**Known facts that can be recorded and have an implicit meaning, Ex: names, registration number, age etc..**Mini-world:**Some part of the real world about which data is stored in a database. Ex: a school’s student information and other functionalities.**Database Management System (DBMS):**A software package/system to facilitate the creation and maintenance of a computerized database.**Database System:**The DBMS software together with the data itself. Sometimes, the applications are also included.

Continue reading Basic Definitions Database Systems Tutorial 1 Unit 1

- The paragraph tags are used to specify a paragraph in html.

Suppose initially there are two singly linked list which intersect at some point and become a singly linked list. The head pointers of both the list are known but the intersection point is not known.

Continue reading Finding intersection point of two singly linked list

Given a linked list say 1->2->3->4->5, you have to make it as 5->4->3->2->1.i.e reversing linked list using recursion.

Follow the following steps :

- If head is NULL return

- If current node next is NULL means it is the last node. So, make head point to it.
- Recursive traverse the list and set

q = p->next

q->next=p

p->next=NULL Continue reading Reversing linked list using recursion – Data structures

Given a singly linked list you have to reverse the linked list.Reverse singly linked list.

Continue reading Reverse singly linked list using iteration method

Given a sorted linked list insert the node in it.

Continue reading Insert a node in a sorted linked list – Data structure

Suppose you have a linked list. First you have to detect if their is a cycle in the list. If cycle exist find the start node of the cycle. i.e find start node.

The algorithm is an extension of floyd cycle algorithm. Continue reading Check if cycle exist. If there is a cycle find start node