Placement Papers: CSC Placement Paper Pattern Pattern 2

Download PDF of This Page (Size: 129K)

Examrace Placement Series prepares you for the toughest placement exams to top companies.

Instructions: This is a 40 minutes paper containing 75 questions. There is no negative marking

  1. ____is associated with webservices.

    1. WSDL

    2. WML

    3. web sphere

    4. web logic

  2. any large single block of data stored in a database, such as a picture or sound file, which does not include record fields, and cannot be directly searched by the database? s search engine.

    1. TABLE

    2. BLOB

    3. VIEW

    4. SCHEME

  3. Areserved area of the immediate access memeory used to increase the running speed of the computer program.

    1. session memory

    2. bubble memory

    3. cache memory

    4. shared memory

  4. a small subnet that sit between atrusted internal network and an untruster external network, such as the public internet.

    1. LAN

    2. MAN

    3. WAN

    4. DMZ

  5. technologies that use radio waves to automatically identify people or objects, which is very similar to the barcode identification systems, seen in retail stores everyday.

    1. BLUETOOTH

    2. RADAR

    3. RSA SECURE ID

    4. RFID

  6. main () { float fl = 10.5; double dbl = 10.5 if (fl = = dbl) printf (? UNITED WE STAND?); else printf (? DIVIDE AND RULE?) } what is the output?

    1. compilation error

    2. UNITED WE STAND

    3. DIVIDE AND RULE

    4. linkage error.

  7. main () { static int ivar = 5; printf (? %d? ivar--); if (ivar) main (); } what is the output?

    1. 1 2 3 4 5

    2. 5 4 3 2 1

    3. 5

    4. compiler error: Main cannot be recursive function.

  8. main () { extern int iExtern; iExtern = 20; printf (? %d? iExtern); } what is the output?

    1. 2

    2. 20

    3. compile error

    4. linker error

  9. #define clrscr () 100 main () { clrscr (); printf (? %d\n\t? clrscr () ); } what is the output?

    1. 100

    2. 10

    3. compiler error

    4. linkage error

  10. main () { void vpointer; char cHar =? g? * cHarpointer =? GOOGLE? int j = 40; vpointer = &cHar; printf (? %c? * (char * ) vpointer); vpointer = &j; printf (? %d? * (int * ) vpointer); vpointer = cHarpointer; printf (? %s? (char * ), vpointer + 3); } what is the output?

    1. g40GLE

    2. g40GOOGLE

    3. g0GLE

    4. g4GOO

  11. #define FALSE-1 #define TRUE 1 #define NULL 0 main () { if (NULL) puts (? NULL?); else if (FALSE) puts (? TRUE?); else puts (? FALSE?); } what is the output?

    1. NULL

    2. TRUE

    3. FALSE

    4. 0

More Practice Questions for CMC

  1. Transparent DBMS is defined as

    1. A DBMS in which there are no program or user access languages.

    2. A DBMS which has no cross file capabilities but is user friendly and provides user interface management.

    3. A DBMS which keeps its physical structure hidden from user

    4. none.

  2. Either all actions are carried out or none are. Users should not have to worry about the effect of incomplete transctions. DBMS ensures this by undoing the actions of incomplete transctions. This property is known as

    1. Aggregation

    2. atomicity

    3. association

    4. data integrity.

  3. ____algorithms determines where in available to load a program. Common methods are first fit, next fit, best fit. --------algorithm are used when memory is full, and one process (or part of a process) needs to be swaped out to accommodate a new program. The-------------algorithm determines which are the partions to be swaped out:

    1. placement, placement, replacement

    2. replacement, placement, placement

    3. replacement, placement, replacement

    4. placement, replacement, replacement

  4. Trap door is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.

    1. true

    2. false.

  5. in recursive implementations which of the following is true for saving the state of the steps

    1. as full state on the stack

    2. as reversible action on the stack

    3. both a and b

    4. none

  6. which of the following involves context switch

    1. previliged instruction

    2. floating point exception

    3. system calls

    4. all

    5. none

  7. piggy backing is a technique for

    1. acknowledge

    2. sequence

    3. flow control

    4. retransmission

  8. a functional dependency XY is ___________dependency if removal of any attribute A from X means that the dependency does not hold any more

    1. full functional

    2. multi valued

    3. single valued

    4. none

  9. a relation schema R is in BCNF if it is in ___________and satisfies an additional constraints that for every functional dependency XY, X must be a candidate key

    1. 1 NF

    2. 2 NF

    3. 3 NF

    4. 5 NF

  10. a _________sub query can be easily identified if it contains any references to the parent sub query columns in the _________ clause

    1. correlated, WHERE

    2. nested, SELECT

    3. correlated, SELECT

    4. none