70 posts tagged with "dev"

I had been dealing with Prolog for a long time and I just want to say something about it.

Predicate logic is the extended form of propositional logic and a branch of mathematical logic. This is used to check and describe things better in the core logically.

The Big-O notation, many talk about it but what is it? It is the question, how fast is the code, which you have in front of you. You have an algorithm that is supposed to solve a task, all well and good, but how long does it take? And more importantly, how does it look with a lot of data?

Linked lists, or single or double linked lists, are data structures that represent dynamic lists. The data structure is fundamental and consists of two classes, the list and the nodes.

Hashing is a data structure which allows to add and read data with $O(1)$. But the search is done with $O(n)$.

Quicksort is a sorting method according to the principle "divide and conquer" with an effort in best case $O(n Log(n))$ in avg case $O(n Log(n))$ and in worst case $O(n^2)$

The Strategy pattern is a design pattern from Object Oriented Programming. Why is this pattern actually very useful in IT security?

Mergesort is a sorting method to sort relatively fast huge amounts of data. Mergesort belongs to the divide & conquer algorithms with a big notation of $n log(n)$

What is Big Endian and Little Endian. Here in this post I explain what it is and where the two differ.

Endian is nothing else than to say "what is the beginning and where is the end".

Hi, after the few posts from Exploit-DB I thought why not try to make a HowTo.

How to build a simple bufferoverflow exploit? Is it much effort?