New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here


by: Susan Williamson

BusinessSystemsTechnology IFMG250

Susan Williamson
GPA 3.62


Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Class Notes
25 ?




Popular in Course

Popular in Information Management

This 0 page Class Notes was uploaded by Susan Williamson on Sunday November 1, 2015. The Class Notes belongs to IFMG250 at Indiana University of Pennsylvania taught by Staff in Fall. Since its upload, it has received 21 views. For similar materials see /class/233518/ifmg250-indiana-university-of-pennsylvania in Information Management at Indiana University of Pennsylvania.


Reviews for BusinessSystemsTechnology


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 11/01/15
timedefcpp NOTE This fiie must be compiied with time1cpp inciude ltiostreamgt using stdcout us1ng stdendi inciude definition of c1ass Time from time1h inciude quottime1h int main Time t instantiate object t of c1ass Time output Time object t39s initia1 va1ues cout ltlt quotThe initia1 universai time is tprintUniversa1 00000 cout ltlt quotnThe initia1 standard time is tprintStandard 120000 AM tsetTime 13 27 6 change time output Time object t39s new va1ues cout ltlt quotnnUniversa1 time after setTime is tprintUniversa1 327 6 cout ltlt quotnStandard time after setTime is tprintStandard 12706 PM tsetTime 99 99 99 attempt invaiid settings output t39s va1ues after specifying inva1id va1ues cout ltlt quotnnAfter attempting invaiid settings ltlt quotnUniversa1 ime tprintUniversa1 000000 cout ltlt quotnStandard time tprintStandard 120000 AM cout ltlt endi return 0 end main Page 1 include ltsystypeshgt include ltsyswaithgt include ltsignalhgt include ltstdiohgt include ltunistdhgt include lterrnohgt static int stopChild O void sigHandler int sig siginfot siginfo void ignore printfquotGot SIGUSRl from dnquot siginfo gtsipid stopChildl return int main pidt ret int status int role l ret fork if ret gt O printfquotParent This is the parent process pid dnquot getpid Let the child init sleepl kill ret SIGUSRl ret wait ampstatus role O else if ret O struct sigaction act printfquotChild This is the child process pid dnquot getpid actsaflags SASIGINFO actsasigaction sigHandler sigaction SIGUSRl ampact 0 printfquotChild Waitingnquot while lstopChild role l else printfquotParent printfquots Exitingnquot Error trying to fork dnquot errno role 0 quotParentquot quotChildquot return 0 arraycpp This program sorts an array39s va1ues into ascending order 1nc1ude lt1ostreamgt using stdcout using stdend1 inc1ude ltiomanipgt using stdsetw int main const int arraySize 10 size of array a int a arraySize 2 6 4 8 10 12 89 68 45 37 int hoid temporary iocation used to swap array e1ements cout ltlt quotData items in origina1 ordern output origina1 array for 39nt i 0 i lt arraySize i cout ltlt setw 4 ltlt a i bubbie sort ioop to controi number of passes for int pass 0 pass lt arraySize 1 pass ioop to controi number of comparisons per pass int j J lt array51ze 1 j for 39 compare side by side e1ements and swap them if firste1ement is greater than second e1ement 1 a gta J 1 hoid 1 a ajajl a J 1 hoid end if cout ltlt quotnData items in ascending ordern output sorted array for int k lt arra Size 0 k k cout ltlt setw 4 ltlt a k cout ltlt end1 return 0 indicates successfui termination end main Page 1


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Jim McGreen Ohio University

"Knowing I can count on the Elite Notetaker in my class allows me to focus on what the professor is saying instead of just scribbling notes the whole time and falling behind."

Jennifer McGill UCSF Med School

"Selling my MCAT study guides and notes has been a great source of side revenue while I'm in school. Some months I'm making over $500! Plus, it makes me happy knowing that I'm helping future med students with their MCAT."

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.