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

Amara Raja Placement Papers Interview Questions
Questions Answers Views Company eMail

placement paper for ece students in amararaja company

1 4348

Post New Amara Raja Placement Papers Interview Questions




Un-Answered Questions

Where is your web server hosted?

462


Why do we need spark?

183


if a base class has a number of overloaded constructors, and an inheriting class has a number of overloaded constructors; can you enforce a call from an inherited constructor to a specific base constructor?

517


what is the difference between hashed & sorted internal tables?

1625


What is trusty ubuntu?

376






If horse and bird inherit virtual public from animal, do their constructors initialize the animal constructor? If pegasus inherits from both horse and bird, how does it initialize animal’s constructor?

632


write a program for reverse a given string?

1602


Can you explain different types of locks in sql server?

517


Tell me what do you think will be the most common objections you'll hear during a call? How would you handle them? : insurance cold calling

321


I have developed and executed a script successfully, and saved the same to QC. When I tried to execute the script from QC, the script is not executing. What are the possible reasons?”

575


Provide the important core components of android.

476


What are the important Features of Redshift?

5


How prevents blocking code in node.js?

265


Tell about Jan Dhan Yojna?

662


#include #include #include #include void select(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); select(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void select(char *items, int count) { register int a, b, c; int exchange; char t; for(a = 0; a < count-1; ++a) { exchange = 0; c = a; t = items[ a ]; for(b = a + 1; b < count; ++b) { if(items[ b ] < t) { c = b; t = items[ b ]; exchange = 1; } } if(exchange) { items[ c ] = items[ a ]; items[ a ] = t; } } } design an algorithm for Selection Sort

2056