avillachandok

Hi, I need to write a prolog predicate for diff/3 without using the built-in predicate subtract/3. The diff/3 predicate for example gives as follows: [code] ?-diff([1,3,3,4],[4,5,8],X) X=[1,3][/code] The diff(List1,List2,X) predicate takes List 1 and List 2 and unifies a new list X with all elements in List1 that do not …

I just want to confirm my answers for prolog problems. i)Every animal is mortal ∀X. (Animal(X)→ Mortal(X)) ii)If nobody is both a child and a dog then if Fido is a dog then Fido cannot be a child. ¬∃X. ((Child(X)^ Dog(X))→ (Dog(Fido)→ ¬Child(Fido))) Let friend(X,Y) denote 'x is a friend …

hi, Here is my code on the three sorts. I've place in the counter called icompare&imove for insertion sort; bcompare&bmove for bubble sort and scomare and smove for selection sort. I've also used time_t as a timer to calculate the time it takes to sort the three. can someone please …

hi, can someone please tell me what is the no. estimated for compares and data moves required by these three algorithms to sort N strings. And what is the order for calculating the time measurement to sort these strings. thanks.

hi, i've an insertion sort algorithm and a selection sort algorithm. i'm not sure how to measure the performace(best case and worst case in terms of N= size of the list, deque, vector etc.) i'm trying to insert comparecount and movecount in the program. Bubble sort was easy but im …

firstly hi all, i''d like to intrroduce myself. Im a new C++ programmer..hardly..but trying..so yes its frustrating with the error and syntax mainly. Anywayz, this is a card game with 2 classes and simple functions but im having a problem compiling it. I compile it on visual studio so i …