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

  • BirlaSoft aptitute test questions (4)
  • BirlaSoft interview questions (144)
  • BirlaSoft placement papers (1)
  • BirlaSoft technical test questions (10)



BirlaSoft Business Objects Interview Questions
Questions Answers Views Company eMail

WHAT ARE THE INDEXES THAT SUPPORT DATA WAREHOUSING ? Thanks In advance Prakash

2 4074

Suppose we had a scenerio like in an universe there are nearly 250 objects but only 50 objects data is updated frequently so is there any way to overcome it.(Birla Soft,)

3 7536

Ihave one report.Now i want to display that report as one row as one color and another row as another color.The entire report i need like that

3 6232

I HAVE USED A PROMPT TO SELECT A COUNTRY IF I REFRESH THE REPORT IT HAS TO SELECT COUNTRY AS INDIA IN DEFAULT AND HAVE TO GIVE THE RESULT? HOW TO ACHIEVE THIS?

3 6056

Post New BirlaSoft Business Objects Interview Questions



Un-Answered Questions

Write down the name of 2 lady Bir Pratin of Bangladesh

850


Why there is Powerfactor difference when we compare to our Capacitive Panel and TNEB side?

880


What is shading?

351


determine two methods to find loose connection in operational electrical system?

596


#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

1390






what are the steps I have to deal with?

1081


how to create overlay on div ?

970


please visit this site you'll find my question this is my homework please answer it if you can http://easyscience.org/ib/lofiversion/index.php/t36168.html

1099


how to calculate MR 9(derivation)

1537


WHY RECIPROCITY THEOREM IS MAINLY USED IN ELECTRONICS

2126


What is accounting

2727


what is KV and XV valve

285


what is mean by sample account and data transfer rule in SAP FI?

861


Asking questions of cryppoyography

1671


What is the procedure for requition import?

1023






BirlaSoft Business Objects Interview Questions
  • C (1)
  • STL (1)
  • C++ General (2)
  • VC++ AllOther (1)
  • C Sharp (1)
  • ASP.NET (2)
  • ADO.NET (1)
  • WCF (1)
  • Oracle General (3)
  • SQL Server (2)
  • SQL PLSQL (15)
  • Unix Commands (1)
  • WinRunner (1)
  • Load Runner (1)
  • QTP (37)
  • Automation Testing AllOther (3)
  • Manual Testing (11)
  • QA Concepts (1)
  • COBOL (4)
  • JCL (3)
  • CICS (1)
  • Core Java (2)
  • Business Objects (4)
  • Informatica (9)
  • Micro Strategy (1)
  • Data Warehouse General (1)
  • HR Questions (2)
  • SAP Basis (1)
  • SAP ABAP (2)
  • SAP FI CO (1)
  • SAP CRM (1)
  • SAP Business Objects BO BOBJ (2)
  • Siebel (1)
  • Oracle Apps Technical (11)
  • Oracle Apps Financial (4)
  • Oracle Apps Manufacturing (1)
  • Risk Analysis (1)
  • General Physics (1)
  • Civil Engineering (1)
  • Electrical Engineering (3)
  • Marketing Sales (1)
  • Taxation (2)
  • Accounting AllOther (1)
  • Law AllOther (1)
  • Everything Else AllOther (3)
  • General Aptitude (4)
  • Placement Papers (1)
  • Oracle Certifications (1)
  • Certifications AllOther (1)
  • USA Student Visa F1 Visa (1)
  • C Code (1)