检索结果-内蒙古大学图书馆

56th Technical Symposium on Computer Science Education

作者： Koitz-Hristov, Roxane Graz Univ Technol Inst Software Technol Graz Austria

ISBN: (纸本)9798400705328

Peer code review is a key practice in professional software development, and its integration into computer science education can provide valuable learning experiences for students. However, few reports compare different peer code review methods within a single educational context. This experience report shares insights from implementing various review types-individual, team, and pair code reviews-in a first-year data structures and algorithms course in a bachelor's degree program. Throughout the semester, students took an active role in their learning by completing three programming assignments, each followed by a different peer review method. Feedback was collected through questionnaires to capture the students' perceptions of their data structure knowledge, programming skills, and overall learning experience. Our report outlines the design of the different review learning activities, provides insights into the students' opinions on the review techniques, and reflects on the challenges and successes we encountered. As each method offers unique benefits, we believe that incorporating a variety of peer code review methods can enhance the overall learning experience in computer science courses.

关键词： Computer Science Education Peer Code Review Peer Review Code Review data structures and algorithms Higher Education

来源：评论

学校读者我要写书评

暂无评论

AlgoTutor: An Integrated Learning Platform for data structures and algorithms with Real-Time Guidance and Interactive Visualizations 26th

AlgoTutor: An Integrated Learning Platform for Data Structur...

引用

26th International Conference on Human-Computer Interaction (HCII)

作者： Sashank, Gadepalli Chandan Tan, Zong Wei Fernando, Owen Noel Newton Nanyang Technol Univ Singapore Singapore

ISBN: (纸本)9783031619526;9783031619533

AlgoTutor is an innovative educational interactive system designed to transform the learning experience of algorithms and data structures for modern university students in computer science. Despite the growing demand for robust computer science education, mastering these subjects remains challenging due to their inherent complexity. AlgoTutor offers an integrated learning platform featuring interactive modules, diverse materials, a real-time coding compiler, and visual aids to enhance conceptual understanding. By emphasizing critical thinking, retention, and real-time feedback without direct answers, AlgoTutor facilitates a deeper comprehension of fundamental concepts. Additionally, the platform ensures the quality and relevance of instructional materials by leveraging ChatGPT with the GPT4.0 API to provide high-quality responses. With its focus on accessibility and engagement, AlgoTutor aims to make learning data structures and algorithms more enjoyable and effective, ultimately empowering students to master these essential aspects of computer science education.

关键词： data structures and algorithms Computer Science Education Educational Technology ChatGPT Integration Learning Platform

来源：评论

学校读者我要写书评

暂无评论

Targeted Guidance for Beginner Software Engineering Students to Learn data structures and algorithms in Java 20

Targeted Guidance for Beginner Software Engineering Students...

引用

ACM Conference on International Computing Education Research (ICER)

作者： Priyankara, Chathura Victoria Univ Wellington Wellington New Zealand

ISBN: (纸本)9781450370929

Beginner software engineering students face difficulties while implementing programs with data structures and algorithms. Knowledge gaps, fundamental misconceptions and invalid mental models are major causes for such difficulties. For an effective learning process, it is important to address misconceptions and provide targeted guidance. This study aims to identify students' misconceptions related to data structures and algorithms programming in Java and to reveal necessary guidance to overcome observed misconceptions while exploring the possibilities of offering targeted guidance automatically.

关键词： data structures and algorithms Java beginner misconceptions targeted guidance

来源：评论

学校读者我要写书评

暂无评论

Willow: A Tool for Interactive Programming Visualization to Help in the data structures and algorithms Teaching-Learning Process 19

Willow: A Tool for Interactive Programming Visualization to ...

引用

33rd Brazilian Symposium on Software Engineering (SBES) / 10th Brazilian Conference on Software (CBSoft)

作者： Moraes, Pedro Teixeira, Leopoldo Univ Fed Pernambuco Recife PE Brazil

ISBN: (纸本)9781450376518

data structures and algorithms (DSA) are one of the main pillars of software development;however, abstractions around them are hard to teach and to be understood by students. The most common approaches adopted by instructors to demonstrate the behavior of DSAs are the use of resources like slides and whiteboard sketches to create program illustrations. This task may be slow and tedious because these illustrations need to be continuously updated to represent new algorithm inputs and modifications. In this paper, we propose Willow, a tool for Program Visualization Simulation (PVS), which supports user interactions to manipulate the generated visualizations. With these manipulations in the visualization, we expect the user to be able to create better examples, resembling Algorithm Visualization Simulation tools (AVS), which are specialized in providing visualizations for specific DSAs. We evaluated our tool through a preliminary qualitative study with teaching assistants from an introductory Computer Science course who all give review lessons to the students. Our preliminary results show that the tool was well accepted by the participants, but we still need more studies to validate the use of the tool in classrooms. With the use of our tool features in the teaching-learning process, we expect that instructors may be able to interactively and more clearly explain DSAs to their students, without the hassle of hours creating slides or drawing by hand messy examples of algorithms.

关键词： data structures and algorithms program visualization algorithm visualization programming learning

来源：评论

学校读者我要写书评

暂无评论

Some innovations of teaching the course on data structures and algorithms 15

Some innovations of teaching the course on Data structures a...

引用

IEEE 15th International Scientific Conference on Informatics (INFORMATICS)

作者： Steingartner, William Eged, Jan Radakovic, Davorka Novitzka, Valerie Tech Univ Kosice Fac Elect Engn & Informat Kosice Slovakia Univ Novi Sad Fac Sci Novi Sad Serbia

ISBN: (纸本)9781728131795

The teaching of practical foundations of computer science is still a big challenge. The course on data structures and algorithms is one of the most important foundational courses that are necessary to be included in the curriculum of future IT experts. The content of this course is quite wide and it differs in many universities. In our teaching process, we identified some interesting problems that could be presented more attractively - using the visualizing software. In this paper, we present a purpose, role, design and methodology of our developed software tool for the convenience of teaching and studying the problem of the longest common subsequence.

关键词： data structures and algorithms formal methods software products software engineering teaching innovation teaching software university didactic

来源：评论

学校读者我要写书评

暂无评论

C++ data structures and algorithms: Learn how to write efficient code to build scalable and robust applications in C++

引用

2018年

作者： Wisnu Anggoro

ISBN: (数字)9781788831970

ISBN: (纸本)9781788835213

Learn how to build efficient, secure and robust code in C++ by using data structures and algorithms - the building blocks of C++ About This Book • Use data structures such as arrays, stacks, trees, lists, and graphs with real-world examples • Learn the functional and reactive implementations of the traditional data structures • Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner Who This Book Is For This book is for developers who would like to learn the data structures and algorithms in C++. Basic C++ programming knowledge is expected. What You Will Learn • Know how to use arrays and lists to get better results in complex scenarios • Build enhanced applications by using hashtables, dictionaries, and sets • Implement searching algorithms such as linear search, binary search, jump search, exponential search, and more • Have a positive impact on the efficiency of applications with tree traversal • Explore the design used in sorting algorithms like Heap sort, Quick sort, Merge sort and Radix sort • Implement various common algorithms in string data types • Find out how to design an algorithm for a specific task using the common algorithm paradigms In Detail C++ is a general-purpose programming language which has evolved over the years and is used to develop software for many different sectors. This book will be your companion as it takes you through implementing classic data structures and algorithms to help you get up and running as a confident C++ programmer. We begin with an introduction to C++ data structures and algorithms while also covering essential language constructs. Next, we will see how to store data using linked lists, arrays, stacks, and queues. Then, we will learn how to implement different sorting algorithms, such as quick sort and heap sort. Along with these, we will dive into searching algorithms such as linear search, binary search and more. Our next mission will be to attain

关键词： C++ data structures algorithms data structures and algorithms algos data structs linked lists

来源：评论

学校读者我要写书评

暂无评论

HFOSS-Lite in CS2: Incorporating the Ushahidi Crowdmapping Program in a data structures and algorithms Course (Abstract Only) 15

HFOSS-Lite in CS2: Incorporating the Ushahidi Crowdmapping P...

引用

Proceedings of the 46th ACM Technical Symposium on Computer Science Education

作者： Samuel A. Rebelsky Grinnell College Grinnell IA USA

ISBN: (纸本)9781450329668

Although undergraduate computer science enrollments are again on the upswing, increased enrollments do not seem to have led to increased diversity -- CS, at least in America, remains a field dominated by white males. A variety of evidence shows that many underrepresented groups, such as women and domestic students of color, are often motivated by course work that includes a clear societal benefit. The Humanitarian Free and Open Source Software (HFOSS) approach suggests that working on FOSS projects that have humanitarian benefits provides such motivation. Unfortunately, adding new themes and topics to courses can be difficult. CS2, in particular, often feels packed enough that it's hard to envision adding something else. And, while HFOSS is attractive, it's sometimes hard for the particular needs of a project to help students develop course-specific knowledge (about data structures and algorithms).I've recently experimented with an idea that I call "HFOSS-lite". Rather than students contributing directly to an HFOSS project, they use an HFOSS project as a source of data for their data structures and algorithms. The Ushahidi crowdmapping platform has proven especially useful. Students can contribute data to Ushahidi sites and even build their own sites. The data can be used in a variety of exercises, from simple searching to sorting algorithms in which they use different criteria (not just alphabetical or by time, but also by distance from a location and a variety of hybrid approaches) and beyond. And, because they are using the HFOSS software, they think about societal impact.

关键词： cs2 data structures and algorithms hfoss csed4sg free and open-source software

来源：评论

学校读者我要写书评

暂无评论

Parallel Minimum -Weight Parity Factor Decoding for Quantum Error Correction 5

Parallel Minimum -Weight Parity Factor Decoding for Quantum ...

引用

2024 International Conference on Quantum Computing and Engineering

作者： Yang, Liu Wu, Yue Zhong, Lin Yale Univ Dept Comp Sci POB 2158 New Haven CT 06520 USA

ISBN: (纸本)9798331541378

The Minimum -Weight Parity Factor (MWPF) decoder is renowned for its accuracy in Quantum Error Correction (QEC) for various space-time codes, including surface codes and quantum LDPC codes. This work explores the scalability of MWPF decoders through parallelization, similar to parallel MWPM decoders. We introduce a dynamic fusion graph to schedule fusion operations in dynamic quantum circuits. It allows parts of the decoding graph to be solved and fused at a later stage, without having the full fusion tree at the very beginning. It also reduces the overhead caused by the traversing of the fusion tree. The dynamic fusion graph represents a novel and efficient method for real-time QEC decoding, providing enhancements in throughput and scalability for fault -tolerant quantum computing.

关键词： and Cluster Computing data structures and algorithms Parallel Quantum Error Correction Distributed

来源：评论

学校读者我要写书评

暂无评论

Helping Faculty Teach Software Performance Engineering

Helping Faculty Teach Software Performance Engineering

引用

1st International Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： Owens, John D. Hoppe, Bruce Univ Calif Davis Dept Elect & Comp Engr Davis CA 95616 USA Connect Associates Arlington MA USA

ISBN: (纸本)9798350364613;9798350364606

Over the academic year 2022-23, we discussed the teaching of software performance engineering with more than a dozen faculty across North America and beyond. Our outreach was centered on research-focused faculty with an existing interest in this course material. These discussions revealed an enthusiasm for making software pertimmance engineering a more prominent part of a curriculum for computer scientists and engineers. Here, we discuss how MIT's longstanding efforts in this area may serve as a launching point for community development of a software performance engineering curriculum, challenges in and solutions for providing the necessary infrastructure to universities, and future directions.

关键词： Performance distributed parallel cluster computing data structures and algorithms software performance engineering

来源：评论

学校读者我要写书评

暂无评论

Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted databases Using a Bio-Molecular Algorithm on IBM Quantum's Computers

IEEE TRANSACTIONS ON NANOBIOSCIENCE

引用

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2022年第2期21卷 286-293页

作者： Chang, Weng-Long Chung, Wen-Yu Hsiao, Chun-Yuan Wong, Renata Chen, Ju-Chin Feng, Mang Vasilakos, Athanasios V. Natl Kaohsiung Univ Sci & Technol Dept Comp Sci & Informat Engn Kaohsiung 80778 Taiwan Natl Ctr Theoret Sci Div Phys Taipei 10617 Taiwan Chinese Acad Sci Wuhan Inst Phys & Math Wuhan 430071 Peoples R China Guangzhou Inst Ind Technol Res Ctr Quantum Precis Measurement Guangzhou 511458 Peoples R China Fuzhou Univ Coll Math & Comp Sci Fuzhou 350116 Peoples R China

In this paper, we propose a bio-molecular algorithm with O(n(2)) biological operations, O(2(n-1)) DNA strands, O(n) tubes and the longest DNA strand, O(n), for inferring the value of a bit from the only output satisfying any given condition in an unsorted database with 2(n) items of n bits. We show that the value of each bit of the outcome is determined by executing our bio-molecular algorithm n times. Then, we show how to view a bio-molecular solution space with 2(n-1 )DNA strands as an eigenvector and how to find the corresponding unitary operator and eigenvalues for inferring the value of a bit in the output. We also show that using an extension of the quantum phase estimation and quantum counting algorithms computes its unitary operator and eigenvalues from bio-molecularsolution space with 2(n-1 )DNA strands. Next, we demonstratethat the value of each bit of the output solution can be determined by executing the proposed extended quantum algorithms n times. To verify our theorem, we find the maximum-sized clique to a graph with two vertices and one edge and the solution b that satisfies b(2) 1 (mod 15) and 1 < b < (15/2) using IBM Quantum's backend.

关键词： data structures and algorithms molecular algorithms quantum algorithms NP-complete problems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：