logo-home
logo

Big o notation - Study guides, Class notes & Summaries

Looking for the best study guides, study notes and summaries about Big o notation? On this page you'll find 218 study documents about Big o notation.

Page 2 out of 218 results

Sort by:

Algorithm Design (Kleinberg & Tardos): Comprehensive Solutions Manual and Analysis Algorithm Design (Kleinberg & Tardos): Comprehensive Solutions Manual and Analysis

  • Exam (elaborations)

    Algorithm Design (Kleinberg & Tardos): Comprehensive Solutions Manual and Analysis

  • -
    -
    -
    283
    October 2025
    2025/2026
    A+
  • This document provides detailed, step-by-step solutions and comprehensive analysis for the exercises and problems found in the globally-recognized textbook, Algorithm Design by Jon Kleinberg and Éva Tardos. The manual covers fundamental concepts and advanced topics essential for competitive programming and university-level computer science, including: Core Design Paradigms: Detailed walkthroughs of solutions involving Greedy Algorithms, Divide and Conquer, and Dynamic Programming. Adva...
  • NurseBernie
    $17.99 More Info
Data Structures Complete PDF Notes | Algorithms, Trees, Graphs, Sorting | Exam Study Guide

  • Class notes

    Data Structures Complete PDF Notes | Algorithms, Trees, Graphs, Sorting | Exam Study Guide

  • -
    -
    -
    176
    March 2026
    2025/2026
  • Comprehensive Data Structures PDF Notes designed for Computer Science and Software Engineering students preparing for exams, quizzes, and technical interviews. These notes clearly explain core data structure concepts with definitions, examples, and algorithm breakdowns — perfect for understanding theory and improving problem-solving skills. Topics typically covered include: Arrays & Strings Linked Lists Stacks & Queues Recursion Trees (Binary Trees, BST, Traversals) Hea...
  • lectjohnson
    $13.99 More Info
COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS

  • Exam (elaborations)

    COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS

  • Available in bundle
    -
    -
    -
    8
    July 2025
    2024/2025
    A+
    Available in bundle
  • COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS What is the run-time efficiency of the following program? for(i = 1; i <= n; i++) printf("%d", i); - Answer -O(n) Calculate the run-time efficiency of the following program segment for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= n; k++) printf("%d %d %dn", i, j, k); - Answer -O(n^3) If the algorithm doIT has an efficiency factor of 5n, calculate the runtime efficiency of ...
  • mercylynneh
    $12.49 More Info
COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS

  • Exam (elaborations)

    COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS

  • Available in bundle
    -
    -
    -
    8
    July 2025
    2024/2025
    A+
    Available in bundle
  • COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS What is the run-time efficiency of the following program? for(i = 1; i <= n; i++) printf("%d", i); - Answer -O(n) Calculate the run-time efficiency of the following program segment for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= n; k++) printf("%d %d %dn", i, j, k); - Answer -O(n^3) If the algorithm doIT has an efficiency factor of 5n, calculate the runtime efficiency of ...
  • mercylynneh
    $12.49 More Info
Data Structures and Algorithms Question Bank | Complete DSA Exam Practice & Interview Prep Guide

  • Exam (elaborations)

    Data Structures and Algorithms Question Bank | Complete DSA Exam Practice & Interview Prep Guide

  • -
    -
    -
    28
    January 2026
    2025/2026
    A+
  • Access the Data Structures and Algorithms Question Bank, a comprehensive collection of exam-style and interview-focused questions with solutions covering all core DSA topics. Includes arrays, linked lists, stacks, queues, trees, graphs, hashing, sorting, searching, recursion, and dynamic programming. Ideal for computer science students, software engineering exams, and technical interview preparation, this resource strengthens problem-solving skills, algorithmic thinking, and time complexity anal...
  • eNerd
    $18.49 More Info
WGU C949 Objective Assessment (Latest 2026/ 2027 Update) Data Structures and Algorithms I Review | Verified Questions & Answers | Grade A

  • Exam (elaborations)

    WGU C949 Objective Assessment (Latest 2026/ 2027 Update) Data Structures and Algorithms I Review | Verified Questions & Answers | Grade A

  • Available in bundle
    -
    -
    -
    51
    March 2026
    2025/2026
    A+
    Available in bundle
  • WGU C949 Objective Assessment (Latest 2026/ 2027 Update) Data Structures and Algorithms I Review | Verified Questions & Answers | Grade A 2026/2027 | GRADED A+ | 100 out of 100 Question: Which statement describes a queue data structure? Answer It is a sequence of elements in which insertions can take place only at the back end and deletions can take place only at the front end. Question: Which data structure allows inserting and deleting data elements at both the front and th...
  • ProfGoodlucK
    $13.99 More Info
COEN 12 Final Exam (45 Questions) – Algorithms, Hashing, Linked Lists, Trees – Santa Clara University

  • Exam (elaborations)

    COEN 12 Final Exam (45 Questions) – Algorithms, Hashing, Linked Lists, Trees – Santa Clara University

  • Available in bundle
    -
    -
    -
    11
    September 2025
    2025/2026
    A+
    Available in bundle
  • This document provides a complete and accurate set of 45 final exam questions and answers for COEN 12: Data Structures, covering essential topics in computer science and engineering. It includes a wide range of conceptual and technical questions on algorithm analysis (Big-O notation), runtime efficiency, hash table operations (linear and quadratic probing), linked lists (singly and doubly linked, sorted and unsorted), binary search trees, AVL trees, binary heaps, and graph representations. Also ...
  • PROFFKERRYMARTIN
    $15.99 More Info
COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS

  • Exam (elaborations)

    COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS

  • Available in bundle
    -
    -
    -
    8
    June 2025
    2024/2025
    A+
    Available in bundle
  • COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS What is the run-time efficiency of the following program? for(i = 1; i <= n; i++) printf("%d", i); - Answer -O(n) Calculate the run-time efficiency of the following program segment for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= n; k++) printf("%d %d %dn", i, j, k); - Answer -O(n^3) If the algorithm doIT has an efficiency factor of 5n, calculate the runtime efficiency of ...
  • AdelineJean
    $12.49 More Info
Computer Science Praxis Study Guide Questions and Answers Latest Version Graded A+

  • Exam (elaborations)

    Computer Science Praxis Study Guide Questions and Answers Latest Version Graded A+

  • Available in bundle
    -
    -
    -
    58
    May 2025
    2024/2025
    A+
    Available in bundle
  • Computer Science Praxis Study Guide Questions and Answers Latest Version Graded A+ What is the difference between a compiler and an interpreter? A compiler translates the entire source code into machine code before execution, while an interpreter translates and executes code line-by-line. How does a binary search algorithm work? It repeatedly divides a sorted list in half to find a target value efficiently. What is the purpose of a data structure? To organize and store data e...
  • StellarScores
    $12.49 More Info
IT C950 Task 2 – WGUPS Routing Program Write-Up | WGU | Complete & Verified Submission

  • Exam (elaborations)

    IT C950 Task 2 – WGUPS Routing Program Write-Up | WGU | Complete & Verified Submission

  • -
    -
    -
    15
    June 2025
    2024/2025
    A+
  • This document provides a fully completed and well-structured Task 2 write-up for the WGUPS Routing Program project in IT C950 – Data Structures and Algorithms II at Western Governors University (WGU). It includes algorithm analysis, Big-O notation justification, data structure rationale, and performance optimization discussion—all aligned with course requirements and evaluation standards. Perfect for reference or preparation before submitting your own write-up.
  • writingassistunlimited
    $15.99 More Info
Want to regain your expenses?
How much did you already spend on Stuvia? Imagine there are plenty more of you out there paying for study notes, but this time YOU are the seller. Ka-ching!
Learn more Get started