SQU IT Exit study materials
SQU IT Exit study resources

SQU IT Exit study plan

SQU IT Exit · Give each week a clear focus.

8 weeks · About 6 hours per week

Week 1

Programming Fundamentals and Problem Solving

  • Write 20 short programs from scratch covering variables, conditionals, loops, and functions without looking at reference solutions, then compare against a self-written checklist of expected behavior.

  • Trace 10 code snippets by hand on paper, predicting exact output line by line before running them, and log every mismatch with the reason for the error.

  • Explain the difference between pass-by-value and pass-by-reference in two languages you know by writing a working example of each that demonstrates the observable difference.

  • Build a personal error log of at least 8 bug types you personally produced (off-by-one, uninitialized variable, wrong operator precedence) with a one-line prevention rule for each.

Your checkpoint

A 20-program practice folder plus a one-page error-prevention cheat sheet covering at least 8 recurring bug patterns.

Week 2

Programming Fundamentals and Problem Solving & Data Structures and Algorithms

  • Solve 15 progressively harder problem-solving exercises (pseudocode first, then code) and record the decomposition steps you used for each.

  • Implement array and string manipulation routines by hand: reverse, rotate, deduplicate, and search, without using built-in library helpers.

  • Draw the memory layout of a stack and a queue after a sequence of 10 push/pop and enqueue/dequeue operations and verify against actual output.

  • Analyze 5 short algorithms and state their time and space complexity in Big-O notation with a one-sentence justification each.

Your checkpoint

A problem-solving notebook with 15 worked solutions showing pseudocode, code, and Big-O analysis for each.

Week 3

Data Structures and Algorithms

  • Implement singly linked lists, stacks, and queues from scratch with insert, delete, and traverse operations, then test each with at least 5 edge cases including empty and single-element structures.

  • Implement binary search and at least two sorting algorithms (one O(n log n), one O(n^2)) and count comparisons on best, average, and worst-case inputs.

  • Implement a hash table with collision handling and measure lookup performance as load factor increases.

  • Compare linear search versus binary search empirically on sorted inputs of 100, 10,000, and 1,000,000 elements and record the timing table.

Your checkpoint

A data structures code repository with a timing table proving the empirical complexity of at least 4 algorithms.

Week 4

Data Structures and Algorithms & Database Systems and SQL

  • Write 25 SQL queries against a self-created sample schema, covering SELECT, WHERE, GROUP BY, HAVING, ORDER BY, and aggregate functions.

  • Write and execute queries using INNER, LEFT, and SELF joins, and explain in writing why each returns the row set it does.

  • Design a normalized (3NF) schema for a small library or booking system and justify each table split against a denormalized alternative.

  • Implement 5 tree or graph traversals (BFS, DFS, and one recursive tree walk) and trace their visit order by hand before running.

Your checkpoint

A schema diagram plus a query file of 25 working SQL statements, each annotated with the expected result shape.

Week 5

Database Systems and SQL & Computer Networks and Security

  • Define primary, foreign, unique, and check constraints on your schema and demonstrate that each one rejects invalid data.

  • Write transactions that demonstrate COMMIT and ROLLBACK behavior, and explain ACID properties using your own examples.

  • Subnet 5 given IPv4 addresses into required host counts and verify each calculation against a subnet calculator.

  • Trace the path of an HTTP request from browser to server, naming the role of DNS, TCP handshake, TLS, and HTTP at each hop.

  • Identify and explain 5 common web vulnerabilities (SQL injection, XSS, CSRF, weak hashing, misconfigured permissions) and write one mitigation for each.

Your checkpoint

A constraints-and-transactions SQL script plus a one-page network request trace with a matching vulnerability-and-mitigation table.

Week 6

Operating Systems & Software Engineering and System Analysis

  • Describe process states and scheduling by drawing a state diagram and walking 4 processes through a round-robin schedule with a time slice.

  • Explain virtual memory, paging, and thrashing in your own words and give one scenario where each causes visible performance problems.

  • Practice 3 Linux command-line tasks (file permissions, process inspection, disk usage) and record the exact commands used.

  • Draft a requirements specification for a small system with 10 functional and 5 non-functional requirements, each testable and unambiguous.

  • Draw a use case diagram and one sequence diagram for your specified system and check that every functional requirement maps to at least one use case.

Your checkpoint

A requirements document with 15 numbered requirements and two UML diagrams, plus a command-line log of 3 completed OS tasks.

Week 7

Web and Mobile Application Development & Information Systems and IT Project Management

  • Build a small CRUD web application (front end, back end, and database) that consumes at least 3 REST endpoints and handles one error case visibly.

  • Implement client-side and server-side input validation and demonstrate that the server rejects a request the client would have blocked.

  • Explain the difference between responsive web layout and native mobile constraints, and apply one responsive breakpoint to your app.

  • Write a project charter for your app covering scope, 5 milestones, a risk register of 3 risks, and a simple effort estimate with assumptions stated.

Your checkpoint

A deployed or locally running CRUD application with a README, plus a one-page project charter with milestones and risk register.

Week 8

Professional Ethics, Communication, and Teamwork & Programming Fundamentals and Problem Solving & Data Structures and Algorithms & Database Systems and SQL

  • Prepare and deliver a 5-minute verbal explanation of one technical decision from your project, recorded and reviewed for clarity and structure.

  • Write 3 short professional email or status-update drafts covering a delay, a disagreement, and a handover, each under 150 words.

  • Complete a timed 60-question mixed mock exam across domains 1-3 and review every wrong answer to a root cause.

  • Resolve 2 ethical scenarios (data privacy conflict, credit for shared work) in writing using a stated decision framework.

  • Re-run your week 1 error log against your mock exam mistakes and update the prevention rules.

Your checkpoint

A recorded 5-minute technical talk, 3 professional writing samples, and a mock exam score report with root-cause notes for every error.

Milestones

Week 2: You can write a working program for a novel problem, including pseudocode and Big-O justification, in under 25 minutes without references.

Week 4: You can implement a linked list and a queue from scratch and write a multi-table SQL join query, both correct on the first attempt.

Week 6: You can explain process scheduling and virtual memory aloud in under 3 minutes and produce a testable requirements list for a new system.

Week 8: Mock exam score is at least 70% overall with no domain below 60%, and all three professional writing samples are complete.