Article

Free access

Using software to solve problems in large computing courses

Authors:

Mark J. Canup,

Russell L. ShackelfordAuthors Info & Claims

SIGCSE '98: Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education

Pages 135 - 139

https://doi.org/10.1145/273133.273178

Published: 01 March 1998 Publication History

PDF eReader

Cited By

View all

Malysheva YAllen JKelleher C(2022)How Do Teaching Assistants Teach? Characterizing the Interactions Between Students and TAs in a Computer Science Course2022 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)10.1109/VL/HCC53370.2022.9832962(1-9)Online publication date: 12-Sep-2022
https://doi.org/10.1109/VL/HCC53370.2022.9832962
Mirza DConrad PLloyd CMatni ZGatin AMcCartney RPetersen ARobins AMoskal AMcCartney RRobins A(2019)Undergraduate Teaching Assistants in Computer ScienceProceedings of the 2019 ACM Conference on International Computing Education Research10.1145/3291279.3339422(31-40)Online publication date: 30-Jul-2019
https://dl.acm.org/doi/10.1145/3291279.3339422
Guzdial M(2015)Learner-Centered Design of Computing Education: Research on Computing for EveryoneSynthesis Lectures on Human-Centered Informatics10.2200/S00684ED1V01Y201511HCI0338:6(1-165)Online publication date: 30-Nov-2015
https://doi.org/10.2200/S00684ED1V01Y201511HCI033
Show More Cited By

Index Terms

Using software to solve problems in large computing courses
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Computing education programs
        Computer science education

Recommendations

Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow problems. The origin-destination integer multicommodity flow problem is a constrained version of the linear multicommodity ...
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
SOFSEM '07: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science

The separable quadratic multi-knapsack problem (<em>QMKP</em>) consists in maximizing a concave separable quadratic integer (non pure binary) function subject to <em>m</em>linear capacity constraints. In this paper we develop a branch-and-bound ...
Software engineering for multi-tenancy computing challenges and implications
InnoSWDev 2014: Proceedings of the International Workshop on Innovative Software Development Methodologies and Practices

Multi-tenancy is a cloud computing phenomenon. Multiple instances of an application occupy and share resources from a large pool, allowing different users to have their own version of the same application running and coexisting on the same hardware but ...

Comments

Information & Contributors

Information

Published In

SIGCSE '98: Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education

March 1998

396 pages

ISBN:0897919947

DOI:10.1145/273133

Chairmen:
John Lewis
Villanova Univ., Villanova, PA
,
Jane Prey
Univ. of Virginia
,
Editors:
Daniel Joyce
Villanova Univ., Villanova, PA
,
John Impagliazzo
Hofstra Univ., Hempstead, NY

ACM SIGCSE Bulletin Volume 30, Issue 1
Mar. 1998
376 pages
ISSN:0097-8418
DOI:10.1145/274790
Chairmen:
John Lewis
Villanova Univ., Villanova, PA
,
Jane Prey
Univ. of Virginia
,
Editors:
John Impagliazzo
Hofstra Univ., Hempstead
,
Daniel Joyce
Villanova Univ., Villanova, PA
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCSE98

Sponsor:

SIGCSE

SIGCSE98: Technical Symposium on Computer Science Education

February 26 - March 1, 1998

Georgia, Atlanta, USA

Acceptance Rates

SIGCSE '98 Paper Acceptance Rate 72 of 201 submissions, 36%;

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE Virtual 2024

Sponsor:
sigcse

1st ACM Virtual Global Computing Education Conference

December 5 - 8, 2024

Virtual Event , NC , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
304
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)17

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Malysheva YAllen JKelleher C(2022)How Do Teaching Assistants Teach? Characterizing the Interactions Between Students and TAs in a Computer Science Course2022 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)10.1109/VL/HCC53370.2022.9832962(1-9)Online publication date: 12-Sep-2022
https://doi.org/10.1109/VL/HCC53370.2022.9832962
Mirza DConrad PLloyd CMatni ZGatin AMcCartney RPetersen ARobins AMoskal AMcCartney RRobins A(2019)Undergraduate Teaching Assistants in Computer ScienceProceedings of the 2019 ACM Conference on International Computing Education Research10.1145/3291279.3339422(31-40)Online publication date: 30-Jul-2019
https://dl.acm.org/doi/10.1145/3291279.3339422
Guzdial M(2015)Learner-Centered Design of Computing Education: Research on Computing for EveryoneSynthesis Lectures on Human-Centered Informatics10.2200/S00684ED1V01Y201511HCI0338:6(1-165)Online publication date: 30-Nov-2015
https://doi.org/10.2200/S00684ED1V01Y201511HCI033
Urban‐Lurain MWeinshank D(2013)Do Non‐Computer Science Students Need to Program?*Journal of Engineering Education10.1002/j.2168-9830.2001.tb00636.x90:4(535-541)Online publication date: 2-Jan-2013
https://doi.org/10.1002/j.2168-9830.2001.tb00636.x
Meiselwitz G(2002)Using the web to maintain the benefits of small class instruction in large classesJournal of Computing Sciences in Colleges10.5555/772636.77266017:3(141-148)Online publication date: 1-Feb-2002
https://dl.acm.org/doi/10.5555/772636.772660
McFall RUrban-Lurain MWeinshank D(2002)A Web-to-database system for collecting student data32nd Annual Frontiers in Education10.1109/FIE.2002.1206464(F1E-14-F1E-18)Online publication date: 2002
https://doi.org/10.1109/FIE.2002.1206464
Preston JShackelford R(1999)Improving on-line assessmentACM SIGCSE Bulletin10.1145/384267.30584031:3(29-32)Online publication date: 27-Jun-1999
https://dl.acm.org/doi/10.1145/384267.305840
Ziegler UCrews T(1999)An integrated program development tool for teaching and learning how to programACM SIGCSE Bulletin10.1145/384266.29978631:1(276-280)Online publication date: 1-Mar-1999
https://dl.acm.org/doi/10.1145/384266.299786
Preston JShackelford RErickson CWilusz TDaniels MMcCauley R(1999)Improving on-line assessmentProceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education10.1145/305786.305840(29-32)Online publication date: 27-Jun-1999
https://dl.acm.org/doi/10.1145/305786.305840
Ziegler UCrews TPrey JNoonan B(1999)An integrated program development tool for teaching and learning how to programThe proceedings of the thirtieth SIGCSE technical symposium on Computer science education10.1145/299649.299786(276-280)Online publication date: 24-Mar-1999
https://dl.acm.org/doi/10.1145/299649.299786
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

Software engineering for multi-tenancy computing challenges and implications

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Cited By

Index Terms

Recommendations

Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

Software engineering for multi-tenancy computing challenges and implications

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations