Computer Science

students, researchers and practitioners of computer science
Solved Questions
Unsolved Questions
  1. reinforcement learning in gridworld with subgoals
  2. Confluent directed acyclic graph

  3. How to Compute Lowpt(v) in a DFS Tree, where Lowpt(v)={w| there exist a back_edge xw, such that x is a descendant of v}?

  4. Convert a string consisting of only digits into an integer array such that the elements form a Fibonacci sequence based on the indices

  5. Is it NP complete to decide whether a partition of $V=(V_1, V_2)$ exists such that $\delta(G(V_1))\le 2 $ and $\delta(G(V_1))\le 3 $?

  6. Maximum sum Sequence such that no two elements are adjacent

  7. Steiner tree problem with the known optimal subset of Steiner vertices in approximation algorithms

  8. multiple sequence alignment using HMM and simulated annealing
  9. If2P(16,r)=P(16,r+2),then find r
  10. How would a priority queue be implemented in a functional programming language?

  11. Find a path that contains specific nodes without back and forward edges

  12. Provide me the algorithm on insertion sort of element
  13. Demonstrate that algorithm is O(n)

  14. Is it NP complete to decide whether there exists a subset of V of size at most $k$ hitting all maximal bicliques of G?

  15. How to deal with cost variation in a dynamic graph when applying Dijkstra
  16. Resource Allocation Graph: Two processes want the same resource

  17. Comb Sort Best Case

  18. Language of all words accepted by a TM by at most $t$ steps is regular
  19. How does a computer know a light is on (binary)?

  20. Binary Exponential Backoff

  21. If $L = \{ a^{2^n} \mid n \ge 0 \} $ is not regular, then why there is a DFA thats accepts its language?

  22. Minimum cost to convert one array to another
  23. Why do we not use CFGs to describe the structure of lexical tokens?

  24. circle selection

  25. A path modification problem in directed graphs

  26. Alan Perlis Epigram on Recursion
  27. Sorting by Comparisons Proof
  28. Making a CFL for a^i b^j c^k such that i+j = 3k
  29. Algorithm to find best combination of datasources (Quality and price)

  30. Binary Tree Node Insertion
  31. Call by value, call by reference , call by value result

  32. Is $P\neq NP\iff 3SAT$ not reducible to LP?
  33. Is $\{0,1\}$ LP and $[0,1]$ LP directly reducible to $3SAT$?
  34. Transitivity of quasi-reducibility

  35. Why don't we delete a node in adjacency list after visiting an edge in Fleury algorithm?

  36. What is a reducible flow graph?

  37. How can I assign cooks to customers?
  38. Troubles understanding this Interval Scheduling question
  39. How to feed videos to a neural network

  40. Calculating the set field of associative cache

  41. Runtime analysis of while-loop analysis

  42. Finding the Diameter, Radius and Eccentricities of G

  43. What do Arora and Barak mean by $x|_S$ in their definition of certificate complexity?

  44. Finding a Simple Distribution In a Binary String
  45. is P_CTC = BPP_PATH?

  46. is it possible to determine using a single depth-first search, in O(V+E) time, whether a directed graph is singly connected?

  47. If Q1 and Q2 are countably enumerable, then is Q1\Q2 countably enumerable?
  48. What is the runtime of binary search on a continuous function?
  49. Which OS component is in charge of searching for free memory?
  50. Efficiently finding the maximum pairwise GCD of a set of natural numbers

  51. Object qualification algorithm

  52. Is the outer loop in typical bubble sort algorithm precise?

  53. Variable bytes (bit arrays) and flipping single bits?

  54. Show that the set $\{uv | u \in L \ and\ v \notin L\}$ is regular

  55. The recursive solution to the all-pairs shortest-paths of Floyd-Warshall algorithm
  56. Does Floyd–Warshall work on all graphs?

  57. How does in-order traversal in Binary search tree works (recursion)
  58. Are the implications of the diagonalization language different from those of the halting problem?
  59. Find the nearest sum to a given number of two elements in sorted matrix

  60. Proving the correctness of a square summing algorithm

  61. Understanding Bellman-Ford and Floyd-Warshall Algorithms as Dynamic Programming Algorithms

  62. What does software data look like?

  63. Better algorithm for aggregating data from various LDAP systems

  64. Fibonacci Heap / Binomial Heap - Decrease Key

  65. $O(n\log n)$- algorithm for finding tree root

  66. Efficient streaming sort

  67. Why can't a compiler create universal N-bit code (e.g. 32-bit, 64-bit, etc.)

  68. Reducing INDSET and MAXCUT to 3SAT

  69. Simulating Turing Machine with writing only on non-input fields on read-only Turing machine

  70. Nearest codeword in a translation-invariant code over $\mathbb{Z}^d$

  71. Computational Complexity of Solutions of the Traveling Purchaser Problem on a Small Data Set
  72. How to prove that the language { ww | w ∈ {a,b}* } is / isn't context free?
  73. Online set filling with redistributions
  74. language accepted by DFA

  75. Name for number of branches of a tree

  76. Is there way to calculate $\sum_{i<j<k\leq n} A_i \cdot A_j \cdot A_k$ faster than $O(n^3)$

  77. Data structure optimized for merging maps on partitions

  78. Do the classes $P$ and $NP$ include problems faster then polynomial?

  79. Miss penalty for Write request in a Write-Back style system
  80. Subtlety of a bar in introduction rule

  81. High Level Assemblers vs Compilers?

  82. What is the difference between a block and a procedure?

  83. video shape recognition in real time
  84. Validating attempt on NFA to Regular Expression

  85. Vertex degrees of planar graphs

  86. Union of two non-context-free languages
  87. Data Structure - Array of Array
  88. Runtime analysis of prime-set computation

  89. Does the Working Set Paging Algorithm use a separate page table?
  90. The "complexity" of the Turing machine state specification
  91. Fuzzy, nonsequential string search algorithm?

  92. How to prove the existence of a number which cannot be written by any algorithm?

  93. Manipulating Adjacency matrix

  94. Segment-tree construction: do we recurse into both children?

  95. Backward mapping with bilinear sampler
  96. Is there an algorithm to detect race conditions in logic circuits?
  97. Provide a derivation from backwards on?
  98. How does reducing the Halting problem prove the reduction cannot exist?

  99. Why is the Turing Machine a popular model of computation?

  100. Algorithm Comparison with Theta-notation