Area of Improvements

Review your assessments and practice — drill into each subject, then each attempt, then each question.

My AssessmentsMy Practice
Back to C Programming
C Programming · Round 1

Assessment Summary

Assesses your understanding of core C programming concepts, including data types, control structures, memory usage, and runtime behavior.

Knowledge
Developing
58/ 100
Delivery
Proficient
66/ 100
Sub-skill heatmap
Weakest first
Type casting45%
Keywords & identifiers60%
Constants & literals61%
Operators70%
Data types73%
Input/output (printf/scanf)76%
Confidence × Competence
Hesitant strong
Interview-ready
Early stage
Overconfident

Confident but shaky on fundamentals — revisit core concepts.

Delivery profile
Filler ratio
3.3%
Speech rate
133 wpm
Pause rate
6.3/min
Structure
84/100

Your delivery is well-structured and easy to follow. Trim filler words to sound even more polished.

Consistency
Swinging between 3 and 8/10
Q1Mean 51 · σ 17Q10
Top 3 priority actions
The only things to act on this week
  1. 1
    Revise Type castingKnowledge

    Lowest sub-skill at 45%. A focused 30-min refresher will lift your overall knowledge score.

  2. 2
    Slow down to 130–140 WPM for clarityDelivery

    You're at 133 WPM. Slowing slightly improves perceived confidence.

  3. 3
    Solve 3 problems on Keywords & identifiersKnowledge

    Second-weakest area at 60%. Active practice cements the concept.

Question-by-question review

Q1
Explain the primitive data types in C and walk through a real-world example.
Data typesMediumBloom: Analyze
3/5
Q2
What is the time complexity of a linear search over an array, and why?
OperatorsHardBloom: Analyze
2/4
Q3
Compare control structures (if/else vs switch) in C and discuss trade-offs.
Keywords & identifiersMediumBloom: Analyze
3/5
Q4
How would you debug a program where a pointer dereference is failing intermittently?
Constants & literalsHardBloom: Analyze
3/5
Q5
Design a small program that uses dynamic memory allocation as a core building block.
Type castingHardBloom: Apply
2/5
Q6
What are common pitfalls when working with arrays and pointers in C?
Input/output (printf/scanf)EasyBloom: Analyze
3/5
Q7
Walk me through how function calls and the call stack work in C, under the hood.
Data typesHardBloom: Analyze
3/5
Q8
When would you NOT use recursion in C? Give a concrete example.
OperatorsEasyBloom: Evaluate
3/4
Q9
Optimise a naive string-copy implementation step by step.
Keywords & identifiersMediumBloom: Analyze
3/5
Q10
How does shared mutable state in C interact with concurrency?
Constants & literalsMediumBloom: Apply
2/5