https://github.com/abhishekmishra-17/eb3_mind-benders_queue-using-linked-list

https://github.com/abhishekmishra-17/eb3_mind-benders_queue-using-linked-list

animation data-structures implementation-of-data-structures linked-list queue queues virtual-lab virtual-laboratory

Last synced: 16 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/abhishekmishra-17/eb3_mind-benders_queue-using-linked-list
• Owner: Abhishekmishra-17
• Created: 2020-08-29T13:13:32.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2021-04-13T18:13:21.000Z (almost 4 years ago)
• Last Synced: 2024-11-08T06:11:54.990Z (2 months ago)
• Topics: animation, data-structures, implementation-of-data-structures, linked-list, queue, queues, virtual-lab, virtual-laboratory
• Language: CSS
• Homepage:
• Size: 1.95 MB
• Stars: 2
• Watchers: 5
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## Introduction (Round 0)




Discipline | Computer Science and Engineering

:--|:--|

 Lab |  Data Structure Lab

 Experiment|      Implementation of Queue using Linked List


 About the Lab (Objective) : 


The objective of this lab is to teach students various data structures and to explain them algorithms for performing various operations on these data structures. This lab complements the data structures course. Students will gain practical knowledge by writing and executing algorithm by using various data structures such as arrays, linked lists, stacks, queues, trees, graphs, hash tables and search trees.

 About the Experiment : 

The experiment "Implementation of Queue using Linked-List", is the implementation of basic principle of Queue, which is FIFO ( First In First Out).

In a linked queue, each node of the queue consists of two parts that is data part and the link part. Each element of the queue points to its immediate next element in the memory.

In the linked queue, there are two pointers maintained in the memory that is front pointer and rear pointer. The front pointer contains the address of the starting element of the queue while the rear pointer contains the address of the last element of the queue.

 Target Audience : 


B. Tech. 2nd year Students and teachers

 Course Alignment : 


B.Tech.

 Universities Mapped : 


Dr. A.P.J. Abdul Kalam Technical University, Lucknow, Uttar Pradesh

Name of Developer |  Dr. Satyendra Kumar Pandey

:--|:--|

 Institute |  Institute of Technology & Management, GIDA, Gorakhpur

 Email id|      [email protected]

 Department | Department of Computer Science


#### Mentor Details

Mentored by |  Dr Ramesh Sharma

:--|:--|

 Institute |  Feroze Gandhi Institute of Engineering and Technology

 Email id|      [email protected] 

 Department | Department of Applied science 


#### Contributors List

SrNo | Name | Faculty or Student | Department| Institute | Email id

:--|:--|:--|:--|:--|:--|

1 | Abhishek Mishra | Student | Computer Science and Engineering | Institute of Technology & Management, GIDA, Gorakhpur |[email protected]

2 | Ashish Shukla | Student | Computer Applications| Institute of Management Studies, Noida, Uttar Pradesh | [email protected]

3 | Kriti Shukla | Student | Computer Science and Engineering | Institute of Technology & Management, GIDA, Gorakhpur | [email protected]

4 | Pankaj Kumar Gond | Student | Information Technology | Institute of Technology & Management, GIDA, Gorakhpur | [email protected]
 

The link of website is here