The following Perl code reads and replace some text in a file. Two code snippets are provided to read a small file and a large file: Reading a Small File Reading a Large File
This is my cheat sheet for SCCS the UNIX source code control system SCCS Commands To edit a file: sccs edit To unedit a file: sccs unedit To check in a file: sccs delget To list all the files that are checked out: sccs info To see the history of a file: sccs prt To
Introduction Image edge detection refers to methods of identifying points in a digital image where brightness changes sharply. Mathematically speaking we are looking for points of discontinuity of the intensity function of the input image. The purpose of detecting edges in images is to capture changes in real world object properties such as discontinuities in
LZW Algorithm: Introduction It is beyond our imagination to specify a ceiling for the amount of information that an individual or a group of people potentially need to store and/or exchange. Using computer systems, almost all kinds of information can be digitized and therefore saved to storage media or sent across channels all over the
Introduction In this tutorial I will demonstrate how to integrate Sikuli (open source image based test automation tool) and Selenium (object based web automation framework) into Robot Framework (keyword and data driven test automation framework). This is not a Robot Framework Tutorial nor a Sikuli Tutorial. For more information about these technologies please visit their
Introduction In this article I will demonstrate how to integrate Sikuli (image based test automation tool) into a Java project for example a JUnit test suite. I will start by providing a general overview about front end test automation then go through the detailed procedure to add visual inspection capabilities to a typical Java project
Insertion Sort Welcome to part 8 on loop invariants. Please refer to the first part (introduction) here. Today, we are going to discuss insertion sort algorithm. Let us get started. Problem definition Given an array (A) of (n) numbers. Assume the array starts at position (1). Develop an algorithm to sort the array in increasing
Bubble Sort Hello! This is part 7 in a series of short articles on loop invariants. You can refer to the first part (introduction) here. Today, we are going to discuss bubble sort algorithm in the context of loop invariants. Problem definition Given an array (A) of (n) numbers. Develop an algorithm to sort the
Linear Search Hello! This is part 6 in a series of short articles on loop invariants. You can refer to the first part (introduction) here. Today, we are going to develop an algorithm for linear search using loop invariants. Let us get started. Problem definition Given an array (A) containing (n) numbers and given some