Area of Improvements

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

My AssessmentsMy Practice
Back to topic
C Programming · Data types · Round 1

Assessment Summary

Round 1 assessment focused on Data types. Mix of recall, application, and analysis questions.

Knowledge
Developing
58/ 100

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