Memory Trivia Quiz

20 Questions | Total Attempts: 71

SettingsSettingsSettings
Please wait...
Memory Quizzes & Trivia

.


Questions and Answers
  • 1. 
    SQL is:
    • A. 

      A programming language.

    • B. 

      An operating system.

    • C. 

      A data sublanguage.

    • D. 

      A DBMS.

  • 2. 
    • A. 

      VARCHAR

    • B. 

      CHAR

    • C. 

      LONG

    • D. 

      NUMBER

  • 3. 
    To obtain the structure of an Oracle table, the command to use is:
    • A. 

      STRUCTURE [TableName].

    • B. 

      DESCRIBE [TableName].

    • C. 

      DESCRIBE STRUCTURE [TableName].

    • D. 

      DESC TABLE [TableName].

  • 4. 
    A foreign key is:
    • A. 

      A column containing the primary key of another table.

    • B. 

      Used to define data types.

    • C. 

      Used to define null status.

    • D. 

      All of the above are above correct.

  • 5. 
    A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as
    • A. 

      Full binary tree.

    • B. 

      AVL tree.

    • C. 

      Threaded tree.

    • D. 

      Complete binary tree

  • 6. 
    In a circular linked list
    • A. 

      Components are all linked together in some sequential manner.

    • B. 

      There is no front and back..

    • C. 

      Components are arranged hierarchically

    • D. 

      Forward and backward traversal within the list is permitted

  • 7. 
    Which of the following sorting methods would be most suitable for sorting a list which is almost sorted
    • A. 

      Bubble Sort

    • B. 

      Insertion Sort

    • C. 

      Selection Sort

    • D. 

      Quick Sort

  • 8. 
    A linear collection of data elements where the linear node is given by means of pointer is called
    • A. 

      Linked list

    • B. 

      Node list

    • C. 

      Primitive list

    • D. 

      None of these

  • 9. 
    The best average behaviour is shown by
    • A. 

      Quick Sort

    • B. 

      Merge Sort

    • C. 

      Insertion Sort

    • D. 

      Heap Sort

  • 10. 
    A queue is a,
    • A. 

      FIFO (First In First Out) list

    • B. 

      LIFO (Last In First Out) list.

    • C. 

      Ordered array.

    • D. 

      Linear tree.

  • 11. 
    Which of the following sorting algorithm is stable
    • A. 

      Insertion sort.

    • B. 

      Bubble sort.

    • C. 

      Quick sort.

    • D. 

      Heap sort.

  • 12. 
    B Trees are generally
    • A. 

      Very deep and narrow

    • B. 

      Very wide and shallow

    • C. 

      Very deep and very wide

    • D. 

      Cannot say

  • 13. 
    A technique for direct search is
    • A. 

      Binary Search

    • B. 

      Linear Search

    • C. 

      Tree Search

    • D. 

      Hashing

  • 14. 
    How will you print \n on the screen?
    • A. 

      Printf("\n");

    • B. 

      Echo "\\n";

    • C. 

      Printf('\n');

    • D. 

      Printf("\\n");

  • 15. 
    The data structure required for Breadth First Traversal on a graph is
    • A. 

      Queue

    • B. 

      stack

    • C. 

      Array

    • D. 

      Tree

  • 16. 
    The process of accessing data stored in a serial access memory is similar to manipulating data
    • A. 

      Heap

    • B. 

      queue

    • C. 

      stack

    • D. 

      Binary tree

  • 17. 
    A linear collection of data elements where the linear node is given by means of pointer is called
    • A. 

      Linked list

    • B. 

      Node list

    • C. 

      Primitive list

    • D. 

      None of these

  • 18. 
    Representation of data structure in memory is known as:
    • A. 

      Recursive

    • B. 

      Abstract data type

    • C. 

      Storage structure

    • D. 

      File structure

  • 19. 
    Quick sort is also known as
    • A. 

      Merge sort

    • B. 

      Heap sort

    • C. 

      Bubble sort

    • D. 

      None of these

  • 20. 
    The operator used to get value at address stored in a pointer variable is
    • A. 

      *

    • B. 

      &

    • C. 

      &&

    • D. 

      ||