A. Write a prolog procedure every-other/2 that receives a source list as its first argument and produces a list in the second argument whos elements are the elements of odd indexes in the source list. Examples are given in the following: ?- every-other([], L) L = []. ?- every-other([1], L) L = [1]. ?- every-other([1, 2], L) L = [1]. ?- every-other([1, 2, 3], L) L = [1, 3). ?- every-other([1, 2, 3, 41, L) L = [1, 3]. Make sure your procedure is efficiently terminated. B. What is the output of the following statements? ?- every-other(1, 2) ?- every-other(1) Provide detailed explanation.

A. Write a prolog procedure every-other/2 that receives a source list as its first argument and produces a list in the second argument whos elements are the elements of odd indexes in the source list. Examples are given in the following: ?- every-other([], L) L = []. ?- every-other([1], L) L = [1]. ?- every-other([1, 2], L) L = [1]. ?- every-other([1, 2, 3], L) L = [1, 3). ?- every-other([1, 2, 3, 41, L) L = [1, 3]. Make sure your procedure is efficiently terminated. B. What is the output of the following statements? ?- every-other(1, 2) ?- every-other(1) Provide detailed explanation.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following program written in C syntax: void fun (int first, int second) { first += first; second += second; } void main() { int list[2] = {1, 3}; fun(list[0], list[1]); } For each of the following parameter-passing methods, what are the values of the list array after execution? Passed by value Passed by reference Passed by value-result
Program in C
Write a program in C language to create a singly linked list as shown below and print it in the output. 1->2->3->4->5
PROLOG LANGUAGE We flatten a list L by first removing all lists within L and replacing them with their members. Write a Prolog rule flattenit/2 which flattens a list. Note: there is a built-in called flatten - you should not use that in your answer. For example: :- flattenit([a,b,c,[d,e],f,[c, a, b]], [a,b,c,d,e,f,c,a,b]). :- flattenit([1,2,3,4,[5,6,[7,8]]], [1,2,3,4,5,6,7,8]). :- flattenit([1,2,[3,4,[5,6],7],8,[2,4,5,8]], [1,2,3,4,5,6,7,8,2,4,5,8]).
In LISP, the function (copy-list <list>) (A) Returns a new list that is equal to <list> by copying the top-level element of <list> (B) Returns the length of <list> (C) Returns t if <list> is empty (D) None of the above
What is the purpose of a List? Give example of a List in any language. How is it created and used?
Don't copy Assuming that you have a function scanner() that returns the next token, and error() that exits the program with an error, write a recursive descent parser in C-like pseudocode for the following LL(1) grammar. S -> cAd | AB A -> ab | Ba B -> bb | empty
Give an example coding of C++. By using linked list, add a binary search tree function for your program that is able to search for data. Display the output for search results if the data exists or not exists.
Please write in scheme language. Write a Scheme procedure that sums all the elements in a given list of numbers. It takes input from the user as a list. Then it returns sums of elements in this list of numbers. Let's say The user enters 1 2 3 4 as a list. It must be returned 10 ( 1+2+3+4=10)
*Needs to be done in scheme interleave* Implement function interleave in scheme, which expects as arguments two lists x and y, and returns asingle list obtained by choosing elements alternately, first from x and then from y. When either x or yruns out, interleave takes the remaining elements from the other list, so that the elements of the resultare exactly the elements of the two argument lists taken together. (interleave '(1 2 3) '(a b c)) -> (1 a 2 b 3 c) (interleave '(1 2 3) '(a b c d e f)) -> (1 a 2 b 3 c d e f) (interleave '(1 2 3 4 5 6) '(a b c)) -> (1 a 2 b 3 c 4 5 6)
10. A. top-down C. syntax directed Cancel RESET _parser cannot handle left recursive grammar fy A © B. bottom up none of the above D. Done
I need the answer as soon as possible