Question

1 point
Q.17 One end of a string of length 1.5 m is tied to a stone of mass 0.4 kg
and other end to a small pivot on a smooth vertical board. The minimum
speed of the stone required at its lowest point for looping the loop is - *
O u = 5.57 ms-1
O U = 7.57 ms-1
O U = 6.57 ms-1
O U = 8.57 ms-1​

Answer 1

Answer:

Abstract

Inductive program synthesis, from input/output examples,

can provide an opportunity to automatically create pro-

grams from scratch without presupposing the algorithmic

form of the solution. For induction of general programs with

loops (as opposed to loop-free programs, or synthesis for

domain-specific languages), the state of the art is at the

level of introductory programming assignments. Most prob-

lems that require algorithmic subtlety, such as fast sorting,

have remained out of reach without the benefit of significant

problem-specific background knowledge. A key challenge is

to identify cues that are available to guide search towards

correct looping programs. We present MAKESPEARE, a

simple delayed-acceptance hillclimbing method that synthe-

sizes low-level looping programs from input/output exam-

ples. During search, delayed acceptance bypasses small gains

to identify significantly-improved stepping stone programs

that tend to generalize and enable further progress. The

method performs well on a set of established benchmarks,

and succeeds on the previously unsolved “Collatz Numbers”

program synthesis problem. Additional benchmarks include

the problem of rapidly sorting integer arrays, in which we ob-

serve the emergence of comb sort (a Shell sort variant that

is empirically fast). MAKESPEARE has also synthesized a

record-setting program on one of the puzzles from the TIS-

100 assembly language programming game.

1 Introduction

Automated synthesis of programs from user requirements

has a long history as an AI research goal (Waldinger and

Lee 1969; Gulwani, Polozov, and Singh 2017). Recent in-

terest in the problem has led to synthesis success for non-

looping programs (e.g. clever bit-twiddling (Gulwani et al.

2011)), partial program “sketches” with holes to be syn-