What is R's PlacePrep?

R's PlacePrep is a free, open-source placement preparation platform for engineering students. It provides company-wise previous year questions with detailed solutions, timed mock exams, university PYQs, and aptitude & coding practice for TCS NQT, Infosys IRT, Accenture, and more.

Is R's PlacePrep free to use?

Yes! R's PlacePrep is 100% free and open-source. All placement papers, mock exams, university PYQs, and solutions are accessible without any payment or subscription.

Which companies are covered on PlacePrep?

PlacePrep covers placement papers from TCS (NQT), Infosys (IRT), Accenture, Wipro, Cognizant (GenC), Capgemini, and more. Papers are organized by year and exam type with detailed solutions.

Does PlacePrep have mock exams?

Yes! PlacePrep offers timed mock exams that simulate real placement test conditions with fullscreen mode, anti-cheat measures, auto-submission, and instant evaluation with detailed performance reports.

Cognizant

Coding

Display Mode

Jump to Section

Practice Questions6

Export

Back to Cognizant

Cognizant coding

1 sections, 6 questions

Practice All (6)Sign in required

Practice Questions

Practice6 questions

Question 1

Fuel Consumption Calculator

Problem

Write a program to calculate the fuel consumption of a truck. The program should ask the user to enter the quantity of diesel filled and the distance covered until the tank goes dry. Calculate fuel consumption in liters per 100 km (European style), then convert to miles per gallon (US style). If quantity or distance is zero or negative, display "is an Invalid Input". (1 km = 0.6214 miles, 1 liter = 0.2642 gallons)

Example:

Input: liters = 20, distance = 150
Output:
Liters/100KM: 13.33
Miles/gallons: 17.64

Code

Java

import java.util.Scanner;
public class FuelConsumption {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double liters = sc.nextDouble();
        double distance = sc.nextDouble();

        if (liters <= 0 || distance <= 0) {
            System.out.println("Invalid Input");
            return;
        }

        double litersPer100Km = (liters / distance) * 100;
        double miles = distance * 0.6214;
        double gallons = liters * 0.2642;
        double milesPerGallon = miles / gallons;

        System.out.printf("Liters/100KM: %.2f%n", litersPer100Km);
        System.out.printf("Miles/gallons: %.2f%n", milesPerGallon);
    }
}

Python

liters = float(input())
distance = float(input())

if liters <= 0 or distance <= 0:
    print("Invalid Input")
else:
    liters_per_100km = (liters / distance) * 100
    miles = distance * 0.6214
    gallons = liters * 0.2642
    miles_per_gallon = miles / gallons
    print(f"Liters/100KM: {liters_per_100km:.2f}")
    print(f"Miles/gallons: {miles_per_gallon:.2f}")

Time: O(1)Space: O(1)

Question 2

Magic Board (ASCII to Character)

Problem

Ritik wants a magic board that displays a character for a corresponding number for his science project. When digits like 65, 66, 67, 68 are entered, the alphabets A, B, C, D should be displayed. Assume the number of inputs is always 4.

Example:

Input: 65666768
Output: 65-A66-B67-C68-D

Code

Java

import java.util.Scanner;
public class MagicBoard {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String digits = sc.next();
        StringBuilder result = new StringBuilder();
        int i = 0;
        while (i < digits.length()) {
            int code = Integer.parseInt(digits.substring(i, i + 2));
            result.append(code).append("-").append((char) code);
            i += 2;
        }
        System.out.println(result.toString());
    }
}

Python

digits = input().strip()
result = ""
i = 0
while i < len(digits):
    code = int(digits[i:i+2])
    result += f"{code}-{chr(code)}"
    i += 2
print(result)

Time: O(N)Space: O(N)

Question 3

Prime Numbers in a Range

Problem

Print all prime numbers in the interval [a, b] (both inclusive). Input 1 (a) should be lesser than Input 2 (b), and both should be positive; otherwise display "Provide valid input".

Example:

Input: a = 2, b = 15
Output: 2 3 5 7 11 13

Code

Java

import java.util.Scanner;
public class PrimesInRange {
    static boolean isPrime(int n) {
        if (n < 2) return false;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) return false;
        }
        return true;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        if (a <= 0 || b <= 0 || a >= b) {
            System.out.println("Provide valid input");
            return;
        }

        StringBuilder result = new StringBuilder();
        for (int i = a; i <= b; i++) {
            if (isPrime(i)) result.append(i).append(" ");
        }
        System.out.println(result.toString().trim());
    }
}

Python

def is_prime(n):
    if n < 2:
        return False
    i = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += 1
    return True

a, b = int(input()), int(input())
if a <= 0 or b <= 0 or a >= b:
    print("Provide valid input")
else:
    print(" ".join(str(i) for i in range(a, b + 1) if is_prime(i)))

Time: O((b-a) × √b)Space: O(1)

Question 4

Palindrome Checker

Problem

Given a number, reverse it and check if it is the same as the original. If yes, print "Palindrome"; if not, print "Not a Palindrome". If negative, print "Invalid Input".

Example:

Input: 21212
Output: Palindrome

Input: 6186
Output: Not a Palindrome

Code

Java

import java.util.Scanner;
public class PalindromeCheck {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long num = sc.nextLong();

        if (num < 0) {
            System.out.println("Invalid Input");
            return;
        }

        long original = num, reversed = 0;
        while (num > 0) {
            reversed = reversed * 10 + num % 10;
            num /= 10;
        }

        System.out.println(original == reversed ? "Palindrome" : "Not a Palindrome");
    }
}

Python

num = int(input())
if num < 0:
    print("Invalid Input")
else:
    if str(num) == str(num)[::-1]:
        print("Palindrome")
    else:
        print("Not a Palindrome")

Time: O(log N)Space: O(1)

Question 5

Salary Increment Based on Appraisal Rating

Problem

XYZ Technologies increments employee salary based on appraisal rating: rating 1-3 → 10% increment, 3.1-4 → 25% increment, 4.1-5 → 30% increment. If salary is zero/negative or rating is out of range [1, 5], display "Invalid Input".

Example:

Input: salary = 8000, rating = 3
Output: 8800

Input: salary = 7500, rating = 4.3
Output: 9750

Code

Java

import java.util.Scanner;
public class IncrementCalculation {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double salary = sc.nextDouble();
        double rating = sc.nextDouble();

        if (salary <= 0 || rating < 1 || rating > 5) {
            System.out.println("Invalid Input");
            return;
        }

        double incremented;
        if (rating <= 3) {
            incremented = salary * 1.10;
        } else if (rating <= 4) {
            incremented = salary * 1.25;
        } else {
            incremented = salary * 1.30;
        }

        System.out.println((long) incremented);
    }
}

Python

salary = float(input())
rating = float(input())

if salary <= 0 or rating < 1 or rating > 5:
    print("Invalid Input")
else:
    if rating <= 3:
        incremented = salary * 1.10
    elif rating <= 4:
        incremented = salary * 1.25
    else:
        incremented = salary * 1.30
    print(int(incremented))

Time: O(1)Space: O(1)

Question 6

Find Factors of a Number

Problem

Given a number, print all its factors in ascending order. If negative, ignore the sign and provide output. If zero, print "No Factors".

Example:

Input: 54
Output: 1, 2, 3, 6, 9, 18, 27, 54

Code

Java

import java.util.Scanner;
public class FindFactor {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long num = Math.abs(sc.nextLong());

        if (num == 0) {
            System.out.println("No Factors");
            return;
        }

        StringBuilder result = new StringBuilder();
        for (long i = 1; i <= num; i++) {
            if (num % i == 0) result.append(i).append(", ");
        }
        System.out.println(result.substring(0, result.length() - 2));
    }
}

Python

num = abs(int(input()))
if num == 0:
    print("No Factors")
else:
    factors = [str(i) for i in range(1, num + 1) if num % i == 0]
    print(", ".join(factors))

Time: O(N)Space: O(N)

import java.util.Scanner; public class FuelConsumption { public static void main(String[] args) { Scanner sc = new Scanner(System.in); double liters = sc.nextDouble(); double distance = sc.nextDouble(); if (liters <= 0 || distance <= 0) { System.out.println("Invalid Input"); return; } double litersPer100Km = (liters / distance) * 100; double miles = distance * 0.6214; double gallons = liters * 0.2642; double milesPerGallon = miles / gallons; System.out.printf("Liters/100KM: %.2f%n", litersPer100Km); System.out.printf("Miles/gallons: %.2f%n", milesPerGallon); } }

liters = float(input()) distance = float(input()) if liters <= 0 or distance <= 0: print("Invalid Input") else: liters_per_100km = (liters / distance) * 100 miles = distance * 0.6214 gallons = liters * 0.2642 miles_per_gallon = miles / gallons print(f"Liters/100KM: {liters_per_100km:.2f}") print(f"Miles/gallons: {miles_per_gallon:.2f}")

import java.util.Scanner; public class MagicBoard { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String digits = sc.next(); StringBuilder result = new StringBuilder(); int i = 0; while (i < digits.length()) { int code = Integer.parseInt(digits.substring(i, i + 2)); result.append(code).append("-").append((char) code); i += 2; } System.out.println(result.toString()); } }

import java.util.Scanner; public class PrimesInRange { static boolean isPrime(int n) { if (n < 2) return false; for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); if (a <= 0 || b <= 0 || a >= b) { System.out.println("Provide valid input"); return; } StringBuilder result = new StringBuilder(); for (int i = a; i <= b; i++) { if (isPrime(i)) result.append(i).append(" "); } System.out.println(result.toString().trim()); } }

def is_prime(n): if n < 2: return False i = 2 while i * i <= n: if n % i == 0: return False i += 1 return True a, b = int(input()), int(input()) if a <= 0 or b <= 0 or a >= b: print("Provide valid input") else: print(" ".join(str(i) for i in range(a, b + 1) if is_prime(i)))

import java.util.Scanner; public class PalindromeCheck { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long num = sc.nextLong(); if (num < 0) { System.out.println("Invalid Input"); return; } long original = num, reversed = 0; while (num > 0) { reversed = reversed * 10 + num % 10; num /= 10; } System.out.println(original == reversed ? "Palindrome" : "Not a Palindrome"); } }

import java.util.Scanner; public class IncrementCalculation { public static void main(String[] args) { Scanner sc = new Scanner(System.in); double salary = sc.nextDouble(); double rating = sc.nextDouble(); if (salary <= 0 || rating < 1 || rating > 5) { System.out.println("Invalid Input"); return; } double incremented; if (rating <= 3) { incremented = salary * 1.10; } else if (rating <= 4) { incremented = salary * 1.25; } else { incremented = salary * 1.30; } System.out.println((long) incremented); } }

salary = float(input()) rating = float(input()) if salary <= 0 or rating < 1 or rating > 5: print("Invalid Input") else: if rating <= 3: incremented = salary * 1.10 elif rating <= 4: incremented = salary * 1.25 else: incremented = salary * 1.30 print(int(incremented))

import java.util.Scanner; public class FindFactor { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long num = Math.abs(sc.nextLong()); if (num == 0) { System.out.println("No Factors"); return; } StringBuilder result = new StringBuilder(); for (long i = 1; i <= num; i++) { if (num % i == 0) result.append(i).append(", "); } System.out.println(result.substring(0, result.length() - 2)); } }

Cognizant

Display Mode

Jump to Section

Other Content

Export

Cognizant coding

Practice Questions

Fuel Consumption Calculator

Problem

Code

Magic Board (ASCII to Character)

Problem

Code

Prime Numbers in a Range

Problem

Code

Palindrome Checker

Problem

Code

Salary Increment Based on Appraisal Rating

Problem

Code

Find Factors of a Number

Problem

Code

Cognizant

Display Mode

Jump to Section

Other Content

Export

Cognizant coding

Practice Questions

Fuel Consumption Calculator

Problem

Code

Magic Board (ASCII to Character)

Problem

Code

Prime Numbers in a Range

Problem

Code

Palindrome Checker

Problem

Code

Salary Increment Based on Appraisal Rating

Problem

Code

Find Factors of a Number

Problem

Code