Add office photos
Employer?
Claim Account for FREE

Motorola

4.2
based on 211 Reviews
Filter interviews by

10+ Ravali Spinners Interview Questions and Answers

Updated 5 Feb 2024

Q1. What are skew trees? For a tree with 4 nodes draw all possible binary? Generalise for n nodes how many binary trees can be drawn?

Ans.

Skew trees are binary trees where each node has at most one child. For n nodes, there are n! possible binary trees.

  • Skew trees are binary trees where each node has at most one child.

  • For a tree with 4 nodes, all possible binary trees can be drawn by arranging the nodes in different orders.

  • Generalizing for n nodes, there are n! possible binary trees that can be drawn.

Add your answer

Q2. What ot methods other than neural networks can be used for recognition of speech?

Ans.

Other methods for speech recognition besides neural networks

  • Hidden Markov Models (HMM)

  • Dynamic Time Warping (DTW)

  • Gaussian Mixture Models (GMM)

  • Support Vector Machines (SVM)

  • Conditional Random Fields (CRF)

  • Convolutional Neural Networks (CNN) for feature extraction

  • Recurrent Neural Networks (RNN) for sequence modeling

  • Deep Belief Networks (DBN) for unsupervised pre-training

  • K-nearest neighbor (KNN) algorithm

  • Principal Component Analysis (PCA) for feature reduction

Add your answer

Q3. What is the latest in continuous speechher recognition?

Ans.

The latest in continuous speech recognition is the use of deep learning algorithms and neural networks.

  • Deep learning algorithms and neural networks are being used to improve the accuracy of speech recognition systems.

  • Advancements in natural language processing and machine learning have also contributed to the development of better speech recognition technology.

  • Companies like Google, Amazon, and Microsoft are investing heavily in this technology to improve their virtual assist...read more

Add your answer

Q4. How many links are there in a binary tree of N nodes? Give a proof?

Ans.

A binary tree with N nodes has N-1 links.

  • A binary tree with N nodes will have N-1 links connecting the nodes.

  • This can be proven using the formula for the number of edges in a tree: E = N-1.

  • For example, a binary tree with 4 nodes will have 3 links connecting the nodes.

Add your answer
Discover Ravali Spinners interview dos and don'ts from real experiences

Q5. Have you used threaded trees anytime in your life time?

Ans.

Yes, I have used threaded trees in my lifetime.

  • Threaded trees are binary trees in which every node has a thread (or a link) to its inorder successor or predecessor.

  • They are used to optimize tree traversal algorithms, as they eliminate the need for stack or recursion.

  • Threaded trees can be used for efficient searching, insertion, and deletion operations.

  • Example: In a threaded binary search tree, the threads can be used to quickly find the inorder predecessor or successor of a g...read more

Add your answer

Q6. Are you interested in "List of user interface related software"?

Ans.

Yes, I am interested in List of user interface related software.

  • I am familiar with various UI design tools such as Sketch, Figma, and Adobe XD.

  • I have experience in developing UI using frameworks like React and Angular.

  • I am also interested in exploring emerging UI technologies like voice and gesture-based interfaces.

Add your answer
Are these interview questions helpful?

Q7. What are the differences between pascal and C?

Ans.

Pascal is a strongly typed language with built-in data types, while C is a weakly typed language with pointers and manual memory management.

  • Pascal has built-in data types, while C requires manual declaration and definition of data types

  • Pascal is strongly typed, while C is weakly typed

  • C has pointers and manual memory management, while Pascal does not

  • Pascal has a simpler syntax and is easier to learn, while C is more complex and powerful

  • C is widely used in systems programming, ...read more

Add your answer

Q8. Give a general algo for converting a m-ary tree to a 2-ary tree

Ans.

The algorithm converts an m-ary tree to a 2-ary tree.

  • Start with the root of the m-ary tree

  • For each child of the root, create a new node in the 2-ary tree and make it the left child of the root

  • For each remaining child of the root, create a new node in the 2-ary tree and make it the right sibling of the previously created node

  • Recursively apply the same process to each child of the root

Add your answer
Share interview questions and help millions of jobseekers 🌟

Q9. Are you interested in working in GUI?

Ans.

Yes, I am interested in working in GUI.

  • I have experience in designing and developing user interfaces.

  • I am proficient in using tools like Adobe XD, Sketch, and Figma.

  • I enjoy creating intuitive and visually appealing interfaces that enhance user experience.

Add your answer

Q10. What is strongly typed?

Ans.

Strongly typed refers to programming languages that enforce strict data type checking.

  • Variables must be declared with a specific data type

  • Operations on variables must be compatible with their data type

  • Errors will be thrown if there is a type mismatch

  • Examples of strongly typed languages include Java, C++, and Swift

Add your answer

Q11. Describe Thesis work

Ans.

Thesis work is a research project that students undertake to demonstrate their knowledge and skills in a particular field.

  • Thesis work involves conducting research on a specific topic

  • It requires critical thinking and analysis of data

  • The findings are presented in a written document and defended in front of a panel

  • Examples include a study on the effects of social media on mental health or an analysis of renewable energy sources

Add your answer
Contribute & help others!
Write a review
Share interview
Contribute salary
Add office photos

Interview Process at Ravali Spinners

based on 15 interviews
Interview experience
4.0
Good
View more
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Top Interview Questions from Similar Companies

3.8
 • 2k Interview Questions
3.7
 • 403 Interview Questions
3.9
 • 366 Interview Questions
3.9
 • 168 Interview Questions
3.7
 • 142 Interview Questions
4.2
 • 139 Interview Questions
View all
Top Motorola Interview Questions And Answers
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
75 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter