Answered: Define a function compress : lists(T) →…

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

Related questions

Question

Define a function compress : lists(T) → lists(T) that accepts a list argument (of some generic type T) and returns a list without any subsequent redundancies, e.g. compress(⟨a, a, b, b, b, c, c, a, b⟩) = ⟨a, b, c, a, b⟩

1. Transform the definition into a computable function.
2. Define f recursively.
3. Unfold your definition for compress(⟨a, a, b, b, c, a⟩).
4. (PROGRAMMING) Please map your definition into a Common LISP function. Place your code in file compress.lisp. The code should behave as follows:

> (compress ’(a a a b c d d e))
(A B C D E)
> (compress ’())
NIL
> (compress ’(a b c c c a))
(A B C A)
> (compress ’(a a b b c c c c a b b))
(A B C A B)

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions