Linked Questions

22
votes
21answers
5k views

Reference: templates for common comments

The purpose of this post is to aggregate several templates for comments useful for the daily moderating of the CS site, e.g., informing the user (usually, new user) when their question is off-topic / ...
49
votes
8answers
12k views

Reference answers to frequently asked questions

Why am I here? If you were sent here, somebody thought that you posted your question too early, that is you don't know facts and/or techniques one would learn in undergraduate courses. This is not ...
5
votes
3answers
1k views

Homework policy

The accepted answer on this question is our homework policy, adopted by a community poll. The poll rules and outcome are retained below for historical purposes. Rules Below, you will find three ...
9
votes
2answers
360 views

A guide to moderating Computer Science Stack Exchange yourself — close voting

We've had complaints in the past that too many questions were closed by moderators. And as the site grows, we have more questions in need of closing. We have a growing number of users who can cast ...
6
votes
3answers
184 views

Should we have a custom close reason for homework assignment dumps?

Since the beginning of the north hemisphere term, we've seen a sharp increase in questions that consist solely of a dump of a homework assignment, where there is no question, only “solve this”. Our ...
2
votes
2answers
85 views

Should this question really be closed?

I recently found this question: If there is comparison between two variables then language is not regular. Then how the below two languages L1 and L2 Regular? Please Explain It is closed as a ...
3
votes
1answer
104 views

Can I ask competitive programming questions?

I often stuck on some competitive programming problems. I don't know a good place to ask my question. If my issue is about the algorithm to use not the implementation, can I ask my question here? How ...
3
votes
2answers
60 views

How to fix the question “Properties of graphs where every edge is in at most one simple cycle”

The question Properties of graphs where every edge is in at most one simple cycle is—in my opinion—an interesting question which is very well suitable for cs.sx. The question concerns properties of ...
3
votes
3answers
58 views

Close votes that don't apply to the question

This question has, at the time of writing, three close votes. None of them seems appropriate. Off-topic: does not appear to be about computer science... It's a question about decidability of ...
0
votes
1answer
87 views

Why was this question re-opened?

Why was this question re-opened? As you can see from the history, I voted to close it, then one moderator closed it, then another moderator re-opened it. The side effect of the re-opening is that I ...