Add office photos
Employer?
Claim Account for FREE

Aspiring Minds

4.0
based on 105 Reviews
Filter interviews by

Fukoku Interview Questions and Answers

Updated 5 Feb 2024

Q1. Given a doubly linked list with one pointer of each node pointing to the next node just like in a singly linked list. The second pointer(arbit pointer) however can point to any node in the list and not just the...

read more
Ans.

Program to create a copy of a doubly linked list with an arbit pointer.

  • Traverse the original list and create a new node for each node in the list.

  • Store the mapping of original node to the new node in a hash table.

  • Traverse the original list again and set the next and arbit pointers of the new nodes.

  • Return the head of the new list.

Add your answer

Q2. Implement funcionality of 1000 of students giving a online test and timer is running. You have to calculate th etime when test is tarted and auto-matically stop the test when test is ended. Handle the scenarios...

read more
Ans.

Implement functionality for online test with timer and handle power failure scenarios

  • Create a timer function to track the time

  • Store the start time and end time of the test

  • Implement a backup system to save progress in case of power failure

  • Use a database to store test data and progress

  • Handle edge cases like internet connectivity issues

Add your answer

Q3. How can you stop man in the middle attack over an insecure communication line without using any kind of encryption ?

Ans.

It is not possible to stop man in the middle attack over an insecure communication line without using any kind of encryption.

  • Without encryption, the communication line is inherently insecure and vulnerable to man-in-the-middle attacks.

  • One possible solution is to use a secure communication line, such as a VPN or a dedicated private network.

  • Another solution is to use digital signatures to verify the authenticity of the communication.

  • However, these solutions are not foolproof an...read more

Add your answer

Q4. Heap memory and stack memory? Local variables are stored where? What is memory tables?

Ans.

Heap and stack memory are two types of memory allocation in a program. Local variables are stored in stack memory. Memory tables are used to track memory allocation.

  • Heap memory is used for dynamic memory allocation, while stack memory is used for static memory allocation.

  • Local variables are stored in stack memory and are only accessible within the scope of the function they are declared in.

  • Memory tables are used to keep track of memory allocation and deallocation in a program...read more

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

Q5. What is the difference between http and https?

Ans.

HTTP is unsecured while HTTPS is secured with SSL/TLS encryption.

  • HTTP stands for Hypertext Transfer Protocol while HTTPS stands for Hypertext Transfer Protocol Secure.

  • HTTP operates on port 80 while HTTPS operates on port 443.

  • HTTP is unencrypted while HTTPS is encrypted with SSL/TLS.

  • HTTPS provides authentication and data integrity while HTTP does not.

  • HTTPS is used for secure online transactions such as online banking, e-commerce, etc.

Add your answer

Q6. WAP of prime number using reursion?

Ans.

A recursive function to check if a number is prime or not.

  • Create a function that takes a number as input.

  • Check if the number is less than 2, return false.

  • Check if the number is 2, return true.

  • Check if the number is divisible by any number less than it, return false.

  • If none of the above conditions are met, call the function recursively with the number minus 1.

Add your answer

Q7. Reverse a linked list?

Ans.

To reverse a linked list, we need to traverse the list and change the direction of the pointers.

  • Create three pointers: prev, curr, and next

  • Initialize prev to null, curr to head of the linked list, and next to null

  • Traverse the list and change the direction of the pointers: next = curr.next; curr.next = prev; prev = curr; curr = next;

  • Set the new head of the linked list to prev

Add your answer

Q8. Q1. Given a doubly linked list with one pointer of each node pointing to the next node just like in a singly linked list. The second pointer(arbit pointer) however can point to any node in the list and not just...

read more
Ans.

The program creates a copy of a doubly linked list with an additional pointer pointing to any node in the list.

  • Traverse the original list and create a new node for each node in the original list.

  • Store the mapping between original and new nodes in a hash map.

  • Traverse the original list again and set the next and arbit pointers of the new nodes based on the mapping.

  • Return the head of the new list.

Add your answer
Contribute & help others!
Write a review
Share interview
Contribute salary
Add office photos
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Top Interview Questions from Similar Companies

3.9
 • 3.8k Interview Questions
3.9
 • 519 Interview Questions
3.9
 • 460 Interview Questions
3.9
 • 202 Interview Questions
4.2
 • 135 Interview Questions
3.9
 • 132 Interview Questions
View all
Top Aspiring Minds 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
70 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions
Get AmbitionBox app

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