List of top Computer Science & Information Technology Questions asked in AP PGECET

Which of these flip-flops cannot be used to construct a serial shift register?
In a hardwired control unit, the sequence of control signals is generated by _______.
The output of a JK flip-flop for inputs \( J=1, K=1 \) and clock transition from 1 to 0 is _______.
In DMA mode, the CPU is bypassed for data transfer between _______.
A 4-way set-associative cache with 256 blocks divides memory addresses into _______.
The IEEE 754 single-precision floating-point representation of 0.375 is _______.
An 8-bit number \( X \) is \( 00001100 \), then \( -X \) is in 1's complement is _______.
Assuming 5-bit addition is done on registers, the sum \( 12 + 7 \) leads to _______.
For a given graph G having \( v \) vertices and \( e \) edges which is connected and has no cycles, which of the following statements is true?
In a TCP/IP model, which of the following is the layer responsible for routing packets between different networks?
Which of the following is NOT a characteristic of cloud computing?
Which of the following sorting algorithms has the best average-case time complexity?
Which of the following is essential for converting an infix expression to the postfix form efficiently?

What is the output of the following C program segment? 
int j = 7; 
printf("%d, %d", j++, j--);}

Which one of the following is commonly used for server side scripting in web development?
Which of the following is not a web component element?
Telnet is
A computer has 24-bit address bus and an instruction format providing 12 bits in the address part. What is the maximum addressable range?
What do semaphores do?
Which font format is used in web pages?
In a page segmented system, a virtual address consists of 32 bits of which 12 bits are a displacement, 11 bits are segment number, and 9 bits are page number. What is the page size?
What does stand for, in web programming development?
Statement 1: When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don't take advantage of overlapping subproblems.
Statement 2: A greedy algorithm can be used to solve all the dynamic programming problems.
Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R, it will
The term cyclomatic complexity is related to