In this post I will describe advantages and disadvantages of Agile Methodology in software development process. I have described in detail different Agile Software Development Methods […]
Computer Networks
Multi Cast Routing And Ad Hoc Routing In Computer Networks
In this post, I will discuss about Multi Cast Routing, Routing in Ad-hoc networks: Route Discovery, Format of a ROUTE REPLY packet, and Congestion Control Algorithms in Computer Networks. What is Multi Cast Routing? There are few applications that need the involvement of far-away separated process to work together in groups. Better example is that […]
PPP Protocol And Method To Bring Internet Lines Up And Down
In this post, I will discuss about The Point-to-Point Protocol, The PPP full frame format for unnumbered mode operation, and Explanation of Method to bring Internet Lines Up and Down in Computer Networks. The Point-to-Point Protocol: Point to Point protocol is used for various reasons like router to router traffic, error detection, supports multiple protocols, […]
Programming Languages
One’s Complement, Bitwise AND, OR, XOR Operators In C
In this post, I will describe about One’s Complement Operator in C programming, Right Shift Operator in C programming, Bitwise AND Operator, Bitwise OR Operator, What is Bitwise XOR Operator in C programming, and showbits( ) Function in C programming. One’s Complement Operator in C programming: One’s compliment mean that all the 1’s present in […]
Low Level Disk I/O, Opening A File, Bitwise Operators In C
In this post, I will discuss about Low Level Disk I/O in C Programming, Low level disk I/O function has the below mentioned advantages, Using argc and argv, Standard I / O Devices in C programming, What is I/O functions Redirection and Bitwise Operators in C Programming. Low Level Disk I/O in C Programming: Using […]
Software Testing
Cyclomatic or Conditional Complexity In Software Testing
In this post I will describe Cyclomatic complexity in Software Testing and how to calculate code complexity using Cyclomatic complexity. I have included few examples to understand how the code complexity is calculated. Also, I have mentioned advantages of using Cyclomatic Complexity. Definition: Cyclomatic complexity (or conditional complexity) is a measurement or a software metric. Cyclomatic complexity was developed by Thomas J. McCabe, Sr. in 1976 and is used to calculate the complexity of a program or a code. It directly measures the number of linearly independent paths through a program's source code. The concept, although not the method, is somewhat similar to that of general text complexity measured by the Flesch-Kincaid Readability Test. Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may … [Read More...]