IBM C6030-042 Online Practice Questions and Exam Preparation

IBM C6030-042 Online Questions & Answers

• Question 41:

  Given the following code, which procedure call would cause the "Pointer corrupted!" message to be output provided that the PL/I compile time option CHECK(STORAGE) has been specified? DCLX FIXED BIN (31) BASED (P);

  DCL Y CHAR (5) BASED (P);

  DCL P POINTER;

  SUB: PROCEDURE (P);

  DCL P POINTER;

  if CHECKSTG(P) THEN PUT (`Pointer 0k!');

  ELSE PUT (`Pointer corrupted!');

  END;

  A. ALLOCATEX;Y = `ABCD';CALL SUB (P);
  B. ALLOCATEY;Y = `ABCDE';CALL SUB (P);
  C. ALLOCATEY;Y = `ABCDE';CALL SUB (ADDR(X));
  D. P = ALLOCATE (100);Y = `ABCDE';CALL SUB (ADDR(X));
  A. ALLOCATEX;Y = `ABCD';CALL SUB (P);

• Question 42:

  In which of the following cases is a performance analyzer tool NOT useful?

  A. To time and tune programs
  B. To locate program hangs and deadlocks
  C. To show the frequency and duration of function calls
  D. To identify the code causing a storage overlay
  D. To identify the code causing a storage overlay

• Question 43:

  Which of the following declarations is NOT accepted by the compiler?

  A. DCL A (3,3) FLOAT DEC (16) INIT ((3)(3)1);
  B. DCL B (3,3) FLOAT DEC (16) INIT ((3)(1), (2)(1,1,1));
  C. DCL C (3,3) FLOAT DEC (16) INIT ((9)1);
  D. DCL D (3,3) FLOAT DEC (16) INIT ((*)1);
  A. DCL A (3,3) FLOAT DEC (16) INIT ((3)(3)1);

• Question 44:

  Which of the following compile list sections would be used to find the location of a static variable in a dump?

  A. Attribute/Xref Table
  B. Source Listing
  C. Table of Offsets and Statement Numbers
  D. Storage Offset Listing
  D. Storage Offset Listing

• Question 45:

  Given the following declarations, which code is likely to perform best and correctly initialize structure 3?

  DCL 1 S UNALIGNED, 2 A CHAR(3), 2 B BIN FIXED(31), 2 C DEC FIXED(5); DCL 1 T UNALIGNED LIKE S; T = ";

  A. S = ";
  B. S = T,BY NAME;
  C. CALL PLIFILL(ADDR(S),'`,STG(S));
  D. CALL PLIMOVE(ADDR(S),ADDR(T),STG(S));
  D. CALL PLIMOVE(ADDR(S),ADDR(T),STG(S));

• Question 46:

  Requirement Copy a dataset of record length 100 to another dataset. If the following code does not fulfill the requirement above, which is the most likely reason?

  DCL DDIN FILE RECORD INPUT;

  DCL DDOUT FILE RECORD OUTPUT;

  DCL INSTRUC CHAR(100);

  DCL EOF_IN BIT(1) INIT('0'B);

  ON ENDFILE(DDIN) EOF_IN = `1'B;

  READ FILE(DDIN) INTO(INSTRUC);

  DO WHlLE(^EOF_IN);

  WRITE FILE(DDOUT) FROM(INSTRUC);

  READ FILE(DDIN) INTO(INSTRUC);

  WRITE FILE(DDOUT) FROM(INSTRUC);

  END;

  A. The code does not fulfill the requirement because too many records will be written to the output dataset, except when the input dataset is empty.
  B. The code does notfulfill the requirement because the input structure is the same as the outputstructure.
  C. The code does notfulfill the requirement because the OPEN statements are missing.
  D. The code fulfills the requirement.
  A. The code does not fulfill the requirement because too many records will be written to the output dataset, except when the input dataset is empty.

• Question 47:

  Given the following code, which set of statements will insert the new element into the doublylinked list after the element pointed to by P?

  DCL1X BASED, 2 FORWARD POINTER, 2 BACKWARD POINTER, 2 DATA FIXED BIN (31); ALLOC X SET(Q);

  A. Q->FORWARD = P;Q->BACKWARD = P->BACKWARD;P->FORWARD = QP->BACKWARD = Q;
  B. Q->FORWARD = P-> FORWARD;Q->BACKWARD = P;P->FORWARD->BACKWARD = P;P- >FORWARD = Q;
  C. Q->FORWARD = P->FORWARD;Q->BACKWARD = P;P->FORWARD = Q;P->FORWARD- >BACKWARD = Q;
  D. P->FORWARD->BACKWARD = Q;P->FORWARD = Q;Q->FORWARD = P->FORWARD;Q- >BACKWARD = P;
  B. Q->FORWARD = P-> FORWARD;Q->BACKWARD = P;P->FORWARD->BACKWARD = P;P- >FORWARD = Q;

• Question 48:

  Given the following declaration, what is the most efficient way of setting C from A?

  DCLA BIN FIXED(31) INIT(-123);

  DCL C CHAR(6);

  DCL P PlC '---- 9' DEFINED C;

  A. C = A;
  B. PUT STRING(C) EDIT(A)(F(6));
  C. PUT STRING(C) LIST(A);
  D. P = A;
  D. P = A;

• Question 49:

  Which of the following may be an advantage of the BEGIN OPTIONS (INLINE) statement?

  A. The program runs faster because all variables declared inside the BEGIN block are already allocated when the block containing the BEGIN block is entered.
  B. The code runs faster because more variables will be optimized in the BEGIN block.
  C. The program uses less stack storage.
  D. The program uses less heap storage.
  A. The program runs faster because all variables declared inside the BEGIN block are already allocated when the block containing the BEGIN block is entered.

• Question 50:

  Which of the following is NOT useful to translate business logic into the appropriate technical design?

  A. GANTT charts
  B. Pseudo code
  C. Nassi-Shneiderman diagrams (structograms)
  D. Jackson Structured Programming method
  A. GANTT charts