arrival time doesnot depending on priority of a process

The Gateway to Computer Science Excellence

0 votes

On other sources, it is given that we need to assign high priorities to newly inserted element in case of stack otherwise low priority to newly inserted element in case of queue. My doubt here is that shouldn't stack be implemented with max-heap priority queue and queue with min-heap priority queue keeping above assumption of assigning priorities to newly inserted element?

0 votes

If **priority** of an element is directly proportional to the **arrival time** of an element then yes you can implement stack with max-heap priority queue and queue with min-heap priority queue.

Since Stack follows **LIFO**(**Last In First Out**) order, the greater the arrival time, the greater will be the priority and hence you can emulate **LIFO**, just by using priorities. Similar logic applies for **FIFO** data structure queue.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.6k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,833 questions

57,733 answers

199,457 comments

107,886 users