List of top Computer Science Questions asked in CPET

Which software process model involves small, iterative cycles with continuous customer feedback?
Which JavaScript function is used to change the style of an HTML element dynamically?
Which function is used to fetch a single row from a MySQL query result as an associative array?
What does document.querySelector(".class") do?
How do you loop through a multidimensional array in PHP?
Which tag is used to create a hyperlink in an HTML document?
Which of the following clipping algorithms uses a region code system to classify line segments?
What does the z-index property in CSS control?
In the 2D viewing pipeline, what is the purpose of the clipping stage?
Which of the following is the correct way to apply an external CSS file?
Which transformation moves an object without changing its shape, size, or orientation?
In 3D transformations, what is the purpose of homogeneous coordinates?
Which type of fragmentation occurs when allocated memory blocks are larger than the requested memory size?
What is the average waiting time for the following CPU workload using Round Robin method with a time slice of 4 ms (assuming that all jobs arrived at the same time)?

Process No.Next CPU burst time in ms
A5
B7
C4
D9
Which of the following is not a valid file allocation method?
Which of the following synchronization mechanisms allows multiple processes to safely access a shared resource?
What happens during a context switch?
What is thrashing in virtual memory?
The time complexity to perform an Enqueue operation on a Queue data structure is:
The Postorder traversal of a Binary Search tree which is created by presenting the values in the order 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 will be:
What is the postfix form of the infix expression A + B * C − D / E?
Which one of the following is the correct way to increment the rear end of a circular queue represented as an array of size M?
Which sorting algorithm performs best for nearly sorted data?
An M-way search tree is a generalization of which data structure?
What can the Bellman-Ford algorithm detect that Dijkstra's algorithm cannot?