Skip to content
#

lpu

Here are 85 public repositories matching this topic...

Given a linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1->2->3->4->5->6 then the output should be 4.

  • Updated Nov 23, 2022
  • HTML

Create a website for CPU scheduling algorithms (FCFS, Priority Scheduling(non preemptive) and Priority Scheduling (Preemptive)). On clicking any algorithm, the page must display the working of the algorithm and have a working model of it. For instance, for priority scheduling, the working model should take input from the user related.

  • Updated Nov 16, 2022
  • JavaScript

Improve this page

Add a description, image, and links to the lpu topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the lpu topic, visit your repo's landing page and select "manage topics."

Learn more