# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

4 Pages

### lect09

Course: COMP 205, Fall 2009
School: East Los Angeles College
Rating:

Word Count: 1207

#### Document Preview

IMPERATIVE COMP205 LANGUAGES 6. COMPOUND (HIGHER LEVEL) DATA TYPES II --- MORE ON ARRAYS 1) Constrained (static) and unconstrained (dynamic) arrays. 2) Flexible arrays 3) Multi-dimensional arrays 4) Arrays of arrays 5) Lists, sets, bags,Etc. 6) Strings CONSTRAINED AND UNCONSTRAINED ARRAYS A constrained array is an array where the index is specified (and hence the number of components is specified). We say that...

Register Now

#### Unformatted Document Excerpt

Coursehero >> California >> East Los Angeles College >> COMP 205

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
IMPERATIVE COMP205 LANGUAGES 6. COMPOUND (HIGHER LEVEL) DATA TYPES II --- MORE ON ARRAYS 1) Constrained (static) and unconstrained (dynamic) arrays. 2) Flexible arrays 3) Multi-dimensional arrays 4) Arrays of arrays 5) Lists, sets, bags,Etc. 6) Strings CONSTRAINED AND UNCONSTRAINED ARRAYS A constrained array is an array where the index is specified (and hence the number of components is specified). We say that the bounds are static, hence constrained arrays are sometimes referred to as static arrays. Many imperative languages (including Ada but not C) also support some mechanism for declaring unconstrained arrays. In this case we say that the bounds are dynamic. Ada makes use of the symbol <> to indicate an unconstrained array: type LIST1 is array (INTEGER range <>) of FLOAT; L1 : LIST1(START..END); DYNAMIC ARRAYS Although C does not support the concept of unconstrained arrays, however it does provide facilities to delay the declaration of an upper bound of an array till run time, i.e. the upper bound is declared dynamically hence such an array is referred to as a dynamic array. Two library functions malloc and free are used. The malloc(<size>) function obtains a block of memory (for the array) according to the parameter <size>. (Note: The type of this parameter is system dependent, but is usually an int or an unsigned int). The free function releases a block of memory. int num = 4; void main(void) { int *numPtr = NULL; numPtr = (int *) malloc(sizeof(int)*num); /* Initialise. */ numPtr[0] = 2; numPtr[1] = 4; numPtr[2] = 6; numPtr[3] = 8; /* Output. */ printf("Array = %d, %d, %d, %d\(bsn", numPtr[0],numPtr[1], numPtr[2],numPtr[3]); /* End */ free(numPtr); } C DYNAMIC ARRAY EXAMPLE OTHER TYPES OF ARRAY Apart from the standard array forms described earlier (static or constrained, and dynamic or unconstrained) we can identify a number of alternative forms of array which are a feature of particular imperative languages. These include: 1) Flexible arrays 2) Multi-dimensional arrays 3) Arrays of arrays 4) Lists FLEXIBLE ARRAYS A powerful feature associated with some imperative languages is the ability to dynamically "resize" an array after it has been declared, i.e. during run-time. Such an array is referred to as a flexible array. Neither Ada or C support flexible arrays (Algol'68 does). A similar effect can be achieved in C using the built-in functions malloc and realloc. realloc extends or contracts the memory space available for a previously declared array. 1 int num = 4; void main(void) { int *numPtr = NULL; /* Allocate memory and initialise. */ numPtr = (int *) malloc(sizeof(int)*num); numPtr[0] = 2; numPtr[1] = 4; numPtr[2] = 6; numPtr[3] = 8; --- Ouput code --/* Reallocate memory and reinitialise. */ num = 3; numPtr = (int *) realloc(numPtr,sizeof(int)*num); numPtr[0] = 1; numPtr[1] = 3; numPtr[2] = 5; --- Ouput code --free(numPtr); } C FLEXIBLE ARRAY EXAMPLE MULTI-DIMENSIONAL ARRAYS Multi-dimensional arrays are arrays where the elements have more than one index. In the case of two-dimensional arrays these can be thought of as comprising rows and columns, where the row number represents one index and the column number a second index. Columns Two-dimensional arrays are 1 2 therefore useful for storing tables of information. 1 1 2 Rows 2 3 4 3 5 6 with CS_IO ; use CS_IO ; procedure EXAMPLE is type TWO_D_ARRAY_T is array (1..3, 1..2) of integer; IA: TWO_D_ARRAY_T := ((1, 2), (3, 4), (5, 6)); begin put(IA(1,1)); put(IA(1,2));new_line; ADA 2-D put(IA(2,1)); ARRAY put(IA(2,2));new_line; put(IA(3,1)); EXAMPLE put(IA(3,2));new_line; end EXAMPLE ; void main(void) { int ia[3][2] = {{1, 2}, {3, 4}, {5, 6}}; printf("Size of array = %d (bytes)\n",sizeof(ia)); printf("Num elements = %d\n", sizeof(ia)/sizeof(ia[0][0])); printf("Array comprises = %d, %d, %d, %d, %d, %d\n", ia[0][0],ia[0][1],ia[1][0], ia[1][1],ia[2][0],ia[2][1]); } C 2-D ARRAY EXAMPLE Size of array = 24 (bytes) Num elements = 6 Array comprises = 1, 2, 3, 5, 4, 6 Note that the "row" index is declared first, then the "column" index. ARRAYS OF ARRAYS Some imperative languages (including Ada, but not C) support arrays of arrays. The distinction between arrays of arrays and multidimensional is that in the second case the result need not be rectangular. procedure ADA_EXAMPLE is type A is array (1..2) of integer; A1: A:= (1, 2); A2: A:= (3, 4); A3: A:= (5, 6); type A_OF_A is array (1..3) of A; IA: A_OF_A:= (A1, A2, A3); begin put(IA(1)(1)); put(IA(1)(2));new_line; put(IA(2)(1)); put(IA(2)(2));new_line; put(IA(3)(1)); put(IA(3)(2));new_line; end ADA_EXAMPLE ; LISTS Lists (or sequences) can be considered to be special types of arrays but: with an unknown number of elements, and without the indexing capability. Lists are popular in logic and functional languages but not in imperative languages. 2 SETS A set is a group of (distinct) elements, all of the same type, which are all possible values of some other type referred to as the base type. The relationship is similar to that of an Ada sub-type to its super-type, e.g. positive integers to integers. The distinction between an array and a set is that the elements are not ordered (indexed) in anyway. The number of elements in a set is referred to as its cardinality. The only operations that can be performed on sets are set operations, e.g. member, union, intersection, etc. Neither Ada or C feature sets, however Pascal and Modula-2 do. PASCAL SET EXAMPLE program SET_EXAMPLE (output); type SOMEBASE_T = 0..10; SOMESET_T = set of SOMEBASE_T; var SET1, SET2 : SOMESET_T; begin SET1 := [1, 2, 5]; SET2 := [6, 8, 9]; --- More code in here --end. BAGS (MULTISETS) Bags (multisets) are similar to sets except that they can contain an element more than once and record how many times a value has been inserted. The primary operations on bags are "insert value" and "remove value" (as opposed to the union, intersection, etc. operations found in sets). Very few imperative languages feature bags. STRINGS A further type of array is the string. A string is a sequence of characters usually enclosed in double quotes. For this reason strings are sometimes referred to as a character arrays. As such we can use standard array operations on strings: We can access any character in a string using an index. Where supported (Ada) we can access slices of strings. In C the last member o...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 14. PROGRAM COMPOSITION II1) More on parameter passing: a) Parameter association b) Default parameters c) Procedures as parameters 2) Modules: Ada packages, C modules, C header files 3) Programs 4) Generics and Abstract
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 2. DATA1) Data Attributes2) Declarations, Assignment and Instantiation 3) Global and Local Data 4) Variables 5) Constants 6) Example programsDATA - &quot;that which is given&quot;A data item has a number of attributes: 1) An A
Cal Poly - MEC - 6304
PERFORMANCE 23 18SWASHPLATESERIES PUMP ANGLETHESE CURVES DO NOT TAKE LOSSES DUE TO THE, CHARGEINTO PUMPACCOUNT
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 3. DATA AND DATA TYPES1) Data Review 2) Anonymous Data Items 3) Renaming 4) Overloading 5) Introduction to Data Types 6) Basic types 7) Range and precision 8) Ada/Pascal &quot;attributes&quot;ANONYMOUS DATA ITEMS Often we use d
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 5. COMPOUND (HIGHER LEVEL) DATA TYPES I - ARRAYS1) Introduction to higher level types 2) Arrays and their declaration 3) Assigning values to array elements 4) Operations on arrays 5) Ada array attributesINTRODUCTION TO
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 6. COMPOUND (HIGHER LEVEL) DATA TYPES II - MORE ON ARRAYS1) Constrained (static) and unconstrained (dynamic) arrays. 2) Flexible arrays 3) Multi-dimensional arrays 4) Arrays of arrays 5) Lists, sets, bags,Etc. 6) Strings
East Los Angeles College - COMP - 205
COMP205 Comparative Programming LanguagesGrant Malcolm (grant@csc.liv.ac.uk) Introduction to programming languages The imperative paradigm The functional paradigm Other paradigms and concluding remarksBOOKS1. Tucker, A. and Noonan, R. Program
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 11. PROGRAM CONSTRUCTS 2 (REPETITION)1) Fixed count loops 2) Variable count loops 3) Post-test Loops 4) Terminating a loopREPETITION Two main forms of repetition: 1) Fixed Count Loops: Repetition over a finite set (fo
Sveriges lantbruksuniversitet - M - 251
Homework #1 MATH 251 Coordinates in Three Dimensions a) Describe the geometry of the set of points whose coordinates (x, y, z) satisfy the equation: x2 + y 2 + z 2 + 4x + 2y 6z 22 = 0 . b) Show that the intersection of the object in part a) with
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 7. COMPOUND (HIGHER LEVEL) DATA TYPES III1) Enumerated types 2) 3) 4) 5) 6) Records and structures Accessing fields in records/structures Operations on records/structures Variant records Dynamic and static arrays of reco
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 9. EXPRESSIONS AND STATEMENTS1. Unions 2.Expressions. 3.Operators. 4.Type equivalence. 5.Coercion, casting and conversion.UNIONS It is sometimes desirable to define a variable which can be of two or more different typ
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 12a. ERROR HANDLING1) Causes of errors 2) Classification of errors 3) Signals and exceptions12b. PROGRAM COMPOSITION I1) Program hierarchy 2) Blocks 3) Routines 4) Procedures and functionsCAUSES OF ERRORS1) Domain/
Sveriges lantbruksuniversitet - MATH - 443
MATH 443 Assignment #7Below are short answers (hints) to assigned questions.19A(i) There are 6 = 15 points in the incidence structure. Consider two 2 distinct edges of K6 . If they have a common endpoint, they belong to a unique triangle, and to
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES INTRODUCTION1) Definition2) Note on structured and modular programming, and information hiding 3) Example imperative languages 4) Features of imperative languages(Q) WHAT IS AN IMPERATIVE LANGUAGE? We can define such
East Los Angeles College - COMP - 205
COMP205 Comparative Programming LanguagesPart 1: Introduction to programming languagesLecture 3: Managing and reducing complexity, program processingMANAGING AND REDUCING COMPLEXITY, AND PROGRAM PROCESSING1. Managing and reducing complexity
East Los Angeles College - COMP - 205
TYPE EQUIVALENCE1) Coercion 2) Casting 3) ConversionCOERCION Operators require their operands to be of a certain type (similarly expressions require their arguments to be of the same type). In some cases it may be appropriate, when a compiler fi
Sveriges lantbruksuniversitet - MATH - 202
MACM 202 Assignment 3, Spring 2004Luis Goddyn and Michael MonaganThis assignment is worth 10% of your grade. It is due Friday February 18th at beginning of class. A late penalty of 20% will apply for each day late. Do question: Either 1 or 2 , eith
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 4. MORE ON BASIC DATA TYPES1) Pointers 2) Type declarations 3) Access/reference values 4) Type renaming/aliasing 5) Subtypes 6) Macro substitutionPOINTERS Pointer variables have as their value an address, i.e. a refer
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 13. PROGRAM COMPOSITION II1) Scope a] Ada scope rules b] C scope rules 2) Parameter passing a] Ada parameter modes b) Parameter passing mechanismsSCOPE RULES Scope rules govern the visibility and life time of data ite
Sveriges lantbruksuniversitet - MATH - 443
MATH 443 - Assignment #3Below are short answers (hints) to assigned questions.14EFix one edge, say e, of the convex (n + 1)-gon. For any particular dissection into quadrilaterals consider the quadrilateral &quot;supported&quot; by edge e. The remaining thr
East Los Angeles College - COMP - 205
Comp 205:Comparative Programming Languages FunctionalProgrammingLanguages:MoreLists Recursivedefinitions Listcomprehensions Lecturenotes,exercises,etc.,canbefoundat: www.csc.liv.ac.uk/~grant/Teaching/COMP205/RecursionThetypeoflistsisrecursive
Sveriges lantbruksuniversitet - MATH - 820
TSP Lower BoundsLuis Goddyn, Math 408 We give here two techniques for obtaining lower bounds on TSP instances. That is, for a given instance (V, d), we would like to find the largest possible number t such that (T ) t for every TSP tour T . We firs
Sveriges lantbruksuniversitet - MATH - 445
A SAMPLE MATH DOCUMENTJOHN DOE, MATH 445, FALL 2006This is a sample input le. Comparing it with the output it generates can show you how to produce a simple document of your own. 1. Ordinary Text The ends of words and sentences are marked by space
Sveriges lantbruksuniversitet - MATH - 820
TSP HeuristicsLuis Goddyn, Math 408 There are two types of heuristic methods for finding optimal TSP tours. Scratch methods produce an initial tour which is hopefully fairly close (say 10%) from being optimal. Improvement methods (sometimes called p
Sveriges lantbruksuniversitet - MATH - 445
Homework 7 SolutionsOuterplanar A graph G is outerplanar if it can be drawn in the plane so that all vertices lie on the infinite face. 1. Show that G is outerplanar if and only if G has no K2,3 or K4 minor. Solution: Let G+ be the graph obtained fr
Sveriges lantbruksuniversitet - MATH - 820
Exercises for Math 820 Luis Goddyn 1. Let w : V {0, 1, 2, . . .} be a weighting of the vertices of an undirected graph G = (V, E). Describe an algorithm which either nds an orientation of G for which each vertex v has out-degree exactly + (v) = w(v
Sveriges lantbruksuniversitet - MATH - 443
MATH 443 - Assignment #5Below are short answers (hints) to assigned questions.37ALet C denote the group of rotations of the cube. Following the description of elements of C in Appendix 1 we find that the cycle index of the action of C on the six
Sveriges lantbruksuniversitet - MATH - 445
Higher Surfaces I: embeddings and the torusIn this section, graphs are permitted to have loops and parallel edges. Surface: A surface is a topological space which appears locally like the plane. More precisely, for every point x in the surface, ther
Sveriges lantbruksuniversitet - MATH - 445
Extremal Graph Theory II: more Ramsey TheoryIn this section, graphs are assumed to have no loops or parallel edges. Hypergraph: A hypergraph H consists of a set of vertices, denoted V (H), a set of edges (sometimes called hyperedges), denoted E(H),
Sveriges lantbruksuniversitet - MATH - 445
Homework 5 Solutions1. If G is a 2-connected simple plane graph with minimum degree 3, does it follow that the dual graph G is simple? Give a proof or a counterexample. Solution: The following graph is a counterexample:2. Prove that contracting an
East Los Angeles College - COMP - 213
Time allowed: TWO Hours Answer four questions. If you answer more than four questions, your answer with the lowest mark will be ignored. 1. A Rose Tree is a tree with an integer internal label and a List of subtrees, each of which is a Rose Tree. We
Sveriges lantbruksuniversitet - MATH - 202
MACM 202 Assignment 4, Spring 2005Luis GoddynThis due Friday March 11th in class. A late penalty of 20% will apply for each day late. For all the excercises, use Maple where appropriate.Questions From the Text (60 marks)Do exercises 4.2, 4.4, 4.
East Los Angeles College - COMP - 205
ORDER OF PROCEDURE DECLARATIONS In block structured languages (where procedures and functions may be nested) the order in which procedures are declared also effects their visibility. Ada (and other block structured languages such as Pascal) require
Sveriges lantbruksuniversitet - MATH - 308
First Midterm Exam MATH 308-3 Solution Key Instructions: Do all ve questions, writing each answer in the space provided (use back if necessary). Their point values are as indicated. Total = 50 points. Duration = 50 minutes. No calculators!(1) (a) C
East Los Angeles College - COMP - 205
Comp 205:Comparative Programming LanguagesFunctional Programming Languages:An Introduction to HaskellT E F v E T y xp h p e interp es ressions reterHaskellunctions al uationLecture notes, exercises, etc., can be found at: w w w .csc.l
Sveriges lantbruksuniversitet - MATH - 445
Homework 2 Solutions1. Let G be a graph such that (G - x - y) = (G) - 2 for all pairs x, y of distinct vertices. Prove that G is a complete graph. Solution: Let (G) = t and suppose (for a contradiction) that there exist x, y V (G) which are not adj
East Los Angeles College - COMP - 213
COMP 213Class Vector&lt;E&gt;public class Vector&lt;E&gt; { public Vector() { E[] elementData = .;Advanced Object-oriented ProgrammingLectureDocumentation} public E elementAt(int i) { E theElement = elementData[i]; . } . }(Tinguely -)Class Vector&lt;B
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 3. DATA AND DATA TYPES1) Data Review 2) Anonymous Data Items 3) Renaming 4) Overloading 5) Introduction to Data Types 6) Basic types 7) Range and precision 8) Ada/Pascal &quot;attributes&quot;ANONYMOUS DATA ITEMS Often we use d
East Los Angeles College - COMP - 213
COMP 213Advanced Object-oriented ProgrammingLecture 4Modiers and ScopeBattle of the BandsRecall: class BandCard constructor BandCard(String s, int v, int a, int c, int e, int h) { name = n; volume = v; attitude = a; cool = c; eclecticism = e;
East Los Angeles College - COMP - 213
COMP 213ClassesAdvanced Object-oriented ProgrammingA class contains declarations of members. Members can be: elds (including constants) methods Lecture 5Scopeclasses Each of these has a name, as do classes themselves. Every name has a scope,
East Los Angeles College - COMP - 213
COMP 213Battle of the BandsRecall: class BandCard constructor BandCard(String s, int v, int a, int c, int e, int h) { name = n; volume = v; attitude = a; cool = c; eclecticism = e; hair = h; }Advanced Object-oriented ProgrammingLecture 4Modie
East Los Angeles College - COMP - 213
COMP 213: Advanced Object-Oriented ProgrammingCOMP 213Advanced Object-Oriented ProgrammingNetwork Programming Lecture 20: networks, protocols, sockets and portsDepartment of Computer Science, University of LiverpoolCOMP 213: Advanced Object
East Los Angeles College - COMP - 205
Comp 205:Comparative Programming LanguagesSemantics of Functional Languages Term- and Graph-Rewriting The ? -calculusLecture notes, exercises, etc., can be found at: www.csc.liv.ac. uk/~grant/Teaching/COMP205/Term RewritingA straightforward w
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 2. DATA1) Data Attributes2) Declarations, Assignment and Instantiation 3) Global and Local Data 4) Variables 5) Constants 6) Example programsDATA - &quot;that which is given&quot;A data item has a number of attributes: 1) An A
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 7. COMPOUND (HIGHER LEVEL) DATA TYPES III1) Enumerated types 2) 3) 4) 5) 6) Records and structures Accessing fields in records/structures Operations on records/structures Variant records Dynamic and static arrays of reco
East Los Angeles College - COMP - 205
COERCION TYPE EQUIVALENCE1) Coercion 2) Casting 3) Conversion Operators require their operands to be of a certain type (similarly expressions require their arguments to be of the same type). In some cases it may be appropriate, when a compiler fin
East Los Angeles College - COMP - 213
COMP 213Advanced Object-oriented ProgrammingLecture 10Utility Classes(Dubuffet )(Re)Using ClassesOne of the chief motivations for the Object Paradigm is code re-use. Code in a method is written once, and can be used many times (each time th
East Los Angeles College - COMP - 213
COMP 213Advanced Object-oriented ProgrammingLecture 14Implementing Prop(Mondrian )Java Implementationpublic class Prop { public Prop and(Prop p1, Prop p2) { . } / similarly for or, etc. public String printAllBrackets() { .} public String t
East Los Angeles College - COMP - 213
COMP 213Advanced Object-oriented ProgrammingLecture 8Lists(Mondrian -)COMP 213Advanced Object-oriented ProgrammingLecture 8Lists(Mondrian -)ListsIn CardHand, we reduced the number of times cards had to be shuffled down the array b
East Los Angeles College - COMP - 213
COMP213DEPARTMENT : Computer ScienceTel. No. 794 6794JANUARY 2006 EXAMINATIONSBachelor of Arts : Year 2 Bachelor of Science : Foundation Year Bachelor of Science : Year 1 Bachelor of Science : Year 2 Bachelor of Science : Year 3 Master of Math
East Los Angeles College - COMP - 213
COMP 213More ParametersAdvanced Object-oriented ProgrammingA class can have more than one type parameter. For example, a class of pairs: public class Pair&lt;A,B&gt; { Lecture 32Fun with Genericsprivate A first; private B second; public Pair(A a, B
East Los Angeles College - COMP - 205
COMP205 IMPERATIVE LANGUAGES 14. PROGRAM COMPOSITION II1) More on parameter passing: a) Parameter association b) Default parameters c) Procedures as parameters 2) Modules: Ada packages, C modules, C header files 3) Programs 4) Generics and Abstract
Sveriges lantbruksuniversitet - CMPT - 310
Three tricksChapter 13Chapter 131Three tricks we useBayes rule: P(X|Y )P(Y ) = P(X|Y )P(Y ) P(Y |X) = P(X) Marginalization: P(X) = y P(X, Y = y) Product rule: P(X, Y ) = P(X)P(Y |X) All 3 work with extra conditioning, e.g.: P(X|Z) = y P(X, Y
Sveriges lantbruksuniversitet - CMPT - 310
Local search algorithmsChapter 4, Sections 34Chapter 4, Sections 341Outline Hill-climbing Simulated annealing Genetic algorithms (briey) Local search in continuous spaces (very briey)Chapter 4, Sections 342Iterative improvement algo
Sveriges lantbruksuniversitet - CMPT - 726
Probabilistic ModelsBayesian NetworksProbabilistic ModelsBayesian NetworksOutlineGraphical Models - Part IGreg Mori - CMPT 419/726 Probabilistic ModelsBishop PRML Ch. 8, some slides from Russell and Norvig AIMA2eBayesian NetworksProb
East Los Angeles College - COMP - 210
COMP210 Articial Intelligence Lab Exercise 3 - to be carried out in week 41. Create a new prolog program le in your prolog programs directory called lab3.pl. Add to it the denition of member given in lectures. Use member to nd whether (a) 3 is a me
East Los Angeles College - COMP - 318