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

  • Capital IQ aptitute test questions (21)
  • Capital IQ interview questions (359)
  • Capital IQ placement papers (2)
  • Capital IQ technical test questions (70)

Capital IQ Interview Questions
Questions Answers Views Company eMail

can anyone give the journal entry with the amount 10 tv bought in the business for 1000 each, out of which one is installed.

34 14320

What is standing order

1 2411

We can add the no. of increase in shares due to exercise of the options.Why diluted eps is calculated separatey?


we can add the no. of increase in shares due to exercise of options,convertible debentures,warrants etc.Why diluted eps is calculated separately?


what is accounting concept? explian in brief?

9 11731

diff between eqiuty share & preference shares

2 3045

why companies put ltd and pvt ltd,what is the difference?

12 18719

What do u mean by Derivatives and its types?

8 17304

what is meant by spin off?

4 5054

what is representative personal accounts?? explain with examples...

11 34059

wat is the golden rule of accounting

12 10523

What is cash profit

2 4538

genteral interview question for accounting

2 3228

what is contingent liability

5 5779

what is book building


Post New Capital IQ Interview Questions

Un-Answered Questions

Where do we use ACvisitor class?


Where do you find which table is currently being populated (BIW1 or BIW2)?


What is the query optimization statistics?


Hi,Please give me the the answer for these quesitons? 1.what is IFS and ICF and RAPE amd DISKET fils? explain with example please? 2.What is the difference between POST AND SPACE OPCODES? 3.Can anybody tell me default printerfile command and object type?


what did u do in the sap sd project ?how did u maping your client business?plz i need help....


How are free energy changes related to LeChatelier's Principle?




a battery is having capacity 100AH and 25% charging .if a load taking 10A & connected 6 hour .what is the final condition of the battery.


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.


Anyone tell me the test cases of Shopping Favorite


Draw transformer phasor diagram.(full load,no load)


IF Statements BLOCK 1 . IF a >= b THEN do_this …..; ELSE do_that….; END IF BLOCK 2 . IF a < b THEN do_that …..; ELSE do_this….; END IF; • Given any pair of non-NULL values for “a” and”b”, will Block 1 and Block 2 do the same thing? • What if either “a” or”b” (or both) is NULL?


What is the BAPI_CUSTMATINFO_GETDETAILM used for? what is the input and output of this bapi.


Why yeast is mostly used for fermentation or biotechnological purposes?


10. Write a program in ‘C’ language that will perform the following operation on double link list. Each node of this list contains the address of previous as well as next node. The previous pointer of first node & next pointer of last node should contain null. 1. Creation of list with as many records as user want 2. Search a node in the list 3. Deletion at last position 4. Display 5. Exit Create separate functions for each operation. The create () will be used to create the list. It should accept no argument & return the address of the starting node. Search() will search a node in the list. It receives rollno as argument & return that node if found otherwise return null. The delete () function will delete the last node. It does not receive any argument & return structure type value at last position. The starting node of the double list must be declared as external pointer variable. Each element of double link list will contain the following information Roll No, Std Name, Course. Use do-while loop & switch case for generating the above menu. The format of the output should is given below: S.No. Roll No. Student Name Course 1 cse01 Anil Singh B.Tech


Capital IQ Interview Questions
  • C (1)
  • PHP (1)
  • Database Management (1)
  • Manual Testing (4)
  • QA Concepts (1)
  • Civil Engineering (1)
  • Business Management (1)
  • Marketing Sales (2)
  • Finance (81)
  • Business Management AllOther (1)
  • Audit (2)
  • CompanyAffairs CS (5)
  • Taxation (11)
  • Accounting General (111)
  • Accounting AllOther (218)
  • Call Centre AllOther (4)
  • General Knowledge_Current Affairs (1)
  • Everything Else AllOther (2)
  • English (1)
  • Puzzles (1)
  • Placement Papers (2)