CareerMonk Publications - Interview Questions | Books - Recent questions in Data Structures and Algorithms

Problem on DS

Fri, 17 May 2013 21:36:10 +0000

We need to implement 2 operations on a datastructure. 1) Inserting an element 2) Finding Minimum_Element. we have 2 data structures 1) D1 ,which takes O(log n) for insertion operation and O(1) for finding Minimum_Element 2) D2 , takes O(log log n) for the both operations... which data structure is efficient??? D1 or D2??

Want the errata of Coding Interview Qs

Wed, 15 May 2013 18:58:58 +0000

I have already bought the book.Please send me this.I need for interview preparation.

Algorithm and Data structures Made it easy ebook

Mon, 13 May 2013 19:45:16 +0000

It's very inconvenient without a ebook. I have such a hard time carrying bulky book to different places I go. Its not atall easy to carry such a heavy book. I have heard the contents are great but just not feasible for a traveller guy like me.

Is there anyways I can get a ebook. I am even ready to pay more for that.

Request Source code for Data structures made easy in C/C++

Sun, 05 May 2013 04:11:01 +0000

Hi,

Would you please send me the code for Data Structures made easy?

Thanks you very much.

Best regards,

Need the errata for the book datastructures and algorithm made easy. Can't find on the site!

Fri, 03 May 2013 22:59:10 +0000

Can I have a digital edition of Data Structures made easy in java

Fri, 26 Apr 2013 19:10:00 +0000

I only see Paperback editions of the book, "Data Structures and Algorithms made easy in Java 2nd edition" available online. And where I live it's going to take too much time to reach. Had it been an online E-Book sort of thing, I could have bought it right away and started using it. Please mail me the links where I can purchase the digital edition of this book. It's really very urgent for me.

Please help.

Programs for Data structures and algorithms made easy in c/c++

Wed, 17 Apr 2013 01:13:30 +0000

Can you please share programs of Data Structures and algorithms made easy in c/c++.

My email id : swan.code@gmail.com

Need Errata for Data structures and algorithms made easy in c/c++ and Data structures and algorithms made easy in Java

Mon, 15 Apr 2013 19:18:14 +0000

Hello,

I have bought first edition of Data structures and algorithms made easy in c/c++ from flipkart and second edition of Data structures and algorithms made easy in Java from Infibeam.

Can i get the errata for both the books ?

My email id is : swan.code@gmail.com

Mathematical Proof for finding the constants C & no with Big O & Omega

Sat, 06 Apr 2013 07:52:52 +0000

Hi ,

I was going through the book, in the introduction chapter section 1.14 you have explained the Big O and w.r.t can you please provide the mathemaical proof for finding constant 'C' and no

Regards

Jayanth

Data Structures and Algorithms Made easy in Java

Mon, 01 Apr 2013 01:10:23 +0000

Is there a way to get a pdf copy (NOT the kindle edition) of this book? I've purchased a hard (paperback) copy on Amazon.

String Algorithms -problem # 11 on page # 342 in data strucutre and alogithms made easy for java book

Sun, 31 Mar 2013 07:09:45 +0000

The solution will never give "ACBA" as result from a string input of "ABCCBCBA".

Please check and take care of the same in next edition.

String Algorithms -problem # 7 on page # 340 in data strucutre and alogithms made easy for java book

Sun, 31 Mar 2013 03:38:12 +0000

Do we have any function in java like the one below:

String.setCharAt(int index, Char c)

It has been used in revesre string function. Also when you XORing two characters yields an int, while in the book it has been used like :

str.setCharAt(start, str.charAt(start) ^ str.charAt(end));

Please clarify on this.

Insert operation in Ternary Search Tree needs correction - data strucutre and alogithms made easy for java book

Sat, 30 Mar 2013 18:33:50 +0000

There is an if condition check as follows:

if(word.length <= position)

rot.setEq(InsertInTST(root.getEq(), word, position +1));

The if condition should be if(word.length > position).

Please clarify.

Please send me the errata

Thu, 28 Mar 2013 00:19:09 +0000

Hi

I got Data Structures and Algorithms Made Easy the second edition.

Could you please send me the errata?

Thank you

Selection Algorithms[Median] chapter - problem # 14 in data strucutre and alogithms made easy for java book

Sun, 24 Mar 2013 14:33:59 +0000

Please refer to trhe code snippet for this, you will find an if condition as:

if(ahi - alo + bhi - blo<4){

Handle the boundary cases and solve it smaller problem in O(1) time.

return;

}

In my opinion handling of this if condtion is the most trickiest part of this solution which is left. It is not that simple. When two arrays are of different length and this difference is larger, it is even more complex.

Searching chapter - problem # 40 in data strucutre and alogithms made easy for java book

Sat, 23 Mar 2013 05:04:48 +0000

Here FindPivot always returns the index of largest element and search method needs to be handled accordingly....Here is the code snippet for search given in the book:

int search(int[] A, int n, int x){

int pivot = FindPivot(A, 0, n-1);

if(A[pivot] == x) return pivot;

if(A[pivot] <= x){ -----> this is wrong

return BinaySearch(A, 0, pivot-1, x);

}else{

return BinaySearch(A, pivot+1, n-1, x);

}

search method should be rewritten as

int search(int[] A, int n, int x){

int pivot = FindPivot(A, 0, n-1);

if(A[pivot] == x) return pivot;

if(A[pivot] < x){

return -1;

}else{

if(A[0] >= x){

return BinaySearch(A, 0, pivot-1, x);

}else{

return BinaySearch(A, pivot+1, n-1, x);

}

Hashtables error? p314

Fri, 22 Mar 2013 20:50:12 +0000

on page 314 of 'DS & Algo made Easy' there is a code for Rehash(struct HashTable * h) and inside this function after doubling the size of the table there is no initialization to NULL of the 'next' pointers of HashTableNode (h-Table) like in the createHashTable. This means the next pointers by default contain garbage values. Shouldn't they be initialized ? Also in the Rehash function, the inner 'for' loop while copying the pointers of oldTable to Table, the statement 'temp=temp->next' appears twice in one loop cycle, which is wrong as it will be jumping two 'next' pointers in each cycle? Lastly, could you please also send me the errata of the book ? Thanks!

errata for books

Fri, 22 Mar 2013 05:45:08 +0000

I bought both Ds and Algos made easy & DS and algos for GATE from flipkart. I need the errata for both the books. Please send me.

Source code request

Thu, 21 Mar 2013 03:23:56 +0000

Hi,

I bought do and Lagos made easy in java last year from flip kart. Pls send me the code.

Thanks, Sateesh

Please send me typo/errata list.

Tue, 19 Mar 2013 22:24:21 +0000

or point me to where the errata is posted? Thank you very much. I am enjoying the book.

Linked list, problem-21, p 66. Error in complexity, shouldn't be O((m+n)^2)?

Mon, 18 Mar 2013 07:26:44 +0000

#next_pages_container { width: 5px; hight: 5px; position: absolute; top: -100px; left: -100px; z-index: 2147483647 !important; } I don't understand why the time complexity of the problem-21 (p. 66) should be O(m+n).

Creating the array with all the next pointers of both the lists takes O(m+n), but if you want to search the first repeating pointer in the array, you should compare each pointer with each others (ex: 1-2, 1-3, 1-4..., 2-3, 2-4, 2-5... etc), and in this case the complexity in my opinion would be O( (m+n)^2 ).

Isn't right?

Thanks

#next_pages_container { width: 5px; hight: 5px; position: absolute; top: -100px; left: -100px; z-index: 2147483647 !important; }

Code for Data Structure Made Easy in Java Second Edition

Mon, 18 Mar 2013 05:35:59 +0000

Hi

Can somebody send me code for book "Code for Data Structure Made Easy in Java Second Edition" ? I purchased it from Amazon and want to practice.

Thanks

Dhruv

data structures and algorithms made easy C/C++ second edition. post order traversal

Sat, 16 Mar 2013 20:52:42 +0000

post order traversal of binary tree iteratively on page 121.

the algorithm fails on this input.

goes into infinite loop in this case becuase root is not set properly .

what is the correction for it.?

thanks

Hi, can I get typo list emailed to me for data structures and algorithms made easy C/C++

Sat, 16 Mar 2013 20:43:06 +0000

really nice book .

Problem - 23 on page number 279 of the book algorithm Data structures and algorithms made easy in Java

Sat, 16 Mar 2013 17:36:01 +0000

Couple of points here:

1. We have reffered to problem -19. The example array which is 6,2,6,5,2,3,1 is not correct it should be 4 in place of 6 according to the problem statement itself. Correct me if something has been overlooked by me.

2. In 23 the equations should read:

X+Y = S - n*(n+1)/2

XY = P/n! Let me know in case I am missing something here.

Can you post the errata for Data Structures and Algorithms Made Easy in java 2nd edition?

Fri, 15 Mar 2013 20:35:11 +0000

can you please send me errata for Data Structures and Algorithms made easy (C/C++) ?

Fri, 15 Mar 2013 14:59:47 +0000

Hi,

Please send me errata for Data Structures and Algorithms made easy (C/C++) or provide a link from where I can download that?

Thanks.

Linked list insertion, deletion loop traversal

Thu, 14 Mar 2013 05:55:15 +0000

Hello,

Shouldn't the loop iteration count be k <= (position -1) in the code for Singly/Doubly Linked List insertion/deletion functions in the book Data Structures And Algorithms Made Easy C/C++ edition?

Thanks.

Question # 6 and # 7 in the book Algorithms made easy in java on page number 263

Mon, 11 Mar 2013 02:04:06 +0000

In reference to question # 6 and # 7 in the book Algorithms made easy in java on page number 263, what is the rationale behind:

1. Considering all numbers as 2-digit if they are in range [0, n^2-1].

1. Considering all numbers as 3-digit if they are in range [0, n^3-1].

Also could not understand straight forward the logic behind subtracting 1 from each number.

Source code for Data structures made easy (in C/C++)

Fri, 08 Mar 2013 12:09:51 +0000

Hi

I purchased the book Data structures made easy (C/C++) from flipkart yesterday

I understand that source code is not available for C/C++. Can same be please provided for Java

Regards

Ramesh

need errata for the book: data strucutre and alogithms made easy for java

Sun, 03 Mar 2013 07:04:43 +0000

my mail id is piyushpatel.srm@gmail.com

Could you please send me the errata for Data Structures & Algorithms (C/C++) 2nd ed?

Thu, 28 Feb 2013 07:08:22 +0000

ERRAT for 2nd ed DS & ALGO made easy

Mon, 25 Feb 2013 11:10:22 +0000

recently bought DS and Algo made easy in c++ 2nd edition, can someone share errata( typos,specific instruction) , could not find a place on this website to download it

Cant understand Problem 3 of chapter 9 Graphs in C/C++ Data Structures book

Sun, 24 Feb 2013 17:44:56 +0000

Could anyone please explain how did the number of permutaions came to be !(E)

errata for the book Data Structures And Algorithms Made Easy in Java

Fri, 22 Feb 2013 19:56:12 +0000

Hi CareerMonk

Where should I be able to get errata for the book

Data Structures And Algorithms Made Easy in Java .I bought it from amazon

email id is premr1@gmail.com

Error in code on page 208 in Data structures and algos made easy c/c++

Fri, 22 Feb 2013 14:09:23 +0000

code for graph creation has errors. Code for allocating the 2d matrix should be

printf("Doing");

g->adj=(int **)malloc(sizeof(int *)*g->v);

for(i=0;i<g->v;i++)

g->adj[i]=(int *)malloc(sizeof(int)*g->v);

also the scanf statement should be like

printf("Enter Vertices");

scanf("%d",&g->v);

printf("Enter Edges");

scanf("%d",&g->e);

please send errata for data structures and algorithms made easy in C++ second edition

Thu, 21 Feb 2013 23:51:42 +0000

Seems to be an FAQ, so why not post the errata for convenient download rather than individually emailing your readers?

There is a memory leak in data structures and algorithms made easy page 80

Thu, 21 Feb 2013 13:55:21 +0000

In CeateStack() if the S->array allocation fails the actual array stack structure is not freeed.

Quick Sort in the book Algorithms made easy in java is erroneous

Sun, 17 Feb 2013 16:28:57 +0000

The quick sort given in the book in this book is erroneous and also nothing is provided in errata. Could you please check this?

Insertion sort is in place algorithm.

Sun, 17 Feb 2013 04:01:49 +0000

Insertion sort is in place algorithm as it only requires a constant amount O(1) of additional memory space. In Data Structures and Algorithms Made Easy in Java, its worst case space complexity is mentioned as O(n^2)total and O(1) auxiliary.

Could please explain this.

FIND function in Disjoint Sets ADT

Thu, 14 Feb 2013 03:05:13 +0000

'Data Structures and Algorithms made easy in java' page number 198, FIND function is defined as follows:

public int FIND(int X){

if(!(X>=0 && X<size))

return;

if(S[X] == X)

return X;

else

return FIND(S, S[X]); ---> what/where is this FIND with two parameters????

}

I bought 'Algorithms made easy in java'. Where can i get the source code for chapters?

Wed, 13 Feb 2013 07:03:09 +0000

Topological Sort - Confusion.

Sun, 10 Feb 2013 07:44:36 +0000

This is in reference to the Section 9.6 Topological Sort given in the book "Data Structures and Algorithms Made Easy in Java"(Page no - 217). A term indegree has been talked about in this section. It is aid that it is computed for all the vertices, but how is it computed, what is ite simportance? These things are not clear. In the algorithm for topological sort this term has been used.

Error in implementation of circular queue on page 102 sec 5.6

Sat, 09 Feb 2013 06:36:13 +0000

The size function returns 0(zero) when the que is either empty of full.

errata of data structures and algorithms made easy(c/c++)

Sat, 09 Feb 2013 06:28:11 +0000

Hi, I need errata of data structures and algorithms made easy(c/c++) ASAP

How to write our own Iterator same as Collection iterator for HashMap with same complexity for all operations in java?

Thu, 07 Feb 2013 05:30:50 +0000

Confusion in DFS

Thu, 07 Feb 2013 03:10:36 +0000

I referring the algorithm for DFS given on page number 210 of "Data Structures and Algorithms made easy in JAVA". Why is visited flag of all the visited vertex are reset to false?

can you please send me errata for Data Structures and Algorithms made easy (C/C++) ?

Tue, 05 Feb 2013 15:27:23 +0000

Hi,

can you please send me errata for Data Structures and Algorithms made easy (C/C++) or provide a link from where I can download that?

Thanks.

Just half page of errata?

Tue, 05 Feb 2013 02:54:40 +0000

Just half page of errata? and the thing on errata is exactly the same as in the book? Can you please email me again all of the errata and typos? thank you.

errata for made easy book in c/c++ 2nd edition

Sun, 03 Feb 2013 05:45:17 +0000

Hello,

Could you please send me the errata for the data structure and algorithm made easy in c/c++ 2nd edition?

Thank you!