Function toggleBits - CTS Pattern

PKJ

 Coding Problem Keys 

 CTS Pattern 

 Function toggleBits 

 Problem Statement 

You are required to fix all the logical errors in the given code. You can click on run anytime to check the compilation/execution status of the program. You can use printf to debug your code. The submitted code should be logically/syntactically correct and pass all test cases. Do not write the main() function as it is not required.

Code Approach: For this question, you will need to correct the given implementation. We do not expect you to modify the approach or incorporate any additional library methods.

The function toggleBits (int N, int A, int B) accepts three integers N, A and B as the input. The function is supposed to return N after toggling the bits from A to B.

Note: The rightmost bit is assumed to be the 1st bit and so the range A to B is calculated in reversed order.

The function compiles successfully but fails to print the desired result due to logical errors.

Your task is to debug the program to pass all the test cases.

 Max Execution Time Limit: 5000 millisecs 

 Given Code 

int toggleBits(int N, int A, int B)
{
    int num = ((1 >> B) - 1) & ((1 << (A - 1)) - 1);
    return N ^ num;
}

 Solution 

 Programming Language: C Language 

int toggleBits(int N, int A, int B){
    int num = ((1 << B) - 1) ^ ((1 << (A - 1)) - 1);
    return N ^ num;
}

// Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Same Unit Digit Adjacent Numbers

PKJ
 Coding  Problem  Keys   Same Unit Digit Adjacent Numbers    Problem Statement  A matrix of size R*C (R rows and C columns) containing numbers (positive integer values) is passed as input. The program must print the count C of numbers in a given cell which has at least one adjacent cell (in the same row) containing a number with the same unit digit.  Input Format  The first line contains R and C separated by a space. Next R lines contains C values separated by a space.  Output Format  The first line contains C.  Boundary Conditions  1 <= R, C <= 100.  Example Input/Output 1   Input  4 3 20 27 67 13 74 100 37 90 97 53 75 44  Output  2  Explanation  The numbers are 27 67 in the first row where both have 7 as their unit digit.  Note:  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include<stdio.h...
Click to Continue...

Print Grandson's Name

PKJ
 Coding Problem Keys   Print Grandson's Name   Problem Statement  The program must accept the first and last names of three persons who are in a family tree and print the grandson's name. Note: The last name of a person is nothing but the father's first name.  Boundary Condition(s)  Length of first and last names are from 3 to 100.  Input Format  The first line contains the first and last name of person 1 separated by a space. The second line contains the first and last name of person 2 separated by a space. The third line contains the first and last name of person 3 separated by a space.  Output Format  The first line contains the first and last name of the grandson separated by a space.  Example Input/Output 1   Input  Arun Kumar Swamy Nathan Kumar Swamy  Output  Arun Kumar  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Languag...
Click to Continue...

Christmas Tree Pattern

PKJ
 Coding Problem Keys   Christmas Tree Pattern   Problem Statement  John is a pure Desi boy. And his one and only dream is to meet Santa Claus. He decided to decorate a Christmas tree for Santa on coming Christmas. John made an interesting Christmas tree that grows day by day. The Christmas tree is comprised of the following:     - Parts     - Stand Each Part is further comprised of Branches. Branches are comprised of Leaves. How the tree appears as a function of days should be understood. Basis that print the tree as it appears on the given day. Below are the rules that govern how the tree appears on a given day. Write a program to generate such a Christmas tree whose input is the number of days. Rules 1) If the tree is one day old, you cannot grow. Print the message "You cannot generate christmas tree" 2) Tree will die after 20 days. It should give a message "Tree is no more". 3) Tree will have one part less than the number of days. ...
Click to Continue...

Largest of Tenth Digit and Unit Digit

PKJ
 Coding Problem Keys   Largest of Tenth Digit and Unit Digit   Problem Statement  Given an integer N as input, the program must print the largest of the tenth digit and the unit digit in the integer N.  Boundary Condition(s)  10 <= N <= 9999999  Input Format  The first line contains the value of N.  Output Format  The first line contains the largest of the tenth digit and the unit digit in the integer N.  Example Input/Output 1   Input  5442  Output  4  Explanation  Tenth digit (4) is greater than unit digit (2).  Example Input/Output 2   Input  4567  Output  7  Explanation  Unit digit (7) is greater than tenth digit (6).  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= input () if (n[- 1 ]>n[- 2 ]): print (n[- 1 ]) else : print (n[- 2 ]) # Published By PKJC...
Click to Continue...

Flowchart Logic 065

PKJ
 Coding Problem Keys   Flowchart Logic 065   Problem Statement  Please fill in the lines of code to implement the logic present in the flowchart.  Example Input/Output 1   Input  8 30 9  Output  9 19 20  Example Input/Output 2   Input  16 49 3  Output  23 30 31 32 33 34 35 36 37 38 39 43  Note: Max Execution Time Limit: 50 millisecs   Solution   Programming Language: Python 3 Language  x,y,d= map ( int , input ().split()) while (x<=y): temp=x while (temp> 0 and temp% 10 !=d): temp//= 10 if (temp> 0 and temp% 10 ==d): print (x,end= " " ) x+= 1 # Published By PKJCODERS  Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main (){ int x,y,d,temp= 0 ; scanf( "%d%d%d" ,&x,&y,&d); while (x<=y){ temp=x; while (temp> 0 ...
Click to Continue...

Minimum Alteration String

PKJ
 Coding Problem Keys   Minimum Alteration String   Problem Statement  Given a set of N words, starting word and ending word, the words can be changed to obtain any one of the words in the given list of words by altering exactly one character and the target is to obtain the ending word with the minimum number of alterations starting with the starting word. Print the minimum number of alterations made to obtain the ending word.  Boundary Condition(s)  1 <= N <= 100 2 <= Length of words <= 100  Input Format  The first line contains N. The next N lines contain the list of words. The (N + 2)th line contains starting word The (N + 3)th line contains ending word  Output Format  The first line contains the minimum number of alterations made to obtain the ending word.  Example Input/Output 1   Input  4 pep pap pat pan pen pat  Output  2  Explanation  To change pen to pat. 4 alterations...
Click to Continue...