69 CS651 Lecture Notes - Circular Buffer

4 views2 pages

Document Summary

L40: queues data structure in java | lesson 40 | Dsa in java | java for beginner |@codingninjasindia. This video is part of the entire playlist of the earlier videos In this video, we "ll be focusing on the introductions of q and how to implement circular queue. we. "ll try to implement a circular queue and some basic questions on it. So let "s begin so what are queues. We "ll be checking if rq is empty or not because this is also one case that we need to handle right. Suppose if the queue is empty and we are using a deletion operation, so we should not be able to use it. enqueue should receive an integer that we need to add in the list. So we "ll just use the add operation. the other function that we should make is dq and it should also be a boolean.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions