code ai

AI at Your Desk

You have an office job, you are losing hours a week, and you do not care how any of this works. Four tasks from your own week, each done twice and timed. A fifth you should not have handed over. You finish with real work done and a page of your own numbers you can show someone.

  • trending_upBeginner
  • schedule7h 25m
  • menu_book12개 강의
  • publicEnglish
  • bolt무료 풀

개요

This segment is for the person who has been sold this three times already and is still doing the same job at the same speed. Nothing here needs a terminal, a key, a card or a line of code. A chat window, your own documents, and a stopwatch. Every exercise uses your own real work, and everything you produce in it is work you send. You start by measuring where your week actually goes, with no tools at all, because the hour most people lose is spent looking for things they already have and no model will find those for you. You learn to get an earlier version back, and something you deleted. Then you work out whether the assistant sitting inside the software your employer already pays for is worth turning on, what it really costs over three years rather than over the first discounted year, and which tier does the thing you actually want. Then the middle of the segment: four tasks out of your own week, each done twice, by hand and with help, both timed. The one you write every week. The long document you have to get through by Friday. The repetitive job you do forty times. And then the fifth task, which is the one you should not have used it for, and which is worth as much as the other four together. You take the details out before anything goes near a model. Every time, and it is said in every lesson that needs it, because your work has other people's names in it. By the end you have a written rule about what you will not hand over, one page holding the instructions that made the difference, and a before-and-after with real numbers that you have shown to somebody who could act on it. Segment A1 explains what the tool is doing when it answers you, and this one assumes it in a single sentence rather than repeating it. Segment A3 is the same argument for a whole company, with policies and controls. This one is about your own desk and your own Thursday.

강의 커리큘럼 · 4개 모듈

lock접근 시 이용 가능
  1. 01 Finding Your Own Things
    3개 강의·1h 27m

    There is no AI at all in this module and that is deliberate. The thing most people lose the most time to is not a model-shaped problem, and you will not believe that until you have timed your own…

  2. 02 The Assistant Where You Already Work
    3개 강의·1h 46m

    The in-place assistant is not a cleverer model. It is plumbing, and the reason it feels faster is that you stopped changing windows. Knowing that is what stops you paying for the wrong tier.

  3. 03 Your Own Week, Done Twice
    3개 강의·2h 30m

    Nothing in this module is an exercise. Every task is one you owed somebody this week, and every one of them gets sent. The deliverable is the pair: what you did by hand, and what you did with help.

  4. 04 The Fifth Task, and What You Keep
    3개 강의·1h 42m

    Modules 1 to 3 make you faster. This one is the one that keeps you employed. It ends with a written rule, one page, and real numbers shown to a real person.

자주 묻는 질문

AI at Your Desk에서 무엇을 배우나요?
You have an office job, you are losing hours a week, and you do not care how any of this works. Four tasks from your own week, each done twice and timed. A fifth you should not have handed over. You finish with real work done and a page of your own numbers you can show someone.
사전 경험이 필요한가요?
아니요 — AI at Your Desk은 기초부터 시작하며 초보자에게 적합해요.
AI at Your Desk은 얼마나 걸리나요?
AI at Your Desk은 4개 모듈과 12개 강의로 구성되어 있고, 자신의 속도로 학습할 수 있어요.
어떻게 접근하나요?
AI at Your Desk은 무료 풀에 포함되어 있어요 — 무료 계정을 만들고 컬렉션에 추가하세요.

프로그래밍의 다른 강의

Binary, Hex and Data Units
Beginner Binary, Hex and Data Units The topic that costs more marks than any other on the paper, taught by hand. Bits and bytes, binary and hex in all six directions, the 1000-versus-1024 trap, file sizes, transmission times, overflow, two's complement and character sets. Every module ends in a timed drill marked the way an examiner marks it.
Python From a White Sheet
Beginner Python From a White Sheet The exact sequence nine students have already walked, from a blank file to a program that asks questions, checks the answers and refuses bad input. No prior programming. No maths. You will break it repeatedly, on purpose.
First Program — Scratch for ages 5–9
Beginner First Program — Scratch for ages 5–9 Nine Scratch blocks, three sessions of about twenty-five minutes, and one small program a child of five to nine builds themselves. Written for the parent sitting beside them: what to click, what they will get stuck on, what to say when it goes wrong, and when to keep your hands off the mouse.
AI Without the Hype
Beginner AI Without the Hype What the model is actually doing when it answers you, why that produces something that looks like thinking, why it invents citations, and the cost mechanic almost nobody explains: a chat resends the entire conversation on every single turn. You will do the arithmetic yourself.
IGCSE and GCSE Computer Science — Theory That Actually Gets Marked
Intermediate IGCSE and GCSE Computer Science — Theory That Actually Gets Marked The theory half of the paper, taught so it survives the exam room. The memory hierarchy and what actually happens at boot. Compilers, interpreters and assemblers, including the answer that sounds right and scores nothing. Databases from a spreadsheet up to keys and normalisation. DNS and the full path between pressing Enter and seeing the page. Systems software, and the ethical and legal section that is the easiest ten marks on the paper.
Programming for the Exam — Python Answers That Score
Intermediate Programming for the Exam — Python Answers That Score The programming half of the paper, taught at exam pitch. Pseudocode translated both ways, because the mark scheme is written in a notation nobody practises. Trace tables done column by column, including the ones with a loop and a condition inside it. Linear and binary search, bubble and insertion sort, what each costs and the comparison questions boards love. Validation against verification, and the boundary test data everybody forgets. Procedures against functions, and a systematic method for finding your own error with four minutes left.