Computers are capable of processing non-numerical data called character data. In computer terminology, a sequence of characters is called a string. Basic terminology Every programming language consists of a character set. A character set will have alphabets, numbers and special characters. A finite sequence of zero or more characters from the character set is called […]
Introduction to strings Read More »
Big O notation is a symbolism used in complexity theory to describe theasymptotic behavior of functions. Basically, it tells you how fast a function grows or declines. Suppose M is an algorithm and n is the size of the input data. As n increases the complexity, f(n), of M also increases. The rate of increase
An algorithm is defined as a well-defined list of steps for solving a problem. Each step of an algorithm will have a clear meaning and can be performed with a finite amount of effort and finite length of time. Every algorithm must satisfy the following criteria, Inputs: Zero or more quantities which are externally supplied
Algorithm complexity and time space trade off Read More »
Different types of data structures are used for different kinds of purposes. Some of them are highly specialized in specific tasks. Applications of data structures are listed below. Applications of Arrays Applications of Linked lists Applications of Trees Applications of Stacks The LIFO property of Stack can be useful in the following applications. Applications of
Applications of data structures Read More »
The data in the data structures are processed by certain operations. Traversing: Visiting each record so that items in the records can be accessed.Searching: Finding the location of the record with a given key or value or finding all records which satisfy given conditions.Inserting: Adding a new record to the data structure.Deleting: Removing records from
Data structure operations Read More »
