Tech Architect interview questions – page 8

Given a long string, arrange the words in alphabetical order, delete the duplicates and output the words with their frequency.

Define a data struct for the search engine which will represent whether given word is there in the document or not .It should be fast.

Traverse a tree in preorder fashion

How to insert and delete a node in a sorted linked list?

Implementation and test cases for compare(string str1, string str2)

Given a complete binary search tree in a array. Write a sort function to sort the array in O(n) time-complexity and at constant memory.

Given two values k1 and k2 and a root pointer to a BST. Print all numbers b/w k1 and k2 in increasing order i.e. k1<=x<=k2 where x is an element of tree.

Insert a node into a circular linked list. This CLL is sorted. So, if the CLL is like 1->2->4->6->1 you will be asked to input a node 3 and it must come between 2 and 4. Write a program for this in C++ or JAVA

Given a linked list in sorted order,now it is broken at a point and rearranged.

Given a word and a file containing words in the dictionary find anagrams of that word.

WAP for inplace removal of vowels from a char string

Find the number of strings of length n having u uppercase letters , l lowercase letters and d digits

Given a large linked list and a small linked list, efficiently find the common elements in two LLs.

Merge two BST into One. BST t2 is merged into BST t1.

Tree traversals .. non recursive and recursive ...

How would you allocate memory for a 2d array, using malloc only once... after the allocation the elements of the array shud be accessible by normal notation a[i][j] i.e. its not desired to access the elements in the form *(a+i*rows+col)

Provided a string S of words and no of character per line m ,with m being greater than the longest phrase in S,print S in a set of lines so that every single line includes no far more than m characters and no phrase split between two lines.

A Binary Tree is represented in an int array such that if P is parent and c is its children..a[c]=p a) Construct a Binary Tree if Such An Array is given b) uve given an index of node representing root of sub tree.. If we ignore t...

Given a binary tree with no size limitation, write a program to find the sum of each vertical level and store the result in an appropriate data structure (Note: You cannot use an array as the tree can be of any size).

You are given two strings A and B, you have to find out whether all the characters of A are present in B or not?

Print an integer using only putchar. Try doing it without using extra storage

When the variables are pushed into the stack, which method is used to retrieve them from it. a) pop b) pull c) remove d) none of these.

A recursive function was given...we were asked to draw the recursion tree and give the output-----5 marks the function took an array of 5 elements all initialized to zero as input void somefun(int a[],int n,int size) a is array,n...

Pick the odd man out a. malloc b. calloc c. realloc d. free

Size of integer and pointer? are they always same?

What class is used to display the ALV grid control?

How to convert decimal to octal and hexadecimal?

How do you pass a string to a function by its value ?

Write your own memcopy function

How much space is allocated by the expression " int *a[10]" if size of int is 4 and size of int pointer is 2