42 Exam Rank 03 [cracked] [PRO]

This guide covers the curriculum, the specific logic required, the common pitfalls, and a walkthrough of the mandatory "print_next" assignment.

---

5.1 do_op

A program that takes three arguments: value1 operator value2. 42 Exam Rank 03

• Example: ./do_op 10 + 5 outputs 15.
• Challenge: Parsing strings to integers (atoi) and using a switch/if-else structure for operators.

The Core Structure of the Rank 03 Shell

You don't need pipes (|) or redirections (>). You only need to handle absolute paths (/bin/ls) and relative paths (ls), plus the built-in cd and exit. This guide covers the curriculum, the specific logic

Here is the mental template you need to have memorized: Example:

1. Read: rl-clear-history(); line = readline("> "); (You must handle EOF/Ctrl+D).
2. Parse: split(line, ' ') to create a char **argv.
3. Built-ins:
   • If argv[0] == "cd", use chdir(argv[1]).
   • If argv[0] == "exit", free and return.
4. Execution:
   • pid = fork()
   • Child: execve(full_path, argv, envp). If it fails, print "command not found".
   • Parent: waitpid(pid, &status, 0)
5. Loop.

My Hour-by-Hour Exam Plan

• Hour 0 - 0:30: Read the subject 3 times. Identify if the shell requires pipes. (Usually, it doesn't for Rank 03, but verify!)
• Hour 0:30 - 1:30: Write the skeleton. main loop, readline, add_history, split.
• Hour 1:30 - 2:30: Implement cd and exit. Make sure chdir works.
• Hour 2:30 - 3:30: Implement fork and execve. Struggle with envp (you need the global environment variable passed to main).
• Hour 3:30 - 4:00: Fix memory leaks (Valgrind is your friend) and handle empty spaces (e.g., user just presses Enter).