one Q is zig zag traversal in a tree nd d other one is like - A new
language is defined called googley and it has two register only 'X' and
'Y' and only two commands are avialable next and print each one has
some specific function (i don't remember now) and now u are given a string
and u hav to
1. Print the zig-zag traversal of a BST.
2. There is a language Googley. There are two global registers X and Y both
of whom have the character 'A' stored in them. There are only two commands
in the language.
i) next
ii) print
next increments the character in the X register. After reaching 'Z',
Hi,
Section A - objective type 10 technical questions in OS,Algorithms,DS,C.
each carries one mark. no negative marks
Section B - coding 2 questions
first was very simple
second - spiral level order traversal of a BST
--
You received this message because you are subscribed to the Google Groups
two coding Qs + some mcqs(more than 1 option correct),time is 1.5 hr..
On Fri, Aug 10, 2012 at 4:06 PM, deepikaanand swinyanand...@gmail.comwrote:
Somebody from DCE plz tell the paper pattern of google...
--
You received this message because you are subscribed to the Google Groups
Algorithm
Can you share the coding questions asked. Thank you.
On Fri, Aug 10, 2012 at 10:29 PM, Abhishek Kumar abhivai...@gmail.comwrote:
two coding Qs + some mcqs(more than 1 option correct),time is 1.5 hr..
On Fri, Aug 10, 2012 at 4:06 PM, deepikaanand swinyanand...@gmail.comwrote:
Somebody from
Somebody from DCE plz tell the paper pattern of google...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/BjLRVjRlekIJ.
To post to this group, send email to
On Wed, Jan 12, 2011 at 2:44 PM, snehal jain learner@gmail.com wrote:
1. Quick-sort is run on two inputs shown below to sort in ascending
order
(i) 1,2,3, ….,n
(ii) n, n - 1, n - 2, …., 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and
(ii) respectively. Then,
1. Quick-sort is run on two inputs shown below to sort in ascending
order
(i) 1,2,3, ….,n
(ii) n, n - 1, n - 2, …., 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and
(ii) respectively. Then,
a) C1 C2
b) C1 C2
c) C1 = C2
d) We cannot say anything for arbitrary n
2. Which
On Wed, Jan 12, 2011 at 1:14 AM, snehal jain learner@gmail.com wrote:
1. Quick-sort is run on two inputs shown below to sort in ascending
order
(i) 1,2,3, ….,n
(ii) n, n - 1, n - 2, …., 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and
(ii) respectively. Then,
for second question answer is b
On Thu, Jan 13, 2011 at 4:41 AM, Anand anandut2...@gmail.com wrote:
On Wed, Jan 12, 2011 at 1:14 AM, snehal jain learner@gmail.comwrote:
1. Quick-sort is run on two inputs shown below to sort in ascending
order
(i) 1,2,3, ….,n
(ii) n, n - 1, n - 2, ….,
10 matches
Mail list logo
