Skip to main content

Issue in booting windows 10 after installation of ubuntu - Fixed

I installed 'ubuntu-16.04.2-desktop-amd64.iso' in my laptop along with windows 10. Installation goes well and after reboot, both Ubuntu and windows option was showing for boot. I was able to boot up Ubuntu and it was working fine as expected.

While selecting the windows option to boot, it didn't boot and returning back to the boot selection menu. I was scared if the windows boot is corrupted or during installation if the drive got formatted or corrupted. I did some grub command but even after changing from grub command i was not able to fix the windows boot issue. i tried grub update but it didn't fix the issue. After lot of research on web i came to know the cause of the issue -


'grub.cfg'  file was not proper, to fix i followed the below -

1) login to Ubuntu OS
2) GO to /boot/grub/grub.cfg file
3) Edit the below section and add the missing line (ntldr /bootmgr)

#### BEGIN /etc/grub.d/30_os_prober ####
---
----
---
chainloader +1
ntldr /bootmgr    #---> line added which was not present responsible to loading windows boot mgr
----
----
---



Labels:

Comments

Post a Comment

Popular posts from this blog

Job Sequencing with Deadlines

Given a set of n jobs Each job i has an integer deadlines di>=0 and a profit pi>0 All jobs requires only one unit time to complete Only one machine is available for processing jobs For job i the profit pi is earned if the job is completed by its deadline.
Post a Comment
Read more

Optimal Binary Search using Dynamic Programming

An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. If the probabilities of searching for elements of a set are known from accumulated data from past searches, then Binary Search Tree (BST) should be such that the average number of comparisons in a search should be minimum. eg. Lets the elements to be searched are A, B, C, D and probabilities of searching these items are 0.1, 0.2, 0.4 and 0.3 respectively. Lets consider 2 out of 14 possible BST containing these keys. Figure 1 Figure 2 Average number of comparison is calculated as sum of level*probability(key element) for each element of the tree. Lets the level of tree start from 1. Therefore, for figure 1 -     Average number of comparison = 1*0.1 +2*0.2 +3*0.4 +4*0.3  = 2.9                                  ...
Post a Comment
Read more

Travel Sales Man Problem (TSP) and Solution using Dynamic Programming

Given a graph of n vertices, determine the minimum cost path to start at a given vertex and travel to each other vertex exactly once, returning to the starting vertex. In some versions, the starting and ending points are different and fixed, and all other points have to be visited exactly once from start to end. A standard way to solve these problems is to try all possible orders of visiting the n points, which results in a run-time of O(n!). To calculate cost using Dynamic Programming, we need to establish recursive relation in terms of sub-problems. Let us define a term C(S, i) be the cost of the minimum cost path visiting each vertex in set S exactly once, starting at 1 and ending at i. We start with all subsets of size 2 and calculate C(S, i) for all subsets where S is the subset, then we calculate C(S, i) for all subsets S of size 3 and so on. Note that 1 must be present in every subset. So the algorithm is like below - If size of S is 2, then S must be {1, i},  C(S, ...
Post a Comment
Read more