Skip to main content

Pizza Parlor

 Data Structure Lab

Practical 32 :

Problem Statement :

Pizza parlor accepting maximum M orders. Orders are served in first come first served basis. Order once placed cannot be cancelled. Write C++ program to simulate the system using circular queue using array.

Check Out Code Here ðŸ‘‡

Code can get updated so also come back later to see if there is any changes. Also if there is any problem with code you can comment below. Do share with your friends.😊

Comments

Post a Comment

Popular posts from this blog

Circle Triangle Pattern

  Group A   Practical 3 a   Problem Statement :   a) Write C++ program to draw the following pattern. Use DDA line and Bresenham‘s circle drawing algorithm. Apply the concept of encapsulation. Check Out Code Here  ðŸ‘‡ Output :  Code can get updated so also come back later to see if there is any changes. Also if there is any problem with code you can comment below. If you like it, do share with your friends.😊
Post a Comment
Read more

DSL A2

  Write a Python program to store marks scored in subject “Fundamental of Data Structure” by N students in the class. Write functions to compute following:  a) The average score of class  b) Highest score and lowest score of class  c) Count of students who were absent for the test  d) Display mark with highest frequency The Code for above problem is as follows : """ @author: SPPU SE GURU """ total=int(input ("Enter total no. of students in your class ")) pre=int(input("No. of students appeared for FDS exam : ")) U=[] for i in range (total): i=i+1 U.append(i) R=[] for i in range(pre): roll=int(input("Enter Roll no. of students present for test :- ")) R.append(roll) M=[] for i in range(pre): print("Enter Roll no. ",R[i],end=" ") marks=int(input("Marks:- ")) M.append(marks) print("********** Solutions Are as fo...
Post a Comment
Read more

DSL E29

 Data Structure Lab : Practical 29 : Problem Statement:  Queues are frequently used in computer programming, and a typical example is the creation of a job queue by an operating system. If the operating system does not use priorities, then the jobs are processed in the order they enter the system. Write C++ program for simulating job queue. Write functions to add job and delete job from queue Check Out Code Here  ðŸ‘‡ // Author : SPPU CSE GURU #include<iostream> using namespace std; class Queue{ private: int front,rear,max; public: int Q[10]; Queue() { front=0; rear=-1; max=10; } void EnQueue(); void DeQueue(); void Display(); }; void Queue::EnQueue() { int data; cout<<"Enter Job no. to Add "<<endl; cin>>data; if(rear...
Post a Comment
Read more