FE Electrical Exam: Where Engineers Fail at Big-O Notation

Algorithms and software is Section 17 of the FE Electrical and Computer exam — and it is one of the most feared sections for power and electrical engineers who have little programming background. In this video, Wasim walks through three real student questions from FE Electrical live training covering pseudocode analysis, loop syntax and Big O complexity. No programming experience required. WHAT YOU WILL LEARN: - Why the FE Electrical exam does not require knowledge of a specific programming language like Java, C++ or C# - What the FE Reference Handbook provides for syntax and how to use it on exam day - Pseudocode dry run walkthrough — for loop with n++ syntax trap explained step by step - Why n++ causes values to skip (1, 3, 9, 512) and how to track it correctly - Second pseudocode problem — while loop with i = i x 2 and why intermediate values are skipped (1, 2, 4, 8, 16) - Big O complexity analysis — why you must always use very large values of n when comparing algorithm efficiency - How to compare n squared vs n squared log n for large values of n - Sorting algorithms to know: bubble sort, insertion sort, merge sort, quicksort - Data structures to know: arrays, linked lists, queues, stacks - How to approach algorithms as dry runs and become confident on exam day FREE RESOURCES — START HERE: FREE FE ELECTRICAL EXAM WEBINAR — 3-step framework to pass in 3-5 months: https://www.studyforfe.com/fe-electrical-exam-prep/webinar/ FREE FE ELECTRICAL EXAM PLANNER (PDF): https://www.studyforfe.com/fe-electrical-exam-prep/free-downloads/ CHAPTERS: 0:00 — Why Algorithms Trips Up FE Electrical Candidates 0:20 — Section 17: Software Engineering in FE Exam Spec 0:46 — Syntax: What the FE Reference Handbook Provides 1:16 — Problem 1: Pseudocode Dry Run — For Loop with n++ 2:02 — The n++ Syntax Trap Explained 3:16 — Dry Run Walkthrough: Loop 1, Loop 2, Loop 3 5:49 — Why the Answer is 512 — Loop Exit Condition 6:57 — What the FE Reference Handbook Says About Syntax 7:47 — No Specific Language Required — Any Pseudocode Works 8:19 — Sorting Algorithms and Data Structures to Know 9:13 — Problem 2: While Loop with i = i x 2 10:10 — Why Intermediate Values Are Skipped 11:31 — Becoming Comfortable With Pseudocode Dry Runs 13:00 — Problem 3: Big O Complexity Analysis 13:48 — Why Small Values of n Give Wrong Big O Conclusions 14:05 — Always Use Large n for Big O Comparison RELATED VIDEOS: - KCL Nodal Analysis Explained Step-by-Step: https://youtu.be/7C8_ySaa-So - Superposition Theorem Deep Dive: https://youtu.be/pSbuSXw3Lls - 5 Most Important FE Electrical Sections: [upcoming] - Why is FE Electrical Exam Challenging: [upcoming] ENROLL IN THE COURSE: FE Electrical Exam Prep — Up to 10% off Live Training Bundles: https://www.studyforfe.com/#pricing_options PE Power Exam Prep — Up to 10% off Live Training Bundles: https://www.studyforfe.com/pe-power-exam-prep/#pricing_options ABOUT WASIM ASGHAR: Licensed Professional Engineer (PE) in the US and Canada with over 10 years of consulting experience. Author of multiple FE Electrical and PE Power exam preparation books. Wasim has helped thousands of engineers pass the FE Electrical and Computer exam and PE Power exam on their first attempt using a first-principles teaching approach. MY BOOKS: FE Electrical and Computer Exam Study Guide: https://amzn.to/3VVxeUn PE Electrical and Computer Exam Study Guide: https://amzn.to/4cy42bI #feexam #electricalengineering #algorithms #softwareengineering #studyforfe Website: https://www.studyforfe.com Facebook: https://www.facebook.com/studyforfe/ Subscribe: https://bit.ly/2TLAq7E Managed by Rohogaka, Inc. (www.rohogaka.com)