This paper presents results of a questionnaire focused on investigating students’ confi� dence and behavioral intention in the area of programming, particularly that of structures, problem solving, and programming commands (Conditional – loop). Responses from 116 1st year students regarding informatics were used. The results indicate that the engagement with programming logic yields a positive ...

Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its nearest facility is minimized. Geometrically, a Euclidean 2-centre of P corresponds to a cover of P by two discs of minimum radius r (the Euclidean 2-radius). Given a set of mobile clients, where each client follows a co...

Optimal algorithms are derived for safisficing problem-solving search, that is, search where the goal is to reach any. solution, no distinction being made among differ-ent solutions. This task is quite different from search for best solutions or shortest path solutions. L:onstraints mav be placed on the order in which sittes may be searched. This paper treats salisficing searches through partia...

We consider the k most vital edges (nodes) and min edge (node) blocker versions of the 1-median and 1-center location problems. Given a weighted connected graph with distances on edges and weights on nodes, the k most vital edges (nodes) 1-median (respectively 1-center) problem consists of finding a subset of k edges (nodes) whose removal from the graph leads to an optimal solution for the 1-me...

Individual differences in working memory capacity (WMC) increase the ability and tendency to devote greater attentional control to a task—improving performance on a wide range of skills. In addition, recent research on enclothed cognition demonstrates that the situational influence of wearing a white lab coat increases controlled attention, due to the symbolic meaning and physical experience of...

The container loading problem has important industrial and commercial applications. An increase in the number of items in a container leads to a decrease in cost. For this reason the related optimization problem is of economic importance. In this work, a procedure based on a nonlinear decision problem to solve the cylinder packing problem with identical diameters is presented. This formulation ...

Vertex k-center problem introduces the notion to recognize k locations as centers in a given network of n connected nodes holding the condition of triangle inequality. This paper presents an efficient algorithm that provides a better solution for vertex k-center problem. Anticipatory Bound Selection Procedure (ABSP) is deployed to find the initial threshold distance (or radius) and eradicating ...

We present an O(n log n) time algorithm for the (weighted) k-center problem of n points on a real line. We show that the problem has an Ω(n log n) time lower bound, and thus our algorithm is optimal. We also show that the problem is solvable in O(n) time in certain special cases. Our techniques involve developing efficient data structures for processing queries that find a lowest point in the c...