[Segment 2.2] In the last column, we had discussed some basic algorithms and methodologies. Now we will generalise the scheme of an algorithm.
In this part 10 of the series on “Programming in Python for Friends and Relations” we build a small classifieds application.
This month’s column focuses on computational complexity and the lower bounds for algorithms. In particular, we’ll show that any algorithm to find the maximum in an array of N elements has a lower bound of O(N) by using an adversary argument.
Have you wondered why some of the features of C language are unintuitive? As we’ll see in this column, there are historical reasons for …
The second part of the article explains the formation of sessions on the server side without the need to store any information on the client machine. This strategy provides better security for the session information and permits sessions to form even if cookies are disabled on the client applications.
You can communicate between dynamic modules with notifier chains.
An application server is a software stack that provides the business logic of a large-scale distributed application. These business logic and business processes are …
So you want to build a custom phone dialler for your cell phone? In the case of a typical mobile OS, to intercept core areas like the contact book or the dialler itself is not only difficult but also needs in-depth knowledge of the phone’s OS. Unlike that, Android has an extremely modular architecture based on the Linux kernel. In this article, we’ll learn how to harness the power of one such API in Android.
[Segment 2.2] We are about to enter the core part of this segment—algorithms.
Welcome to another installment of CodeSport, which focuses on number theoretic algorithms. In particular, we will discuss the well-known 3-SUM problem, where given an array A of N numbers, we need to determine whether there exists a triple a, b and c that belongs to A, such that a+b+c = 0.