RSS Subjects — Blogs about "Data Structures"

Data Structures

Computer Programming Tutorial - An Introduction to Data Structures
2008-09-24 13:34:00
In this article, we will discourse why we necessitate information constructions and what kind of jobs can be solved with their use. Data Structures aid us to form information in the computer, resulting in more than efficient programs. An efficient programme carries faster and assists minimise the use of resources like memory, disk.Computers are getting more than powerful with the transition of time, addition in central processing unit performance, handiness of faster web and the maximization of disc space. Therefore, people have got started solving more than than than and more composite problems.As computing machine applications are becoming complex, so there is a demand for more resources.This makes not intend that we should purchase a new computing machine to do the application carry faster. Our attempt should be to result that the solution is achieved with the aid of online computing machine programming, information constructions and algorithm.Selecting a Data StructureHow ca...

By: moments infusion

C, C++, Programming, Data Structures Quizzes
2008-04-28 15:34:00
OpenAsthra introducing c, c++, programming, os, data structures quizzes http://quiz.openasthra.com/ (note: We didn’t not upload all of our quizzes, we put some samples for now, however framework is fully functional, we will upload soon) Please submit your quizzes to [openasthra AT gamil DOT com]) Assess Your C Skills is back You can use same authentication information (user ... SHARETHIS.addEntry({ title: "C, C++, Programming, Data Structures Quizzes", url: "http://www.openasthra.com/unca-tegorized/c-c-programming-data--structures-quizzes/" });

By: C CPP Blogging

Data Structures and Program Design in C++
2008-01-18 06:29:00
In a surprisingly lively textbook-style treatment, Data Structures and Program Design in C++ delivers expertise and plenty of sample programs for the working C++ programmer or computer science... [[ This is a content summary only. Visit my website for full links, other content, and more! ]]

By: e-book mania

Operation on Bits and Bitwise Operators
2008-01-16 07:00:00
OK guys, this is my first post in the New Year 2008, I thought of posting it earlier but at last I didn’t. It’s already been so long since I posted so let’s keep everything aside and talk just about what we have for today. ;-) I was sitting the other day thinking about what to write for a post here. Suddenly I realized that we have discussed operations on matrices, arrays, and what not but we haven’t had the chance to talk anything about the most fundamental thing a computer understands. Yeah, Operation on Bits. Bits can have only two values either ON (1) or OFF (0). In this article, we’ll be discussing about the different operations which can be performed on bits. One thing to note here is, we don’t perform these operation on single bits but rather on a group of bits (byte(s)). So even though Bitwise operators operate on bits its almost always a part of a group (byte, which makes up each data type), it means we...

By: Learning Computer Programming

Using a Stack to Reverse Numbers
2007-12-07 10:32:00
Yeah, I heard many of you saying this and I know it’s no big deal to reverse a number and neither is it using stack to do so. I am writing this just to give you an example of how certain things in a program can be done using stacks. So, let’s move on… As many of you already know, a stack is a Data Structure in which data can be added and retrieved both from only one end (same end). Data is stored linearly and the last data added is the first one to be retrieved, due to this fact it is also known as Last-In-First-Out data structure. For more info please read Data Structures: Introduction to Stacks. Now, let’s talk about reversing a number, well reversing means to rearrange a number in the opposite order from one end to the other. Suppose we have a number 12345 then its reverse will be 54321 Ok, now let’s have a look at the example program which does this: // Program in C++ to reverse // a number using a Stack // PUSH -&...

By: Learning Computer Programming

Introduction to Linked Stacks
2007-07-20 08:47:00
In the article Data Structures: Introduction to Stacks, we saw that there was one major disadvantage of representing stacks using arrays- the stack like the array could have a limited number of elements, while stacks should be able to grow up to any number of elements. Besides this there were other disadvantages too. In one of the other article about Linked Lists, we noticed one useful property of linked lists that they can grow up to any size to accommodate for the addition of elements and it efficiently uses the memory too. So if we combine both of this to from a linked version of the stack then it won’t have the shortcomings that the array version had. This is what this article is all about. pushing and popping As you know that addition of elements to the stack is known as pushing while retrieval is known as popping. The process of pushing and popping in case of linked version of stack is slightly different from the array version. The followin...

By: Learning Computer Programming

Data Structures: Introduction to Queues
2007-07-04 15:43:00
Queue is a linear data structure in which data can be added to one end and retrieved from the other. Just like the queue of the real world, the data that goes first into the queue is the first one to be retrieved. That is why queues are sometimes called as First-In-First-Out data structure. In case of queues, we saw that data is inserted both from one end but in case of Queues; data is added to one end (known as REAR) and retrieved from the other end (known as FRONT). The data first added is the first one to be retrieved while in case of queues the data last added is the first one to be retrieved. A few points regarding Queues: Queues: It is a linear data structure; linked lists and arrays can represent it. Although representing queues with arrays have its shortcomings but due to simplicity, we will be representing queues with arrays in this article. Rear: A variable stores the index number in the array at which the new data will be added (in the queue). Front: It is a variab...

By: Learning Computer Programming

Data Structures: Introduction to Stacks
2007-06-30 15:30:00
In the previous article, we saw how data is inserted and deleted in an array. In that case we could insert data at any place throughout the array. However, there are situations when we only need to add and retrieve data form the ends of the array. Stacks are one of the examples of this. Stacks are data structures in which data could be added and retrieved only from one end (also known as the TOP of the stack). Suppose we insert 5, 6, 9 to the stack consecutively then while retrieving the first one to be retrieved will be 9 then 6 and then 5. That is why stacks are also known as Last-In-First-Out (or LIFO) structure. A few terms regarding stacks: Stack: Stack is a user-defined data structure. It is most commonly represented by linked-lists and arrays. In this article, we will be representing stacks with arrays. Push: Adding data to the stack is known as pushing. Pop: Retrieving data from the stack is known as popping. Let us have look at this process with the help of an examp...

By: Learning Computer Programming

Fundamentals of Data Structures in C++ , EBook
2007-04-03 09:21:00
Hi Finally I found This cool book , Ebook Link: 653 pages Publisher: W. H. Freeman (February 15, 1995) Language: English ISBN-10: 0716782928 by Ellis Horowitz (Author), Sartaj Sahni (Author), Dinesh Mehta (Author) For Download Link Click On Read More:

By: Masphp site