Design a generalization /specialization hierarchy for a Computer Peripheral sales company. The company sells monitors, printers, scanners and UPS. Justify your placement of attributes at each level of the hierarchy. Convert the diagram into tables with integrity constraints for each table

What are the different features of IpSec?

Discuss the implementation of Kerberos mechanism.

What are the functions of SSL? Discuss the merits of SSL.

With the help of a diagram explain the three phases in TCP’s congestion control mechanism. How does the size of a congestion window change in the different phases?

Write and apply Dijkstra’s Shortest path algorithm to find the shortest path from a source node A to all the other nodes in a graph given below

Formulate the shortest path problem in a computer network.

What is count to infinity problem? Explain, how it can be solved.

Write steps involved in working of CSMA/CD.

A system uses Slotted ALOHA protocol. In an observation interval, the channel is busy for 90% of the time. Calculate the system throughput.

Sketch the Manchester and RƵ encoding of the following bit stream:

 1011 11 01 01 11

Find CRC for the data polynomial X⁹ +X⁷ +X⁴+X² +1 with the generator polynomial X³ +X¹ +1

What is Checksum? Write algorithm for Checksum.

What is meant by QAM? How is it different from PSK? Draw constellation diagrams of 8-PSK and 16 QAM .

Discuss in detail the Process management, Memory management, I/O & File management and Security & Protection in Windows-11 Operating System.

Explain in detail how semaphores and monitors are used to solve the Dining-Philosopher‘s problem.

What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?

On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume the last request serviced was at track 345 and head is moving to track 0. The queue in FIFO order contains requests for the following tracks: 123, 874,692, 475, 105, 376. Perform the computation for the following disk scheduling algorithms:

(a) FIFO (b) SSTF (c) SCAN (d) LOOK

Consider the following page-reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.

How many page faults would occur for the following replacement algorithms, assuming four frames? Remember all frames are initially empty. a. FIFO replacement b. Least Recently Used replacement c. Optimal d. Least Frequently Used

Mention the merits and demerits of each of the above algorithms.

Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.