Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian
  • Member for 5 years, 10 months
  • Last seen this week
  • Berlin, Deutschland
2 votes
Accepted

Give a grammar for a language on Σ={a,b,c} that accepts all strings containing exactly one a

1 vote

Compiler - Why is the grammar not suitable for shift-reduce

1 vote

Given an array arr[] of N integers. Do the following operation n-1 times

1 vote
Accepted

How to prove NP-completeness of this variant of the set cover problem?

1 vote

Are there any problems that reduce to the halting problem?

1 vote

is AVL tree is better than heap for sorting purpose?

1 vote
Accepted

Special case of the $MST-$ Problem

1 vote

Proving that Rice's theorem does not apply to a property

1 vote
Accepted

Sensitivity analysis of $MST$ edges

1 vote

Find $n'th$ perfect number , where perfect number is a positive integer whose sum of digits is $10$

1 vote
Accepted

How to find number of combinations of choosing one from k subsets

1 vote

Can we solve this problem more efficiently than trying all possible combinations

1 vote
Accepted

Doubt on Karger's Algorithm for Min-Cuts

1 vote
Accepted

Deterministic pushdown automaton for a given language

1 vote

Subset sum to 0/1 knapsack

1 vote

Proving NP-Complete problem by reduction of subset-sum

1 vote
Accepted

What category does questions like "Given n points on 2D plane find ..." belong to

1 vote
Accepted

Hamiltonian cycle, verifying and finding

1 vote

Finishing degree requirements NP-complete: Choosing 1 element from each set avoiding conflicts

1 vote

largest bitwise-or subset with a maximum number of on bits?

1 vote

What would happen if we added this rule to red-black trees?

1 vote

Bipartite graph minimal amount of vertices required

1 vote

Find all critical edges for minimum spanning tree

1 vote

Insert into binary tree and keep it balanced

1 vote
Accepted

Efficient algorithm for finding optimal sum from both arrays

1 vote

How to find all the edges shared by all diametral paths of a tree?

1 vote
Accepted

P/NP - Polynomial Reduction vs Certificate

1 vote
Accepted

Undecidable languages

1 vote
Accepted

find all paths from source to destinations and then calculate the path with minimum cost

1 vote

Algorithm to convert undirected connected graph with no bridges to strongly connected directed graph