Computer Science

I'm looking for a backup program to use on a home pc. Preferably free. I downloaded EaseUS Todo Backup Free yesterday, but was disappointed as it seems to only work on whole drives. I want something that will work on individual folders, and just back up the changes from the last time the folder was updated. I don't want to back up a whole drive again, just to apply the most recent changes. I seem to remember seeing that kind of thing advertised, but I don't know by who or where.

Really need this. Tried googling but not many. 1 or 2 are there. I want this algorithm solved by hand to some problem. IDK what kinds of problems exists. but one is knapsack problem. there is analytics vidya's tutorial but I want sth else, more direct, more clear....Any resource you can show to me? I really need it. This is important for my exam. Asked almost 70% of time.

This code is for iterative deepening depth first search in python. # Python dictionary to act as an adjacency list graph = { '7' : ['19','21', '14'], '19': ['1', '12', '31'], '21': [], '14': ['23', '6'], '1' : [], '12': [], '31': [], '23': [], '6' : [] } visited=[] goal='31' depth=0 depth_limit=2 def dls(visited, graph, node,depth_limit): if(node==goal): print("goal found") return True if(depth>=0): #to print path if node not in visited: visite…

Hi All, I wanted to do a Data Science Course but, i don't have any prior knowledge in programming. One of my friend told me to learn Java and Python (i have started learning python on Scaler Topics). My questions is, is there any other programming language i should learn?

Hi, I am trying to find out the index of a substring in a string. "in" tells that the string is present but "find" is returning -1. import numpy as np cnt = 0 response = "the following information: Your Email address." ind = "Your Email address".find(response) print("index =", ind) if "Your Email address" in response: print("Yes") Somebody please guide me how can I get the index of substring in the string. Following is the output: Zulfi.

# Python dictionary to act as an adjacency list graph = { '7' : ['19','21', '14'], '19': ['1', '12', '31'], '21': [], '14': ['23', '6'], '1' : [], '12': [], '31': [], '23': [], '6' : [] } visited = [] # List of visited nodes of graph. def dfs(visited, graph, node): if node not in visited: visited.append(node) for neighbor in graph[node]: dfs(visited, graph, neighbor) print(node) # Driver Code print("Following is the Depth-First Search") dfs(visited, graph, '7') print("visited=",vis…

https://imgur.com/a/dYxPAEi#apvIooQ

What is the best tools/method to draw honeycombs(hexagon)? and 3D hexagons, animation hexagons.

I am from Nepal and instead of asking us code, these are types of questions that are asked in our country examination system. IDK what's their purpose. But some of them are badly hard as there are not many examples about it in textbook(In Nepal we can't get the textbook reference that the syllabus is made upon, we can of course get international writers textbook but our syllabus and exam paper is based on Indian author textbooks and we don't get that here in Nepal) So I was studying about hopfield network and got badly confused. I have listed my confusions with annonations. It is not like I don't understand anything, I do understand the gist, but I am not very c…

For a project I was asked to present a slide in which it is explained how a web application is serving a search query to a random user that typed a word in a search bar of a website like ebay or amazon. Each step from the typing of the user to the search bar providing the results page should be mentioned with the timing of each event. Can anyone help me with this, I find it pretty demanding.

How to read/write a number from/to a txt file from a Javascript program?

I am really confused by this question as there are multiple possible answers of this question, so I am asking this. There is very minimum role of GFS master in writing and reading operations.. You can either go through these or just tell me what is the correct answer if you are bored to go through all of these. links offsite removed by moderator, per rule 2.7

I can read less text content easily. my way of reading it is to make slides of all those texts and learn from the slides. But I have issue with reading huge huge texts as you know in this case it will require too much time when I do this. Is there way to simplify this reading style? eg-: of sth that I want to read is this. https://static.googleusercontent.com/media/research.google.com/en//archive/gfs-sosp2003.pdf It takes me 45 minutes to read 3 paragraph and comprehend it at least. If I go that way, you can imagine, how long it takes me to read a research paper. Probably a week to read a research paper lo…

(For anyone interested) I finally got around to finishing the 3-Sat Algorithm (there may be a few typos) package com.company; import java.math.BigInteger; import java.util.Arrays; import java.util.HashMap; public class kSatMap { private static final int k = 3; private static final double permutations = Math.pow(2, k); private static final HashMap<String, String[]> lookupTable; static { lookupTable = new HashMap<>(); //position 0 value assignments (Single Letter Clauses) lookupTable.put("0", new String[]{"00001111"}); // A lookupTable.put("1", new String[]{"11110000"}); // !A //position 0 value assig…

hotspot-: region of computer program where a high proportion of executed instructions occur Lazy space allocation-:https://stackoverflow.com/questions/18109582/what-is-lazy-space-allocation-in-google-file-system With lazy space allocation, the physical allocation of space is delayed as long as possible, until data at the size of the chunk size (in GFS's case, 64 MB according the 2003 paper) is accumulated. Large chunk size in GFS-: =>A large chunk size, even with lazy space allocation has its disadvantages. => A small file consists of a small number of chunks, perhaps just one. => The chunkservers storing those chunks may become hot s…

P vs NP is a fundamental Computer Science/Math problem that has remained unsolved for half a century. I have proposed a solution that proves P=NP. To do so, it is required to propose a polynomial algorithm for one of the NP-complete problems. I have proposed a polynomial time algorithm for Hamiltonian cycle problem. I appreciate if you have a look at my preprint and comment on it. The preprint can be found here: https://osf.io/2gskv

Most sites advise drilling a few holes in it to thwart privacy invasion, so I'm assuming it does not take much. What about an electric engraver, woodburning pen, soldering iron or bolt cutters...would either of these be an effective method to use on a bare platter?

Merry Christmas! Dear friends, during Christmas we share gifts, so I did not come empty handed, but I have gifts for you. C# scripts that you can compile yourself on your Windows computers (sorry Linux geeks!). ScreenCapture Compilation: On Windows 7+ it should work without any additional installation. On Vista change the version from v3.5 to v3.0, or install .NET Framework v3.5, if needed. On WinXP install .NET Framework v3.5+, if needed. Start, cmd, cd [the location where you stored ScreenCapture.cs] %SYSTEMROOT%\Microsoft.NET\Framework\v3.5\csc ScreenCapture.cs If you are having problems, you can c…

Hey guys, how you doing? Im here to ask for you help. Im writing my bachelor paper as an implementation/review of the TPP algorithms out there. Almost every paper that I read references the Ramesh algorithm, that returns an exact solution for TPP problems, but I just can't find the algorithm, not even a high level description that I could use to implement my own version. Does someone know how to implement it? I would be grateful with even a high level description. There's other two approaches out there that I would be grateful to have access: the branch-and-bound algorithm of Singh and Van Oudheusden, and the branch-and-cut algorithm of Laporte. If someone …

I have a background a PhD in biostatistics and moving on to data science hoping to try for data science roles. I am looking for book recommendations to learn algorithms and data structures specifically in Python. Any recommendations for a beginner friendly book?

I am Wilfred Thompson and I am a newbie when it comes to web design. My problem is that I am having a difficult time understanding CSS, HTML, and the HTML element Script which is why my navigation dropdown is a broken mess. My aim is to create a navigation dropdown that starts from a small button with three lines that will ultimately drop down the menus Home, Gallery, About, and Contact vertically and then the close symbol will also appear which will hide the menus if clicked. I want the three lined button dropdown navigation to appear only after reaching screen width 1044 pixels and below because I am fine with the menus being shown and in-line with each other side by si…

Hello friends, I am a Windows user and recently I am encountering a serious problem on Windows 10 search bar. When I go to type something in the search bar of Windows 10, I fail to type there. Has anyone encountered such a problem before? Please help me to fix the issue.

can you learn it in a week?