We teach by example - thou shall not EVER click on banner ads or pop ups.
How can we teach our children to ignore online ads by C-list celebrities?
You cant. they are too powerful
Reply:Firefox with the Adblock add-on.
Other than that, it's impossible. Our kids are programmed to follow the trend. What do you expect in a society where people believe that K-Fed can rap and Christians can rapture.
Reply:Give them something to do besides watch television and play the computer. Spend time reading to them, take them on nature walks, teach them to entertain themselves with toys.
Reply:I would keep asking this question over and over in various sections of Y!A. It's very relevant and engages something that I find highly annoying.
It's difficult to answer questions when I feel like Clay Aiken is watching me.
Reply:you mean you don't know?????
common sense comes to mind... and telling your brats what is right is another...
are you stupid?
Reply:get a good adblocker. duh. ;)
Reply:....hey!
Lucy Liu starred in Charlie's Angels damnit! %26gt;:(
Peace out.
Reply:Mocking. Definitely.
Reply:I think its a better source of revenue for Yahoo.
Would you rather see obscene gif ads?
Reply:Sorry - don't have a clue who "C-list celebrities" are.
Reply:C List?
Reply:Now this is funny!
Reply:I'm getting more sick of the "23" ads all over this site.
Thursday, July 9, 2009
Write a program in 'c' programming language to list the nodes of a binary tree in the following way: List the
Write a program in 'c' programming language to list the nodes of a binary tree in the following way: List the root, then nodes at depth 1, foollowed by nodes at depth 2, and so on.
Write a program in 'c' programming language to list the nodes of a binary tree in the following way: List the
This is an interesting problem, because typical recursive tree traversals visit the left subtree, then the right subtree. Nodes at a particular depth can appear on both sides of the tree. What you can do is modify a normal traversal to keep track of what depth you're at as you're visiting nodes. I'll give you some of the parts of the solution, and leave you to fill in the details.
Suppose we have a tree node defined like this:
struct treeNode {
int val;
struct treeNode *left;
struct treeNode *right;
};
A simple traversal where you identify nodes on your way down each subtree would look like this:
void traverse(struct treeNode *n) {
if (n == NULL) return;
printf("\n%d",n-%26gt;val);
if (n-%26gt;left != NULL) traverse(n-%26gt;left);
if (n-%26gt;right != NULL) traverse(n-%26gt;right);
}
in main() I create a tree:
struct treeNode *root = newTreeNode(0);
populate it, then traverse(root);
(This is where you create you're own newTreeNode( ) function, and a way to populate your tree.)
That's not bad, but we never know what level we're at. Modifying this to maintain and print a level, a traverseLevels function might look like this:
void traverseLevels(struct treeNode *n, int *level) {
if (n == NULL) return;
printf("\n%d: %d",*level,n-%26gt;val);
if (n-%26gt;left != NULL) {
++(*level);
traverseLevels(n-%26gt;left,level);
}
if (n-%26gt;right != NULL) {
++(*level);
traverseLevels(n-%26gt;right,level);
}
--(*level);
}
Now I need to declare:
int level = 0;
before calling the function:
traverseLevels(root,%26amp;level);
Each time we traverse down a branch of the tree, level gets incremented, and level is decremented on each step up from a child node to its parent.
It's getting better, each node and its level are displayed, but it doesn't quite solve the problem you stated, since all nodes at a particular level are not listed together in the output. I.e., we don't get all nodes at level 1, followed by all nodes at level 2, etc. They're listed as encountered in the traversal, which, as mentioned before, visits left subtree then right subtree.
So, we need some way to get these nodes in order. I came up with one way to do it, maybe you can find a better way. I decided I wanted to have traverseLevels create a linked list, sorted in order of increasing level:
struct listNode {
int level;
int val;
struct listNode *next;
};
typedef void (*listInsertFuncPtr_t)(struct listNode*,int,int);
void traverseLevels(struct treeNode*,
struct listNode*,
int *level,
listInsertFuncPtr_t);
void listInsert(struct listNode*, int level, int val);
void traverseLevels(struct treeNode *n,
struct listNode *l,
int *level,
listInsertFuncPtr_t listInsert) {
if (n == NULL) return;
listInsert(l,*level,n-%26gt;val);
if (n-%26gt;left != NULL) {
++(*level);
traverseLevels(n-%26gt;left,l,level,listInser...
}
if (n-%26gt;right != NULL) {
++(*level);
traverseLevels(n-%26gt;right,l,level,listInse...
}
--(*level);
}
And to call it:
struct listNode *head = newListNode(-1, -1);
traverseLevels(root,head,%26amp;level,%26amp;listI...
Passing around the pointer to the list head and list insert function isn't really necessary, but I thought it would be a nice way to do it. You could have traverseLevels know about a global list, or devise some other way for the function to create the list of nodes in the correct order.
Reply:I recommended you that you can get help from
http://expert.asptutorials.info/
and let many programmers bid for your project.
You can hire whoever you like.
Do not pay any money afront however
Write a program in 'c' programming language to list the nodes of a binary tree in the following way: List the
This is an interesting problem, because typical recursive tree traversals visit the left subtree, then the right subtree. Nodes at a particular depth can appear on both sides of the tree. What you can do is modify a normal traversal to keep track of what depth you're at as you're visiting nodes. I'll give you some of the parts of the solution, and leave you to fill in the details.
Suppose we have a tree node defined like this:
struct treeNode {
int val;
struct treeNode *left;
struct treeNode *right;
};
A simple traversal where you identify nodes on your way down each subtree would look like this:
void traverse(struct treeNode *n) {
if (n == NULL) return;
printf("\n%d",n-%26gt;val);
if (n-%26gt;left != NULL) traverse(n-%26gt;left);
if (n-%26gt;right != NULL) traverse(n-%26gt;right);
}
in main() I create a tree:
struct treeNode *root = newTreeNode(0);
populate it, then traverse(root);
(This is where you create you're own newTreeNode( ) function, and a way to populate your tree.)
That's not bad, but we never know what level we're at. Modifying this to maintain and print a level, a traverseLevels function might look like this:
void traverseLevels(struct treeNode *n, int *level) {
if (n == NULL) return;
printf("\n%d: %d",*level,n-%26gt;val);
if (n-%26gt;left != NULL) {
++(*level);
traverseLevels(n-%26gt;left,level);
}
if (n-%26gt;right != NULL) {
++(*level);
traverseLevels(n-%26gt;right,level);
}
--(*level);
}
Now I need to declare:
int level = 0;
before calling the function:
traverseLevels(root,%26amp;level);
Each time we traverse down a branch of the tree, level gets incremented, and level is decremented on each step up from a child node to its parent.
It's getting better, each node and its level are displayed, but it doesn't quite solve the problem you stated, since all nodes at a particular level are not listed together in the output. I.e., we don't get all nodes at level 1, followed by all nodes at level 2, etc. They're listed as encountered in the traversal, which, as mentioned before, visits left subtree then right subtree.
So, we need some way to get these nodes in order. I came up with one way to do it, maybe you can find a better way. I decided I wanted to have traverseLevels create a linked list, sorted in order of increasing level:
struct listNode {
int level;
int val;
struct listNode *next;
};
typedef void (*listInsertFuncPtr_t)(struct listNode*,int,int);
void traverseLevels(struct treeNode*,
struct listNode*,
int *level,
listInsertFuncPtr_t);
void listInsert(struct listNode*, int level, int val);
void traverseLevels(struct treeNode *n,
struct listNode *l,
int *level,
listInsertFuncPtr_t listInsert) {
if (n == NULL) return;
listInsert(l,*level,n-%26gt;val);
if (n-%26gt;left != NULL) {
++(*level);
traverseLevels(n-%26gt;left,l,level,listInser...
}
if (n-%26gt;right != NULL) {
++(*level);
traverseLevels(n-%26gt;right,l,level,listInse...
}
--(*level);
}
And to call it:
struct listNode *head = newListNode(-1, -1);
traverseLevels(root,head,%26amp;level,%26amp;listI...
Passing around the pointer to the list head and list insert function isn't really necessary, but I thought it would be a nice way to do it. You could have traverseLevels know about a global list, or devise some other way for the function to create the list of nodes in the correct order.
Reply:I recommended you that you can get help from
http://expert.asptutorials.info/
and let many programmers bid for your project.
You can hire whoever you like.
Do not pay any money afront however
How do I find a list of songs in the key of C? Is there a database?
I'm looking to search for a list of songs sorted out by key so I can practice scales. So far, nothing has surfaced, for guitar.
How do I find a list of songs in the key of C? Is there a database?
start with ANY song and transpose it or if you are not that advanced then keep practicing the scale of C and buy a Grade One piano tutor book by Michael Aaron from any good music store. Similarly if it is for guitar then ask at the music store for a simple guitar tutor book.
avender
How do I find a list of songs in the key of C? Is there a database?
start with ANY song and transpose it or if you are not that advanced then keep practicing the scale of C and buy a Grade One piano tutor book by Michael Aaron from any good music store. Similarly if it is for guitar then ask at the music store for a simple guitar tutor book.
avender
What's the difference between A-List and B-List celebrities? Is there a C and D list to?
This is my take on it:
A List = People that are well known, well liked, and have a good resume, been around a little while (Tom Hanks, George Clooney, Julia Roberts, Robert De Niro, Meryl Streep)
B-List = People that are trying. Well known, sometimes well liked, do something OK every once in a while, but somehow always get invited to everything (Vince Vaughn, Colin Farrell, Kate Hudson, Cameron Diaz) and those only popular at this very moment (maybe something like Hannah Montana)
C-List = People that are only famous because of one hit (Megan Fox, Eva Longoria) people only famous for having money (Kim Kardashian, Donald Trump) models (Tyra Banks, Kate Moss) and has-beens that keep reappearing (Paula Abdul, Flavor Flav)
D-List = People that are known because of someone else, public usually doesn't care about, hardly anything of a resume (Bai Ling, K-Fed, reality show stars, famous people's kids like Rumer Willis) and maybe people that used to be really famous and aren't anymore (80's rockers, 90's TV stars)
I will argue for the plus/minus system though too lol.. There is definitely some moving around between the levels.
A List = People that are well known, well liked, and have a good resume, been around a little while (Tom Hanks, George Clooney, Julia Roberts, Robert De Niro, Meryl Streep)
B-List = People that are trying. Well known, sometimes well liked, do something OK every once in a while, but somehow always get invited to everything (Vince Vaughn, Colin Farrell, Kate Hudson, Cameron Diaz) and those only popular at this very moment (maybe something like Hannah Montana)
C-List = People that are only famous because of one hit (Megan Fox, Eva Longoria) people only famous for having money (Kim Kardashian, Donald Trump) models (Tyra Banks, Kate Moss) and has-beens that keep reappearing (Paula Abdul, Flavor Flav)
D-List = People that are known because of someone else, public usually doesn't care about, hardly anything of a resume (Bai Ling, K-Fed, reality show stars, famous people's kids like Rumer Willis) and maybe people that used to be really famous and aren't anymore (80's rockers, 90's TV stars)
I will argue for the plus/minus system though too lol.. There is definitely some moving around between the levels.
How do i write a self defining data structure for a linked linear list data structure in C language?
I also want to use the self defining structure to create a linked list to perform the following functions on the list:
i. Insert data items into the list. Input should be terminated by a zero ii. Delete a specified item from the list iii.Modify a specified item in the list iv. Print the list.
How do i write a self defining data structure for a linked linear list data structure in C language?
I'm not sure what you mean by "self defining data structure"
unless you're pointing out that the "node" of a linked list
contains pointers to it's own type. If it's more than that, then
maybe my answer won't be sufficient; however, I think
what you're asking for is a data structure like:
struct node {
void* data;
struct node* next;
};
If you visit the following web page, you'll find an explanation
of this (and other variations), including source code for
insertion, deletion, search, etc.
http://stsdas.stsci.edu/bps/linked_list....
Reply:Sounds to me like you want to do a template class, so that you can define which data type to store in your linked list "on the fly". Here's a tutorial about templates:
http://www.devarticles.com/c/a/Cplusplus...
Oh, it is in C++. But I thought maybe that's what you meant, because I wouldn't know what "self-defining data structure" is otherwise.
Reply:Seems like you are making a database software. Like a library or dictionary program. Most likely you will need iostream.h and stdio.h as header then use multidimensional arrays to store the result. as for printing use printf or if you save the data on a file
fprintf.
But if I tell you more you will have to pay/employ me :).
An advice: Think on the data structures before you create the program.
i. Insert data items into the list. Input should be terminated by a zero ii. Delete a specified item from the list iii.Modify a specified item in the list iv. Print the list.
How do i write a self defining data structure for a linked linear list data structure in C language?
I'm not sure what you mean by "self defining data structure"
unless you're pointing out that the "node" of a linked list
contains pointers to it's own type. If it's more than that, then
maybe my answer won't be sufficient; however, I think
what you're asking for is a data structure like:
struct node {
void* data;
struct node* next;
};
If you visit the following web page, you'll find an explanation
of this (and other variations), including source code for
insertion, deletion, search, etc.
http://stsdas.stsci.edu/bps/linked_list....
Reply:Sounds to me like you want to do a template class, so that you can define which data type to store in your linked list "on the fly". Here's a tutorial about templates:
http://www.devarticles.com/c/a/Cplusplus...
Oh, it is in C++. But I thought maybe that's what you meant, because I wouldn't know what "self-defining data structure" is otherwise.
Reply:Seems like you are making a database software. Like a library or dictionary program. Most likely you will need iostream.h and stdio.h as header then use multidimensional arrays to store the result. as for printing use printf or if you save the data on a file
fprintf.
But if I tell you more you will have to pay/employ me :).
An advice: Think on the data structures before you create the program.
Can I back on the eligible blood donation list after a false positive test for Hepatitis C?
A year ago, I donated blood and it came back positive for Hepatitis C. Since then I have had 2 separate test for Hepatitis C, (1 month after the false positive, and 1 year after the false positive), and both came up negative. I don't even show up as ever having antibodies for Hepatitis C, so my doctor told me the results show that I have never had Hepatitis C. Is it possible to ever get back on whatever list they use so I am eligible to donate blood again, or am I banned forever.
Can I back on the eligible blood donation list after a false positive test for Hepatitis C?
I sell my plasma and i'm pretty sure it's the same list, she told me that if I had a false positive I would not be able to donate blood or plasma ever again. once on it your on it forever from the way it sounds.
Reply:If you took a test a year later from when you got your first positive and it came back negative, then you should be eligible to donate blood again. Its possible, but rare that the test came up with a false positive. The only thing that may be required for you to get back on the list is to have the first test that came up positive and the test you took a year later that came up negative; providing these documents will prove that you are clean and you should have no problem getting back on the list. Good luck to you.
Can I back on the eligible blood donation list after a false positive test for Hepatitis C?
I sell my plasma and i'm pretty sure it's the same list, she told me that if I had a false positive I would not be able to donate blood or plasma ever again. once on it your on it forever from the way it sounds.
Reply:If you took a test a year later from when you got your first positive and it came back negative, then you should be eligible to donate blood again. Its possible, but rare that the test came up with a false positive. The only thing that may be required for you to get back on the list is to have the first test that came up positive and the test you took a year later that came up negative; providing these documents will prove that you are clean and you should have no problem getting back on the list. Good luck to you.
What is the source code to sort a linked list in C? Strings are what to be sorted.?
It's a linked list of structures with strings. The whole program is like a directory. The string is the name. We must sort it out alphabetically as we enter the data. Kind of frustrating that I have to do ask this.
What is the source code to sort a linked list in C? Strings are what to be sorted.?
Instead of sorting the list after entering the node, you must sort it while inserting the node. Whenever you add a new node compare it with all the nodes already present in the linked list and insert it accordingly. The "head" pointer points to the first node and the successive "next" pointers point to the nodes that are (alphabetically) smaller than the current node.
This is just kind of a rough algorithm. Try to code it, hope you got it.
Reply:When creating linked lists I make sure a prototypical comparison method exists. This method is generally customized for each type making use of the template.
Like strcmp() the method is intended to return less than zero if the left operand is less than the right, zero if equal, and greater than zero if the left operand is greater than the right.
Two sorting methods are provided (as overloads of each other.) One is the general sort which will do the basic ascending or descending values of the list. The other accepts a function pointer that allows for a custom sorting algorithm.
An example of a custom sorting algorithm is a randomizer; it simply returns one of the three expected returns at random. :-)
Reply:That is not easy. May be you can contact a C expert at websites like http://askexpert.info/
violet
What is the source code to sort a linked list in C? Strings are what to be sorted.?
Instead of sorting the list after entering the node, you must sort it while inserting the node. Whenever you add a new node compare it with all the nodes already present in the linked list and insert it accordingly. The "head" pointer points to the first node and the successive "next" pointers point to the nodes that are (alphabetically) smaller than the current node.
This is just kind of a rough algorithm. Try to code it, hope you got it.
Reply:When creating linked lists I make sure a prototypical comparison method exists. This method is generally customized for each type making use of the template.
Like strcmp() the method is intended to return less than zero if the left operand is less than the right, zero if equal, and greater than zero if the left operand is greater than the right.
Two sorting methods are provided (as overloads of each other.) One is the general sort which will do the basic ascending or descending values of the list. The other accepts a function pointer that allows for a custom sorting algorithm.
An example of a custom sorting algorithm is a randomizer; it simply returns one of the three expected returns at random. :-)
Reply:That is not easy. May be you can contact a C expert at websites like http://askexpert.info/
violet
Subscribe to:
Posts (Atom)