I85PREP
⌘ K
NYSTCE 074 study materials
NYSTCE 074 study resources

NYSTCE 074: Content Knowledge and Skills for NYSTCE Computer Science (074)

NYSTCE 074 · Work through your exam, one topic at a time.

All guide sections

Content Knowledge and Skills for NYSTCE Computer Science (074)

This domain samples the computer science content and pedagogical content knowledge tested on the NYSTCE Computer Science (074) CST. Items ask you to recognize precise CS distinctions and apply them to short scenarios: algorithm analysis, programming semantics, data structures, Boolean and number systems, systems and networks, security, and computing's social impacts. The exam rewards exact vocabulary, not broad impressions.

Core rules and concepts

  • Algorithm efficiency is expressed with Big-O growth, not wall-clock seconds. Binary search is O(log n) only when the data is sorted and supports random access; linear search is O(n).
  • Python assignment binds names to objects. Passing a list to a function passes a reference, so in-place mutation affects the caller unless the function copies the list.
  • Stacks are LIFO; queues are FIFO. Tree traversals differ: preorder visits root-left-right, inorder left-root-right, postorder left-right-root.
  • IP routes packets; TCP provides reliable, ordered delivery; UDP does not guarantee delivery or order. DNS resolves host names to IP addresses.
  • Symmetric encryption is efficient for bulk data; asymmetric encryption supports key exchange and digital signatures; hashing is one-way and is not encryption.
  • Ethical and legal topics include privacy, acceptable use, accessibility, equity, and intellectual property.

Worked example

Trace binary search for 23 in the sorted list [4, 9, 15, 23, 31, 42]. Start with low = 0 and high = 5. The midpoint index is 2, value 15, which is less than 23, so set low = 3. The new midpoint is 4, value 31, which is greater than 23, so set high = 3. The midpoint is now 3, value 23, and the search succeeds after three probes. If the list were unsorted, binary search would be invalid; linear search would be the correct O(n) choice.

Traps that cost marks

Do not call O(log n) universally fast without the sorted precondition. Do not treat hashing as reversible encryption. Do not claim TCP is always faster than UDP; TCP adds reliability overhead. Do not assume inorder traversal equals sorted order unless the structure is a binary search tree. Watch for aliasing when a list is passed and mutated.