Content deleted Content added

Inline

Latest revision as of 00:05, 14 May 2024

Welcome to the computing section
of the Wikipedia reference desk.

skip to bottom

Select a section:

Shortcut

WP:RD/C

Want a faster answer?

Main page: Help searching Wikipedia

How can I get my question answered?

Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
Post your question to only one section, providing a short header that gives the topic of your question.
Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
Don't post personal contact information – it will be removed. Any answers will be provided here.
Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
Note:
- We don't answer (and may remove) questions that require medical diagnosis or legal advice.
- We don't answer requests for opinions, predictions or debate.
- We don't do your homework for you, though we'll help you past the stuck point.
- We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.

Ready? Ask a new question!

How do I answer a question?

Main page: Wikipedia:Reference desk/Guidelines

The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.

April 30[edit]

Cursor hovering over the thumbnail at YouTube[edit]

On my YouTube subscription list, if the cursor hovers over the thumbnail of a video, the video starts playing (without audio) inside the thumbnail. When I click on the video, it then starts playing at the point where the thumbnail got to. That means if I don't notice that the cursor is hovering over a video, when I open it, it might start 15 minutes in, and I have to stop and restart the video to watch from the beginning. This has got to be one of the most useless and annoying features I've ever seen on a website. Is there any way to turn it off? Can I go to Settings and click something so it stops doing that? —Mahāgaja · talk 11:36, 30 April 2024 (UTC)[reply]

Yes. Go into your settings (click on your icon), go into Playback and Performance, turn off Video Previews. It will turn it off for 30-60 days. Then, it tends to turn back on. I believe that it turns back on because Youtube counts those previews as views, increasing viewership counts. Similarly, I turn off the shorts. They turn off for 30 days and turn back on again. I also turn off autoplay. That stays off for longer, usually, but turns back on eventually. Again, having it autoplay increases view counts. 12.116.29.106 (talk) 12:01, 30 April 2024 (UTC)[reply]

Thanks! I turned off video previews. I had no option for turning off shorts, but they annoy me less now that they're segregated into their own section of the subscription page rather than being lumped in with the full-length videos, like they used to be. I've had autoplay switched off for years and it's never turned back on. —Mahāgaja · talk 12:12, 30 April 2024 (UTC)[reply]

May 4[edit]

How do I write this road trip?[edit]

On the Data Structures unit of a CodeHS course, there’s a part where I’m supposed to write a road trip in Java. The GeoLocation class was mostly autogenerated (requiring just a few additions that I already made) and most of the RoadTrip class seems simple. It wants me to store the stops on the road trip in an ArrayList, so I wrote “private ArrayList<RoadTrip> stations;”. The part where I’m having an issue is the function “public void addStop(String name, double latitude, double longitude)”. How do I write this part, and how do I add the stops to the ArrayList with “stations.add();”? ArrayLists only have one dimension, but I need to store three pieces of information about each stop. Primal Groudon (talk) 14:22, 4 May 2024 (UTC)[reply]

Making RoadTrip an array implies that you are working with a bunch of road trips. It appears that you have one road trip and you want to have multiple stops. So, your road trip object/class should contain an array of stops. This is the basic concept of relationships. In your example, you claim that a road trip "is a" array of stations. But, in reality, a road trip "contains" or "has a" array of stations. The whole "is a" and "has a" relationship concept is difficult for new object-oriented developers, but it is supposed to be simplified by filling in the sentence: A road trip ____ an array of stations. 12.116.29.106 (talk) 15:54, 7 May 2024 (UTC)[reply]

To add to the great comment above, you would want to have a Stop class, which contains a Stop class object with instance variables name, latitude, and longitude. Then in the RoadTrip class you could create an ArrayList named "private ArrayList<Stop> stations", which you can then use to load the aforementioned instance variables into the ArrayList with the method “public void addStop(String name, double latitude, double longitude)”. In this case, you will only need to write your method to access the Stop object at the desired index, then change the attributes of that Stop object and not the entire RoadTrip class.

Hope this is useful! Hanoi2020 (talk) 08:18, 12 May 2024 (UTC)[reply]

May 5[edit]

Logarathmic scale for page views[edit]

In page information, if you click no. of page views, you see a graph for daily page views for a period. You also get a logarithmic scale. What additional insight does it provide, and is thus helpful? ExclusiveEditor _{Notify Me!} 10:14, 5 May 2024 (UTC)[reply]

It is useful when there are large variations in the edit counts over time as a logarithmic scale expands low numbers. An illustrative example might be an article that describes a current event: As it happens and interest is high, there may be hundreds of edits per day, whereas some time after, as interest wanes or the article is reasonably complete, those numbers might decrease to a few edits per day. On a linear scale, those few edits (representing just a hundredth of the peak) tend to disappear, hardly distinguishable from zero. On a logarithmic scale they are clearly visible, making it possible to follow periods of high and low activity on the same graph. Addendum: replace "edit" by "view"... --Wrongfilter (talk) 10:55, 5 May 2024 (UTC)[reply]

@ExclusiveEditor: See e.g. page views for Bernard Hill who died 5 May. Without logarithmic scale you cannot even see how many views he got before, and it was far more than most articles. PrimeHunter (talk) 08:30, 8 May 2024 (UTC)[reply]

Two zeros in Ones' complement[edit]

Computers using ones' complement have two ways to represent zero. Back in my day, I used Fortran on such a machine. I just checked for 0. I assume that is the way it was with all high-level languages on such a machine (correct me if I'm wrong).

But in assembler or machine language, would you have to check for both forms of zero? Bubba73 ^{You talkin' to me?} 22:26, 5 May 2024 (UTC)[reply]

I don't know how the different languages handled it, but the article does say [...] a side effect of negative zero is that software must test for negative zero. RudolfRed (talk) 02:13, 6 May 2024 (UTC)[reply]

Some ones' complement models (e.g. the Electrologica X1) had a zero-test as part of the machine instructions (see here, section 2.4.3 Condition-setting), so one test sufficed for plus-or-minus zero. When using high-level languages such as FORTRAN or ALGOL, the issue was not visible to the user. --Lambiam 13:38, 6 May 2024 (UTC)[reply]

One's complement was used in older models (PDP, LINC) and programmers had to handle value properly. By 1985, this was codified in IEEE 754, stating that -0 and +0 are the same value and programming languages should treat them as such. You mention Fortran. Unless it is a very old version, Fortran's compiler treated zero as unsigned, so both -0 and +0 were just 0, converted as such in the compiler. 75.136.148.8 (talk) 17:31, 6 May 2024 (UTC)[reply]

Thanks for the replies. You speak of early Fortran, the first Fortran I used was FORTRAN IV and it must have handled that for the programmer. Bubba73 ^{You talkin' to me?} 04:27, 7 May 2024 (UTC)[reply]

You mentioned using a 1s complement machine and using Fortran. That tells me you must have been using a DEC F40 on a PDP. Fortran IV was ported to other old mainframes, primarily for education purposes, but DEC ported it (as F40) for the PDP series for business use. DEC F40's compiler handled positive/negative zero, but also gave the programmer the ability to distinguish between them if desired. If you were using a different Fortran on a different computer, I have to assume that that version of Fortran also handled positive/negative zero in the compiler in much the same way. 12.116.29.106 (talk) 12:18, 7 May 2024 (UTC)[reply]

It was actually on a CDC 6400. We used a Fortran IV textbook. CDC had enhancements to Fortran IV, but I didn't know about them until I bought my own CDC Fortran manuals a few years later Bubba73 ^{You talkin' to me?} 02:08, 8 May 2024 (UTC)[reply]

May 6[edit]

I need some reliable sources about the history of computer startup sounds.[edit]

I'm trying to write an article about computer startup sounds. The draft can be found at: Draft:Startup sound. I need help finding some good sources about the history of startup sounds as well as writing the article itself. Could someone please help me with the article? Thanks! Félix An (talk) 06:53, 6 May 2024 (UTC)[reply]

The thing that immediately springs to mind is Brian Eno's work on the startup sound used in Windows 95, which is discussed in his article with some sources you can peruse. Otherwise, it would likely make sense for you to investigate histories of places and people who were developing systems like Microsoft and Apple. Remsense诉 06:58, 6 May 2024 (UTC)[reply]

Oh dear! I thought of those ancient mainframes where when one switched them on various relays would click as the different bits got poweed up and all the fans would start running and eventually it could read cards or a paper tape and run a noisy lineprinter chunk chunk chunk chunk. But if you put vintage computers into Google it comes up with ones from the 90's! I was already on my third home computer by then! NadVolum (talk) 18:19, 6 May 2024 (UTC)[reply]

pdf and pictures[edit]

If there is a PDF novel written in a non-English language. which are mostly scanned books of old novels that have no online version. Then is there any software or online website that can lift the written text from PDF scans and write those lines? They are not original pdf files that can be edited by a pdf editor but scanned picture books by scan machine and then uploaded in Asian languages. 2409:40E1:C9:E2A:CCC2:B6C:CF71:29B3 (talk) 09:22, 6 May 2024 (UTC)[reply]

Yes, it is very possible to use optical character recognition for non-Latin scripts. Specifically, Asian languages are often well-supported, including Chinese characters written both horizontally and vertically. I use a complicated command line script, but I will try looking for an easy web tool to do it. But I wanted to make it clear it's possible. Remsense诉 09:29, 6 May 2024 (UTC)[reply]

May 7[edit]

Software for generating directed graphs[edit]

Is there software that will generate a directed graph such as this one, given a list of "from" and "to" numbers? It will include a cycle. Bubba73 ^{You talkin' to me?} 02:24, 7 May 2024 (UTC)[reply]

As the description says, it was created with Graphviz, which should be usable for your purpose. --Lambiam 07:23, 7 May 2024 (UTC)[reply]

You can use graphviz, mermaid, cytoscape, d3js (look up observablehq). D3Js can do almost everything svg can do, but of course you need to roll your own display algorithms. Graphviz strenghts is that you dont need to care about manual placement, but with complex graphs it will not be pretty. You can also use TikZ or CetZ 2A02:F28:F:36A0:0:0:0:100B (talk) 08:37, 7 May 2024 (UTC)[reply]

Thanks. Graphviz looks like it will do the job and the language is easy to use Bubba73 ^{You talkin' to me?} 04:04, 8 May 2024 (UTC)[reply]

May 9[edit]

Are the IP addresses used by VPNs recognizable?[edit]

Are the IP addresses used by VPNs recognizable as such? Can sites you're accessing tell you're using a VPN? I've noticed WP does not let an anonymous user make edits if that user is using the free (fairly limited) VPN service that comes with the Microsoft Edge browser. But does Wikipedia recognize VPN users in all cases? Does it always prevent anonymous users from editing WP if WP can tell they are using a VPN? Of is it the case only for some VPNs? 178.51.93.5 (talk) 01:08, 9 May 2024 (UTC)[reply]

They are not generally recognizable per se as such. The policy against open proxies does not apply to private VPNs. IPs from public VPNs may be blocked on sight. This requires identifying them as a public VPN service, which AFAIK is not automatic. --Lambiam 09:22, 9 May 2024 (UTC)[reply]

May 10[edit]

Windows 10 vs Windows 11.[edit]

I have dealt with computers and their OSs for many years, but I never had anything more inconvenient than the newest Windows 11, I am used to work with file trees and file folders, but here I cannot find the "C" folder. The impression I have is that such a chaotic system was made deliberately but why? Suggestions will be appreciated. I plugged Inyo the computer an external hard drive but how to find it in the software? It is all total absurd 107.191.2.10 (talk)a 107.191.2.10 (talk) 23:39, 10 May 2024 (UTC)[reply]

Open File Explorer on your machine. On the left side there should be a navigation pane. Click on the "This PC" button, after which a selection of connected drives and partitions will appear, which will definitely include your OS drive (C:)

Alternatively, you could hit the Windows key and type in "Disk Management" and click on "Create and format hard disk partitions." Afterwards, a much more familiar interface will open (I am pretty sure this is lifted straight from Windows 7), allowing you to open all folders by right clicking on them and selecting "Explore."

Hope this helps. Hanoi2020 (talk) 08:26, 12 May 2024 (UTC)[reply]

May 12[edit]

Longest computer-chess game[edit]

What's the longest chess game (i.e. the one with the most moves) on record between computers, not counting moves after one side could've claimed a threefold-repetition draw? Would the answer change if known endgame solutions retroactively replaced the fifty-move rule where available? Neon Merlin 05:10, 12 May 2024 (UTC)[reply]

I'm not sure there's any sensible answer to this. A poorly written program could play essentially forever. It wouldn't be hard to write a program that just makes random moves without attempting to checkmate the other side's king. Playing it against itself, it could probably play for thousands of moves before one side accidentally stumbles on a checkmate. CodeTalker (talk) 18:58, 12 May 2024 (UTC)[reply]

Okay, so what if we consider only those games where both programs have beaten the World Chess Champion in a publicly recorded match without a handicap in their favor, or have beaten in such a match a program that had done so in such a match, or so on transitively? Or only those whose FIDE-equivalent Elo ratings are at least 2800 based on human-computer matches that someone's bothered to provide enough hardware for and publish the moves from? Neon Merlin 01:46, 13 May 2024 (UTC)[reply]

May 13[edit]

Punch card loopback[edit]

Did any of the punch-card-based computers have a mechanism to move cards from the output deck to an input deck? Was this used for array indexing before indirect addressing was implemented? Did the cards contain the addresses or the data? Neon Merlin 20:59, 13 May 2024 (UTC)[reply]

I don't believe so. However there were quite a number of places which had all their data on cards and used various arrangements of card sorters, adders, multipliers and suchlike for their computing needs. See Unit record equipment. I think loading and storing via a register were implemented fairly early on. However there were commercial machines where they for instance wrote the return address into a location where a subroutine would jump to it at the end before jumping to the subroutine. Recursive routines and stacks came later! NadVolum (talk) 21:42, 13 May 2024 (UTC)[reply]

May 14[edit]