Start NorthStar
☰

Placement Assessment

Discover Your C++ Level

C++ readiness for CCC-style learning. This assessment helps students and parents understand current strengths, gaps, and the next realistic learning step.

Start the Quiz

100

Total points

20

Multiple-choice questions

8

Coding problems

C++17

Recommended standard

Section A

Section A: Multiple-Choice Check

20 questions, 2 points each. Click the score button before continuing so the final submission includes the Section A result.

A1. Variable Types

Which declaration correctly stores the value 3.75?

A2. Integer Division

What is printed?

int a = 17;
int b = 5;
cout << a / b;

A3. Remainder

What is the value of 23 % 6?

A4. Boolean Expression

Assume x = 8. Which expression evaluates to true?

A5. Conditional Logic

What is printed?

int score = 74;
if (score >= 80)
    cout << "A";
else if (score >= 70)
    cout << "B";
else
    cout << "C";

A6. For Loop

How many times does this loop run?

for (int i = 2; i <= 10; i += 2) {
    cout << i << " ";
}

A7. While Loop

What is printed?

int n = 3;
while (n > 0) {
    cout << n;
    n--;
}

A8. String Indexing

What is printed?

string word = "coding";
cout << word[2];

A9. Function Return Value

What is printed?

int square(int x) {
    return x * x;
}
cout << square(4) + 1;

A10. Pass by Reference

What is printed?

void addOne(int& x) {
    x++;
}
int n = 5;
addOne(n);
cout << n;

A11. Vector Size

What is printed?

vector<int> nums = {4, 7, 9};
nums.push_back(12);
cout << nums.size();

A12. Range-Based Loop

What is printed?

vector<int> nums = {2, 5, 3};
int total = 0;
for (int x : nums) {
    total += x;
}
cout << total;

A13. Sorting a Vector

What is the vector after this code runs?

vector<int> nums = {8, 2, 5, 2};
sort(nums.begin(), nums.end());

A14. Finding a Value

What does this condition check?

if (find(nums.begin(), nums.end(), 7) != nums.end())

A15. Set

What is printed?

set<int> values;
values.insert(4);
values.insert(2);
values.insert(4);
cout << values.size();

A16. Map

What is printed?

map<string, int> points;
points["Ana"] = 3;
points["Ben"] = 5;
points["Ana"] += 2;
cout << points["Ana"];

A17. Queue

What is printed?

queue<int> q;
q.push(10);
q.push(20);
q.push(30);
q.pop();
cout << q.front();

A18. Stack

What is printed?

stack<char> s;
s.push('A');
s.push('B');
s.push('C');
s.pop();
cout << s.top();

A19. Complexity

What is the usual time complexity of searching an unsorted vector one element at a time?

A20. Bounds and Data Types

Which type is the safest standard choice for a value as large as 10^15?

Before you continue: check Section A score

After answering the multiple-choice questions, save the calculated score for final submission.

Section A score is not checked yet.

Section B

Section B: Coding Fundamentals

Use the C++ workspace to test, then paste the final C++17 code into each problem’s Solution box.

B1

Sum of Positive Even Numbers

8 points

You are given N integers. Print the sum of all numbers that are both positive and even.

Input

The first line contains N. The second line contains N integers.

Output

Print one integer: the required sum.

Constraints

  • 1 <= N <= 100
  • -1000 <= value <= 1000
Sample Input

6
-2 4 7 10 0 3
Sample Output

14

B2

Normalized Vowel Count

8 points

You are given one line of text. Count how many characters are vowels. Both uppercase and lowercase vowels count. The vowels are a, e, i, o, and u.

Input

One line containing up to 200 characters.

Output

Print the number of vowels.

Constraints

  • Input length <= 200
Sample Input

Accel Thinking
Sample Output

4

B3

Distinct Scores in Sorted Order

8 points

You are given N student scores. Print each distinct score once in increasing order.

Input

The first line contains N. The second line contains N integers.

Output

Print the distinct scores in increasing order, separated by single spaces.

Constraints

  • 1 <= N <= 1000
  • 0 <= score <= 100
Sample Input

8
80 70 80 95 70 60 95 85
Sample Output

60 70 80 85 95

B4

Most Frequent Word

8 points

You are given N lowercase words. Print the word that occurs most often and its frequency. If several words tie, print the alphabetically smallest word.

Input

The first line contains N. The next N lines each contain one lowercase word.

Output

Print the selected word and its frequency, separated by one space.

Constraints

  • 1 <= N <= 1000
  • Each word has 1-20 lowercase English letters
Sample Input

7
apple
pear
apple
banana
pear
pear
apple
Sample Output

apple 3

Section C

Section C: CCC-Similar Problems

These original problems measure problem interpretation, edge cases, STL usage, and efficient implementation.

C1

Direction Decoder

J3 similar, 6 points

A delivery robot receives four-digit instruction codes. The first two digits determine direction and the last two digits are distance. If their sum is divisible by 3, turn left. Otherwise, if the sum is even, turn right. Otherwise, continue in the previous direction. For the first instruction, continue means forward. Stop at 0000.

Input

Several four-character codes, one per line, followed by 0000.

Output

For each instruction, print the direction and the distance as an integer.

Constraints

  • Each code has four digits
  • Do not process 0000
Sample Input

1205
3412
2210
0000
Sample Output

left 5
left 12
right 10

C2

Club Schedule

J4 similar, 6 points

A coding club runs for D days. A schedule character is A, M, or L. Earn 2 points for A, 1 point for L, and a bonus of 3 points for every consecutive pair where both days are not M.

Input

The first line contains D. The second line contains a string of length D using A, M, and L.

Output

Print the total score.

Constraints

  • 1 <= D <= 100000
Sample Input

6
AALMAL
Sample Output

17

C3

Signal Groups

J5 similar, 8 points

A monitoring system records N integer signal values. For each distinct value, its span is last position minus first position. Print the sum of spans of all distinct values.

Input

The first line contains N. The second line contains N integers.

Output

Print the instability score.

Constraints

  • 1 <= N <= 200000
  • -10^9 <= signal value <= 10^9
Sample Input

8
5 2 5 3 2 5 3 3
Sample Output

12

C4

Connected Classrooms

S2 similar, 8 points

There are N classrooms and M two-way hallways. For each query, print CONNECTED if two classrooms are in the same connected group, otherwise print NOT CONNECTED.

Input

The first line contains N and M. The next M lines contain hallway pairs. The next line contains Q. The next Q lines contain query pairs.

Output

Print one answer per query.

Constraints

  • 1 <= N <= 200000
  • 0 <= M <= 200000
  • 1 <= Q <= 200000
Sample Input

6 3
1 2
2 3
5 6
4
1 3
1 4
5 6
3 6
Sample Output

CONNECTED
NOT CONNECTED
CONNECTED
NOT CONNECTED

Online Coding

C++ Practice Workspace

Submission reminderCode inside the OneCompiler editor is not automatically sent to Accel Thinking. Please copy the final code for each coding problem into that problem’s Solution box, then submit the full assessment.

Complete & Submit All

Review saved coding solutions, add contact details, and submit the full C++ assessment to Accel Thinking. A copy will be sent to the evaluator email.

CCC Junior Club

CCC Junior Club 2026-2027

A structured pathway for CCC Junior preparation: C++ foundations, fundamental DSA, weekly practice, and guided review.

View Club Details

Placement Model

Recommended Score Bands

0-20C++ Explorer

C++ Introduction

21-40C++ Beginner

C++ Foundations

41-60C++ Builder

C++ Core + STL

61-80C++ Problem Solver

CCC Junior J3-J4 Preparation

81-100C++ Competitive Programmer

CCC Junior J5 / Senior S1-S2 Preparation

Related Learning

Continue exploring related learning paths.

These related pages help students and parents move from interest to the right next step.

CCC Junior ClubView next stepCP AcademyView next stepPython AssessmentView next step

Scroll to Top