Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

CSCI 2230 Spring 2009 Final Exam Topic Outline - Prof. Vernon W. Pine, Exams of Digital Signal Processing

An outline for the final exam of csci 2230, a computer science course, held in spring 2009. The exam consists of four parts: true or false questions, short answer questions, computations, and analyze, compare and contrast. The first two parts are restricted to material from lectures 10 to 12, while the last two parts cover the comprehensive course material. Topics include b-tree index search, insert, delete, order calculations, node structure, and performance.

Typology: Exams

Pre 2010

Uploaded on 08/18/2009

koofers-user-9vh-1
koofers-user-9vh-1 🇺🇸

10 documents

1 / 1

Toggle sidebar

Related documents


Partial preview of the text

Download CSCI 2230 Spring 2009 Final Exam Topic Outline - Prof. Vernon W. Pine and more Exams Digital Signal Processing in PDF only on Docsity! CSCI 2230 Final Exam – Topic Outline Spring 2009 Test Date: 4 May Test Format Part 1 – True or False Read carefully, these questions are not designed to be deliberately misleading, but words have meaning. (~20 points) Part 2 – Short answer questions Brief, to the point answer, 1-3 sentences. (~ 20 points) Part 3 – Computations Must show work to receive credit. (~ 40 points) Part 4 – Analyze, compare and contrast Thought required. Discuss pros and cons, pluses and minuses, advantages and disadvantages support with specific examples. (~20 points) Part 1 and Part 2: Restricted to material from Lecture 10, 11, 12 Part 3 and Part 4: Course Comprehensive Computations and Manipulations Same as Test 1 and Test 2, plus  B-tree Index o Search o Insert  Including Split and Promote o Delete  4 Cases o Order calculations  Node structure  Blocking factor calculation  Minimum, maximum number of keys per node  B-Tree performance o Store the master file in the B-tree  Node structure  Blocking factor calculation Order of Study  Exercises  Test 1  Test 2  Lectures 10 - 12  Lectures 6 - 9  Lectures 1- 5
Docsity logo



Copyright © 2024 Ladybird Srl - Via Leonardo da Vinci 16, 10126, Torino, Italy - VAT 10816460017 - All rights reserved