The intelligent student OS

Your semester, solved before it starts.

Six tabs, a syllabus nobody reads twice, deadlines you are already behind on. Nexora pulls the whole mess out of Brightspace, reads the rules that decide your grade, and turns your lectures into something you can study.

Free while you study. No card.

6course pages, one workspace
4AI passes per outline
12/12grading patterns handled
<60sfrom upload to your real grade

01 — Sync

Six tabs become one timeline.

The extension reads every course you are enrolled in, then keeps deadlines, announcements and lecture files current without you opening Brightspace again.

Auto-sync · 8 minutes ago4 courses
SYSC 1006 — FoundationsBrightspace
MATH 1104 — Linear AlgebraBrightspace
ECOR 1042 — DesignBrightspace
PSYC 1001 — Intro PsychBrightspace
Today Lab 7 reportSYSC 1006Due 6pm
Thu Quiz 4 — MatricesMATH 11043 days
Oct 18 MidtermSYSC 10062 weeks
Oct 21 Design briefECOR 10423 weeks

02 — Grades

It reads the paragraph that decides your grade.

Best ten of twelve labs. A final you must reach 50% on whatever your total says. A second scheme that only opens above C-. Every calculator ignores these. Nexora extracts them and does the arithmetic properly.

SYSC 1006 · outline.pdfConfidence 100%
To pass the course, students must pass the final examination (at least 50%), and achieve at least 4/10 on the lab component. If the letter grade under Scheme 1 is C- or higher, a second mark is calculated. The final grade is the higher of the two. Assignments (best 2 of 3) · Labs (best 10 of 12) · Bonus: Participation 4%
Assignmentsbest 2 of 3 · min 4/1010%
Labsbest 10 of 12 · min 4/1010%
Midterm20%
Final exammust reach 50%60%
Participationbonus, added on top+4%
Base weight 100+4 achievable

03 — Study

Your lectures, turned into practice.

Point at any deck you have synced. Everything below was written from it, and every card carries the slide it came from, so you can check it rather than trust it.

Flashcard

What is a binary search tree?

An ordered tree where every left child is smaller than its parent and every right child is larger.

SYSC 1006 · Lecture 07 · Slide 14
Quiz

Which traversal visits the left subtree first?

APre-order
BIn-order
CPost-order
Answer explained · Slide 22
Summary

Tree traversals

Three depth-first orders differ only in when the node is visited relative to its children. Level-order is breadth-first and needs a queue.

4 key concepts · Slides 11–24

04 — In order

Every course in order, in week one.

The mess you started with, stacked and sorted — so you know where you stand now, not in April when the arithmetic finally catches up with you.