This method uses a field in the header to specify the number of characters in the frame. When the data link layer at the destination sees the character count, it knows how many characters follow, and hence where the end of the frame is. The disadvantage is that if the count is garbled by a transmission error, the destination will lose synchronization and will be unable to locate the start of the next frame. So, this method is rarely used. [

This Cyclic Redundancy Check is the most powerful and easy to implement technique. Unlike checksum scheme, which is based on addition, CRC is based on binary division. In CRC, a sequence of redundant bits, called cyclic redundancy check bits, are appended to the end of data unit so that the resulting data unit becomes exactly divisible by a second, predetermined binary number.

Several algorithms for computing the shortest path between two nodes of a graph are known. This one is due to Dijkstra (1959). Each node is labeled (in parentheses) with its distance from the source node along the best known path. Initially, no paths are known, so all nodes are labeled with infinity.

The following example shows how a pipe is created, reading and writing from pipe. A pipe provides a one-way flow of data. A pipe provides a one-way flow of data. A pipe is created by the pipe system call. int pipe ( int *filedes ) ; Two file descriptors are returned- filedes[0] which is open for reading , and filedes[1] which is open for writing. Pipes

FIFO (“First In, First Out”) is sometimes known as a named pipe. That is, it's like a pipe, except that it has a name! In this case, the name is that of a file that multiple processes can open() and read and write to.

Connect function: The connect function is used by a TCP client to establish a connection with a TCP server. int connect(int sockfd, const struct sockaddr *servaddr, socklen_t addrlen); Bind function: The bind function assigns alocal protocol

Connect function: The connect function is used by a TCP client to establish a connection with a TCP server. int connect(int sockfd, const struct sockaddr *servaddr, socklen_t addrlen);

The SRS document explains the purpose and features of the software, the interfaces of the software, what the software will do, the constraints under which it must operates and how the software will react to the external stimuli. This SRS document is intended for both the end-users and to the developers of the software.

The Constructive Cost Model (COCOMO) is an algorithmic software cost estimation model developed by Barry W. Boehm. The model uses a basic regression formula with parameters that are derived from historical project data and current as well as future project characteristics.

Calculating effort for Attendance Management System using Function Point oriented estimation model. It is a method to break systems into smaller components, so they can be better understood and analyzed. It is used to express the amount of business functionality, an information system (as a product) provides to a user. Fps measure software size

The proactive management of risks throughout the software development life-cycle is important for project success. The risk management practice, which involves risk identification, analysis, prioritization, planning, mitigation, monitoring, and communication .Software development risks that seem to reoccur in educational and industrial projects A risk-driven process for selecting a software development model Risk in itself is not bad; risk is essential to progress, and failure is often a key part of learning.

The program evaluation and review technique (PERT) chart is used to schedule, organize, and coordinate tasks within the project. The objective of PERT chart is to determine the critical path, which comprises critical activities that should be completed on schedule.