Quite often there is a difference in how a developer tests a web form and how a user uses it. Users may: leave random characters in a field that requires a telephone number to be the input. For example, if there is a code that tracks phone calls and compares them to the phone data [...]
Web applications cause a problem that is not present on traditional applications stored on the user's PC (tablet/phone). The problem is the following: the user connects to the server and requests a page, the page is delivered, the connection is stopped and then all the page objects are deleted from the server memory. This stateless [...]
B-Trees and binary trees are both non-linear data structures and while their names may sound similar, they’re very different in nature. In this article, we will compare them to make them easier to distinguish. B-Tree B-tree is a self-balancing tree data structure in which a node can have more than two children. The height of [...]
ASP .NET provides a new way to handle dynamic web forms. Unlike the conventional style where the developers had to adapt and improvise with HTML tags and attributes, ASP. NET server controls automatically provide their HTML structure. This allows the developers to focus just on the desired behavior. These server controls behave like objects and [...]
Breadth-First Search (BFS) and Depth-First Search (DFS) are algorithms for traversing graphs. Traversal is the process of accessing each vertex (node) of a data structure in a systematic well-defined order. Choosing the algorithm depends on the type of data you are dealing with. There are generally two types of traversal and the main difference between [...]
Trees and graphs are data structures used to resolve various complex problems. Knowing the difference between them is useful in terms of better understanding of the non-linear way of storing data. Definition: Trees and graphs are both abstract data structures. They are a non-linear collection of objects, which means that there is no sequence between [...]
Stacks and queues are both very commonly used data structures. They dynamically store and retrieve data items in two different ways. Let’s take a look at these two principles, so we can understand what differences they have and where their uses may be applicable. Definition: Stacks and queues are both abstract data structures and the [...]