Home Tech info Quiz technology

Test of programming C P5

If you are a fan of C programming language and intend to learn more about them, the following test of Network Administrator will be very suitable for you. Let's learn and play with these interesting questions.

  1. Question 1. Which of the following signs indicates the node p of a single linked list is the last right node:
    1. (p-> info! = NULL);
    2. (p-> info == NULL);
    3. (p-> next! = NULL);
    4. (p-> next == NULL);
  2. Question 2. When removing node x in the search binary tree, we only need to check that:
    1. x is the left leaf node of the binary search tree or not
    2. x is the right leaf node of the binary search tree
    3. The existence of x on the tree
    4. All 3 answers above
  3. Question 3. Which of the following mechanisms is installed for the queue:
    1. FIFO
    2. Round Robin
    3. Sequentially
    4. FILO
  4. Question 4. Which of the following signs indicates a single list of empty links:
    1. (p-> right == NULL);
    2. (p-> info == NULL);
    3. (p == NULL);
    4. (p-> next == NULL);
  5. Sentence 5. Which sign indicates that the right node of p has the right subtree:
    1. (p-> right! = NULL);
    2. (p-> left! = NULL);
    3. (p-> right! = NULL) && (p-> right-> right == NULL);
    4. (p-> right! = NULL) && (p-> right-> right! = NULL);
  6. Question 6. Which of the following mechanisms is installed for Stack:
    1. FILO
    2. Sequentially
    3. Round Robin
    4. FIFO
  7. Question 7. A binary tree is called true if:
    1. The original node and all intermediate nodes have 2 child nodes
    2. The key value of the root node is always greater than the value of the keys of the right sub-branch

    3. The key value of the root node is always greater than the value of the keys of the left sub-branch
    4. Both the root node and intermediate nodes have two child nodes and the leaf nodes have the same level
  8. Question 8. When performing the operation of adding a leaf node x to the right of node p of the normal binary tree, we need:
    1. Check for the existence of p and the right leaves p;
    2. Check the existence of leaf nodes on the right p
    3. Check for the existence of node p
    4. There is no need to perform all three conditions outlined in the question
  9. Question 9. For the following program section:
      int a, * p, * q; 

      float * t; 

      a = 5;  p = & a; 

      p = q; 

      t = p; 

      printf ('% d% f', a, t);
    1. 5-12
    2. 5
    3. Program error
    4. Other results
  10. Question 10. The number of colors can be displayed in graphic mode due to what factors:
    1. The number of bits corresponds to 1 pixel
    2. Screen resolution
    3. Due to screen size
    4. Not the above 3 factors

You've just finished reading the article "Test of programming C P5" edited by the TipsMake team. You can save test-of-programming-c-p5.pdf to your computer here to read later or print it out. We hope this article has provided you with many useful tech tips and tricks. You can search for similar articles on tips and guides. Thank you for reading and for following us regularly.

C programming language multiple choice programming test
« PREV : What do you know...
Test on C... : NEXT »
Read More
Maybe you are interested