Pattern matching finds whether or not a given string pattern appears in a string text. Commonly used pattern matching algorithms are Naive Algorithm for pattern matching and pattern matching algorithm using finite automata. Naive Algorithm for pattern matching PAT and TEXT are two strings with length R and S respectively. This algorithm finds INDEX(P) The […]
Different types of string operations are, Substrings A substring is the basic unit of access in a string. Unlike other array elements, substrings have their own meaning. To access a substring we need the following information, Name of the string. Position of the first character of the substring in the given string. length of the
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
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
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
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 structures are generally classified into primitive and non-primitive data structures. Different categories of data structures are shown in the figure. Primitive data structures Basic data structures that cannot be further divided is called primitive data structures. Non primitive data structures Data structures that can be used for other complex storages are called non-primitive data
What is the difference between a data type and a data structure? Data type and data structure sound like the same thing because they both deal with the nature and organisation of data, but one explains the kind and nature of data while the other represents the collections in which that data might be stored.
“The logical or mathematical model of a particular organization of data is called a data structure.” The choice depends on two consideration. First, it must be rich enough in structure to mirror the actual relationship of the data in the real world. Also, the structure should be simple enough that one can effectively process the
