WWW Thelearningpoint Net Computer Science Data Structures Qu

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

the learning point
Main 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 Progressions
MCQ Quiz #1: Arithmetic Progression
MCQ Quiz #2: Geometric Progression
MCQ Quiz #3 : More on Geometric
Progressions.
MCQ Quiz #4 : Harmonic
Progressions.
MCQ Quiz #5: More on Harmonic
Progression
MCQ Quiz #6: Mixed Progressions
Coordinate Geometry - Straight Lines
MCQ Quiz #1: Cartesian Planes and
the Straight Line- the Very Basics
MCQ Quiz #2 on Straight Lines
Search this site
pdfcrowd.com open in browser PRO version Are you a developer? Try out the HTML to PDF API
Introduction to Algorithms
3r...
List Price: Rs.525
Our Price: Rs.357

(CLRS)
Algorithms 4th Edition
Our Price: Rs.599

Algorithms (By Robert
Sedgewick)
An Introduction to the
Analys...
List Price: Rs.550
Our Price: Rs.500
Analysis of Algorithms (By
Robert Sedgewick)
Some Important Linear Data Structures- at a
glance

Stacks
Queues
Single Linked List
Double Linked List
Circular Linked List
Tutorials on Sorting- at a glance
Bubble Sort - One of the most
elementary sorting algorithms to implement
- and also very inefficient. Runs in quadratic
time. A good starting point to understand
sorting in general, before moving on to
more advanced techniques and algorithms.
A general idea of how the algorithm works
and a the code for a C program.
Insertion Sort - Another quadratic time
sorting algorithm - an example of dynamic
programming. An explanation and step
through of how the algorithm works, as
well as the source code for a C program
which performs insertion sort.
Selection Sort - Another quadratic time
sorting algorithm - an example of a greedy
algorithm. An explanation and step through
of how the algorithm works, as well as the
source code for a C program which performs
selection sort.
Circles
1 MCQ Quiz #1 on Circles.
Conic Sections- Parabola, Hyperbola,
Ellipse
1 MCQ- The Basics of Conic Sections
2 MCQ Quiz on Parabola. Your score
will be emailed to you.
3 MCQ Quiz (Fill up answers in the
Answer Submission form below this)
4 MCQ Quiz/Worksheet on Ellipses.

Probability
MCQ Quiz #1 on Basic Probability
MCQ Quiz #2: More Challenging
Problems on Probability
MCQ Quiz #3- Conditional
Probability and Bayes Theorem
Complex Numbers
MCQ Quiz #1
MCQ Quiz #2: More on Complex
Numbers
Quadratic Equations
MCQ Quiz for Quadratic Equations-
test how much you know about the
topic !
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 access
of elements in a Queue is restricted. It has two
main operations enqueue and dequeue.
Insertion in a queue is done using enqueue
function and removal from a queue is done
using dequeue function. An item can be
inserted at the end (rear) of the queue and
removed from the front (front) of the queue. It
is therefore, also called First-In-First-Out
(FIFO) list. Queue has five properties - capacity
stands for the maximum number of elements
Queue can hold, size stands for the current size
of the Queue, 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).

Shell Sort - An inefficient but interesting
algorithm, the complexity of which is not
exactly known.
Merge Sort An example of a Divide and
Conquer algorithm. Works in O(n log n)
time. The memory complexity for this is a bit
of a disadvantage.
Quick Sort In the average case, this works in
O(n log n) time. No additional memory
overhead - so this is better than merge sort
in this regard. A partition element is
selected, the array is restructured such that
all elements greater or less than the
partition are on opposite sides of the
partition. These two parts of the array are
then sorted recursively.
Heap Sort - Efficient sorting algorithm which
runs in O(n log n) time. Uses the Heap data
structure.
Binary Search Algorithm- Commonly used
algorithm used to find the position of an
element 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 up
the one on the top ( which is the last one to
be placed on top of the stack ).
Documentation of the various operations and
the stages a stack passes through when
Quadratic In-equations
MCQ Quiz for Quadratic In-equations
Computer Science
Quizzes on Basic Object Oriented
Programming with C++
1 MCQ Quiz #1: C++ and OOPS
2 MCQ Quiz #2: Inheritance in C++
Quizzes on C Programming- Arrays, Strings
and Pointers
1 C Programming MCQ Quiz #1:
Strings- 1
Strings (2)
Strings (3)
Arrays(1)
Arrays (2)
Arrays (3)
Pointers (1)
Pointers (2)
elements are inserted or deleted. C program
to help you get an idea of how a stack is
implemented 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 the
ticket first and gets to leave the queue first.
Documentation of the various operations and
the stages a queue passes through as
elements are inserted or deleted. C Program
source code to help you get an idea of how a
queue is implemented in code.
Single Linked List A self referential data
structure. A list of elements, with a head and
a tail; each element points to another of its
own kind.
Double Linked List - A self referential data
structure. A list of elements, with a head and
a tail; each element points to another of its
own kind in front of it, as well as another of
its own kind, which happens to be behind it in
the sequence.
Circular Linked List Linked list with no head
and tail - elements point to each other in a
circular fashion.
Binary Search Trees A basic form of
tree data structures. Inserting and
deleting elements in them. Different
kind of binary tree traversal
algorithms.
Heaps - A tree like data structure
where every element is lesser (or
greater) than the one above it. Heap
formation, sorting using heaps in O(n
Quizzes on Java Programming
1 Java MCQ Quiz #1- Classes,
Inheritances and Interfaces
2 Java MCQ Quiz #2- Collections
3 Java MCQ Quiz #3- Threading
Quizzes on Data Structures,
Algorithms and Complexity
1 MCQ Quiz #1: The Basics of Sorting
Algorithms- Quadratic Sorts
2 MCQ Quiz #2: Efficient Sorting
Algorithms- Quick sort, Merge Sort,
Heap Sort
3 MCQ Quiz #3- The Radix Sort
4 MCQ Quiz #4: Divide and Conquer
Techniques- Binary Search, Quicksort,
Merge sort, Complexities
5 MCQ Quiz #5- Dynamic
Programming
6 MCQ Quiz #6- Complexity of
Algorithms
7 MCQ Quiz #7- Application of
Master's Theorem
8 MCQ Quiz #8: Binary Search Trees
9 MCQ Quiz #9: B-Trees
10 MCQ Quiz #9: AVL-Trees
11 MCQ Quiz #10: Representing
Graphs as Data Structures
12 MCQ Quiz #11: Spanning Trees
13 MCQ Quiz #12: Algorithms -
Graphs: Spanning Trees - Kruskal and

Algorithm:
Queue structure is defined with fields capacity,
size, *elements (pointer to the array of
elements), front and rear.
Functions
1. createQueue function This function takes
the maximum number of elements
(maxElements) the Queue can hold as an
argument, creates a Queue according to it
and returns a pointer to the Queue.
2. enqueue function - This function takes the
pointer to the top of the queue Q and the item
(element) to be inserted as arguments. Check
for the emptiness of queue
3. dequeue function - This function takes the
pointer to the top of the stack S as an
log n) time.
Height Balanced Trees - Ensuring
that trees remain balanced to
optimize complexity of operations
which are performed on them.
Graphs
Depth First Search - Traversing through a
graph 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 and
Prim Algorithms
14 MCQ Quiz #13: Algorithms -
Graphs: Depth and Breadth First
Search
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
#2
#3
#4
#5
pointer to the top of the stack S as an
argument and will then dequeue an element.
4. front function This function takes the
pointer to the top of the queue Q as an
argument and returns the front element of the
queue Q.
Properties:
1. Each function runs in O(1) time.
2. It has two basic implementations
Array-based implementation Its simple and
efficient but the maximum size of
the queue is fixed.
Singly Linked List-based implementation Its
complicated but there is no limit
on the queue size, it is subjected to the
available 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 Parts
of Speech (Quiz #1)
of Speech (Quiz #2)
of Speech (Quiz #3)
of Speech (Quiz #4)
of Speech (Quiz #5)
of Speech (Quiz #6)
of Speech (Quiz #7)
1 / 5
shortest path algorithm : Bellman Ford
Algorithm.
Dynamic Programming A technique
used to solve optimization problems,
based on identifying and solving sub-
parts of a problem first.
Integer Knapsack problemAn
elementary problem, often used to
introduce the concept of dynamic
programming.
Matrix Chain Multiplication Given a
long chain of matrices of various
sizes, how do you parenthesize them
for the purpose of multiplication -
how do you chose which ones to start
multiplying first?
Longest Common Subsequence Given
two strings, find the longest common
sub 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
Trees Compression using Huffman Trees. A
of Speech (Quiz #7)
of Speech (Quiz #8)
of Speech (Quiz #9)
of Speech (Quiz #10)

Queues - C Program source code
#include<stdio.h>
#include<stdlib.h>
/*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 Out
data structures (
LIFO ). Like a
stack of cards
from which you
pick up the one
on the top (
which is the last
one to be placed
on top of the
stack ).
Documentation
of the various
operations and
the stages a
stack passes
through when
elements are
inserted or
deleted. C
program to help
you get an idea
of how a stack is
implemented 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 the ticket
first and gets to
leave the queue
first.
Documentation
of the various
operations and
the stages a
queue passes
through as
elements are
inserted or
deleted. C
Program source
code to help you
get an idea of
how a queue is
implemented in
code.
Testing Zone For Programmers-
Try out our online Multiple-
Choice-Question tests in
Programming and Computer Science!

Photo-credits: www.istockphoto.com

Quizzes on Basic Object Oriented
Programming with C++
1. 1 MCQ Quiz #1: C++ and OOPS
2. 2 MCQ Quiz #2: Inheritance in C++
Quizzes on
Java
Programming
1. 1 Java MCQ
Quiz #1-
Classes,
Inheritances
and Interfaces
2. 2 Java MCQ
Quiz #2-
Collections
3. 3 Java MCQ
Quiz #3-
Quiz #3-
Threading

Quizzes on C Programming- Arrays, Strings
and Pointers
1. 1 C Programming MCQ Quiz #1: Strings- 1
2. 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 on
Data
Structures,
Algorithms and
Complexity
1. 1 MCQ Quiz #1:
The Basics of
Sorting
Algorithms-
Quadratic Sorts
2. 2 MCQ Quiz #2:
Efficient Sorting
Algorithms-
Quick sort,
Merge Sort,
Heap Sort
3. 3 MCQ Quiz
#3- The Radix
Sort
4. 4 MCQ Quiz #4:
Divide and
Conquer
Techniques-
Binary Search,
Quicksort,
Merge sort,
Complexities
5. 5 MCQ Quiz
#5- Dynamic
Programming
6. 6 MCQ Quiz
#6- Complexity
of Algorithms
7. 7 MCQ Quiz
#7- Application
of Master's
Theorem
8. 8 MCQ Quiz #8:
Binary Search
Binary Search
Trees
9. 9 MCQ Quiz #9:
B-Trees
10. 10 MCQ Quiz
#9: AVL-Trees
11. 11 MCQ Quiz
#10:
Representing
Graphs as Data
Structures
12. 12 MCQ Quiz
#11: Spanning
Trees
13. 13 MCQ Quiz
#12: Algorithms
- Graphs:
Spanning Trees
- Kruskal and
Prim
Algorithms
14. 14 MCQ Quiz
#13: Algorithms
- Graphs: Depth
and Breadth
First Search
Recommended books for learning
Computer Science, learning high quality
programming, and preparing for
programming interviews:
These are the standard sources of the
knowledge expected from candidates
interviewing at Google, Microsoft,
Facebook, Amazon and other startups and
top-tier technology companies. The books
by Cormen or Sedgewick (a standard part
of the undergraduate curriculum) are
sufficient for this part of the preparation.
Google specially, loves to focus on
algorithmic questions.
1. A good
knowledge of
Data
Structures,
Algorithm
Design and
Analysis of
Complexity
The books by
Cormen or
Sedgewick (a
standard part
of the
undergraduate
curriculum)
are sufficient
for this part of
the
preparation.
Google
specially,
loves to focus
on algorithmic
questions.
Introduction to Algorithms 3r...
List Price: Rs.525
Our Price: Rs.357

(CLRS)
Algorithms 4th Edition
Our Price: Rs.599

Algorithms (By Robert
Sedgewick)
An Introduction to the Analys...
List Price: Rs.550
Our Price: Rs.500
Analysis of Algorithms (By
Robert Sedgewick)

2. Standard
and

and
established
sources of
Programming
Interview
Questions
A lot of
interview
questions are
re-used and
re-cycled by
interviews
again and
again.
Chances are,
that question
you're going to
be asked, has
been asked a
hundred times
during the last
week, across a
number of
companies!
Google,
Facebook,
Microsoft,
Amazon- all
of them
frequently ask
questions on
the lines of
Cracking The Coding
Interview...
List Price: Rs.2293
Our Price: Rs.2178
Cracking the Coding
Interview: 150 Programming
Questions and Solutions
[Paperback]
Programming Interviews
Exposed
List Price: Rs.299
Our Price: Rs.284
Programming Interviews
Exposed

Ace the Programming
Interview
Our Price: Rs.1733

Ace the Programming
Interview

Ace the IT Interview
Our Price: Rs.1300

Ace the IT Interview
those in these
books.
3. Puzzles and
Brainteasers
(often asked,
good to be
prepared)
Questions
from Mount
Fuji are
specially
popular with
Microsoft
recruiters.

How Would You Move Mount
Fuji?
List Price: Rs.860
Our Price: Rs.800
How would you move Mount
Fuji?

How to
Ace the Brain Teaser
Interview

4. Good
Software
Engineering
practices.
Writing clean
and secure
code, an
Code Complete
Writing Secure Code 2nd

Design Patterns

code, an
awareness
about Design
Patterns and
Object
Oriented
Programming
techniques.
Some of these
books are
frequently
recommended
by Microsoft
recruiters.
Take care of
buffer
overflows!
Code
Complete is a
recommended
book for
Microsoft
Interviews.
Code Complete
List Price: Rs.629
Our Price: Rs.611

Code Complete 2
Writing Secure Code 2nd
Edition
Our Price: Rs.699

Writing Secure Code
Design Patterns
List Price: Rs.499
Our Price: Rs.409

Design Patterns
In case your
primary
language is
C++, make
sure you know
its "ins-and-
outs". You
should know
about

The C++ Programming
Language...
List Price: Rs.775
Our Price: Rs.736
Beginning C++ Through Game
Pr...
Our Price: Rs.2008

C++ How to Program
List Price: Rs.695
Our Price: Rs.632

about
destructors
and
constructors,
virtual
destructors,
polymorphism,
function
overloading.
Some of these
books might
help you revise
C++.
Our Price: Rs.736
The C++ Programming
Language (Bjarne Stroustrup)

Beginning C++ through
Game Programming

C++: How to Program (Deitel
and Deitel)
In case your
primary
language is C,
make sure to
be well versed
with pointers,
system calls
and how they
work. How
does Malloc
work, how
does calloc
work? All of
these are
questions
which some
interviewers
could

The C Programming Language
List Price: Rs.175
Our Price: Rs.137

C How To Program 6th
Edition
List Price: Rs.650
Our Price: Rs.624

could
potentially
ask, to test the
depth of your
knowledge
and your
understanding
of the system
"under the
hood".
The C Programming
Language (Kernighan)
C How to Program (Deitel
and Deitel)
Here's a great
book for
the Java
lovers as well.
It normally
doesn't matter
which
programming
language you
know, but
make sure to
know about it
in detail.
Java
List Price: Rs.595
Our Price: Rs.541

Java: A Beginner's Guide
(Herb Schildt)

Sign Up
Recommendations
Create an account or Log In to see what your f riends recommend.
Infographics - Visualizing India's Crude Oil Reserves - the learning point
2 people recommend this.
the learning point
ISC Class 12: English Syllabus - the learning point
One person recommends this.
Algorithms: Dynamic Programming - Matrix Chain Multiplication with C Program Source Code - The Learn...
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

WWW Thelearningpoint Net Computer Science Data Structures Qu

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

WWW Thelearningpoint Net Computer Science Data Structures Qu

Caricato da

Copyright:

Formati disponibili

pdfcrowd.com open in browser PRO version Are you a developer?

Try out the HTML to PDF API

Potrebbero piacerti anche