Online Test on Data Structures and Algorithms Set 1 contains 50 questions carrying equal marks. Attempt all the questions withing 60 minutes. Fill up the form to access test.
Name: Enter your name
Password: dsapsexam
Email: Enter your valid email. This address will be used to track and send your result test result.
Download all 50 questions as PDF […]
July 8th, 2010 | Posted in Multiple Choice Questions | No Comments
Following is the first set of multiple choice questions from Data Structure and Algorithms chapter.
Questions
1. In linked lists there are no NULL links in:
Single linked list
Linear doubly linked list
circular linked list
None of the above
2. In a Stack the command to access nth element from the top of the stack s will be
S[Top-n]
S [Top+n] […]
July 2nd, 2010 | Posted in Multiple Choice Questions | No Comments
The queue data structure is characterized by the fact that additions are made at the end, or tail, of the queue while removals are made from the front, or head, of the queue. For this reason, a queue is referred to as a FIFO structure (First-In First-Out).
Queues occur naturally in situations where the rate at […]
June 22nd, 2010 | Posted in Queues, Texts | No Comments
Well, we are learning data structures and algorithms in this section of PS Exam. We’ve reached to Queues all the way from lists, linked lists and stacks. I’m posting the brief notes about Queues very soon, but before that I’d like to share a pdf file that introduces the Queue data structure, along with implementation […]
June 22nd, 2010 | Posted in Downloads | No Comments
[Note: Visit cPlusPlus.psexam.com for examples and source code of C++ implementation of Stacks Data Structure. Click Here]
Today its turn of Stacks. In our previous posts we’ve dealt a bit about Data Types, Data Structures and Abstract Data Types, A list of different data structures in use in programming world, List data structure, Linked list data […]
June 14th, 2010 | Posted in Stacks, Texts | No Comments
Linked lists are data structure which are the self-referential class objects called nodes. Each nodes are connected by reference links. Make yourself clear that linked lists are not dynamically sized array.
An array is data structure (type of memory layout) that stores a collection of individual values that are of the same data type. Arrays are useful […]
June 2nd, 2010 | Posted in Arrays, List Data Structure, Texts | No Comments
What is linked list data structure? This is what we are trying to draw from this post. I will be quoting the excerpts and point out the references for you to begin the topic. Keep in mind that the contents presented here are indented for Computer Officer Exam preparation.
Data Structure is included in Computer Officer […]
May 31st, 2010 | Posted in Texts | 1 Comment
A list is a sequential data structure, i.e. a collection of items accessible one after another beginning at the head and ending at the tail. It is a widely used data structure for applications which do not need random access. It differs from the stack and queue data structures in that additions and removals can […]
May 29th, 2010 | Posted in Texts | No Comments
Data types
Primitive types
Boolean
Character
Integer
String
Double
Float
May 28th, 2010 | Posted in Texts | No Comments
Data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Formal data structures enable a programmer to mentally structure large amounts of data into conceptually manageable relationships.
National Institute of Standards and Technology (NIST) defines data structure as “An organization of information, usually in […]
May 28th, 2010 | Posted in Texts | No Comments