CECS-326: Operating Systems
PROJECT 1
BINARY TREE OF PROCESSES
Name: ____________________________________
Last, First
ABSOLUTELY NO LATE PROJECTS WILL BE ACCEPTED
PROJECT DESCRIPTION:
Write a program using C/C++ to generate a binary tree of processes. The input to the program includes the
number of levels in the tree. The maximum number of levels is 5, but the program should work for a
general case of any number. Use command line arguments.
Example of a program run is as follows:
ecs416lin213.cecs.csuld.edu:1p1 4
Level Procs Parent Child 1 Child 2
No. ID ID ID ID
0 3608 3574 3609 3610
1 3610 2608 3612 3613
1 3609 3608 3611 3614
2 3612 3610 3616 3617
2 3614 3609 3620 3621
2 3611 3609 3615 3622
2 3613 3610 3618 3619
3 3620 3614 3629 3630
3 3622 3611 3633 3634
3 3615 3611 3623 3635
3 3616 3612 3624 3625
3 3617 3612 3626 3636
3 3618 3613 3627 3637
3 3619 3613 3628 3638
3 3621 3614 3631 3632
DOCUMENTATION:
The project must be carefully documented. The write-up must include: one page of problem analysis and
discussion (include a flow chart or structure chart when relevant), program listing with proper comments,
one page of output listing using N = 3. Draw a tree diagram showing the process IDs in circles. The
discussion should include general considerations, UNIX/LINUX function calls, any reasonable
assumptions, and any other relevant information. Attach this sheet as the front page of your project.
Firmly staple the entire project together. No folder is used.
NOTES:
1) After submitting the project, do not change, edit, or recompile the program. Violations of this rule will
result in the project being graded zero.
2) Discussions among students are encouraged, but only to the extent of clarifying the problem statement
and/or the general approach to the problem as discussed in class. The project must represent your own
work.
END OF PROJECT 1
