Placement Papers: CMC Technical Questions
Download PDF of This Page (Size: 128K) ↧
Examrace Placement Series prepares you for the toughest placement exams to top companies.
-
what is NFS-Networking File System.
-
what is BIOS-Basic Input Output System.
-
What is RPC-Remote procedure Call.
-
Find shortest Path (graph has given) -45
-
What is the output main () { int i = 5; if (i>5); { i = 100; printf ( “%d” i); } }-100
-
On huffman code one question has been given.
-
No. Of comparisions ina merge sort- (2n + 1)
-
Sorting of N elments how many comparisions are required-n − 1.
-
One question on selection sort (to find third pass of give list)
-
What is a daemon process?
-
What is the use of fork system call-To create child processes.
-
In CPU scheduling, Non preemptive or pre emptive which one is best-Both have negetive as well as positive.
-
DBMS queries (two questions)
-
“”
-
If two entities have m, n elements. What is the result of cross product-mn
-
For every table, IS foreign key mandatory-NO
-
Three questions on OOPS (Operator over loading, inheritance)
-
One question on system maintainance-perfect
-
He has given base address of an array. Find the address of given element.
-
One question on calling main in main.
-
main () { int x = 32; x = x>>6; printf ( “%d” x); }-0
-
main () { int x = 5; x = x____1; printf ( “%d” x); abc. Com }-error.
-
main () { int x = 0xff; if (x<<4>>12) printf ( “____” ); else printf ( “…” ); abc. Com }
-
Find number of bytes of a given structure.
-
On a static variable 5 question have been given.
C Questions
-
If we use front end processor for I/O operations then the load will be reduced on-cpu
-
one question on DMA-DMA
-
In list of 4 numbers the maximum number of comparisions to find the maximum and immediate maximum number
-
Confuguration management does not consider about-hard ware devices.
-
The most important factor of the coding: Ans: Readability. 6 Which of the following testing methods is used as a aceptency test-functional testing
-
If the number of conditions in the decision table is n, the max number of-2 power n
-
What is meant by swaping?
-
If (node! = null) { write (node) A (left B, right D) traverse (right subtree) D (left E, right f) write (node) traverse (left subtree) }
-
A question on Functional Dependencies which is not FD in the following?
-
If T (x) = 2T (x/2) + 1 T (1) = 1 and n is the power of 2 then T (x) =? - (2n − 1)
-
If we want to access the data and members of a class to the immediate derived class which access specifier is used-protected
-
Two questions on Queries (sql) technical test is easy. u must attempt first data comparisons, then arithmetic, then datasufficiency.
-
windows NT is:
-
extension to windows 95
-
mutiprocessing system
-
provides GUI
-
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)
-
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.
-
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
-
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