Temple University 3 credits CIS
This course is typically offered in Fall and Spring.Comparative analysis of algorithms and data structures. Data structures include heaps, priority queues, binary and general trees, binary search trees, AVL trees, Red-Black trees, B-trees, and graphs. Algorithms include heapsort, topological sort, breadth-first search, depth-first search, shortest path algorithms, and Greedy algorithms. Students will gain experience working in a group on at least one moderate-size project. NOTE: For Computer Science Majors.For any CIS prerequisite course taken prior to Spring 2012 a grade of C or better is required.
Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β written from scratch to your course requirements.
Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.
Expert guides on essay writing, citation styles, study skills, and academic success.
View All Articles
Learn how to write a good research question for a paper. Narrow your topic, identify a research problem, and create a focused question with practical examples.
Learn how to choose a research topic you can actually research. Discover how to narrow broad ideas, find reliable sources, and develop a focused research question.
Learn how to cite sources in a research paper using APA, MLA, and Chicago styles, with in-text citation examples and reference-list tips.