Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
At time t, a TCP connection has congestion window of 4000 bytes. The maximum segment size used by the connection is 1000 bytes. What is the congestion window after it sends out 4 packets and receive
Why would ISPs select to have peering relationships if it means they transport packets for free? Why do ISPs attempt to make sure valley-free routes?
Why was the original TCP/IP protocol split into two separate protocols, TCP and IP? Describe how the NAT on the router in your home network violates fate sharing.
Why does UDP exist? Would it not have been sufficient to let applications send raw IP packets?
Measurements of slotted Aloha channel with the infinite number of users demonstrate that 10 percent of the slots are idle. Determine the channel load, G? Calculate the throughput S? Is the channel u
In this assignment, use a queue for storing data for Fifo accounting, and stack for Lifo accounting. You must use the array based implementation for your stack based implementation and a linked list
Write down three non-member functions for inorder, preorder and postorder traversals of binary search tree. Demonstrate the result of all the three traversals.
What is external fragmentation? Discuss different ways of handling the problem of external fragmentation.
What is a Process Control Block? Explain each field in the PCB. What is meant by race condition of concurrent access ? Explain with an example.
Draw the Gantt chart and calculate average waiting time, average turnaround time for Preemptive Priority scheduling algorithm. Show that with the general definition of semaphores with busy waiting, t
Write down the differences between user-level and kernel-level threads? Under what situation is one type better than the other? Explain the cause of thrashing? How does the system detect thrashing?
For the bit stream 1010011010(10 bits) sketch the waveforms for the following codes. Make suitable assumptions where ever necessary. NRZL, NRZ-I and Differential Manchester.
With diagrams describe various types of access to a distribute database. With example describe horizontal and vertical fragmentation.
Outline the design scheme that make the IP multicast a reliable group communication. Discuss the design issues for Remote Method Invocation.
With a neat diagram explain in detail the working mechanism of RPC. Discuss in details the file service architecture with a neat diagram.
Describe the techniques used to increase concurrency in locking scheme. With a diagram describe backward validation technique. Compare the same with forward validation technique.
What is the significance of external data representation? With an example describe CORBA CDR Representation. Describe the TCP implementation of Request Reply protocol.
Describe multi valued dependency and Fourth normal form. Describe the different Armstrong’s axioms and why they are used. Describe the multi table clustering file organization.
What are attributes? Describe various types of attributes with example. How they are represented in an ERD. Describe the concept of recoverable and cascade less schedules.
Write a recursive function to solve Tower of Hanoi problem with problem statement. Write a function to insert a node between two consecutive nodes with information fields x and y respectively in a si
Describe different techniques used to resolve hash collision. Describe the array of adjacency list representation of an undirected graph with the example.
Write the c function to create an ordered linked list. Write the recursive function to compute GCD of two numbers.
Write a function to create a tree for a postfix expression. Trace the same stepwise for the expression (A+ ((B-C)*D) ^E^F) by first giving the equivalent postfix expression.
Describe why the software maintenance phase is significant for a software development company. In brief explain why software maintenance is so expensive a phase in software maintenance.
Write a function to implement heap sort. Write the function to convert the infix expression to postfix expression using a stack.