# Data Structures

Data Structures

### C program for insertion and deletion in Linear Queue

C program for insertion and deletion in Linear Queue : A linear queue models the FIFO(first in first out) data structure, much like a line in real life. The first person in line will be the first person served, in queues the first element to be added is the first that can be removed. The only adding point is...

### C Program of Library Management System | C Projects

C program of Library Management System : Hey friends, we are back with another cool C program. Today we will see how to write a C program of Library Management System. Actually, I haven't written it but found it quite useful for C programmers and students. I don't wanna take the credit of great work of Dinesh that he...

### C program of Student Database System Version 1

C program of Student Database System : Hey friends, on request of users i have started making Student Database System in C Language. I have came up with version 1 of C program of Student Database System. Its a switch case based Menu driven program which allows you to add student details like roll no, his first name, last...

### C Program of N Queens Problem Solution using Backtracking

C program of N queens problem solution : The N Queens Puzzle is the problem of putting N chess queens on an N×N chessboard such that none of them is able to capture any other using the standard chess queen's moves. The queens must be placed in such a way that no two queens would be able to attack...

### C program of Bubble sort using linked list

C program of bubble sort using linked list : In my previous code of Bubble sort algorithm, we have seen how to write a C program of bubble sort using for loop. Today we will learn how to write c code of bubble sort using linked list. Bubble sort algorithm is a simple sorting algorithm that works by repeatedly stepping...

### C program of Knapsack problem using Backtracking

C program of knapsack problem using backtracking : The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the...