Scribd Logo
Upload

Welcome to Scribd!

  • 157 views

    Cognizant Coding Syllabus 2019 (Updated) : Type of Question Description

    Uploaded by

    prateek bharadwaj
    The document outlines the types of questions that may be asked in the Cognizant coding test, including debugging code to fix logical errors, correcting syntax errors, and writing new functionality by reusing existing functions. It also provides examples of code snippets with errors and the corrections needed to fix them, covering topics like loops, data types, conditionals, and functions.

    Copyright:

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

    Cognizant Coding Syllabus 2019 (Updated) : Type of Question Description

    Uploaded by

    prateek bharadwaj
    157 views7 pages
    The document outlines the types of questions that may be asked in the Cognizant coding test, including debugging code to fix logical errors, correcting syntax errors, and writing new functionality by reusing existing functions. It also provides examples of code snippets with errors and the corrections needed to fix them, covering topics like loops, data types, conditionals, and functions.

    Original Title

    CTS_coding

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document outlines the types of questions that may be asked in the Cognizant coding test, including debugging code to fix logical errors, correcting syntax errors, and writing new functionality by reusing existing functions. It also provides examples of code snippets with errors and the corrections needed to fix them, covering topics like loops, data types, conditionals, and functions.

    Copyright:

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

    Cognizant Coding Syllabus 2019 (Updated) : Type of Question Description

    Uploaded by

    prateek bharadwaj
    The document outlines the types of questions that may be asked in the Cognizant coding test, including debugging code to fix logical errors, correcting syntax errors, and writing new functionality by reusing existing functions. It also provides examples of code snippets with errors and the corrections needed to fix them, covering topics like loops, data types, conditionals, and functions.

    Copyright:

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

    Cognizant Coding Syllabus 2019 (Updated)

    Questions can be asked on topics such as:


    1. Basic programming
    2. Control Structures
    3. Conditional statements
    4. Linear data structures
    5. Advanced data structures
    6. Sorting and searching algorithm
    What cognizant is checking basically –
     Boundary value condition check
    o In many cases like in for loops, the boundary values may cause issues like writing
    for(i=0;i<n;i++) may give different result and for for(i=0;i<=n;i++) may give
    different results
     Knowledge of data sets like int, float, double etc.
    o In some code they may try to assign a mismatched data type value and that may
    cause error. Like forcefully putting string value in int.
     Knowing functions, precision values, signed and usigned int.
     You are required to fix all logical errors in the given code. You can click on Compile and
    Run anytime to check the compilation/execution status of the program.
     The submitted code should be logically/syntactically correct and pass all test cases. Do
    not write the main() function as it is not required.
     In some cases the function compiles successfully but fails to return the desired result
    due to logical errors. Your task is to debug the program to pass all the test cases.
     In some code writing cases you can Click on Helper Code tab to find out the details of
    functions/ classes provided for reuse.
    Type of question Description

    Logical The candidate is required to fix all logical


    errors in the given code.

    Compilation Candidate needs to correct the syntax of the


    given code without changing its logic.

    Code Reuse Candidates need to compare the given code by


    reusing existing functions.
    Cognizant Test pattern 2018 (on-campus)

    Sections Number of questions Time duration

    Quantitative Aptitude 16 16 mins

    Logical Reasoning 24 35 mins

    Verbal Ability 22 18 mins

    Automata Fix 7 20 mins

    Tentative pattern can be:


    In the new Cognizant – AMCAT test pattern changes have occurred. Here are they:

    Sections Time No of questions

    Aptitude(Quant) 25 min 25

    Logical 35 min 25

    Verbal 20 min 22

    Automata Fix 20 min 7


    AUTOMATA FIX

     In CTS test, 7 Automata fix questions (5 debugging & 2 partial code) are to be answered in 20
    minutes.
     A set of programs will be given, where students have to either debug erroneous code and fix
    it or write new functionality based on the given functions and code.
     It tests the candidate’s skill of being able to understand code written by someone else, be
    able to find bugs and also use the code to implement new functionality.
    1) Check for syntax error/ logical error and correct the error to get the desired
    output.
    Given n, print from n to 0
    int main()
    {
    int n;
    scanf(“%d”, &n);
    unsigned int i = n;
    while(i >= 0)
    {
    printf(“%d\n”, i);
    i–;
    }
    return 0;
    }
    Input: 4
    Output: Infinite loop

    Answer: Error – Logical error


    unsigned int i = n; unsigned integer ranges from 0 to 65535, which will be taken in
    the cyclic order. So i– will keep repeating in a cyclic way. The loop will never be
    terminated. So it should be written as int i = n;

    2) Find the factorial of a given number.


    int main()
    {
    long int fact = 1, n, i;
    scanf(“%d”, &n);

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


    {
    fact = fact * i;
    }
    printf(“%d”, fact);
    return 0;
    }
    Input: 20
    Output: -2102132736

    Answer: Error – Logical error


    The fact and n are declared as long int, so in scanf and printf %ld should be used
    in place of %d.

    3) Check whether the below program print the below pattern


    1111
    222
    33

    void main()
    {
    int i, j, n;
    scanf(“%d”, &n);
    for(i = 1; i<n; i++)
    {
    for(j = 1; j<n; j++)
    {
    printf(“%d”, i);
    }
    printf(“\n”);
    }
    }
    Input: 3
    Output:
    111
    222
    333
    Answer: Error: Logical error
    The inner for loop has to be written in this way: for(j = i-1; j<n; j++)

    4) Find the greatest of three numbers.


    int main()
    {
    int num1, num2, num3;
    scanf(“%d %d %d”, &num1,&num2,&num3);
    if (num1 > num2) && (num1 > num3)
    {
    printf(“%d”, num1);
    }
    elseif(num2>num3)
    {
    printf(“%d”, num2)
    }
    else
    {
    printf(“%d”, num3);
    }
    return 0;
    }
    Answer: Error: Syntax error
    if (num1 > num2) && (num1 > num3) à it has to be written as if ((num1 > num2)
    && (num1 > num3)) and this line elseif(num2>num3) should be rewritten as else
    if(num2>num3)

    5) Fix the error, recompile and match against the output provided.
    int main(void)
    {
    printf(“This is a \”buggy” program\n”);
    return 0;
    }

    Corrected program:
    int main(void)
    {
    printf(“This is a \”buggy\” program\n”);
    return 0;
    }
    6) Code reuse: Convert Binary to Decimal by using the existing function.
    void binarytodecimal(number)
    {
    // Type your code here
    }
    void main()
    {
    int num;
    scanf(“%d”, &num);
    printf(“%d”, binarytodecimal(num);
    }

    Answer:
    void binarytodecimal(number)
    {
    int dval=0, base=1, rem;
    while(number > 0)
    {
    rem = number % 10;
    dval = dval + rem * base;
    num = number / 10;
    base = base * 2;
    }
    return dval;
    }

    7) Print the prime numbers from an array up to given value n by using existing
    function.
    int isprime(int num)
    {
    // type your code here
    }
    int main()
    {
    int n, m, arr[100], size=0, i;
    scanf(“%d”, &n);
    for(m = 2; m <= n; m++)
    {
    if(isprime(m))
    {
    arr[size++]= m;
    }
    }
    for(i = 0; i < size; i++)
    {
    printf(“%d\n”, arr*i+);
    }
    return 0;
    }

    Answer:
    int isprime(int num)
    {
    int i;
    int isprime = 1;
    for(i = 2; i <= num / 2; i++)
    {
    if(num % i == 0)
    {
    isprime = 0;
    break;
    }
    }
    return isprime;
    }

    You might also like