473,698 Members | 2,203 Online
Bytes | Software Development & Data Engineering Community
+ Post

Home Posts Topics Members FAQ

help needed in c++



hi
this hw have four files:
1. for the main program
2. listp.cpp (the source file)
3. listp.h (the header file)
4. exception.h
hi
iam done with my hw i still have to do one function which is the last
one on program.cpp subsetsum(int aList, int sum)so please can you help.

thanks for anybody in advance
#include <iostream>
#include <limits.h>
#include <cassert>
using std::cin;
using std::cout;
using std::endl;
using namespace std;
#define NumCities 5
#define MaxFib 100
#include "Exceptions .h"
#include "ListP.h"
#include "ListP.cpp"
void List::enterList ()
// Prompt the user to enter integer values from the keyboard. Each
// value is inserted into the list. When the user enters -1, input
// from the keyboard stops. Adds the new values to the beginning of
// the current contents of list, if any.
{
ListItemType val;
int count = 1;
do
{
cout << "Enter value (-1 to end): " << count << endl;
cin >> val;

if (val != -1)
insert(count, val);
count++;
}
while (val != -1);
}
int fib(int n)
// Returns the nth Fibonacci number. The result is computed
// recursively. Does no error checking. What is the largest number
// you can compute this way?
{
if (n == 1 || n == 2)
return 1;
else
return fib(n - 1) + fib(n - 2);
}
int fib2(int n, int F[])
// Returns the nth Fibonacci number. The result is computed
// recursively. Does not compute any number more than once and uses
// the array F[] to store previously computed numbers. Does no error
// checking. What is the largest number you can compute this way?
{
if (F[n] != -1)
return (F[n]);
else
if (n != 1 || n != 2)
{
F[n] = fib2(n - 1, F) + fib2(n - 2, F);
return F[n];
}
else
{
F[n] = 1;
return 1;
}
}

void testFib()
// Helper function that prompts the user to enter an integer n, and
// prints the nth Fibonacci number.
{
int n;
cout << "enter n: " << endl;
cin >> n;
cout << fib(n) << endl;
}
void testFib2()
// Helper function that prompts the user to enter an integer n, and
// prints the nth Fibonnaci number.
{
int F[MaxFib];
int n;
for (int i = 0; i < MaxFib; i++)
F[i] = -1;
cout << "enter n: " << endl;
cin >> n;
cout << fib2(n,F) << endl;
}
int sum (int list[], int left, int right)
// Returns the sum of the numbers in array list, starting at index
// left and ending at index right. The sum is computed recursively.
{

if (left == right - 1)
return list[left] + list[right];
else
if (left == right)
return list[left];
else
return list[left] + list[right] + sum (list, left+1, right-1);
}

void testSum()
// Function to test the sum function
{
int list[99999];
int i = 0;
int x;
cout << "Enter numbers, enter -1 to stop" << endl;
do
{
cin >> x;
if (x != -1)
list[i++] = x;
} while (x != -1);
cout << "The sum is " << sum(list,0,i-1) << endl;
cout << endl;
}
int multiply(int m, int n)
// Returns the product of m and n. The result is computed
// recursively. Assumes that m and n are positive integers, uses no
// loops or multiplication, and does no error checking.
{
if (n == 1)
return m;
else
return multiply(m, n - 1)+ m;
}

void testMultiply()
// Function to test the multiply function.
{
int x,y;
cout << "Enter a number:" << endl;
cin >> x;
cout << "Enter a number:" << endl;
cin >> y;
cout << "The product of " << x << " and " << y << " is " <<
multiply(x,y) << endl;
}
bool findPathRecursi ve(int originCity, int destinationCity , bool
visited[],
int edge[][NumCities])
// Returns true if a path from originCity to destinationCity exists in
// the graph defined by edge. Paths are found using the following
// recursive algorithm: to find a path from city i to city j, check
// whether there is a path from any cities k, which are neighbors of
// i, to j. If a path exists, prints it in any order. This function
// does not use any stacks or queues.
{
if (originCity == destinationCity )
{
cout << originCity << endl;
return true;
}
else
for (int i = 0; i < NumCities; i++)
{
if (edge[originCity][i] && !visited[i])
{
visited[originCity] = true;
originCity = i;
}

if (findPathRecurs ive(originCity, destinationCity , visited, edge))
{
cout << originCity << endl;
return true;
}

if (i == destinationCity )
{
cout << i << endl;
return true;
}

}
return false;
}

void testFindPathRec ursive()
// Helper function that prompts the user to enter source and
// destination cities, and then uses findPathRecursi ve to determine if
// a path exists in the graph from source to destination.
{
int edge[NumCities][NumCities] = {{0,1,0,0,0},
{0,0,1,1,0},
{0,0,0,0,1},
{0,1,0,0,0},
{0,0,0,0,0}};
int originCity, destinationCity , i;
bool visited[NumCities];
for (i = 0; i < NumCities; i++)
visited[i] = false;
cout << "Enter origin city: ";
cin >> originCity;
cout << "Enter destination city: ";
cin >> destinationCity ;
if (!findPathRecur sive(originCity , destinationCity , visited, edge))
cout << "No path found" << endl;
}
//bool subsetSum(List aList, int sum)
// Return true if some subset of the integers stored in aList add up
// to sum. Uses recursion.


/*void testSubsetSum()
{
List aList;
int num;
cout << "Enter list values" << endl;
aList.enterList ();
cout << "Enter a target sum" << endl;
cin >> num;
cout << "Result: " << subsetSum(aList , num) << endl;
}
*/
int main()
{
int choice;
do
{
cout << "1. fib" << endl;
cout << "2. fib2" << endl;
cout << "3. multiply" << endl;
cout << "4. sum" << endl;
cout << "5. findPathRecursi ve" << endl;
cout << "6. subsetSum" << endl;
cout << "Enter a number, or -1 to exit: ";
cin >> choice;
switch (choice)
{
case 1:
testFib();
break;
case 2:
testFib2();
break;
case 3:
testMultiply();
break;
case 4:
testSum();
break;
case 5:
testFindPathRec ursive();
break;
// case 6:
// testSubsetSum() ;
break;
}
} while (choice != -1);return 0;
}


// *************** *************** *************** *************
// Header file ListP.h for the ADT list.
// Pointer-based implementation.
// *************** *************** *************** *************

// Must define ListItemType before compilation
#ifndef ListP_h
#define ListP_h
#include "Exceptions .h"
typedef int ListItemType;
class List
{
public:
// constructors and destructor:
List(); // default constructor
List(const List& aList); // copy constructor
~List(); // destructor
// list operations:
bool isEmpty() const;
int getLength() const;
void insert(int index, ListItemType newItem)
throw(ListIndex OutOfRangeExcep *tion, ListException);
void remove(int index)
throw(ListIndex OutOfRangeExcep *tion);
void retrieve(int index, ListItemType& dataItem) const
throw(ListIndex OutOfRangeExcep *tion);
void enterList();
private:
struct ListNode // a node on the list
{
ListItemType item; // a data item on the list
ListNode *next; // pointer to next node
}; // end struct
int size; // number of items in list
ListNode *head; // pointer to linked list of items
ListNode *find(int index) const;
// Returns a pointer to the index-th node
// in the linked list.

}; // end class
// End of header file.

#endif
// *************** *************** *************** *************
// Implementation file ListP.cpp for the ADT list.
// Pointer-based implementation.
// *************** *************** *************** *************
#include "ListP.h"
#include "Exceptions .h"
List::List(): size(0), head(NULL)
{

} // end default constructor
List::List(cons t List& aList): size(aList.size )
{
if (aList.head == NULL)
head = NULL; // original list is empty
else
{
// copy first node
head = new ListNode;
assert(head != NULL); // check allocation
head->item = aList.head->item;

// copy rest of list
ListNode *newPtr = head; // new list pointer
// newPtr points to last node in new list
// origPtr points to nodes in original list
for (ListNode *origPtr = aList.head->next;
origPtr != NULL;
origPtr = origPtr->next)
{
newPtr->next = new ListNode;
assert(newPtr->next != NULL);
newPtr = newPtr->next;
newPtr->item = origPtr->item;
} // end for
newPtr->next = NULL;
} // end if

} // end copy constructor
List::~List()
{
while (!isEmpty())
remove(1);
} // end destructor
bool List::isEmpty() const
{
return bool(size == 0);
} // end isEmpty
int List::getLength () const
{
return size;
} // end getLength
List::ListNode *List::find(int index) const
// ------------------------------*--------------------
// Locates a specified node in a linked list.
// Precondition: index is the number of the
// desired node.
// Postcondition: Returns a pointer to the desired
// node. If index < 1 or index > the number of
// nodes in the list, returns NULL.
// ------------------------------*--------------------
{
if ( (index < 1) || (index > getLength()) )
return NULL;

else // count from the beginning of the list
{
ListNode *cur = head;
for (int skip = 1; skip < index; ++skip)
cur = cur->next;
return cur;
} // end if

} // end find
void List::retrieve( int index,
ListItemType& dataItem) const
throw (ListIndexOutOf RangeException)
{
if ((index < 1) || (index > getLength()))
throw ListIndexOutOfR angeException(
"ListOutOfRange Exception: retrieve index out of range");
else
{
// get pointer to node, then data in node
ListNode *cur = find(index);
dataItem = cur->item;
} // end if
} // end retrieve
void List::insert(in t index, ListItemType newItem)
throw(ListIndex OutOfRangeExcep *tion, ListException)
{
int newLength = getLength() + 1;

if ((index < 1) || (index > newLength))
throw ListIndexOutOfR angeException(
"ListOutOfRange Exception: insert index out of range");
else
{
// create new node and place newItem in it
ListNode *newPtr = new ListNode;
if (newPtr == NULL)
throw ListException(
"ListExcept ion: insert cannot allocate memory");
else
{
size = newLength;
newPtr->item = newItem;
// attach new node to list
if (index == 1)
{
// insert new node at beginning of list
newPtr->next = head;
head = newPtr;
}
else
{
ListNode *prev = find(index-1);
// insert new node after node
// to which prev points
newPtr->next = prev->next;
prev->next = newPtr;
} // end if
} // end if
} // end if
} // end insert
void List::remove(in t index)
throw(ListIndex OutOfRangeExcep tion)
{
ListNode *cur;

if ((index < 1) || (index > getLength()))
throw ListIndexOutOfR angeException(
"ListOutOfRange Exception: remove index out of range");
else
{
--size;
if (index == 1)
{
// delete the first node from the list
cur = head; // save pointer to node
head = head->next;
}

else
{
ListNode *prev = find(index-1);
// delete the node after the
// node to which prev points
cur = prev->next; // save pointer to node
prev->next = cur->next;
} // end if

// return node to system
cur->next = NULL;
delete cur;
cur = NULL;
} // end if
} // end remove

// *************** *************** *************** ************
// File Exceptions.h containing declarations of List and Stack
// Exceptions.
// *************** *************** *************** ************

#ifndef Exceptions_h
#define Exceptions_h

#include <string>
#include <exception>
using namespace std;

class ListException
{
public:
ListException(c onst string &m = "")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end ListException

class ListIndexOutOfR angeException
{
public:
ListIndexOutOfR angeException(c onst string &m = "")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end ListIndexOutOfR angeException

class StackException
{
public:
StackException( const string & m="")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end StackException

class QueueException
{
public:
QueueException( const string & m="")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end QueueException

#endif

Jul 23 '05 #1
1 2016

"jhon02148" <jh*******@gmai l.com> wrote in message
news:11******** *************@g 14g2000cwa.goog legroups.com...
hi
this hw have four files:
1. for the main program
2. listp.cpp (the source file)
3. listp.h (the header file)
4. exception.h
hi
iam done with my hw i still have to do one function which is the last
one on program.cpp subsetsum(int aList, int sum)so please can you help.

thanks for anybody in advance
I have som pseudocode here for you.. You might need to make a copy
constructor that will deep copy the list, or
use a list from stl or something..

bool subsetSum(List aList, int sum) {
// Return true if some subset of the integers stored in aList add up
// to sum. Uses recursion.

if (sum(aList)==su m) //needs an implementation of sum
that works with a list, and not an array
return true;
else if (aList.empty())
return false;
else {

aList.remove(0) ; // remove an element from the
list,

return subsetSum(aList ,sum);// and pass it on...
}
}
/*void testSubsetSum()
{
List aList;
int num;
cout << "Enter list values" << endl;
aList.enterList ();
cout << "Enter a target sum" << endl;
cin >> num;
cout << "Result: " << subsetSum(aList , num) << endl;
}
*/
int main()
{
int choice;
do
{
cout << "1. fib" << endl;
cout << "2. fib2" << endl;
cout << "3. multiply" << endl;
cout << "4. sum" << endl;
cout << "5. findPathRecursi ve" << endl;
cout << "6. subsetSum" << endl;
cout << "Enter a number, or -1 to exit: ";
cin >> choice;
switch (choice)
{
case 1:
testFib();
break;
case 2:
testFib2();
break;
case 3:
testMultiply();
break;
case 4:
testSum();
break;
case 5:
testFindPathRec ursive();
break;
// case 6:
// testSubsetSum() ;
break;
}
} while (choice != -1);return 0;
}


// *************** *************** *************** *************
// Header file ListP.h for the ADT list.
// Pointer-based implementation.
// *************** *************** *************** *************

// Must define ListItemType before compilation
#ifndef ListP_h
#define ListP_h
#include "Exceptions .h"
typedef int ListItemType;
class List
{
public:
// constructors and destructor:
List(); // default constructor
List(const List& aList); // copy constructor
~List(); // destructor
// list operations:
bool isEmpty() const;
int getLength() const;
void insert(int index, ListItemType newItem)
throw(ListIndex OutOfRangeExcep *tion, ListException);
void remove(int index)
throw(ListIndex OutOfRangeExcep *tion);
void retrieve(int index, ListItemType& dataItem) const
throw(ListIndex OutOfRangeExcep *tion);
void enterList();
private:
struct ListNode // a node on the list
{
ListItemType item; // a data item on the list
ListNode *next; // pointer to next node
}; // end struct
int size; // number of items in list
ListNode *head; // pointer to linked list of items
ListNode *find(int index) const;
// Returns a pointer to the index-th node
// in the linked list.

}; // end class
// End of header file.

#endif
// *************** *************** *************** *************
// Implementation file ListP.cpp for the ADT list.
// Pointer-based implementation.
// *************** *************** *************** *************
#include "ListP.h"
#include "Exceptions .h"
List::List(): size(0), head(NULL)
{

} // end default constructor
List::List(cons t List& aList): size(aList.size )
{
if (aList.head == NULL)
head = NULL; // original list is empty
else
{
// copy first node
head = new ListNode;
assert(head != NULL); // check allocation
head->item = aList.head->item;

// copy rest of list
ListNode *newPtr = head; // new list pointer
// newPtr points to last node in new list
// origPtr points to nodes in original list
for (ListNode *origPtr = aList.head->next;
origPtr != NULL;
origPtr = origPtr->next)
{
newPtr->next = new ListNode;
assert(newPtr->next != NULL);
newPtr = newPtr->next;
newPtr->item = origPtr->item;
} // end for
newPtr->next = NULL;
} // end if

} // end copy constructor
List::~List()
{
while (!isEmpty())
remove(1);
} // end destructor
bool List::isEmpty() const
{
return bool(size == 0);
} // end isEmpty
int List::getLength () const
{
return size;
} // end getLength
List::ListNode *List::find(int index) const
// ------------------------------*--------------------
// Locates a specified node in a linked list.
// Precondition: index is the number of the
// desired node.
// Postcondition: Returns a pointer to the desired
// node. If index < 1 or index > the number of
// nodes in the list, returns NULL.
// ------------------------------*--------------------
{
if ( (index < 1) || (index > getLength()) )
return NULL;

else // count from the beginning of the list
{
ListNode *cur = head;
for (int skip = 1; skip < index; ++skip)
cur = cur->next;
return cur;
} // end if

} // end find
void List::retrieve( int index,
ListItemType& dataItem) const
throw (ListIndexOutOf RangeException)
{
if ((index < 1) || (index > getLength()))
throw ListIndexOutOfR angeException(
"ListOutOfRange Exception: retrieve index out of range");
else
{
// get pointer to node, then data in node
ListNode *cur = find(index);
dataItem = cur->item;
} // end if
} // end retrieve
void List::insert(in t index, ListItemType newItem)
throw(ListIndex OutOfRangeExcep *tion, ListException)
{
int newLength = getLength() + 1;

if ((index < 1) || (index > newLength))
throw ListIndexOutOfR angeException(
"ListOutOfRange Exception: insert index out of range");
else
{
// create new node and place newItem in it
ListNode *newPtr = new ListNode;
if (newPtr == NULL)
throw ListException(
"ListExcept ion: insert cannot allocate memory");
else
{
size = newLength;
newPtr->item = newItem;
// attach new node to list
if (index == 1)
{
// insert new node at beginning of list
newPtr->next = head;
head = newPtr;
}
else
{
ListNode *prev = find(index-1);
// insert new node after node
// to which prev points
newPtr->next = prev->next;
prev->next = newPtr;
} // end if
} // end if
} // end if
} // end insert
void List::remove(in t index)
throw(ListIndex OutOfRangeExcep tion)
{
ListNode *cur;

if ((index < 1) || (index > getLength()))
throw ListIndexOutOfR angeException(
"ListOutOfRange Exception: remove index out of range");
else
{
--size;
if (index == 1)
{
// delete the first node from the list
cur = head; // save pointer to node
head = head->next;
}

else
{
ListNode *prev = find(index-1);
// delete the node after the
// node to which prev points
cur = prev->next; // save pointer to node
prev->next = cur->next;
} // end if

// return node to system
cur->next = NULL;
delete cur;
cur = NULL;
} // end if
} // end remove

// *************** *************** *************** ************
// File Exceptions.h containing declarations of List and Stack
// Exceptions.
// *************** *************** *************** ************

#ifndef Exceptions_h
#define Exceptions_h

#include <string>
#include <exception>
using namespace std;

class ListException
{
public:
ListException(c onst string &m = "")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end ListException

class ListIndexOutOfR angeException
{
public:
ListIndexOutOfR angeException(c onst string &m = "")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end ListIndexOutOfR angeException

class StackException
{
public:
StackException( const string & m="")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end StackException

class QueueException
{
public:
QueueException( const string & m="")
{ message = m;}
string what() {return message;}
private:
string message;
}; // end QueueException

#endif
Jul 23 '05 #2

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

28
3300
by: stu_gots | last post by:
I have been losing sleep over this puzzle, and I'm convinced my train of thought is heading in the wrong direction. It is difficult to explain my circumstances, so I will present an identical make-believe challenge in order to avoid confusing the issue further. Suppose I was hosting a dinner and I wanted to invite exactly 12 guests from my neighborhood. I'm really picky about that... I have 12 chairs besides my own, and I want them all...
7
1892
by: ChadDiesel | last post by:
Hello everyone, I'm having a problem with Access that I need some help with. The short version is, I want to print a list of parts and part quantities that belong to a certain part group---One list per page. I created a report that groups the parts by part classification group with a force new page after each group. The report is based on a query of that week's orders. Some of these parts have drawings (usually 2 each stored in an...
7
1756
by: Tina | last post by:
I have an asp project that has 144 aspx/ascx pages, most with large code-behind files. Recently my dev box has been straining and taking long times to reneder the pages in the dev environment. After addding another Crystal report, vs.net will no longer build the project - it just goes away - no message no nothing. My other dev box will build it but won't run it in debug. I ran a vs.net repair but it still does the same thing. vs.net...
10
14846
by: Mae Lim | last post by:
Dear all, I'm new to C# WebServices. I compile the WebService project it return no errors "Build: 1 succeeded, 0 failed, 0 skipped". Basically I have 2 WebMethod, when I try to invoke the first method it is working fine. Then when I try to invoke the second method it return me an error, Just In-Time Debugging, with error message "An exception 'System.StackOverflowException' has occurred in WebServices"
2
2904
by: trihanhcie | last post by:
I m currently working on a Unix server with a fedora 3 as an os My current version of mysql is 3.23.58. I'd like to upgrade the version to 5.0.18. After downloading from MYSQL.COM the package on the site, I made : rpm -i MySQL-server-5.0.18-0.i386.rpm then i have errors that relate to many conflicts. I cannot figure out why -and- cannot upgrade. Please Help !
2
1986
by: Steve K | last post by:
I got a bit of a problem I like some help on. I'm designing an online training module for people that work in food processing plants. This is my target audience. These workers have little or no computer knowledge at all! And they also have outdated, old browsers, slow modems, old computers, etc. So I need to keep this as simple as possible and as browser compatible as possible. The client wants a navigation bar at the bottom of each...
3
2414
by: Kitana907 | last post by:
Hi- I'm attempting to write a module that uses and updates info from two tables and does the following: Opens the recordset of a table called "tblstoreinv" If the Needed Field in the tblstoreinv table is null and is less than the DCOH field from the tbldcinv then: The Shipped Field in the tblstoreinv table equals the Needed Field and the DCOH field from tbldcinv = DCOH - Shipped Else If Needed from tblstoreinv is > DCOH from tbldcinv,...
9
2091
by: smartbei | last post by:
Hello, I am a newbie with python, though I am having a lot of fun using it. Here is one of the excersizes I am trying to complete: the program is supposed to find the coin combination so that with 10 coins you can reach a certain amoung, taken as a parameter. Here is the current program: coins = (100,10,5,1,0.5) anslist = def bar(fin, hist = {100:0,10:0,5:0,1:0,0.5:0}): s = sum(x*hist for x in hist)
2
2899
by: rookiejavadude | last post by:
I'm have most of my java script done but can not figure out how to add a few buttons. I need to add a delete and add buttong to my existing java program. Not sure were to add it on how. Can anyone help? my script is below. thank you import java.awt.*; //import all java.awt import java.awt.event.*; //import all java.awt.event import java.util.*; //import all java.util import javax.swing.*; //import all javax.swing class Product...
32
2778
by: =?Utf-8?B?U2l2?= | last post by:
I have a form that I programmatically generate some check boxes and labels on. Later on when I want to draw the form with different data I want to clear the previously created items and then put some new ones on. In my code I am doing the following: For Each ctrl In tpMain.Controls If TypeOf (ctrl) Is CheckBox Then If ctrl.Name.StartsWith("chkS") Then ctrl.Visible = False
0
8672
marktang
by: marktang | last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However, people are often confused as to whether an ONU can Work As a Router. In this blog post, we’ll explore What is ONU, What Is Router, ONU & Router’s main usage, and What is the difference between ONU and Router. Let’s take a closer look ! Part I. Meaning of...
0
8600
by: Hystou | last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it. First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
0
9156
Oralloy
by: Oralloy | last post by:
Hello folks, I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>". The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed. This is as boiled down as I can make it. Here is my compilation command: g++-12 -std=c++20 -Wnarrowing bit_field.cpp Here is the code in...
0
9021
jinu1996
by: jinu1996 | last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that captivates audiences and drives business growth. The Art of Business Website Design Your website is...
1
8892
by: Hystou | last post by:
Overview: Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows Update option using the Control Panel or Settings app; it automatically checks for updates and installs any it finds, whether you like it or not. For most users, this new feature is actually very convenient. If you want to control the update process,...
1
6518
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules. He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms. Adolph will...
0
5860
by: conductexam | last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one. At the time of converting from word file to html my equations which are in the word document file was convert into image. Globals.ThisAddIn.Application.ActiveDocument.Select();...
0
4361
by: TSSRALBI | last post by:
Hello I'm a network technician in training and I need your help. I am currently learning how to create and manage the different types of VPNs and I have a question about LAN-to-LAN VPNs. The last exercise I practiced was to create a LAN-to-LAN VPN between two Pfsense firewalls, by using IPSEC protocols. I succeeded, with both firewalls in the same network. But I'm wondering if it's possible to do the same thing, with 2 Pfsense firewalls...
2
2323
muto222
by: muto222 | last post by:
How can i add a mobile payment intergratation into php mysql website.

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.