Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

  • iGate aptitute test questions (6)
  • iGate interview questions (361)
  • iGate placement papers (3)
  • iGate technical test questions (14)



iGate IBM AS400 AllOther Interview Questions
Questions Answers Views Company eMail

how to get no of records in file in rpg with out cl cmd

2 9718

Can we use OVRDBF command without using of OPNQRYF ? Or can we use OPNQRYF command without using of OVRDBF command ?

4 23283

how to find whether a date format is valid or not in RPG400 not in RPGILE.Can you please write the coding for this sir,i'm new to AS400.Please help.

1 4513

how to convert date format from one format to another i think in CL/400 its CVTDAT,Please tell in RPG/400 sir not in RPGILE

3 6168

Post New iGate IBM AS400 AllOther Interview Questions



Un-Answered Questions

What is the safety of UPS?

378


hi all iam going to give AAI tech exam i did my BE in electronics and communication if any one have any sample papers and SYLLABUS for it please plzzzzzzzzzzzzz for my career mail me at neha_sheokand11@yahoo.co.in

782


Compare the advantages and disadvantages of a three-dimensional monitor using a varifocal mirror with a stereoscopic system.

1732


How to Stop TScrollbar button from blinking ?

804


How to identify a particular T_Code has been modified or not? If yes, how to identify who modified particular T_Code in current system?

1234






what are all the components required to assemble solar panel other than pv cell?

220


what books to prepare for atc please

882


describe a time when you made a mistake when dealing with a staff and how did you handle the situation

696


Topics: Structures, Arrays, Searching and Sorting Assume there is a small mobile computer device including a hard disk and a slot for a memory card. The device shall be used to backup photos e.g. during holiday. Every time a memory card is connected all photos of the card are copied into a new folder automatically. And your task is to develop some basic controlling software to show, add, remove, search and sort the directories of photos. Step by Step Implementation 1.Define two symbolic constants, one to hold the total volume of the disk (e.g. VOLUME) and another one to hold the number of entries the files system of the device can handle (MAXFOLD). 2.Define a new structure data type named DATE to store a date consisting of year, month and day as unsigned values. 3.Define an other structure data type FOLDER to store the information of one folder of photos: ◦A title as character array of appropriate length ◦The location (event) the photos are taken as character array of appropriate length ◦The date of the day the photos are copied to the disk using the just defined data type DATE ◦The number of photos as natural number ◦And the size of the folder in MB as floating point value 4.Define the following global variables and initialise them: ◦disk as an array with MAXFOLD elements of data type FOLDER ◦folders as natural value to count the number of folders currently stored at the disk (valid elements in the array) TEST: Now you should be able to compile the code the first time without any warning or error. In the menu only "p" to print and "q" to quit will work!. 5.Now complete the functions given by their prototype: float freeSpace ();The function has to calculate the sum of the size component of all elements currently stored in the disk array. The function shall return the free space of the disk by the difference between the available total volume and the calculated sum. TEST: To test this function you only need to uncomment printing the "statusline" at the function actionmenu(). Compare the calculated value with a manual calculation of the example values given above. unsigned isBefore (DATE, DATE);The function checks if one date is before the other. There are 3 different possibilities which have to be handled. Imagine for example these 3 different combinations of values: ◦2010-01-01 : 2010-01-02 ◦2010-01-01 : 2010-02-01 ◦2010-01-01 : 2009-01-01 The function shall just return the result of the comparison. unsigned isEqual (DATE, DATE);The function checks if one date is equal to the other, all components have to be compared. The function shall just return the result of the comparison. int findByDate (DATE);As the array is should be kept in order (sorted by date) implement a binary search for a folder by its date here. You need only to adapt the binary search we used in the exercise. Use the 2 comparing functions above where appropriate. The function shall return the index of the element which was found or -1. TEST: Now you can try searching a folder by date via the "s" in the menu. Activate the corresponding part in the main function. int isSpaceLeft (FOLDER);This function compares the free space of the disk with the size of folder given with the parameter list. The function shall return 1 if there is enough space to add the folder, otherwise 0 (just the result of the comparison). void SortByDate ();This function shall implement the InsertionSort using the component date as key. Use the provided algorithm/souce code of the exercise as template. If you need a comparison between dates, use the function isBefore you have written again. void addFolder (FOLDER);The function has to check if the disk has additional capacities to add the new folder (number of folders and space left). If at least one of these conditions is false print an error message and return -1. Else there has to be added an other test to avoid 2 folder elements with the same date (use the findByDate function here. If there is no folder with the new date simply attach the new folder at the end of the array and call the sorting algorithm afterwards to keep the order in the array. TEST: Now you can try to add a folder via the "a" in the menu. Activate the corresponding part in the main function. void delDir (int);This function removes one element of the disk array. The input parameter contains the index of the element to delete. Deletion can simply be done by moving all elements at the right one to the left (overwriting the element to delete. The function may get a -1. This has to be checked first (certainly there is nothing to delete then!) Don't forget to decrement the counter of elements at the end. TEST: Now you can try to remove a folder by date via the "r" in the menu. Activate the corresponding part in the main function. unsigned findAllOfLocation(char[], FOLDER[]);This is an optional additional task: The function shall find all elements with the given value for the component location (first input parameter). The array elements which are found have to be added to the FOLDER array (second input parameter). As this parameter is an array we can use the result later in the main function. There kernel of function implements a modified linear search on the disk array (it does not stop if one element is found bat continues search until the location of all elements is checked). The finally function shall return the number of elements found in the disk array. TEST: Now you can try to add a folder by date via the "l" in the menu. Activate the corresponding part in the main function.

1307


What is the minimum rating availalbe for weld neck orifice in market?

842


Difference between drift current and diffusion current?

586


what is the effect of un-synchronized power.

764


what is the IPC ? & what the uses ?

258


I am sonakshi did MBA in marketing and then SAP sd certification now i am unable to get job yet i have around 2 years of domain ex. what to do?

1519


what is the importance of CV in the control valves? how it is calculated?

1292






iGate IBM AS400 AllOther Interview Questions
  • C (4)
  • C++ General (1)
  • Programming Languages AllOther (2)
  • JavaScript (2)
  • VB Script (4)
  • Networking Security (1)
  • Networking AllOther (1)
  • Visual Basic (1)
  • C Sharp (2)
  • ASP.NET (5)
  • Dot Net AllOther (7)
  • Microsoft Related AllOther (2)
  • Oracle General (3)
  • Oracle AllOther (1)
  • SQL Server (3)
  • DB Administration (4)
  • SQL PLSQL (6)
  • Databases AllOther (1)
  • Data Structures (1)
  • WinRunner (3)
  • Load Runner (3)
  • QTP (10)
  • Automation Testing AllOther (1)
  • Manual Testing (24)
  • QA Concepts (1)
  • Mobile Testing (1)
  • Test Cases (2)
  • Testing AllOther (1)
  • Servers AllOther (1)
  • COBOL (11)
  • JCL (8)
  • CICS (2)
  • DB2 (4)
  • VSAM (2)
  • IBM MainFrame AllOther (1)
  • RPG400 (9)
  • IBM AS400 AllOther (4)
  • Core Java (10)
  • Advanced Java (3)
  • EJB (1)
  • Servlets (5)
  • Struts (6)
  • Java J2EE AllOther (1)
  • Teradata (1)
  • Business Objects (7)
  • Cognos (10)
  • Informatica (23)
  • Ab Initio (1)
  • Data Stage (4)
  • Micro Strategy (5)
  • ETL (2)
  • Data Warehouse General (3)
  • HR Questions (3)
  • Project Planning (1)
  • SAP Basis (28)
  • SAP ABAP (6)
  • SAPScript (1)
  • SAP SD (19)
  • SAP FI CO (32)
  • SAP HR (1)
  • SAP CRM (1)
  • SAP Business Warehouse (4)
  • SAP Security (17)
  • SAP ALE IDocs (1)
  • SAP B1 (1)
  • Oracle Apps Technical (4)
  • Oracle Apps Financial (2)
  • Oracle Apps Manufacturing (1)
  • Oracle Apps SCM (8)
  • AI Fuzzy Logic (1)
  • AI General (2)
  • WebMethods (1)
  • Electrical Engineering (1)
  • Marketing Sales (1)
  • Banking Finance (2)
  • CompanyAffairs CS (1)
  • Accounting General (2)
  • Accounting AllOther (5)
  • Call Centre AllOther (3)
  • CDS (1)
  • General Aptitude (4)
  • Puzzles (2)
  • Placement Papers (3)
  • CCNA (1)
  • ISTQB Certification (1)
  • C++ Code (1)
  • C C++ Errors (1)