CareerCup

There is a class called A, which receives co-ordinate (x, y) which is processed in a function called fn(x,y): produces an address in memory, pass that address to B and then B retrieves data from memory at that address and then sends that data back through two 32 byte (total 64 byte) data chunk to users. Design the class. follow up questions: How to improve the functions. What are the main bottlenecks?

there are 5 stairs. you can take either 1 or 2 steps
how many combinations you can take to climb the stairs?

Write a program to find the first occurance of one string into another : it is okay to write a O(n2) algorithm

C# Question.

class Test

int x;
int y;

Where the memory would be allocated ? Since both are primitive datatypes would it be allocated on stack or heap ?

Write code to remove a node from a linked list. Choose the node which would be most efficient to remove.
Hint: Head node.

Reverse an array without using iteration.
Hint: Recursion.

Write functions for insertion and deletion in a circular queue implemented using an array in C.
Hint: Remove the node from the end.
Add a node in the front. Move the pointer for removal and insertion. Pointer is just a counter for the index. Modulus it by size of array so that it circles from 0-n.
When pointers match , array is full.

When a child is forked then it inherits parent's file descriptors, if child closes the file descriptor what will happen ? If child starts writing what shall happen to the file at the parent's end ? Who manages these inconsistencies , kernel or user ?

Hello

Suppose I have set of files and in every files there are include# to other files in the same set.Suppose I have function that load all the includes in certain file.I need to write function that load all the includes in some given source file so I will avoid infinite loop and circular call for the include.

To solve the question I have to use this function i can't use pragma once or something similar I think it could be solved by recursion though I am not sure how

Thank you

Where is the process descriptor structure stored?(Higher 3Gb-4gb)? Is it shared among all processes or separate

Implementation details about a semaphore

DOes linux support semaphores?(he said no..only spinlock)

You are given a set of n points in a XY plane. Suggest an algorithm to determine if every point is at least separated by every other point by a Manhattan distance of 5 units. Return should be true or false.

Simplest option is to check each point with every other point to see if (x1-x2) < 5 && (y1-y2) < 5. But this would be O(n^2). But they expected a solution with lesser complexity.

Find the GCD of two numbers.

Given two character strings, find whether these are anagrams.

in this function for inserting the link list why do u check for head==null and why not *head==null and whats the diff

insert(Node * head)
{
if(head==NULL)
return ;
...
}

How do you shift a String given a String

For instance the following string abcdef and given an index 3, how would you make this in to defabc. So basically the index at a given point must be moved to the front and the rest of the string shifted to the right.

Another example:

Given an index 2 the result is cdefab

Suppose you had an XML document which represented the contents of a tree. What would it look like? And how would you parse the XML document into a tree using C++?

Describe our design process when given a software development task.

Implement a chess game using object oriented design methods.

What's XD bit? How does buffer overflow work?

Computer Architecture: Virtual Memory, Interrupts, Cache, Hazards, CISC vs RISC.

When do you use a double pointer?

Draw all the components of a computer!

Behavior questions: favorite internship, projects...