Www Thelearningpoint Net Computer Science Data Structures Qu

pdfcrowd.comopen in browser PRO version Are you a developer? Try out the HTML to PDF API

the learning pointMain Page Math Computer Science Physics And Its Applications Electrical & Electronic Engg.

Test Prep: IIT JEE/CBSE/ISC Programming Interviews English Grammar About Top ISC-ICSE Schools

Discussion Forums/Feedback Exam Result Analysis 2013 (CBSE/ICSE/JEE) The Book Corner

Computer Science >

Data Structures: Queues ( with C Program source code)

0 Follow @learning_pt 87 followers

Follow The Learning Point Community on Facebook!

All Categories

Try out our Quizzes!

Mathematics

Quizzes on ProgressionsMCQ Quiz #1: Arithmetic Progression MCQ Quiz #2: Geometric ProgressionMCQ Quiz #3 : More on GeometricProgressions.MCQ Quiz #4 : HarmonicProgressions. MCQ Quiz #5: More on HarmonicProgressionMCQ Quiz #6: Mixed Progressions

Coordinate Geometry - Straight LinesMCQ Quiz #1: Cartesian Planes andthe Straight Line- the Very BasicsMCQ Quiz #2 on Straight LinesMCQ Quiz #3 on Straight LinesMCQ Quiz #4 on Straight Lines

Search this site


Introduction to Algorithms3r...

List Price: Rs.525Our Price: Rs.357

Introduction to Algorithms(CLRS)

Algorithms 4th Edition

Our Price: Rs.599

Algorithms (By RobertSedgewick)

An Introduction to theAnalys...


Analysis of Algorithms (ByRobert Sedgewick)

Some Important Linear Data Structures- at aglance

StacksQueuesSingle Linked ListDouble Linked ListCircular Linked List

Tutorials on Sorting- at a glance

Bubble Sort - One of the mostelementary sorting algorithms to implement- and also very inefficient. Runs in quadratictime. A good starting point to understandsorting in general, before moving on tomore advanced techniques and algorithms.A general idea of how the algorithm worksand a the code for a C program.

Insertion Sort - Another quadratic timesorting algorithm - an example of dynamicprogramming. An explanation and stepthrough of how the algorithm works, aswell as the source code for a C programwhich performs insertion sort.

Selection Sort - Another quadratic timesorting algorithm - an example of a greedyalgorithm. An explanation and step throughof how the algorithm works, as well as thesource code for a C program which performsselection sort.

Circles1 MCQ Quiz #1 on Circles. 2 MCQ Quiz #2 on Circles. 3 MCQ Quiz #3 on Circles.

Conic Sections- Parabola, Hyperbola,Ellipse1 MCQ- The Basics of Conic Sections2 MCQ Quiz on Parabola. Your scorewill be emailed to you.3 MCQ Quiz (Fill up answers in theAnswer Submission form below this)4 MCQ Quiz/Worksheet on Ellipses.

Probability

MCQ Quiz #1 on Basic ProbabilityMCQ Quiz #2: More ChallengingProblems on ProbabilityMCQ Quiz #3- ConditionalProbability and Bayes Theorem

Complex NumbersMCQ Quiz #1MCQ Quiz #2: More on ComplexNumbers

Quadratic EquationsMCQ Quiz for Quadratic Equations-test how much you know about thetopic !


To go through the C program / source-code,scroll down to the end of this page

Queue

Queue is a specialized data storage structure(Abstract data type). Unlike, arrays accessof elements in a Queue is restricted. It has twomain operations enqueue and dequeue.Insertion in a queue is done using enqueuefunction and removal from a queue is doneusing dequeue function. An item can beinserted at the end (rear) of the queue andremoved from the front (front) of the queue. Itis therefore, also called First-In-First-Out(FIFO) list. Queue has five properties - capacitystands for the maximum number of elementsQueue can hold, size stands for the current sizeof the Queue, elements is the array ofelements, front is the index of first element (theindex at which we remove the element) andrear is the index of last element (the index atwhich we insert the element).

Shell Sort- An inefficient but interestingalgorithm, the complexity of which is notexactly known.

Merge Sort An example of a Divide andConquer algorithm. Works in O(n log n)time. The memory complexity for this is a bitof a disadvantage.

Quick Sort In the average case, this works inO(n log n) time. No additional memoryoverhead - so this is better than merge sortin this regard. A partition element isselected, the array is restructured such thatall elements greater or less than thepartition are on opposite sides of thepartition. These two parts of the array arethen sorted recursively.

Heap Sort- Efficient sorting algorithm whichruns in O(n log n) time. Uses the Heap datastructure.

Binary Search Algorithm- Commonly usedalgorithm used to find the position of anelement in a sorted array. Runs in O(log n)time.

Basic Data Structures and Algorithms

Stacks Last In First Out data structures ( LIFO). Like a stack of cards from which you pick upthe one on the top ( which is the last one tobe placed on top of the stack ).Documentation of the various operations andthe stages a stack passes through when

Quadratic In-equationsMCQ Quiz for Quadratic In-equations

Computer Science

Quizzes on Basic Object OrientedProgramming with C++

1 MCQ Quiz #1: C++ and OOPS2 MCQ Quiz #2: Inheritance in C++

Quizzes on C Programming- Arrays, Stringsand Pointers

1 C Programming MCQ Quiz #1:Strings- 12 C Programming MCQ Quiz #2:Strings (2)3 C Programming MCQ Quiz #3:Strings (3)4 C Programming MCQ Quiz #4:Arrays(1)5 C Programming MCQ Quiz #5:Arrays (2)6 C Programming MCQ Quiz #6:Arrays (3)7 C Programming MCQ Quiz #7:Pointers (1)8 C Programming MCQ Quiz #8:Pointers (2)


elements are inserted or deleted. C programto help you get an idea of how a stack isimplemented in code.

Queues First in First Out data structure (FIFO).Like people waiting to buy tickets in a queue -the first one to stand in the queue, gets theticket first and gets to leave the queue first.Documentation of the various operations andthe stages a queue passes through aselements are inserted or deleted. C Programsource code to help you get an idea of how aqueue is implemented in code.

Single Linked List A self referential datastructure. A list of elements, with a head anda tail; each element points to another of itsown kind.

Double Linked List- A self referential datastructure. A list of elements, with a head anda tail; each element points to another of itsown kind in front of it, as well as another ofits own kind, which happens to be behind it inthe sequence.

Circular Linked List Linked list with no headand tail - elements point to each other in acircular fashion.

Binary Search Trees A basic form oftree data structures. Inserting anddeleting elements in them. Differentkind of binary tree traversalalgorithms.

Heaps - A tree like data structurewhere every element is lesser (orgreater) than the one above it. Heapformation, sorting using heaps in O(n

Quizzes on Java Programming

1 Java MCQ Quiz #1- Classes,Inheritances and Interfaces2 Java MCQ Quiz #2- Collections3 Java MCQ Quiz #3- Threading

Quizzes on Data Structures,Algorithms and Complexity

1 MCQ Quiz #1: The Basics of SortingAlgorithms- Quadratic Sorts2 MCQ Quiz #2: Efficient SortingAlgorithms- Quick sort, Merge Sort,Heap Sort3 MCQ Quiz #3- The Radix Sort4 MCQ Quiz #4: Divide and ConquerTechniques- Binary Search, Quicksort,Merge sort, Complexities5 MCQ Quiz #5- DynamicProgramming6 MCQ Quiz #6- Complexity ofAlgorithms7 MCQ Quiz #7- Application ofMaster's Theorem8 MCQ Quiz #8: Binary Search Trees9 MCQ Quiz #9: B-Trees10 MCQ Quiz #9: AVL-Trees11 MCQ Quiz #10: RepresentingGraphs as Data Structures12 MCQ Quiz #11: Spanning Trees13 MCQ Quiz #12: Algorithms -Graphs: Spanning Trees - Kruskal and


Algorithm:

Queue structure is defined with fields capacity,size, *elements (pointer to the array ofelements), front and rear.

Functions

1. createQueue function This function takesthe maximum number of elements(maxElements) the Queue can hold as anargument, creates a Queue according to itand returns a pointer to the Queue. 2. enqueue function - This function takes thepointer to the top of the queue Q and the item(element) to be inserted as arguments. Checkfor the emptiness of queue3. dequeue function - This function takes thepointer to the top of the stack S as an

log n) time.

Height Balanced Trees - Ensuringthat trees remain balanced tooptimize complexity of operationswhich are performed on them.

Graphs

Depth First Search - Traversing through agraph using Depth First Search in which

unvisited neighbors of the current vertex are

pushed into a stack and visited in that order.

Breadth First Search - Traversing through a

graph using Breadth First Search in which

unvisited neighbors of the current vertex are

pushed into a queue and then visited in that

order.

Minimum Spanning Trees: Kruskal Algorithm -

Finding the Minimum Spanning Tree using the

Graphs: Spanning Trees - Kruskal andPrim Algorithms14 MCQ Quiz #13: Algorithms -Graphs: Depth and Breadth FirstSearch

Basic English Grammar

Test your English Online: Articles(Quiz #1)

Test Your English Online: Articles(Quiz #2)

Test Your English Online: Articles(Quiz #3)

English Grammar- The Tenses: Quiz#1






pointer to the top of the stack S as anargument and will then dequeue an element.4. front function This function takes thepointer to the top of the queue Q as anargument and returns the front element of thequeue Q.

Properties:

1. Each function runs in O(1) time.2. It has two basic implementationsArray-based implementation Its simple andefficient but the maximum size ofthe queue is fixed.Singly Linked List-based implementation Itscomplicated but there is no limiton the queue size, it is subjected to theavailable memory.

Complete Tutorial with document :


Kruskal Algorithm which is a greedy

technique. Introducing the concept of Union

Find.

Minumum Spanning Trees: Prim's Algorithm -


Prim's Algorithm.

Dijkstra Algorithm for Shortest Paths-

Popular algorithm for finding shortest paths :

Dijkstra Algorithm.

Floyd Warshall Algorithm for Shortest

Paths- All the all shortest path algorithm:

Floyd Warshall Algorithm

Bellman Ford Algorithm - Another common

shortest path algorithm : Bellman Ford

Test Your English Grammar: The Partsof Speech (Quiz #1)








1 / 5shortest path algorithm : Bellman Ford

Algorithm.

Dynamic Programming A techniqueused to solve optimization problems,based on identifying and solving sub-parts of a problem first.

Integer Knapsack problemAnelementary problem, often used tointroduce the concept of dynamicprogramming.

Matrix Chain Multiplication Given along chain of matrices of varioussizes, how do you parenthesize themfor the purpose of multiplication -how do you chose which ones to startmultiplying first?

Longest Common Subsequence Giventwo strings, find the longest commonsub sequence between them.

Elementary cases : Fractional Knapsack

Problem, Task Scheduling - Elementary

problems in Greedy algorithms - Fractional

Knapsack, Task Scheduling. Along with C

Program source code.

Data Compression using Huffman

TreesCompression using Huffman Trees. A

of Speech (Quiz #7)





Queues - C Program source code

#include

#include

/*Queue has five properties. capacity stands for the maximum number of elements Queue can hold.

Size stands for the current size of the Queue and elements is the array of elements. front is the

index of first element (the index at which we remove the element) and rear is the index of last element

(the index at which we insert the element) */

typedef struct Queue

{

int capacity;

int size;

int front;

int rear;

int *elements;

}Queue;

/* crateQueue function takes argument the maximum number of elements the Queue can hold, creates

a Queue according to it and returns a pointer to the Queue. */

Queue * createQueue(int maxElements)

{

/* Create a Queue */

Queue *Q;

Q = (Queue *)malloc(sizeof(Queue));

/* Initialise its properties */

Q->elements = (int *)malloc(sizeof(int)*maxElements);

Q->size = 0;

Q->capacity = maxElements;

Q->front = 0;

greedy technique for encoding information.


Q->rear = -1;

/* Return the pointer */

return Q;

}

void Dequeue(Queue *Q)

{

/* If Queue size is zero then it is empty. So we cannot pop */

if(Q->size==0)

{

printf("Queue is Empty\n");

return;

}

/* Removing an element is equivalent to incrementing index of front by one */

else

{

Q->size--;

Q->front++;

/* As we fill elements in circular fashion */

if(Q->front==Q->capacity)

{

Q->front=0;

}

}

return;

}

int front(Queue *Q)

{

if(Q->size==0)

{

printf("Queue is Empty\n");

exit(0);

}


/* Return the element which is at the front*/

return Q->elements[Q->front];

}

void Enqueue(Queue *Q,int element)

{

/* If the Queue is full, we cannot push an element into it as there is no space for it.*/

if(Q->size == Q->capacity)

{

printf("Queue is Full\n");

}

else

{

Q->size++;

Q->rear = Q->rear + 1;

/* As we fill the queue in circular fashion */

if(Q->rear == Q->capacity)

{

Q->rear = 0;

}

/* Insert the element in its rear side */

Q->elements[Q->rear] = element;

}

return;

}

int main()

{

Queue *Q = createQueue(5);

Enqueue(Q,1);

Enqueue(Q,2);

Enqueue(Q,3);

Enqueue(Q,4);

printf("Front element is %d\n",front(Q));


Enqueue(Q,5);

Dequeue(Q);

Enqueue(Q,6);

printf("Front element is %d\n",front(Q));

}

Related Tutorials :

Stacks Last In First Outdata structures (LIFO ). Like astack of cardsfrom which youpick up the oneon the top (which is the lastone to be placedon top of thestack ).Documentationof the variousoperations andthe stages astack passesthrough whenelements areinserted ordeleted. Cprogram to helpyou get an ideaof how a stack isimplemented incode.

Queues First in First Outdata structure(FIFO). Likepeople waitingto buy tickets ina queue - thefirst one to standin the queue,gets the ticketfirst and gets toleave the queuefirst.Documentationof the variousoperations andthe stages aqueue passesthrough aselements areinserted ordeleted. CProgram sourcecode to help youget an idea ofhow a queue isimplemented incode.


Testing Zone For Programmers- Try out our online Multiple-Choice-Question tests inProgramming and Computer Science!

Photo-credits: www.istockphoto.com

Quizzes on Basic Object OrientedProgramming with C++

1. 1 MCQ Quiz #1: C++ and OOPS2. 2 MCQ Quiz #2: Inheritance in C++

Quizzes onJavaProgramming

1. 1 Java MCQQuiz #1-Classes,Inheritancesand Interfaces

2. 2 Java MCQQuiz #2-Collections

3. 3 Java MCQQuiz #3-


Quiz #3-Threading

Quizzes on C Programming- Arrays, Stringsand Pointers

1. 1 C Programming MCQ Quiz #1: Strings- 12. 2 C Programming MCQ Quiz #2: Strings (2)3. 3 C Programming MCQ Quiz #3: Strings (3)4. 4 C Programming MCQ Quiz #4: Arrays(1)5. 5 C Programming MCQ Quiz #5: Arrays (2)6. 6 C Programming MCQ Quiz #6: Arrays (3)7. 7 C Programming MCQ Quiz #7: Pointers (1)8. 8 C Programming MCQ Quiz #8: Pointers (2)

Quizzes onDataStructures,Algorithms andComplexity

1. 1 MCQ Quiz #1:The Basics ofSortingAlgorithms-Quadratic Sorts

2. 2 MCQ Quiz #2:Efficient SortingAlgorithms-Quick sort,Merge Sort,Heap Sort

3. 3 MCQ Quiz#3- The RadixSort

4. 4 MCQ Quiz #4:Divide andConquerTechniques-Binary Search,Quicksort,Merge sort,Complexities

5. 5 MCQ Quiz#5- DynamicProgramming

6. 6 MCQ Quiz#6- Complexityof Algorithms

7. 7 MCQ Quiz#7- Applicationof Master'sTheorem

8. 8 MCQ Quiz #8:Binary Search


Binary SearchTrees

9. 9 MCQ Quiz #9:B-Trees

10. 10 MCQ Quiz#9: AVL-Trees

11. 11 MCQ Quiz#10:RepresentingGraphs as DataStructures

12. 12 MCQ Quiz#11: SpanningTrees

13. 13 MCQ Quiz#12: Algorithms- Graphs:Spanning Trees- Kruskal andPrimAlgorithms

14. 14 MCQ Quiz#13: Algorithms- Graphs: Depthand BreadthFirst Search

Recommended books for learningComputer Science, learning high qualityprogramming, and preparing forprogramming interviews:

These are the standard sources of theknowledge expected from candidatesinterviewing at Google, Microsoft,Facebook, Amazon and other startups andtop-tier technology companies. The booksby Cormen or Sedgewick (a standard part


of the undergraduate curriculum) aresufficient for this part of the preparation.Google specially, loves to focus onalgorithmic questions.

1. A goodknowledge ofDataStructures,AlgorithmDesign andAnalysis ofComplexityThe books byCormen orSedgewick (astandard partof theundergraduatecurriculum)are sufficientfor this part ofthepreparation.Googlespecially,loves to focuson algorithmicquestions.

Introduction to Algorithms 3r...


Introduction to Algorithms

(CLRS)

Algorithms 4th Edition

Our Price: Rs.599

Algorithms (By Robert

Sedgewick)

An Introduction to the Analys...


Analysis of Algorithms (By

Robert Sedgewick)

2. Standardand


andestablishedsources ofProgrammingInterviewQuestionsA lot ofinterviewquestions arere-used andre-cycled byinterviewsagain andagain.Chances are,that questionyou're going tobe asked, hasbeen asked ahundred timesduring the lastweek, across anumber ofcompanies!Google,Facebook,Microsoft,Amazon- allof themfrequently askquestions onthe lines of

Cracking The CodingInterview...


Cracking the Coding

Interview: 150 Programming

Questions and Solutions

[Paperback]

Programming InterviewsExposed


Programming Interviews

Exposed

Ace the ProgrammingInterview

Our Price: Rs.1733

Ace the Programming

Interview

Ace the IT Interview

Our Price: Rs.1300

Ace the IT Interview


those in thesebooks.

3. Puzzles andBrainteasers(often asked,good to beprepared)Questionsfrom MountFuji arespeciallypopular withMicrosoftrecruiters.

How Would You Move MountFuji?


How would you move Mount

Fuji?

How to

Ace the Brain Teaser

Interview

4. GoodSoftwareEngineeringpractices. Writing cleanand securecode, an

Code Complete Writing Secure Code 2nd

Design Patterns


code, anawarenessabout DesignPatterns andObjectOrientedProgrammingtechniques.Some of thesebooks arefrequentlyrecommendedby Microsoftrecruiters.Take care ofbufferoverflows!CodeComplete is arecommendedbook forMicrosoftInterviews.

Code Complete


Code Complete 2

Writing Secure Code 2ndEdition

Our Price: Rs.699

Writing Secure Code

Design Patterns


Design Patterns

In case yourprimarylanguage isC++, makesure you knowits "ins-and-outs". Youshould knowabout

The C++ ProgrammingLanguage...


Beginning C++ Through GamePr...

Our Price: Rs.2008

C++ How to Program



aboutdestructorsandconstructors,virtualdestructors,polymorphism,functionoverloading.Some of thesebooks mighthelp you reviseC++.

Our Price: Rs.736

The C++ Programming

Language (Bjarne Stroustrup)

Beginning C++ through

Game Programming

C++: How to Program (Deitel

and Deitel)

In case yourprimarylanguage is C,make sure tobe well versedwith pointers,system callsand how theywork. Howdoes Mallocwork, howdoes callocwork? All ofthese arequestionswhich someinterviewerscould

The C Programming Language


C How To Program 6thEdition



couldpotentiallyask, to test thedepth of yourknowledgeand yourunderstandingof the system"under thehood".

The C Programming

Language (Kernighan)C How to Program (Deitel

and Deitel)

Here's a greatbook forthe Javalovers as well.It normallydoesn't matterwhichprogramminglanguage youknow, butmake sure toknow about itin detail.

Java


Java: A Beginner's Guide

(Herb Schildt)


Sign Up

Recommendations

Create an account or Log In to see w hat your friends recommend.

Infographics - Visualizing India's Crude Oil Reserves - the learning point2 people recommend this.

the learning point76 people recommend this.

ISC Class 12: English Syllabus - the learning pointOne person recommends this.

Algorithms: Dynamic Programming - Matrix Chain Multiplication w ith C Program Source Code - The Learn...3 people recommend this.

Facebook social plugin


0

Comments

Name

Enter your comment here

Comment by Html Comment Box

(Dec 10, 2013) RIDHI said:

NOT UNDERSTANDING CODING

(Dec 10, 2013) RIDHI said:

BAKWAS CODING

(Oct 29, 2013) Vijay said:

Thanks for the information.

Sign in | Recent Site Activity | Report Abuse | Print Page | Powered By Google Sites

Documents

Www Thelearningpoint Net Computer Science Data Structures Qu