Author: Study Clue

If an algorithm does 3n² + 10n + 50 operations, its Big-O is A O(n) B O(n log n) C

When an algorithm is O(n log n), it usually combines A Two nested loops B Constant work only C Random

In a singly linked list, inserting a node after a given node mainly requires updating A Head reference B Next

When choosing between two data structures, the best first step is to compare their A Screen output B Font settings

When the input size doubles, Big-O mainly helps you predict A Growth of work B Exact seconds C Screen brightness

In Big-O analysis, constants are usually ignored because A Growth matters most B They are always zero C Memory is

When designing a program for fast repeated lookups, the main benefit of using a suitable data structure is A Better

In a linked list, each element is stored as a A Sector B Node C Record D Block Explanation A

A data structure is best defined as A A) Programming language rule B C) Computer hardware component C B) Organized

In C, which statement about fgets vs scanf(“%s”) is most correct A scanf reads full line B fgets ignores ‘\n’