Scribd
Upload
86 views

CSE 1384 Test # 3 Study Guide: Multiple Choice and Short Answer Topics

This study guide covers topics that may appear on the CSE 1384 Test #3 in multiple choice or short answer questions. Students should review sections on doubly linked lists, recursion types and tree traversal algorithms. The test may also include programming questions involving implementing single and doubly linked lists as well as recursive functions on linked lists and binary trees. Sample problems include adding and removing nodes, checking for empty lists, and traversing trees preorder and postorder.

Uploaded by

bella_duane
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
86 views

CSE 1384 Test # 3 Study Guide: Multiple Choice and Short Answer Topics

This study guide covers topics that may appear on the CSE 1384 Test #3 in multiple choice or short answer questions. Students should review sections on doubly linked lists, recursion types and tree traversal algorithms. The test may also include programming questions involving implementing single and doubly linked lists as well as recursive functions on linked lists and binary trees. Sample problems include adding and removing nodes, checking for empty lists, and traversing trees preorder and postorder.

Uploaded by

bella_duane
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CSE 1384 Test # 3 Study Guide

Multiple choice and short answer topics You should expect questions on these topics to appear in the multiple choice or as short answer questions Section 7.3 and 7.4 terms and details on doubly linked list Chapter 4 - 4.1.1, 4.1.3 and 4.1.4. Also check the details provided by my slides on Chapter 4. Types of Recursion with examples. Section 8-8.1.1 several terms and definitions, tree traversal algorithms and applications. There may be some questions from recent homework and/or quizzes Programming: You may see some programming questions that are of the following. Singly Linked list: Assume this linked list has both a head and tail pointer Implement the Node class for a singly linked list Implement the add_first, add_last, remove_first and remove_last methods of a singly linked list class Doubly linked list: Assume this linked list has a header and trailer node and a size data field Implement the Node class for a doubly linked list Implement the insert_between and delete_node methods of the doubly linked list class Assume another doubly linked list has a header and trailer but no size data field, write the is_empty method for the linked list Implement the add_first, add_last, remove_first and remove_last method on a doubly linked list that has no header and trailer node Positional List ADT (accessor methods) Recursion: See Homework #2 and Quiz #3 Summing the Elements of a sequence Recursively Reversing the elements of a sequence using linear recursion Perform a binary search upon a sorted list using recursion Summing the elements of a sequence using binary recursion Trees: Computing depth and height Arithmetic expression tree Implement the Node class for a binary tree Implement the Preorder and Postorder traversal methods

You might also like