CareerCup

what is output for below code and what is purpose of using const type for pointer variable p?

#include<stdio.h>
#include<conio.h>
#include<string.h>
void main()
{
char a[10]="HELLO";
char *const p=a;
clrscr();

//puts(p);
printf("%s",p);
*p='n';
//puts(p);
printf("%s",p);
getch();
}

Int a=10;
Int b=a>15;
Print("%d",b);

a)15
b)10
c)0
d)1

Virtual memory can be handled by which of the following?
a)demand paging
b)demand segmentation
c)both a and b

Using which data structures the arthematic expressions can be calculated?

Find a sub string in a given string and replace it with another string?

Implement a solution nth_largest( array, n ) that takes in an array of arbitrary size and returns the nth largest element.

Eg. array = [1, 8, 4, 5, 9, 7, 2, 10, 44, 55, 67]

nth_largest( array, 2) = 55
nth_largest( array, 5) = 9

Write a program to identify if a given binary tree is balanced or not.

Write a program to print all permutations of a given string.

If you have the chapter of a book and you're supposed to build an index such that given a word, you can tell which pages the word occurs on, what data structure can you use? Optimize for space utilization.

Write a Python program to print numbers from 1 to 100 except for multiples of 3 for which you should print "fuzz" instead, for multiples of 5 you should print 'buzz' instead and for multiples of both 3 and 5, you should print 'fuzzbuzz' instead.

Implement a function DoIt( o,a ) such that the following code:

Object o = SomeClass()
O.first = 'fizz'
O.second = 'buzz'

print DoIt( o, 'first)
print DoIt(o, 'second')

prints

fizz
buzz

Write a iterative Python function to print the factorial of a number n (ie, returns n!).

Write a recursive Python function to print the factorial of a number n (ie, returns n!).

Board Game:

1) Write a program that can take a board of N x N filled with alphabets and print/return all the words that can be constructed by connecting alphabets together. You're allowed to connect alphabets in any direction including diagonally, the only restriction is that you cannot cross over the same alphabet twice. So for eg:

A,B,C,D
E,K,L,A
C,A,M,N
D,I,N,G

So example words that can be made are: BEAD, CALM, CAN, DAMN, MAKE.

2) What's the run time for your algorithm? Does your algorithm scale for large sizes of the matrix? What optimizations can you make to improve the run time.

Given a non-directed, strongly connected graph where the node values are letters of the alphabet, write an algorithm that prints out all possible permutations of strings. What is this called?
For example:
V = A,B,C
Printout
ABC
ACB
BAC
BCA
CAB
CBA
BAC etc.

Given a sorted integer array, write a method that builds a balanced binary search tree. What is the runtime complexity?
Hint: Recursion.
Follow-up: Non-recursive solution

Given a list of tuples {x, y, x' } that describe histograms on the X/Y axis, such that X is the X coordinate, Y is the Y coordinate, and X' is the distance from X, write a function that draws the skyline of these tuples.
For example:
{3, 2, 4} , {4,5,3} will give the following points:
{3,0} - trivial
{3,2} - trivial
{4,5} -calculated
{7,0} -if list is done.

You cannot assume that the tuples are sorted. Provide runtime analysis.

Given a list of integers of size n, write a method to write all permutations the list; do this in O(1) space
Hint: No recursion.

Given a decimal number, write a function that returns its negabinary (i.e. negative 2-base) representation as a string.

#!/usr/bin/env python3
assert solution(-15) ==	'110001'
assert solution(2) == '110'
assert solution(13) == '11101'

I have an array with 60% sorted and 40% unsorted, which algorithm will give fastest accurate sorted output in C? And for Linked list which sorting algorithm suited?

How can I find factorial of positive integers using structures in C?

Assume there are 10000 stars in sky, how would you find which star is closest to the earth? in C

Create a program to compute nth Fibonacci number in O(1) space and faster than O(n) time.
(Target complexity is O(logn)).

i need to write code that union two nodes from graph G Vi ,Vj
then new node will generated Vm = ViUVj

Image an airport with the control tower having a constantly rotating radar scanning for airplanes. The radar's coordinates in the 2-d plane are (0,0). The radar has an API: void scan(const Plane &P) that is called periodically whenever the radar detects a plane. You can imagine that the Plane structure has x,y coordinates for that plane. You should fill in the function Scan, such that at any given time you are able to return the 100 closest planes to the tower (0,0).

Given a tree.
Each node is of type:

public class Node {
       public IEnumerable<Node> Children { get; set; }
}

Write a function GetAllNodes which returns collection, containing all nodes from given tree. (Given only the root node), i.e.:

IEnumerable<Node> allNodes = GetAllNodes( rootNode );

(The task is given in C#, but this is not a restriction, you may use any language you want).

How do you create your own garbage collector? How do you find whether objects in memory are orphans in order to purge them?

for given array

s[] = {5,1,0,4,2,3}

1) length of array is not given.
2) If length of array is 5 content is guaranteed to be between 0 to 5. There is no repetition of numbers. Sample example for length(s, 3)
- a[3] = 4 , a[4] = 2, a[2] = 0, a[0] = 5, a[5] =3
returns length of 4 .

For given condition write subroutine
int length (s, 3)
- to find the number of steps it takes to find given value - It's a function api - that I was asked to write with the conditions - I cannot change parameters of the function - I have to make sure return value is correct

Additional Condition:

You cannot use any loop statements like for, while and so on -
You cannot use any global or static variables.
You cannot call other routines inside this routine
You cannot modify given function parameters - it stays length (s, n) only
You cannot change original array too

Google is conducting a contest where they display a special doodle to the user
submitting the billionth query of the day. Design a system to achieve this. (NOTE:
Google has thousands of servers and each query can hit a different server).
Optimise it. How will you handle server failures?

Implement class Queue with help of only 2 stacks.
i.e.:

class Queue<T>{
	private Stack<T> _stack1;
        private Stack<T> _stack2;
	
	// public methods: Enqueue, Dequeue, Peek, Count
	// private methods, if any.
}