I'm not sure if this is the place to ask about graduate admission, so please let me know if the question is off-topic.  I'm currently in my senior year doing my undergraduate degree. I recently made the decision to pursue graduate studies (M.S. CS), but my GPA is a bit low. I will graduate with a double major degree in international relations and computer science. My major GPA will be 3.1/4.0 (cumulative 3.3/4.0), and so I decided to delay graduation an take another semester to raise my GPA (retaking a couple of courses and taking one new one) and also give me more time to prepare for graduate admission as I felt I was a bit too unprepared. After the extra semester (and assuming I do average to well) my major GPA will be 3.4/4.0.  I took the GRE and did well (163V / 169Q / 5.5 AW), but felt that I want to invest as much effort as I can (since this is the only time I'll have, to raise my undergraduate GPA) and then apply when I'm better prepared.  Does graduating late reflect poorly for graduate admission? I wanted to use that time and take advantage of the fact that I'm taking fewer courses during the semester to work on other projects as well.  Any feedback is appreciated. Thank you!
Would spending one more year as an undergraduate adversely affect my chances of getting into a graduate program?   I wasn't really thinking about economics PhD until recently so my GPA is not too impressive and I lack in math courses so I've decided to spend one more year to boost my GPA taking upper level courses and get a math minor.  However, could the very fact of spending one more year to finish college be a disadvantage of getting into a graduate program?
I install virtualBox on Ubuntu 16.04, but after install and create new virtual Host shows this error:     Kernel driver not installed (rc=-1908)      The VirtualBox Linux kernel driver (vboxdrv) is either not loaded or there is a permission problem with /dev/vboxdrv. Please install virtualbox-dkms package and load the kernel module by executing  modprobe vboxdrv       as root. If it is available in your distribution, you should install the     DKMS package first. This package keeps track of Linux kernel changes and   recompiles the vboxdrv kernel module if necessary.  where: suplibOsInit what: 3 VERR_VM_DRIVER_NOT_INSTALLED (-1908) - The support driver is not installed. On linux, open returned ENOENT.     How to address this modprobe vboxdrv error? I am using wp_get_attachment_image_src to construct the srcset attribute of an img tag. In that attribute I want to output a comma separated list of image urls along with the image widths.  Using the Media Settings page, I have configured the image sizes to be as follows:   Thumbnail size: 150x150 Medium size: 640x480 Large size: 1024x768 Small size: 278x320   The wp_get_attachment_image_src function returns the correct urls and the correct widths for the image sizes full, medium and small. small is a custom size I added using add_image_size.  If I call wp_get_attachment_image_src( $image_id, 'large' ), the returned array looks like this:  array (     0 =&gt; 'http://localhost/wp-content/uploads/2014/10/image-1024x768.jpg',     1 =&gt; 640,     2 =&gt; 480,     3 =&gt; true, )   Checking the image which can be found at that url turns up the image with the correct dimensions.  Currently i am using the php builtin function  to circumvent this problem, but this function call takes significantly longer than simply accessing the index returned by wp_get_attachment_image_src:  Without getimagesize (mtime before and after execution):   '0.83761000 1415195440' '0.83831600 1415195440'   With getimagesize:   '0.34808000 1415195635'  '0.35323900 1415195635'   What can I do to make wp_get_attachment_image_src return the correct dimensions? A little bird told me that if $2^n+1$ is prime, then $n$ is a power of $2$. I tend not to trust talking birds, so I'm trying to verify that statement independently.  Suppose $n$ is not a power of $2$. Then $n = a \cdot 2^m$ for some $a$ not a power of $2$ and some integer $m$. This gives $2^n+1 = 2^{a \cdot 2^m}+1$. Now I suspect there's a way to factor that, but I don't see how. Can someone give me a hint? If gravity isn't a force, then why do we learn in school that it is? which of the two it is? Is it possible to change the Environment of a parent process in Python? In Linux When I invoke python from the shell it replicates its environment, and starts the python process. Therefore if I do something like the following:  import os os.environ["FOO"] = "A_Value"   When the python process returns, FOO, assuming it was undefined originally, will still be undefined. Is there a way for the python process (or any child process) to modify the environment of its parent process?  I know you typically solve this problem using something like  source script_name.sh   But this conflicts with other requirements I have. Hide and seek game $A$ and $B$ go to the Senate to play a game of Hide-and-Seek. There are $100$ rooms in the Senate, and $B$ picks one of them and hides there till the game ends.  $A$, at the beginning of every turn, picks one room and searches in it. Since he is human and thus fallible, he only has a $60\%$ chance of finding $B$ if she is in fact hiding in the room. If he fails to find her in the room, $B$'s score increases by one, and the next turn starts, whereupon $A$ must pick another room to check (he can also check the same room again). $B$ remains in the room she initially chose.  Given that $A$ and $B$ play with perfect strategies, what is the expected value of $B$'s score at the end of the game?  I tried with $1$ room. There is only one hiding place for $B$. So the expected score of $$B = \sum_{n=1}^{\infty}0.4^{n-1}0.6(n-1)=\frac{2}{3}.$$ Proof that an integral domain that is a finite-dimensional $F$-vector space is in fact a field Let $\Gamma$ be a set of formulas and $\phi$ be a formula. Show that $\Gamma \cup \{\neg \phi\}$ is satisfiable if and only if $\Gamma\not \models \phi$.   This seemed pretty obvious but I wanted to see if my proof made sense:  Proof: $(\Rightarrow)$  To derive for a contradiction, suppose that: $\Gamma \models \phi$. That means for all truth assignments $v$, for $\gamma \in \Gamma$, if $v(\gamma) = T$, then $v(\phi) = T$.  But this contradicts our assumption that $\Gamma \cup \{\neg \phi \}$ is satisfiable by the fact that $v(\phi) = T$ cannot happen so: $\Gamma \not \models \phi$ .  $(\Leftarrow)$   So by the definition of $\Gamma \not \models \phi$, we have that there is some truth assignment $v$ which satisfies $\Gamma$ but does not satisfy $\phi$. So  that means $v(\phi) = F$ since $v(\phi) \not = T$ which implies that $v(\neg \phi) = T$ which means $v$ satisfies $\Gamma \cup \{\neg \phi\}$.    I feel like I'm missing something in the forward direction, but at the same time... It looks pretty trivial as well. Am I missing anything crucial?  Thank you! system of ode with non-constant coefficient matrix How do I remove Windows 7 from my dual boot system with Ubuntu? Hello can someone give me short tutorial how to:   Remove Windows 7 from my dual boot system (Ubuntu/Windows7) Let me use free space as new partition for data (so I don't need to extend Ubuntu itself here) Remove windows 7 option from boot screen   Update:  Thanks to Lekensteyn answer I successfully deleted windows. Now I created new partition (formatted to ext4), but I can not use it. I cannot copy files there, only as root.  Also when booting, Ubuntu complains it didn't find /windows partition (of course it didn't, I removed it). I feel like I should update some tables or what, any ideas? How do I increase my code coverage, or why can't I cover these lines? This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, including more unit test resources, navigate to the  tag.  This canonical question is intended to address several classes of common questions by providing a quick summary and links to comprehensive resources:   How is code coverage obtained and calculated? How do I increase my coverage?  Why can't I cover these lines? Why isn't the body of my loop or conditional statement covered? link new object to scene with python in 2.8 In Python 2.8, I would like to create copies of the object 'CubeTemplate' but am having no luck.  I have reviewed every blender.stackexchange post on this subject (, ,  and ) but cannot get them to work - either they don't apply or the sample code throws errors (perhaps because it was pre 2.8).  The code below throws this error:       AttributeError: 'bpy_prop_collection' object has no attribute 'link'   for x in range(1, 3):     bpy.data.objects['CubeTemplate'].select_set(True)     bpy.context.view_layer.objects.active = bpy.data.objects['CubeTemplate']     me = bpy.context.object.data # use current object's data     me_copy = me.copy()     ob = bpy.data.objects.new('CubeCopy'+str(x), me_copy)     ob.location = (0, 0, x)     scene = bpy.context.scene     scene.objects.link(ob)     scene.update() I wonder whether it is possible to perform within R a clustering of data having mixed data variables. In other words I have a data set containing both numerical and categorical variables within and I'm finding the best way to cluster them. In SPSS I would use two - step cluster. I wonder whether in R can I find a similar techniques. I was told about poLCA package, but I'm not sure ... How do I delete files that are locked when no other app can delete them? So I found out that I had a Trojan on my external hard drive. My anti-virus app killed it, but it has created a bunch of random files on my computer which cannot be deleted. These are image files. They cannot be renamed - using any method - nor can they be moved, cut, copied, permanently deleted or even opened (in any program).  How can we rid these files from our system?  I have tried:   Right-click > Delete Shift+Delete (Permanently Delete) Swearing   and then:   FileASSASSIN from MalwareBytes Eraser program sdelete program several commands in cmd   but none of them have been successful. How can I completely obliterate these files? Steam Bollywood Achievement:     As Gandhi, win a cultural victory with   3 or fewer cities in your empire.   I wish to do this achievement on a Pangaea Standard map size or larger and on Prince difficulty or higher,  What tactics do people recommend to achieve this. Any tips on the use of, Social Policies, Wonders, Diplomacy, City States and Military. Open Finder window from current Terminal location? If I am in a specific path in a Terminal window, how can I open that same window in a new Finder window?   Note: This is the opposite of . The canonical way to return multiple values in languages that support it is often . Option: Using a tuple Consider this trivial example: def f(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return (y0, y1, y2)  However, this quickly gets problematic as the number of values returned increases. What if you want to return four or five values? Sure, you could keep tupling them, but it gets easy to forget which value is where. It's also rather ugly to unpack them wherever you want to receive them. Option: Using a dictionary The next logical step seems to be to introduce some sort of 'record notation'. In Python, the obvious way to do this is by means of a dict. Consider the following: def g(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return {'y0': y0, 'y1': y1 ,'y2': y2}  (Just to be clear, y0, y1, and y2 are just meant as abstract identifiers. As pointed out, in practice you'd use meaningful identifiers.) Now, we have a mechanism whereby we can project out a particular member of the returned object. For example, result['y0']  Option: Using a class However, there is another option. We could instead return a specialized structure. I've framed this in the context of Python, but I'm sure it applies to other languages as well. Indeed, if you were working in C this might very well be your only option. Here goes: class ReturnValue:   def __init__(self, y0, y1, y2):      self.y0 = y0      self.y1 = y1      self.y2 = y2  def g(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return ReturnValue(y0, y1, y2)  In Python the previous two are perhaps very similar in terms of plumbing - after all { y0, y1, y2 } just end up being entries in the internal __dict__ of the ReturnValue. There is one additional feature provided by Python though for tiny objects, the __slots__ attribute. The class could be expressed as: class ReturnValue(object):   __slots__ = [&quot;y0&quot;, &quot;y1&quot;, &quot;y2&quot;]   def __init__(self, y0, y1, y2):      self.y0 = y0      self.y1 = y1      self.y2 = y2  From the :  The __slots__ declaration takes a sequence of instance variables and reserves just enough space in each instance to hold a value for each variable. Space is saved because __dict__ is not created for each instance.  Option: Using a  (Python 3.7+) Using Python 3.7's new dataclasses, return a class with automatically added special methods, typing and other useful tools: @dataclass class Returnvalue:     y0: int     y1: float     y3: int  def total_cost(x):     y0 = x + 1     y1 = x * 3     y2 = y0 ** y3     return ReturnValue(y0, y1, y2)  Option: Using a list Another suggestion which I'd overlooked comes from Bill the Lizard: def h(x):   result = [x + 1]   result.append(x * 3)   result.append(y0 ** y3)   return result  This is my least favorite method though. I suppose I'm tainted by exposure to Haskell, but the idea of mixed-type lists has always felt uncomfortable to me. In this particular example the list is -not- mixed type, but it conceivably could be. A list used in this way really doesn't gain anything with respect to the tuple as far as I can tell. The only real difference between lists and tuples in Python is that lists are , whereas tuples are not. I personally tend to carry over the conventions from functional programming: use lists for any number of elements of the same type, and tuples for a fixed number of elements of predetermined types. Question After the lengthy preamble, comes the inevitable question. Which method (do you think) is best? What is $48\div2(9+3)$? There is a huge debate on the internet on the value of $48\div2(9+3)$. I believe the answer $2$ as I believe it is part of the bracket operation in BEDMAS.  yields the same answer. I also believe that if $48\div2\times(9+3)$ was asked it would be $288$ which Mathway agrees with as well. However,  says it is $288$ either way. A friend of mine (who is better at math) told me that there is no such thing as 'implicit multiplication', only shorthand so that is in fact done after the division (going left to right, not necessarily because division occurs before multiplication. But he didn't explicitly give a reason) What is the answer and why? Want to set a guest session password for login. How do you do this after skipping it at OS install?