The global acceptance of English as the language of science poses challenges to its non-native speakers. There has been prior work that assesses the impact of using a native/regional language as a medium of instruction for a Computer Science (CS) class. However, since classroom instruction involves a lot of non-verbal communication as well, the methodology of those studies is difficult to replicate and hence the results are difficult to generalize. In this paper, we focus on a smaller but potentially more replicable aspect. In particular, we are interested in assessing the impact of bilingual problem specifications on student comprehension in Introductory Programming. Problem comprehension is identified as one of the bottlenecks in the process of solving programming problems by novice programmers. Problems posed in English can be even tougher for its non-native speakers to comprehend. A feature of a typical multilingual classroom in India is that, in addition to having different native languages, the students can also have different levels of proficiency in English. Translating the problem to a language in which the students are more comfortable with, and in a way that reflects their use of the language, may result in better comprehension. In this paper, first, we present a framework for translation of a problem from English to a combination of English and a regional language. The framework allows some customization of the translation to suit an instructor’s specific teaching-learning context. We conduct a user study with 25 instructors that gives evidence on the efficacy of the framework. Then we apply it to translate an English variation of the well-studied Rainfall problem [14] to Hinglish (Hindi-English) and pose the two versions to two groups of randomly selected students (who are comfortable with Hindi) respectively. The result of this preliminary user study shows that there is no significant difference in the problem comprehension of students in the two groups.
In this paper, we study the hard uniform capacitated $k$ - median problem. We give $(5+\epsilon)$ factor approximation for the problem using local search technique, violating cardinality by a factor of $3$. Though better results are known for the problem using LP techniques, local search algorithms are well known to be simpler. There is a trade-off viz-a-viz approximation factor and cardinality violation between our result and the result of Korupolu \etal \cite{KPR} which is the only result known for the problem using local search. They gave $(1 + \alpha)$ approximation factor with $(5 + 5/\alpha)$ factor loss in cardinality. In a sense, our result is an improvement as they violate the cardinality by more than a factor of $6$ to achieve $5$ factor in approximation. Though in their result, the approximation factor can be made arbitrarily small, cardinality loss is at least $5$ and small approximation factor is obtained at a big loss in cardinality. Thus, we improve upon their result with respect to cardinality.
With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the availability and profitability of the central store. A store serving too less clients can be non-profitable and a store getting too many orders can lead to bad service to the customers which can be detrimental for the business. In this paper, we study the facility location problem(FL) with upper and lower bounds on the number of clients an open facility serves. Constant factor approximations are known for the restricted variants of the problem with only the upper bounds or only the lower bounds. The only work that deals with bounds on both the sides violates both the bounds [8]. In this paper, we present the first (constant factor) approximation for the problem violating the upper bound by a factor of (5/2) without violating the lower bounds when both the lower and the upper bounds are uniform. We first give a tri-criteria (constant factor) approximation violating both the upper and the lower bounds and then get rid of violation in lower bounds by transforming the problem instance to an instance of capacitated facility location problem.