CareerCup

Given the following set of strings, write a function that stores this information.

// /Electronics/Computers/Graphics Cards
// /Electronics/Computers/Graphics Cards
// /Electronics/Computers/SSDs
// /Electronics/Computers/Graphics Cards
// /Electronics/Computers/SSDs
// /Electronics/TVs
// /Electronics/Computers/Graphics Cards
// /Electronics/TVs
// /Electronics/TVs
// /Garden
// /Automotive/Parts

Your datastructure should be able to provide information as such:
// / = 11
// /Electronics = 9
// /Electronics/Computers = 6
// /Electronics/Computers/Graphics Cards = 4
// /Electronics/TVs = 3
// etc
// ["/Electronics/Computers/Graphics Cards", "/Garden"]

A producer continuously produces a stream of characters. There are multiple consumer threads which read the chars and match to one of known strings and increment the counter for that pattern. Write the consumer function. Show how you will synchronize and maintain parallelism.

Ex: Producer: abcdegabccaabbaacv ......
Known strings[] = {"ab", "aa", "fff" ... }
patternMatchCount[] = {3, 2, 0 ... }

A plumber working for a company as a contractor. His job is attend services and submit the bill to get his salary on basis of daily work including his service charge 500 rupees. For a typical plumbing work he need pipes with different lengths. But in market he will get new pipe with standard size 100m of cost 100 rupees. (no small or large sized pipes available) Now , he need 10 , 40 , 60, 70 lengths of pipes for a jobwork.

Generally company gives him (4 pipes * 100 rupees) + 500rupees as service charge = 900 rupees.
but plumber bought only 2 pipes cut as follows and get his job done...
1st pipe => 40+60
2nd pipe => 10+70 + extra left(20)
By buying only 2 pipes he get his job done. remaining 2 pipes money saved.

write an efficient algorithm to calculate minimum number of standard size pipes required for given number of different pipes lengths:

Input:
N => total pipes for jobwork
arr[N] => lengths of pipes. (for simplicity, pipe size will be either smaller or equal to standard size)

outpud:

minimum statdard sized(100m) pipes required

constraint: you can only cut them can not join them back as follows
say he need 10 95 95,
with two pipes 100 100 = > 95+5 95+5 => 95 95 (5+5)// this is not accepted

EX:

Input:
5
20 30 50 60 80

output:
3

Input:
5
10 10 10 15 20 35 55 60 70 75 75 80

output:
6

Write a function in C to create a new BST which is the mirror image of a given tree.

Consider the statement
result = a ? b : c;
Implement the above statement without using any conditional statements.

Write a multi threaded C code with one thread printing all even numbers and the other all odd numbers. The output should always be in sequence
ie. 0,1,2,3,4....etc

Write a piece of code to find out if the system is x86 architecure of Sparc

Write a function in C to create a new BST which is the mirror image of a given tree.

Write a piece of code to find out if the system is x86 architecture of Sparc

Write multi threaded code in C so that one thread prints all even numbers and other all odd numbers with the output always in sequence ie. 0,1,2,3...etc

Write a piece of code to find out if a system is x86 architecture or Sparc?

In Linux, we use virtual address.So each process will think it has 4 GB
memory space even if the real memory is only 2GB. Now suppose we do not have
MMU and programmer use real physical address in their program. We only have
small size of physical memory. How can we design the system?

We run two video game benchmarks on our new designed SOC. The two
benchmarks have the same instruction set. The benchmark with higher power
consumption always work well while the other one always get stuck. What can
be the problems?

In the new mobile phone, we can either choose to use a 1GHz solo core or
500MHz duo core processor. What tradeoffs should we consider?

This is a hardware design problem. I can not figure it out. Suppose we have 2 pipelined hardware multipliers(or something). One is working at 1GHz with 2 operations executed in parallel at the same time. The other one is at 500GHz with 4 operations. Suppose we have transistors of 3 types(low leaky(30%),middle leaky(50%) and high leaky(70%)) and here leaky means leakage power of the transistor. Which multiplier should we use considering the 3 types of transistors.

How will you implement run-time polymorphism in C? There are two structs. There is a common function receiving only one argument(only one). The function should accept both base struct and derived struct objects and do corresponding actions. i.e if base struct object is passed, do base struct's task and vice versa

The interviewer asked the following question.

char *s = "Hello";
printf("%s",s); 
printf(s)

The second print statement crashes sometimes. Why

Given an int, write code to return the number of bits that are 1 in O(m) time, where m is the number of bits that are 1.

Create the mirror image of a binary tree.

For a given US based phone number, write a function to return all possible alphanumberic words that can be formed with that number, based on the keypad of a standard phone.

For example, one possible value for 1-800-623-6537 could be 1-800-MCDNLDS

Given set of N threads generate sum of all numbers in an array of known size M

What is high dynamic range rendering and why is it important for realistic rendering?

Write a function to generate a second array of numbers containing running average of N elements from the original array

So for instance if the original array is,
2,6,4,2,3 and N=3

result = 2,4,3,4,3
you can assume the corner elements can be filled with original elements where there are not enough elements to take avg of N elements

You have written a memory manager and after using it your coworker complains that he is facing severe issues of fragmentation. What could be the reason(s) and how can you fix it

What is mip-maps and why are they used

Why we use 4X4 matrix for representing and calculations in transformation of 3D points when that can be done only with 3X3 matrix.

(the concept of homogenization of matrices and how they help including translation operation)

What the different shaders(vetex, geomtery, pixel) describe their roles and the order in which they are executed in graphics pipeline

given y bytes and you can transfer only x bytes at once..give a mathematical expression having only + - / * which gives the number of iterations to copy y bytes. ( dont try giving modulo operator answers )

Sequence of steps that happen in CPU, cache, TLB, VM, HDD leading to execution of “x = 7” which isn’t present in cache or sysmem nor translation in TLB. Also specify if any intrs, exceptions or faults are generated.

Assuming you have three N bit unsigned integers a, b and c, what is the min number of bits you would need to store the result of a * b + c?