Ask
Login

kaivanshah

Subject Expert at Suchit's Academy

gravatar for kaivanshah
kaivanshah • 270
Reputation:
Level 3
Status:
Active

Country:
India  

Last seen:
2 years, 10 months ago
Joined:
6 years, 3 months ago

Profile Strength:
80%
  • 52
    Questions
  • 51
    Answers
  • 49
    Awards
None
None

Top contributions by kaivanshah

2
votes
1
answer
47k
views
1
answer
Explain recursion as an application of stack with examples
data structures and algorithms updated 5.0 years ago by abhishektiwari1 • 100
2
votes
1
answer
24k
views
1
answer
Explain Circular queue and Double ended queue with example
data structures and algorithms updated 6.1 years ago by kaivanshah • 270
1
vote
1
answer
17k
views
1
answer
Explain B Tree and B+ Tree
data structures and algorithms updated 4.5 years ago by prashantsaini • 0
3
votes
1
answer
15k
views
1
answer
Define ADT with an example
data structures and algorithms updated 5.0 years ago by abhishektiwari1 • 100
0
votes
1
answer
10k
views
1
answer
Explain different types of data structures with examples
data structures and algorithms updated 5.0 years ago by abhishektiwari1 • 100
2
votes
1
answer
9.4k
views
1
answer
Using Linear probing and Quadratic probing, insert the following values in the hash table of size 10.Show how many collisions occur in each iterations 28, 55, 71, 67, 11, 10, 90, 44
data structures and algorithms updated 5.0 years ago by sanketshingote • 100
0
votes
1
answer
9.3k
views
1
answer
What is graph? Explain methods to represent graph
data structures and algorithms updated 4.5 years ago by prashantsaini • 0
2
votes
1
answer
8.6k
views
1
answer
Explain Topological Sorting with example
data structures and algorithms updated 4.5 years ago by prashantsaini • 0
1
vote
1
answer
7.8k
views
1
answer
What is huffman coding? Construct the huffman Tree and determine the code for each symbol in the sentence "Engineering"
data structures and algorithms updated 3.0 years ago by student2 • 30
0
votes
1
answer
7.6k
views
1
answer
Compare Quick Sort and Radix Sort based on their advantages and disadvantages
data structures and algorithms updated 4.5 years ago by prashantsaini • 0
2
votes
5.5k
views
2
votes
A: Explain recursion as an application of stack with examples
updated 6.1 years ago by kaivanshah • 270
2
votes
2.2k
views
2
votes
A: Explain Circular queue and Double ended queue with example
updated 6.1 years ago by kaivanshah • 270
1
vote
1.5k
views
1
vote
A: Using Linear probing and Quadratic probing, insert the following values in the h
updated 6.1 years ago by kaivanshah • 270
3
votes
1.5k
views
3
votes
A: Define ADT with an example
updated 6.1 years ago by sanketshingote • 100
0
votes
648
views
0
votes
A: Covert the following expression to postfix. (f-g)*((a+b)*(c-d))/e
updated 6.1 years ago by kaivanshah • 270
1
vote
553
views
1
vote
A: What is huffman coding? Construct the huffman Tree and determine the code for ea
updated 6.1 years ago by sanketshingote • 100
2
votes
496
views
2
votes
A: Explain Topological Sorting with example
updated 6.1 years ago by sanketshingote • 100
0
votes
439
views
0
votes
A: What is graph? Explain methods to represent graph
updated 6.1 years ago by kaivanshah • 270
1
vote
428
views
1
vote
A: Explain B Tree and B+ Tree
updated 6.1 years ago by sanketshingote • 100
0
votes
373
views
0
votes
A: Write a program in C to evaluate postfix expression using STACK ADT
updated 6.1 years ago by kaivanshah • 270

Latest awards to kaivanshah


created an answer with at least 3 up-votes

created 100 posts

created 50 posts within first three months of joining

created a question with more than 1,000 views

created a question with more than 10,000 views

created a question with more than 5,000 views