Member Avatar for Qazi_1

Hi guys,
Tomorrow is my theory paper exam of C++ OOP and Data Strucutre. Paper will be based on 50% theory Q/A and 50% on coding implentaion.
Can you give me some hints to prepare for this coming exam?
PS. I have gone throw all lectures slides and course material, but you know what I am asking for, how can I prepare my se;f to do 100% job?

Thanks,
Regards,
Umer Jamil.

Edited by Qazi_1 because: some spelling mistakes
  • 2 Contributors
  • 1 Reply
  • 277 Views
  • 56 Minutes Discussion Span
  • Latest Post Latest Post by mathijs

Dani AI

Generated

A compact, last‑day plan that builds on what already did and on 's point: focus on understanding connections rather than rote memorization, and split remaining time between concise theory checks and short coding drills.

Theory quick checks (write one short note for each item)

  • OOP: class vs. struct, access specifiers, inheritance types, virtual functions, polymorphism, abstract classes, constructors/destructors, copy semantics (rule of three/five), RAII/smart pointers.
  • Data structures: operation definitions and Big‑O for array, linked list, stack, queue, BST, heap, hash table, graph.
  • Algorithms: DFS/BFS, common sorts (quick/merge/heap) and when each is appropriate, binary search, tree traversals.
  • Complexity: best/worst/average cases and simple amortized examples (dynamic array push_back).

Short coding drills (write by hand, then type if time)

  • Implement push/pop for stack (array or linked list).
  • Reverse a singly linked list (iterative).
  • Insert/search in a BST and write inorder traversal.
  • BFS on adjacency list; know edge‑case inputs (empty, single node).
  • Practice one small STL solution (vector, map) and state its complexity.

Example snippet for a common question (reverse a singly linked list)

Node* reverse(Node* head) {
    Node* prev = nullptr;
    while (head) {
        Node* next = head->next;
        head->next = prev;
        prev = head;
        head = next;
    }
    return prev;
}

Exam technique (practical scoring moves)

  • Skim the paper, pick easy theory questions first. For each theory answer: give a short definition, a one‑line example, and state complexity if relevant.
  • For coding: start with a function signature + short plan or invariant, handle edge cases, then code. Clear comments and a quick test case often earn partial credit.
  • Watch common traps: off‑by‑one, null pointers, shallow vs deep copy, and resource leaks.
Member Avatar for mathijs

It's hard for us to know what your teacher put emphasis on.

I would say that in general it is always very important to know the connections between the different parts of your theory. Don't just study it by heart, know how it relates to itself. Speaking for my experience, most teachers will ask questions that go beyong just reproducing the theory but that focus on understanding the theory and relating it to other parts of the theory.

Basicly you would have to feel like you understand the course not that you can reproduce the course.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.