IgnouGroup Social Campus
Problem Detail: I am trying to understand summation for amortization analysis of a hash-table from a MIT lecture video (at time 16:09). Although you guys don’t have to go and look at the video, I feel that the summation he does Read More …
Problem Detail: I’m having some trouble understanding the following: When we look at satisfiability problems in conjunctive normal form, an underconstrained problem is one with relatively few clauses constraining the variables. For eg. here is a randomly generated 3-CNF sentence with Read More …
Problem Detail: I need help with this exercise. Indicate the regular expression for the following Languages. Explain your expression in one sentence and indicate the basis form of the alphabet. Indicate also every assumption you make. i) Sums of positive fixed-point Read More …
Problem Detail: I have a directed graph, where each node has an alphabetical value. The graph is to be traversed with topological DFS by descending alphabetical values (Z-A). The result is $M,N,P,O,Q,S,R,T$ (after reversing). Several DFS trees are created during this Read More …
Problem Detail: tl;dr What does the Minimax algorithm do when all its options are the same? Consider this Minimax tree: (Green means the ends, orange minimize, blue maximize) (Source: Myself) Imagine this is the tree for a game (tic-tac-toe, maybe?). What Read More …
Problem Detail: Is the cardinality of the set of partially recursive functions greater than the cardinality of the set of recursive functions ? Asked By : chgsilva Answered By : lPlant No they have the same cardinality. They have the cardinality $aleph_0$. Both Read More …
Problem Detail: I am looking for the longest simple path in a directed, cyclic and weighted graph with positive and negative weights. In my research so far I have found out that you need to generate -G from graph G and Read More …
Problem Detail: Suppose we have a set of functions $f_i: mathbb Z rightarrow {0,1}, i=1, dots,n $, with the following property: For each $i =1,dots ,n$, there exists an $xin mathbb Z$ such that $f_i(x)=0$ and $f_j(x)=1$ for each $jin {1,dots,i-1,i+1,dots,n}$. Read More …
Problem Detail: Problem I want to implement an optimization algorithm for my file transfer program. The program buffers data in a local file before uploading to central server periodically and it compresses the files before transferring. I would want the program Read More …
Problem Detail: On the begining: It is a programming contest problem, but not from on-going one. Unfortunatelly, I can’t provide any link to this task, because it is not publically available. It was from one of the Polish local programming contest Read More …
