How can we distinguish between an online and batch program in IMS environment?

Correct Answer: ESDS: Entry Sequence Data Set KSDS: Key Sequence Data Set RRDS: Relative Data Set

Correct Answer: They are DEFINE CLUSTER, DATA and INDEX

Correct Answer: Define new VSAM dataset allocated with more space Use IDCAMS to REPRO the old VSAM file to new VSAM dataset Use IDCAMS to ALTER / RENAME the old VSAM dataset to DELETE the old VSAM datset Use IDCAMS to ALTER / RENAME the new VSAM dataset to the name of the original VSAM dataset

Correct Answer: A relative record dataset (RRDS) consists of a specified number of areas called slots Each slot is identified by a relative record number (RRN) which indicates its relative position in the file

Correct Answer: Use the LISTCAT command

Correct Answer: Key Fields - (PROCOPT=K) - Used to sequence the database and can't be changed - It is the field within a segment, used to identify the occurrence of the segment - Used to maintain the IMS segments in ascending sequence Search Fields - (PROCOPT=G) - Used to search for a segment, without the segment being sequenced on that field - A segment need not have a key or search field Both types of fields can be used to search the database

Correct Answer: Batch DL/I MPP Mode - (Message Processing Program) BMP Mode - (Batch Message Processing)

Correct Answer: An in-stream PROC is defined right in the jcl stream and doesn't reside in the proclib This is an older technique associated with punched cards but it is still in use with setup and installation programs from vendors for the in-line perform instead of: perform add-paragraph until switch = 'y' you can code perform until switch = 'y' body of code end-perform body of code is the code from add-paragraph appearing in-line (ie right in the perform) instead of in a separate paragraph (out of line code)

Correct Answer: greater than 1 and less than -1

Explanation:

Difference between the heights of left and Right subtrees in an AVL tree can never be greater than +1

Correct Answer: Stack Because of its LIFO (Last In First Out) property it remembers its ?caller? so knows whom to return when the function has to return Recursion makes use of system stack for storing the return addresses of the function calls Every recursive function has its equivalent iterative (non-recursive) function Even when such equivalent iterative procedures are written, explicit stack is to be used