Different string operations....................

Different string operations....................

• 1.
  2 Data Structures andAlgorithms Remarks • Each programming language contains a character set that is used to communicate with the computer. This set usually includes the followings- • Alphabet- A B C D… X Y Z • Digits- 0 1 2.. 9 • Special Characters- + - / * . (), {}, , $ etc..
• 2.
  3 Data Structures andAlgorithms Storing String • For Example,
• 3.
  4 Data Structures andAlgorithms Storing String • 1. Fixed- length storage.
• 4.
  5 Data Structures andAlgorithms Storing String • 1. Fixed- length storage.
• 5.
  6 Data Structures andAlgorithms Storing String • 2. Variable- length storage with fixed maximum.
• 6.
  7 Data Structures andAlgorithms Storing String • 2. Variable- length storage with fixed maximum.
• 7.
  8 Data Structures andAlgorithms Storing String • 3. Linked storage
• 8.
  9 Data Structures andAlgorithms String Operation • Length: LENGTH (string) e.g.- LENGTH(‘Mark Zuckerberg’)= 15 • Substring: SUBSTRING(string, initial, length) e.g.- SUBSTRING(‘Impossible is a word found in coward’s dictionary’,0,20) = Impossible is a word • Indexing: INDEX(string, pattern) e.g.- INDEX(‘He is wearing glasses’, ‘ear’)= 8 • Concatenation: String1//String2 e.g.- ‘To be or not to be’// ‘, this is the question.’= To be or not to be, this is the question
• 9.
  String Operation • WordProcessing- Insertion: INSERT(string, position, string) e.g.- INSERT(‘ABCDEIJKL’,5,‘FGH’)= ABCDEFGHIJKL Deletion: DELETE(string, position, length) e.g.- DELETE(‘ABCDEFG’, 4, 2)= ABCDG
• 10.
  11 Data Structures andAlgorithms String Operation – Replacement: REPLACE(string, pattern1, pattern2) e.g.- REPLACE(‘XABYABZ’, ‘AB’, ‘c’)= XCYABZ REPLACE function can be executed be using the following three steps- 1. K:= INDEX(string, P1) 2. T:= DELETE(string, K, LENGTH(P1)) 3. INSERT(T, K, P1) – So, the algorithm is- ©SMT, Faculty, CSE, IUBAT
• 11.
  12 Data Structures andAlgorithms String Operation – Pattern Matching: Pattern matching is the problem of deciding whether or not a given string pattern P appears in a text. Widely used in word processing. – So, a basic algorithm is- ©SMT, Faculty, CSE, IUBAT