Placement Papers: CMC Technical Questions

Get unlimited access to the best preparation resource for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

  1. what is NFS-Networking File System.
  2. what is BIOS-Basic Input Output System.
  3. What is RPC-Remote procedure Call.
  4. Find shortest Path (graph has given) -45
  5. What is the output main () {int i = 5; if (i > 5) ; {i = 100; printf ( “% d” i) ;} } -100
  6. On huffman code one question has been given.
  7. No. Of comparisions ina merge sort- (2n + 1)
  8. Sorting of N elments how many comparisions are required-n − 1.
  9. One question on selection sort (to find third pass of give list)
  10. What is a daemon process?
  11. What is the use of fork system call-To create child processes.
  12. In CPU scheduling, Non preemptive or pre emptive which one is best-Both have negetive as well as positive.
  13. DBMS queries (two questions)
  14. “”
  15. If two entities have m, n elements. What is the result of cross product-mn
  16. For every table, IS foreign key mandatory-NO
  17. Three questions on OOPS (Operator over loading, inheritance)
  18. One question on system maintainance-perfect
  19. He has given base address of an array. Find the address of given element.
  20. One question on calling main in main.
  21. main () {int x = 32; x = x ≫ 6; printf ( “% d” x) ;} -0
  22. main () {int x = 5; x = x________1; printf ( “% d” x) ; abc. Com} -error.
  23. main () {int x = 0xff; if (x ≪ 4 ≫ 12) printf ( “________” ) ; else printf ( “…” ) ; abc. Com}
  24. Find number of bytes of a given structure.
  25. On a static variable 5 question have been given.

C Questions

  1. If we use front end processor for I/O operations then the load will be reduced on-cpu
  2. one question on DMA-DMA
  3. In list of 4 numbers the maximum number of comparisions to find the maximum and immediate maximum number
  4. Confuguration management does not consider about-hard ware devices.
  5. The most important factor of the coding: Ans: Readability. 6 Which of the following testing methods is used as a aceptency test-functional testing
  6. If the number of conditions in the decision table is n, the max number of-2 power n
  7. What is meant by swaping?
  8. If (node! = null) {write (node) A (left B, right D) traverse (right subtree) D (left E, right f) write (node) traverse (left subtree) }
  9. A question on Functional Dependencies which is not FD in the following?
  10. If T (x) = 2T (x/2) + 1 T (1) = 1 and n is the power of 2 then T (x) = ? - (2n − 1)
  11. If we want to access the data and members of a class to the immediate derived class which access specifier is used-protected
  12. Two questions on Queries (sql) technical test is easy. u must attempt first data comparisons, then arithmetic, then datasufficiency.
  13. windows NT is:
    1. extension to windows 95
    2. mutiprocessing system
    3. provides GUI
    4. none of the above:

CMC Aptitude Questions in Barrons GRE

Page No. Question Nos.

11 5,6, 7-An instructor …

12 9,10, 11-Dormitories … It, s important … The Census Bureau …

34 7, 13, 14,15, 16-My father … All …

37 25 − I, m afraid …

40 17, 18, 19, 20,21, 22-Mathematics …

41 25-Television …

89 14-Hobble

99 According to the passage … (RC)

273 30,31 − x, y, z are consecuive … a/b-c =-5/c + b

408 1,2, 3,4-An office manager …

413 40,41-As president …

438 7-Wilbur is 6

439 8, 9, 10,11, 12 − A project

441 5,6-If Elaine … Frank must …

444 24 − A meadow …

471 23,24-In 1978 …

473 8 to 16 (Analogy) Bleat: Sheep …

494 23-The current trend …

591 23-Lillian, who …

C Questions

Read Exploring in c: (bitwise operators, precedence)

  1. main () {int x = 10, y = 5, p, q; p = x > 9; q = x > 3&&y! = 3; printf ( “p =% d q =% d” p, q) ;} ans: 1,1.
  2. main () {int x = 11, y = 6, z; z = x == 5 | ! = 4; printf ( “z =% d” z) ;} ans: 1 3 main () {int c = 0, d = 5, e = 10, a; a = c > 1? d > 1|e > 1? 100: 200: 300; printf ( “a =% d” a) ;} ans: 300 4 main () {int i =-5, j =-2; junk (i, &j) ; printf ( “i =% d, j =% d” i, j) ;} unk (i, j) int i, ⚹ j {i = i ⚹ i; ⚹ j =⚹ j ⚹⚹ j;} ans: 5,4; 5 #define NO #define YES main () {int i = 5, j; if (i > 5) j = YES; else j = NO; printf ( “% d” j) ;} ans: Error message
  3. main () {int a = 0xff; if (a ≪ 4 ≫ 12) printf ( “leftist” ) else printf ( “rightist” ) } -rightist

7 main () {int i =+ 1; while (~i) printf ( “vicious circles” ) } -continuous loop.

8 One question on assigning two different structures; i.e.. structure1 variable1 = structure1 variable2

Developed by: