homework

In PHP, how many parents may a single class have, and what is this process called?

Thanks for your replies. Appreciate it alot! ...

Why must the copy assignment operator return a reference/const reference?

In C++, the concept of returning reference from the copy assignment operator is unclear to me. Why can't the copy assignment operator return a copy of the new object? In addition, if I have class A, and the following: A a1(param); A a2 = a1; A a3; a3 = a2; //<--- this is the problematic line The operator= is defined as follows: A A:...

Question about pseudocode for HW

I have the following question, and what I'm most confused on, is how to do the logic for determining if a check is one month late or not. Question is: "Write pseudocode for a program that calculates the service charge of a customer owes for writing a bad check. The program accepts a customer's name, the date the check was written (year...

Simple question regarding an equation inside of a function

Hey, so basically I have this issue, where I'm trying to put an equation inside of a function however it doesn't seem to set the value to the function and instead doesn't change it at all. This is a predator prey simulation and I have this code inside of a for loop. wolves[i+1] = ((1 - wBr) * wolves[i] + I * S * rabbits[i] * wolves...

What is the magic method

What is the magic method? Please give brief definition of magic method? ...

Regex to match tags like <A>, <BB>, <CCC> but not <ABC>

hi all, i need a regex to match tags that looks like <A>, <BB>, <CCC>, but not <ABC>, <aaa>, <>. so the tag must consist of the same uppercase letter, repeated. i've tried <[A-Z]+>, but that doesn't work. of course i can write something like <(A+|B+|C+|...)> and so on, but i wonder if there's a more elegant solution. thanks. ...

header files. class and aplication of stacks

when i put the header file in the same folder of the source code. the program doesnt compile. it shows errors. like:7 E:\data structure\asig 5\code.cpp `Queue' has not been declared driver for queue adt. code.cpp #include <iostream> #include "QueueLnk.h" using namespace std; // ********************* Function Prototypes **************...

Composite Index

There are fields in a table a, b, c; to a, b, c build into a composite index; find the condition that a> 10, b = 3, c <1; terms of how to find the best arrangement to make performance ...

Finding a submatrix with the maximum possible sum in O(n^2)

Hi, I'm trying to write a program in Java that when given an MxN matrix it will find the (contiguous) submatrix with the biggest sum of numbers. The program then needs to return the top left corner coordinates of the submatrix and the bottom right corner coordinates. The matrix can include negative numbers and both the matrix and submat...

Case sensitive and insensitive in the same pattern

hi guys, thanks to the help with my previous homework question Regex to match tags like <A>, <BB>, <CCC> but not <ABC>, but now i have another homework question. i need to match tags like <LOL>, <LOLOLOL> (3 uppercase letters, with repeatable last two letters), but not <lol> (need to be uppercase). using the technique from the previou...

how can i declare hdc ?

i copied this code and got an error. plzz tell me how should i declare hDC??? coding: #include "BitmapEx.h" CBitmapEx bitmapEx; bitmapEx.Load(_T("Enter bitmap source file path here...")); bitmapEx.Rotate(45); bitmapEx.Sepia(); bitmapEx.Scale(50, 50); bitmapEx.Draw(hDC); bitmapEx.Save(_T("Enter bitmap destination file path here...")); ...

Answer difference in C

Possible Duplicate: Could anyone explain these undefined behaviors (i = i++ + ++i , i = i++, etc) int a=2,b=3,c; c=a++ + a-- + b++ + b--; printf("%d",c); and int a=2,b=3; int c=a++ + a-- + b++ + b--; printf("%d",c); in first case ans comes 10 but in second case ans comes 12 why? ...

Persisting a heterogeneous array in C#

I have an List<Animal> but in that list I have subclasses of Animal such as Mammal. (Yes that is right; it is a school assignment, so don't be specific, just give me some pointers.) I should persist it with [Serializable] interface and that is no problem, except when I shall read it back again, I have no idea what subclass the data ca...

[C++] A tricky counter - just a int, but he won't work as requested

Hello guys, I'm near the end of a program I had got to code for my university courses, but I got into a last trouble: formatting the output! It's nothing about code: this is just cosmetics (but I need to fix that cause my output's got to respect some standards). Basically, my program will read a .csv file and process that by dividing t...

Find the longest path between any two nodes.

I have a binary tree. I need to write Java recursive method that will give longest path between two nodes. For example longest path if following tree is 7 (7-8-5-13-15-18-16-17). http://img294.imageshack.us/img294/130/treeb.jpg What's the way to resolve this problem? (The method: public static int longestPath(Node n) ) ...

merge part in merge sort

Hi we have merge sort for two arrays or linked list how can I write merge part for more than two linked lists? please help me thanks ...

merge k lists with o(nlogk)

Is the running time of the Merge algorithm O(n log k)? k is the number of lists. n is the total number of elements in all of the lists (n = n1 + n2 + ... + nk). algorithm MakingAHalf(List_Of_Lists) if List_Of_Lists.size() = 1 return the only list in List_Of_Lists else split List_Of_Lists into two halfs (Firs...

binary search tree

Hi This is my homework and I have thought a lot about it but I could not get the answer I need your guidance ,please help me thanks Q: we have keys from 1 to 1000 in BST and we want to find the key = 363 which of these following searching is not correct? <925, 202, 911, 240, 912, 245, 363> <924, 220, 911, 244, 898, 258...

Binary Tree: Longest path between 2 Nodes

Calculate the longest path between two nodes. The path is in an arch. Signature of method is: public static int longestPath(Node n) In the example binary tree below, it is 4 (going thru 2-3-13-5-2). This is what I have right now and for the given tree it just returns 0. public static int longestPath(Node n) { if (n != null) {...

i am out of ideas...

i have an assignment,and i need help!! in a given 2D ARRAY of integers and a given MAXIMUM number of steps the program supposed to find a path, from one corner to the one in front of it, which sums the biggest numbers in limited number of steps. this supposed to be done with BACKTRACKING RECURTION... ...