Practice Test GeeksNOCTI - National Occupational Competency Testing Institute Practice Test
← All NOCTI Flashcard Decks

Computer Science Flashcards

6 cards from real NOCTI practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.

Read the first 6 Computer Science flashcards as text

  1. What is the time complexity of a binary search algorithm?

    Answer: O(log n)

    Binary search divides the search space in half with each comparison, resulting in O(log n) time complexity where n is the number of elements.

  2. Which data structure uses FIFO (First In, First Out) ordering?

    Answer: Queue

    A queue processes elements in FIFO order, the first element added is the first one removed, similar to a line of people waiting.

  3. What does SQL stand for?

    Answer: Structured Query Language

    SQL stands for Structured Query Language, the standard language for managing and querying relational databases.

  4. In object-oriented programming, what is encapsulation?

    Answer: Bundling data and methods that operate on that data within a single unit

    Encapsulation is the OOP principle of bundling data (attributes) and the methods that manipulate that data into a single unit (class), while restricting direct access to some components.

  5. What is the decimal equivalent of the binary number 11010?

    Answer: 26

    Converting binary 11010: (1x16) + (1x8) + (0x4) + (1x2) + (0x1) = 16 + 8 + 0 + 2 + 0 = 26.

  6. Which network topology connects each device to a central hub or switch?

    Answer: Star topology

    In a star topology, all devices connect to a central hub or switch, which manages data transmission between nodes.