Results for "Category: Data Structures"

Data and File structure Programs Program Set 1 ------------------------------------------------- 1. Perform the following operations on an array: (a) insert (b) delete (c) merge (D) Delete multiple occurrences of a number ------------------------------------------------- 2. Create a stack using static memory allocation ------------------------------------------------- 3. Create a queue using static memory allocation ------------------------------------------------- 4. Create a circular queue ------------------------------------------------- 5. Create a singly linked list and perform the following operations: (a) insert (b) delete (c) merge (d) sort (e) union (f) intersection (g) reverse ------------------------------------------------- 6. Create a stack using dynamic memory allocation ------------------------------------------------- 7. Create a queue using dynamic memory allocation ------------------------------------------------- 8. Represent a polynomial in terms of a singly linked list, and then add two three variables polynomials ------------------------------------------------- 9. Create a doubly linked list ------------------------------------------------- 10. Create a circular linked list ------------------------------------------------- 12. Create a double-ended queue (Dequeue) with the following operations: (a) insert in the beginning (b) insert in the end (c) delete from beginning (d) delete from end Hint: Use doubly-link list ------------------------------------------------- 13. Create a Priority Queue with the following operations: (a) Insert (b) DeleteMin() / deleteMax---depending on the heap ------------------------------------------------- Program Set 2 ------------------------------------------------- 1.Trace the following set of nos using quick sort and bubble sort. Which of the sorting method is more efficient? 9, 11, 1, 5, 10, 45, 3, 8, 18 ------------------------------------------------- 2. Code for finding a no in a binary search tree and displaying its level where it is found (root is at zero level) ------------------------------------------------- 3. Code for traversing a binary tree in inorder iteratively ------------------------------------------------- 4. Code for interchanging the left and right subtrees of a binary tree ------------------------------------------------- 5. Code for counting the leaves(node having no subtree) of the tree Note: Q-2 to Q-5 are to be implemented practically also. ------------------------------------------------- 6. Heap Sort -------------------------------------------------

The code is for creating adding deleting and printing

Code reads an array and writes array's php code to a file.

[Please rate my code.] This helps to maintain a book-list in a small library. The book information contains the title, author, publish year, and ISBN code. The information will be given to you in a text file books.txt. Each line of the file contains data about books. (For more information about this, look at the books.txt file in the zip file) It provides functions to: - add a book - delete a book based on the ISBN code or title - search for a book based on the ISBN code - list all books - list every books written by a specific author It also provides an easy way for users to select a command from a command menu to perform the above functions and to input data from the keyboard. The "books.txt" file is used to initialize the list.

You can learn Pointer & Link List easily. Familiar with Link List

learn all about a single linked lists (adding and deleting nodes). Sorting works but it is not sorting the linked list itself but sorting array then transfering back into linked list.

This code implements a simple class, wich stores and manages some basic data(name, address and telephone). It also saves and opens data using serialization :-). Uses a MDI form with toolbar and menuitems to navigate the different options.

It is a implementation of Tree (Binary, AVL and Red Black) and the various operations (Insertion, Deletion) and traversal Inorder, Postorder and Preorder. Study the code in the order binary .. AVL .. Red Black to understand how the program enhances and works.. The various factors such as Balancing factor, height and colour fixup have been kept in mind. Each rotation in Tree is clearly depicted and coded as a separate function.

creates a GD image resource from a pcx file

Some linked list implementations are very hard to understand. Take a look at this Simplest Linked list. please vote

:How to extend your urls dynamically using a Mysql Database without having file structures for every directory in your Url's, this code will improve search engine status of your website and much more.

This article describes a simple approach to displaying object property data within a data grid view control. The example includes a test application comprised of a simple data container class and a sample application used to bind and display object data within a data grid view control. The value of the approach is to permit a developer to quickly display object data in tabular format, or to provide a convenient method for editing object data.

This Describes the principle of a queue processing technique or servicing conflicting demands by ordering process or also known as CPU scheduling. The program displays the list of process and their burst and waiting time and the total waiting and burst time.

use of link list in multiplying two polynomials of any order

my purpose is to solve difficulty in linklist through this program.in this code one can use isert,delete,userdefine insertion between node and deletion is also at userdefine node.

Connect to a database and generate SQL to Insert, Update, and Delete records. Also generates VB.Net Classes to make use of the generated SQL stored procedures.

This is my first submition to this site. so i like to start with some simple this code helps you to impliment a stack using c or c++ i think this is the simplest code to impliment the stack ... So enjoy ...:)

This is a compilation of shop programs I wrote in 3 different ways or better said data structures from scratch. Shop 1 is implemented with an array. When the program starts it allocates memory on heap and gives 100 possibly entries of products (during runtime it is not possible to customize it). Shop 2 is implemented using a doubly linked list and therefore it is possible to allocate memory during runtime. Shop 3 is implemented using a binary search tree.To keep things simple I decided to sort products by a code value, so when displaying products on the screen, they will be printed out in an increasing order. I have also omitted a sort option from the program.

Convert a binary file in a useful C/C++ structure that can be included in a C/C++ source.

Visual Basic 2005 OLEDB Demo - showing how to use a database in code only.