 A student at NIT Durgapur pursuing B.Tech currently in my final year. Interested in Data Structures, Algorithms and Web Development.


Sarfraz Baig

This course deals with the Abstract Data Type Queue and its implementation. In these series of lessons, we will try to do an in-depth analysis of queue and its implementations. The course also deals with solving competitive programming questions based on queue along with some typical questions asked in an interview.

Programming

English

Introduction To Queues

Competitive Programming

Stacks & Queues

Basics

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

Through this lesson, Sarfaraz makes us understand and learn what a queue data structure is and its applications

Introduction to Queues

Through this lesson, one will be able to learn what are the various operations that can be performed in a queue.

Operations on Queues

Through this lesson, Sarfaraz makes us  Learn to implement a queue using array.

Queue Using Array

Through this lesson, Sarfaraz teaches us on how to implement a queue using linked list.

Queue Using Linked List

From this lesson, one will learn what a circular queue is and how it is advantageous to use it.

Circular Queue

In this lesson, Sarfaraz makes us learn how to implement a queue using stack (typical interview questions).

Queue Using Stack

Through this lesson, Sarfaraz teaches on how to implement a stack using queue. This question is one amongst the common interview questions.

Stack Using Queue

In this lesson, various question based on queue are discussed. Viewing this lesson will help you learn how to approach such questions.

Questions on Queue: Summary

This series aims to take your programming to the next level. The series focuses on aspiring programmers who aim to be better at coding.

Hackerearth Inc.

This collection begins with the explanation of Euclid's Algorithm. Thereby the next lesson talks about Number Theory and discusses prime numbers. Also the need and implementation of a powerful algorithm, the Modular Exponentiation are also being discussed. In the next lesson, problems are discussed that requires one to compute a huge value. For reference please follow this link:  https://www.hackerearth.com/notes/number-theory-1 

Diving Into Number Theory

The collection provides a basic introduction to Stacks and Queues. The first lesson talks about the Stack data structure and why and how it is used. Thereby Queue data structure and its domain of application are discussed. The last two lessons help in solving an elementary problem using the Stack Data Structure and Queue Data Structure. Also, follow the links provided in the lessons for better understanding. 

Studying The Basic Data Structures - Stacks & Queues

Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

The course is about linked list data structure. The prerequisites for the course are: Pointers; Dynamic Memory Allocation. 
The course first gives an introduction to linked list then discusses about operation that can be performed on linked list.

Data Structure and Algorithms - Linked List

The course is about Stacks and Queues. Stacks and Queues are widely used in competitive programming and are of significant importance in solving many real life problems like expression conversion. Recursion in any programming language is internally implemented by using stacks only. Similarly Queues have their own importance like solving of first come first serve scheduling algorithms.

Data Structures and Algorithms - Stacks and Queues

Computer science background. Passionate about solving real life problems through algorithms. Intern at GeeksforGeeks. Freelancer.

Dhiman Mayank

This course will discuss algorithms and data structures with important interview questions.

(Hindi) Data Structures - Stack, Queue, Linked List, Sorting and Binary Search

The collection begins with an indispensable searching algorithm, Binary Search and tries to get a basic understanding of where it can be used. The next two lessons solve problems for the important application of Binary Search in Competitive Programming. In these two lessons, one can Binary Search for the answer in a range of values and learn how to exploit the behavior of a variable.

Lessons

8 lessons • 1h 7m

Invalid Date

NaN

Introduction to Queues

Invalid Date

NaN

Operations on Queues

Invalid Date

NaN

Queue Using Array

Invalid Date

NaN

Queue Using Linked List

Invalid Date

NaN

Circular Queue

Invalid Date

NaN

Queue Using Stack

Invalid Date

NaN

Stack Using Queue

Invalid Date

NaN

Questions on Queue: Summary