This paper provides computational algorithms for English Questions, by which we can effectively handle and implement Yes-No Questions and Wh-Questions. Those algorithms will be developed in Categorial Grammar. In this paper, we will modify and revise Steedman＇s Combinatory Categorial Grammar (CCG) so that we can computationally implement Questions effectively, which will be called a CCG-like system. In this system, semantic interpretations of Questions will be calculated compositionally based on the functor-arguments relations of the constituents. In sum, this paper provides analyses of Questions in Categorial Grammar, by which we can effectively implement Questions in English.