Can anyone share programming questions asked for you in EPIC systems
skill assessment test and in which year you attended the test?
I am hoping to get list of questions asked recently.
--
Regards,
*SNK*
--
You received this message because you are subscribed to the Google Groups
Algorithm
1st round ( MCQ questions based on aptitiude, DBMS, OS etc)
30 questions were there:-
1) count number of ones in binary representation of 1 to 100
2) ACID (databases)
3) A C program was given with 4 forks().we had to find number of times it
prints hello world (answer - 26)
4)2-3 questions
Given two arrays , one is 1D array and other is 2D array . Now u need to
find out whether 2D array contains the subset of 1D array . The elements
of 1D array not neccessary present in the same row it can be either on the
up or down but should be continuous in the 2D array ..
--
You received
Solution for Problem 4:
#includeiostream
#define size 10 //size = sizeof(arr);
#define max 8 //max = maxof(arr[])+1;
using namespace std;
int main()
{
int arr[] = {2,4,6,4,6,3,5,1,5,7}, hasharr[max] = {0}, i, sum=8;
for(i=0; isize; i++)
hasharr[arr[i]] = 1;
Problem 1: Remove duplicate elements from an unsorted array of size N
Problem 2: Find intersection of K unsorted array of N elements each.
Intersection consists of elements that appear in all the K arrays.
Problem 3: How to make a linked list support operations in O(1) time. The
operations on
problem 4.. good question...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Tue, Oct 25, 2011 at 5:57 PM, kumar raja rajkumar.cs...@gmail.comwrote:
Problem 1: Remove duplicate elements from an unsorted array of size N
Problem 2: Find intersection of K unsorted
First of Happy Diwali 2 all.
For question number 4, this can be done by using a chained hashing
technique along with a valid/invalid bit which wil say it has been
processed or not..
After insertion has been done in the hash table. For finding the unique pairs ..
Iterate over the elements
On 10/26/11, SAMM somnath.nit...@gmail.com wrote:
First of Happy Diwali 2 all.
For question number 4, this can be done by using a chained hashing
technique along with a valid/invalid bit which wil say it has been
processed or not..
After insertion has been done in the hash table. For
Hi Frnds
Can anybody suggest me some questions typically asked on Graphs .
Couldnt find much in the internet
If some one can share link or few questions on Graphs it will be really
helpful
Thanks in Advance
Ankur
--
You received this message because you are subscribed to the Google Groups
1.)
how would you detect mouth in a picture
2.)
write iterative version of seed fill algorithm
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.com puneet.ar...@aricent.com
what is seed fill algorithm?
On Sun, Sep 11, 2011 at 10:45 AM, Ishan Aggarwal
ishan.aggarwal.1...@gmail.com wrote:
1.)
how would you detect mouth in a picture
2.)
write iterative version of seed fill algorithm
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A,
I dont know. I got this question from Facebook interview page. So posted it
here..
On Sun, Sep 11, 2011 at 10:51 AM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:
what is seed fill algorithm?
On Sun, Sep 11, 2011 at 10:45 AM, Ishan Aggarwal
ishan.aggarwal.1...@gmail.com wrote:
c=a+b
then find b=c-a;
if this b equals previous one then ok else overflow
On 7/9/11, John Hayes agressiveha...@gmail.com wrote:
regarding question related to overflow
int ovr_sum(int *sum,int a,int b)
{
*sum=a+b
if(*sum0)
return -1; //overflow
else
return 0; //no
#includestdio.h
#includeerror.h
#includemalloc.h
#includestdlib.h
void swap(void *p1,void *p2,const unsigned size)
{
char *buff=(char*) malloc(size*sizeof(char));
if(!buff)
{
perror(malloc);
exit(11);
}
memcpy(buff,p1,size);
memcpy(p1,p2,size);
memcpy(p2,buff,size);
free(buff);
return;
}
int
generic swap can be written as - #define Swap(T, a, b) {T temp = a; a=b;
b=temp;}
this is working fine in gcc
On Sat, Jul 9, 2011 at 1:45 PM, saurabh singh saurab...@gmail.com wrote:
#includestdio.h
#includeerror.h
#includemalloc.h
#includestdlib.h
void swap(void *p1,void *p2,const
regarding question related to overflow
int ovr_sum(int *sum,int a,int b)
{
*sum=a+b
if(*sum0)
return -1; //overflow
else
return 0; //no problem with the sum (overflow don't occur)
}
On Sat, Jul 9, 2011 at 2:05 PM, John Hayes agressiveha...@gmail.com wrote:
generic swap can
Q1 - write a generic macro to swap two values (int,float,double,pointers as
well )
Q2 - Implement your own malloc() and free() function
Q3 - Two unsigned ints given a, b you have add these numbers and return
the sum ...Make sure in case of overflow return error.
--
You received this
read KR
On Fri, Jul 8, 2011 at 4:20 PM, vikas mehta...@gmail.com wrote:
Q1 - write a generic macro to swap two values (int,float,double,pointers as
well )
Q2 - Implement your own malloc() and free() function
Q3 - Two unsigned ints given a, b you have add these numbers and return
the
also programming paradigm lectures from stanford may help
On Fri, Jul 8, 2011 at 4:25 PM, Naveen Kumar naveenkumarve...@gmail.comwrote:
read KR
On Fri, Jul 8, 2011 at 4:20 PM, vikas mehta...@gmail.com wrote:
Q1 - write a generic macro to swap two values (int,float,double,pointers
as
well
Thanks very much for recommending. By the way, Solutions to any problem
posted by anybody, will be available in some or other book. I also knows KR
is a good book.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on
Hi,
For some time now I started studying Algos and Data Structures. I got
these question when I was going through Hashing. Please help me
answering them. Some questions are of the type to validate my
understanding.
1) Suppose If I need to design a commonly referred Hash table, I
should allow
21 matches
Mail list logo
