TipsMake

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.

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

    • The key value of the root node is always greater than the value of the keys of the left sub-branch
    • Both the root node and intermediate nodes have two child nodes and the leaf nodes have the same level
  • 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:
    • Check for the existence of p and the right leaves p;
    • Check the existence of leaf nodes on the right p
    • Check for the existence of node p
    • There is no need to perform all three conditions outlined in the question
  • 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);
    • 5-12
    • 5
    • Program error
    • Other results
  • Question 10. The number of colors can be displayed in graphic mode due to what factors:
    • The number of bits corresponds to 1 pixel
    • Screen resolution
    • Due to screen size
    • Not the above 3 factors

Discover more

C programming language multiple choice programming technology programmer programming test
Kareem Winters

Share by

Kareem Winters
Update 24 May 2019

You should read it