Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Dsa Fat: Harshil Gupta 17BCE1112

    Uploaded by

    anon_784586715
    The document describes how to determine if a string of brackets is balanced. It defines matched pairs of brackets as opening and closing brackets of the same type. A string is balanced if it contains no unmatched brackets and any brackets enclosed within a matched pair are also balanced. The code reads in an integer n, then n strings. It prints "YES" if a string is balanced or "NO" if not.

    Copyright:

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

    Dsa Fat: Harshil Gupta 17BCE1112

    Uploaded by

    anon_784586715
    37 views3 pages
    The document describes how to determine if a string of brackets is balanced. It defines matched pairs of brackets as opening and closing brackets of the same type. A string is balanced if it contains no unmatched brackets and any brackets enclosed within a matched pair are also balanced. The code reads in an integer n, then n strings. It prints "YES" if a string is balanced or "NO" if not.

    Original Title

    dsa fat2 (1).docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes how to determine if a string of brackets is balanced. It defines matched pairs of brackets as opening and closing brackets of the same type. A string is balanced if it contains no unmatched brackets and any brackets enclosed within a matched pair are also balanced. The code reads in an integer n, then n strings. It prints "YES" if a string is balanced or "NO" if not.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    37 views3 pages

    Dsa Fat: Harshil Gupta 17BCE1112

    Uploaded by

    anon_784586715
    The document describes how to determine if a string of brackets is balanced. It defines matched pairs of brackets as opening and closing brackets of the same type. A string is balanced if it contains no unmatched brackets and any brackets enclosed within a matched pair are also balanced. The code reads in an integer n, then n strings. It prints "YES" if a string is balanced or "NO" if not.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    HARSHIL GUPTA

    17BCE1112

    DSA FAT
    Question -2

    A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are
    considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing
    bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {},
    and ().A matching pair of brackets is not balanced if the set of brackets it encloses are not matched. For
    example, {[(])}is not balanced because the contents in between { and } are not balanced. The pair of
    square brackets encloses a single, unbalanced opening bracket, (, and the pair of parentheses encloses a
    single, unbalanced closing square bracket, ]. By this logic, we say a sequence of brackets is considered to
    be balanced if the following conditions are met:  It contains no unmatched brackets.  The subset of
    brackets enclosed within the confines of a matched pair of brackets is also a matched pair of brackets.
    Given strings of brackets, determine whether each sequence of brackets is balanced. If a string is
    balanced, print YES on a new line; otherwise, print NO on a new line

    INPUT

    The first line contains a single integer, n , denoting the number of strings.

    Each line i of the n subsequent lines consists of a single string, s , denoting a sequence of brackets.

    Constraints 

    1<=n<=103  1<=lens<=103 , where lens is the length of the sequence

    .  Each character in the sequence will be a bracket (i.e., {, }, (, ), [, and ]).

    Output Format For each string, print whether or not the string of brackets is balanced on a new line. If
    the brackets are balanced, print YES; otherwise, print NO.

    Sample Input 3 {[()]}

    {[(])}

    {{[[(())]]}}

    Sample Output

    YES
    NO

    YES

    CODE
    #include<stdio.h>

    main()

    char queue[1000][1000];

    int n;

    int front = 0;

    scanf("%d", &n);

    char s[1000];

    int i;

    for (i = 0; i < n; i++)

    scanf("%s", &queue[i]);

    for (i = 0; i< n; i++)

    printf("%s ", queue[front]);

    front += 1;

    if (front == 0)

    printf("Balanced");

    else

    printf("UnBalanced");

    You might also like