Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Ap Ex-5 .......

    Uploaded by

    rekha80193

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Ap Ex-5 .......

    Uploaded by

    rekha80193
    14 views6 pages

    Original Title

    AP EX-5 .......

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    14 views6 pages

    Ap Ex-5 .......

    Uploaded by

    rekha80193

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 6

    DEPARTMENT OF

    COMPUTER SCIENCE & ENGINEERING

    Experiment 5

    Student Name: Budda Archana UID:23BCS80089


    Branch: CSE Section/Group:FL-IOT-604/B
    Semester:5 Date of Performance:28-08-24
    Subject Name: AP Subject Code: 22CSP-314

    1. Aim:
    Problem Statement: - There is a sequence of words in CamelCase as a
    string of letters s, having the following properties:
     It is a concatenation of one or more words consisting of English letters.
     All letters in the first word are lowercase.
     For each of the subsequent words, the first letter is uppercase and rest of
    the letters are lowercase. Given, determine the number of words in s
    2. Objective:
    The objective of this experiment is to implement a function in Java that
    counts the number of words in a camel case formatted string.
    3. Implementation/Code:
    class Result {

    public static String pangrams(String s) {


    // Write your code here
    s = s.toLowerCase();
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    // Create a boolean array to track presence of each letter (26 letters in


    alphabet)
    boolean[] seen = new boolean[26];

    // Iterate over each character in the string


    for (char c : s.toCharArray()) {
    // Check if character is a letter
    if (c >= 'a' && c <= 'z') {
    // Mark the character as seen
    seen[c - 'a'] = true;
    }
    }

    // Check if all letters have been seen


    for (boolean letterSeen : seen) {
    if (!letterSeen) {
    return "not pangram";
    }
    }

    return "pangram";

    }
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    4. Output:

    Problem -2

    1. Aim:
    Problem Statement: - Louise joined a social networking site to stay in touch
    with her friends. The signup page required her to input a name and a password.
    However, the password must be strong. The website considers a password to
    be strong if it satisfies the following criteria:
     Its length is at least.
     It contains at least one digit.
     It contains at least one lowercase English character.
     It contains at least one uppercase English character.
     It contains at least one special character. The special characters are:
    !@#$%^&*()-+.
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    2. Objective:
    The objective of this experiment is to implement a function in Java that
    determines the minimum number of characters needed to make a given
    password "strong" according to specific criteria.
    3. Code:
    class Result {

    public static int minimumNumber(int n, String password) {


    // Return the minimum number of characters to make the password strong
    int count = 0;
    // Flags to check for each type of character
    boolean hasDigit = false;
    boolean hasLowerCase = false;
    boolean hasUpperCase = false;
    boolean hasSpecialChar = false;

    // Special characters set


    String specialCharacters = "!@#$%^&*()-+";
    // Check each character in the password
    for (char ch : password.toCharArray()) {
    if (Character.isDigit(ch))
    { hasDigit = true;
    } else if (Character.isLowerCase(ch))
    { hasLowerCase = true;
    } else if (Character.isUpperCase(ch)) {
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    hasUpperCase = true;
    } else if (specialCharacters.contains(Character.toString(ch)))
    { hasSpecialChar = true;
    }
    }
    // Count missing character types
    if (!hasDigit) count++;
    if (!hasLowerCase) count++;
    if (!hasUpperCase) count++;
    if (!hasSpecialChar) count++;

    int additionalLength = Math.max(6 - n, 0);

    additional length needed


    return Math.max(count, additionalLength);
    }

    4. Output:
    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    5. Learning Outcome
    i. Learn to efficiently process strings and manipulate individual characters
    ii. Learn to work with strings in Java, including iterating over characters,
    checking character properties, and applying conditions based on those
    properties.
    iii. Understand basic password strength requirements, which is essential for
    developing secure applications.
    iv. Develop skills in analyzing strings and manipulating characters in Java,
    which is critical in many programming tasks.

    You might also like