Closed Stack at queue

[watchertheend]

Mga sir ano pong system ang naaapply yung stack at queue maraming salamat po.

 

[FinestWork]

Algorithm ba 'yan? If yes

Queue algorithm:
Ginamit namin 'to nung nag queuing management system kami kasi nandon 'yung idea ng first in first out.

Stack algorithm:
Ahm, ginamit namin 'to dun sa queuing management system namin na may "UNDO / RECALL" button, nandon din kasi 'yung idea na last in first out.

Sana maliwanagan ka kapatid.

 

[aa1012]

It's a two different data set structure. Stack is a structure where it implements the last-in-first-out principle. The best example of this is the Windows System Restore where the system saves/captures/cache it's last state every time there is a crucial changes in the system. By this, the user will be able to pull out the last/recent state of the system in order to go back to the last system state(although the user can choose manually by jumping from different state but Windows suggest the most recent saved state and not from other previous state).

On the other hand, Queue data structure implements the first-in-first-out principle. This mimics the real life queuing sequence where items are removed/process exactly the same as they were added. Hence, what we call "first come, first served" principle.

Computers does different data processing structure depending on the user demand and system wide demand/priority.

As per your question, "anong system naaapply" well, walang specific na system unless gagawa ka ng program na i-simulate yung iba't-ibang cpu scheduling which includes these two. Ginawa namin yan noong college at nabuang ako sa project na yan lalo na yung shortest-job-first at round-robin cpu scheduling. hahaha! biruin mo gumamit kami jan ng multithreading, async and await kasi interactive ang displaying kung ano ang nangyayari sa mga jobs na ininput mo pag run nung program at ang representation ng progress ay ginamitan namin ng progress bar para maipakita namin sa prof. yung job progress, pakahirap na project nyan noon kasi mga bugoy pa kami hahaha!

Hope it helps.

 

[FinestWork]

It's a two different data set structure. Stack is a structure where it implements the last-in-first-out principle. The best example of this is the Windows System Restore where the system saves/captures/cache it's last state every time there is a crucial changes in the system. By this, the user will be able to pull out the last/recent state of the system in order to go back to the last system state(although the user can choose manually by jumping from different state but Windows suggest the most recent saved state and not from other previous state).

On the other hand, Queue data structure implements the first-in-first-out principle. This mimics the real life queuing sequence where items are removed/process exactly the same as they were added. Hence, what we call "first come, first served" principle.

Computers does different data processing structure depending on the user demand and system wide demand/priority.

As per your question, "anong system naaapply" well, walang specific na system unless gagawa ka ng program na i-simulate yung iba't-ibang cpu scheduling which includes these two. Ginawa namin yan noong college at nabuang ako sa project na yan lalo na yung shortest-job-first at round-robin cpu scheduling. hahaha! biruin mo gumamit kami jan ng multithreading, async and await kasi interactive ang displaying kung ano ang nangyayari sa mga jobs na ininput mo pag run nung program at ang representation ng progress ay ginamitan namin ng progress bar para maipakita namin sa prof. yung job progress, pakahirap na project nyan noon kasi mga bugoy pa kami hahaha!

Hope it helps.

Hahahaha ginagawa ko 'to ngayon at nasa SJF pa rin ako, lintek hindi ko mahuli 'yung switching.

 

[aa1012]

Hahahaha ginagawa ko 'to ngayon at nasa SJF pa rin ako, lintek hindi ko mahuli 'yung switching.

Kaya mo yan paps. Ang hirap talaga nyan. Kung di ako magkakamali, ang maalala ko, SJF is consist of 3 types e, Normal, Pre-emptive at Non-Pre-emptive. Kahit siguro ngayong Dev na ako kung gagawin ko yan kayalangan kong magbasa ulit ng documentation nyan para maalala ko yung principle at details ng bawat scheduling.

 

[FinestWork]

Kaya mo yan paps. Ang hirap talaga nyan. Kung di ako magkakamali, ang maalala ko, SJF is consist of 3 types e, Normal, Pre-emptive at Non-Pre-emptive. Kahit siguro ngayong Dev na ako kung gagawin ko yan kayalangan kong magbasa ulit ng documentation nyan para maalala ko yung principle at details ng bawat scheduling.

Hmmmmm not sure eh pero pina pagawa samen ngayon non-preemptive SJF, mahina pa naman ako sa mga algorithms pero kailangan siya pag aralan hahaha

 

[aa1012]

Hmmmmm not sure eh pero pina pagawa samen ngayon non-preemptive SJF, mahina pa naman ako sa mga algorithms pero kailangan siya pag aralan hahaha

Ang dali lang nyang no-npreemptive paps. Bast ang processing lang nyan is based sa highest priority. Di gaya ng preemptive na hihinto yung current process pag may dumating na mas mataas na priority which is mejo tricky din icode yun kasi bawat dadating na process titignan mo yung priority nya kung mas higher sa current proccess pag yes, sya ang process mo tas pause mo yung current tas pag dumating lahat ng process at walang higher tuloy lang yung current hanggang matapos saka magsu-switch sa non-preemptive yung processing.

 

[Beefsteak]

Algorithm ba 'yan? If yes

Queue algorithm:
Ginamit namin 'to nung nag queuing management system kami kasi nandon 'yung idea ng first in first out.

Stack algorithm:
Ahm, ginamit namin 'to dun sa queuing management system namin na may "UNDO / RECALL" button, nandon din kasi 'yung idea na last in first out.

Sana maliwanagan ka kapatid.

Boss pano po mag Queuing need kolang po. Pinagawa po kase kami ng program e yung akin is scheduling kaya need ko mag Queuing. Example po may pila na 1,2,3,4,5 tapos pag si 1 wala sya ex. Umalis then si 1 mapupunta sa huli ex 2,3, 4,5,1 magiging ganan po.

 

[FinestWork]

Boss pano po mag Queuing need kolang po. Pinagawa po kase kami ng program e yung akin is scheduling kaya need ko mag Queuing. Example po may pila na 1,2,3,4,5 tapos pag si 1 wala sya ex. Umalis then si 1 mapupunta sa huli ex 2,3, 4,5,1 magiging ganan po.

Ano pong language ginagamit niyo sir?

 

[Beefsteak]

Ano pong language ginagamit niyo sir?

C# po paps. Pahelp nmn po

 

[FinestWork]

C# po paps. Pahelp nmn po

Patingin ako ng code mo sir