×
Home Discussions Write at Opengenus IQ
×
  • #7daysOfCode
  • C Interview questions
  • Linux 💽
  • 🔊 Data Structures
  • Graph Algorithms
  • Dynamic Programming 💑
  • Greedy Algo 📔
  • Algo Book 🧠
  • String Algo 🧬
  • Join our Internship 🎓
  • Home
Shruti Rawal

Shruti Rawal

Android developer || Data Structures and Algorithms enthusiast || Smart India Hackathon 2020 || Student at National Institute of Technology (NIT), Raipur

Varanasi •
3 posts •
Data Structures

Applications of Queue

We have covered all applications of queue. Some of the algorithms were it is used are CPU Scheduling (First-Come-First-Serve), Breadth First Search Traversal, Level Order Traversal of a tree, Edmonds Karp Algorithm, Dinic's Algorithm and Fibonacci Heap. We have explored some of the problems as well.

Shruti Rawal Shruti Rawal
Data Structures

Types of Queue and their implementations

Queue is a FIFO (first in first out) data structure. The different types of queues are linear queue, circular queue, priority queue and deque. We have explored the types along with implementations.

Shruti Rawal Shruti Rawal
Data Structures

Binary Space Partitioning Trees

Binary Space Partitioning Trees is a method of recursively subdividing a space into two convex sets by using hyperplanes as partitions. The resulting data structure is a binary tree, and the two subplanes are referred to as front and back.

Priyanshi Sharma Priyanshi Sharma
×

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ © 2021 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter