PR2

 Write a Python program to compute following operations on String:

a) To display word with the longest length

b) To determines the frequency of occurrence of particular character in the string

c) To check whether given string is palindrome or not

d) To display index of first appearance of the substring

e) To count the occurrences of each word in a given string



# Function to display the word with the longest length


def longest_word(string):

    words = []

    word = ""

    for char in string:

        if char == ' ':

            if word:

                words.append(word)

            word = ""

        else:

            word += char

    if word:

        words.append(word)


    max_length = 0

    longest = ""

    for w in words:

        length = 0

        for _ in w:

            length += 1

        if length > max_length:

            max_length = length

            longest = w

    return longest


# Function to determine the frequency of occurrence of a particular character

def char_frequency(string, char):

    count = 0

    for c in string:

        if c == char:

            count += 1

    return count


# Function to check whether the given string is a palindrome

def is_palindrome(string):

    cleaned = ""

    for c in string:

        if (c >= 'a' and c <= 'z') or (c >= 'A' and c <= 'Z') or (c >= '0' and c <= '9'):

            if c >= 'A' and c <= 'Z':

                cleaned += chr(ord(c) + 32)

            else:

                cleaned += c


    length = 0

    for _ in cleaned:

        length += 1


    for i in range(length // 2):

        if cleaned[i] != cleaned[length - i - 1]:

            return False

    return True


# Function to display the index of the first appearance of a substring

def first_substring_index(string, substring):

    n = 0

    for _ in string:

        n += 1

    m = 0

    for _ in substring:

        m += 1


    for i in range(n - m + 1):

        match = True

        for j in range(m):

            if string[i + j] != substring[j]:

                match = False

                break

        if match:

            return i

    return -1


# Function to count the occurrences of each word in a string

def word_count(string):

    words = []

    word = ""

    for char in string:

        if char == ' ':

            if word:

                found = False

                for i in range(len(words)):

                    if words[i][0] == word:

                        words[i][1] += 1

                        found = True

                        break

                if not found:

                    words.append([word, 1])

                word = ""

        else:

            word += char

    if word:

        found = False

        for i in range(len(words)):

            if words[i][0] == word:

                words[i][1] += 1

                found = True

                break

        if not found:

            words.append([word, 1])


    return words


# Input a string from the user

input_string = input("Enter a string: ")


# a) Display the word with the longest length

print("\nWord with the longest length:", longest_word(input_string))


# b) Determine the frequency of occurrence of a particular character

char = input("\nEnter a character to find its frequency: ")

print(f"Frequency of '{char}':", char_frequency(input_string, char))


# c) Check whether the given string is a palindrome or not

print("\nIs the string a palindrome?:", is_palindrome(input_string))


# d) Display the index of the first appearance of a substring

substring = input("\nEnter a substring to find its first occurrence: ")

index = first_substring_index(input_string, substring)

if index != -1:

    print(f"First appearance of '{substring}' is at index: {index}")

else:

    print(f"'{substring}' not found in the string.")


# e) Count the occurrences of each word in the given string

word_occurrences = word_count(input_string)

print("\nOccurrences of each word:")

for word, count in word_occurrences:

    print(f"{word}: {count}")


Comments

Post a Comment

Popular posts from this blog

Pr13

 Pizza parlor accepting maximum M orders. Orders are served in first come first served basis. Order once placed cannot be cancelled. Write C++ program to simulate the system using circular queue using array. Objectives:- 1. To understand concept of circular queue. #include <iostream> #include <string> using namespace std; class PizzaParlor { private:     string* orders;    // Array to store pizza orders     int front;         // Front pointer (for serving orders)     int rear;          // Rear pointer (for placing orders)     int capacity;      // Maximum capacity (M orders)     int size;          // Current number of orders public:     // Constructor to initialize the queue with a given capacity     PizzaParlor(int M) {         capacity = M;         orders = new ...
Read more

pr7

 Department of Computer Engineering has student's club named 'Pinnacle Club'. Students of Second, third and final year of department can be granted membership on request. Similarly one may cancel the membership of club. First node is reserved for president of club and last node is reserved for secretary of club. Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name. Write functions to a) Add and delete the members as well as president or even secretary. b) Compute total number of members of club c) Display members d) Display list in reverse order using recursion e) Two linked lists exists for two divisions. Concatenate two lists #include <iostream> #include <string> using namespace std; // Define a structure for a student node struct Student {     string prn;     string name;     Student* next; }; // Define a class for managing the club's members class PinnacleClub { private:   ...
Read more