Schedule | Academics | Bemidji State University

Class Schedule Search

Term

Subject

Location

Liberal Education

Additional Options

Class Schedule Addition Search Options

Times: Between

and

If only one start or end time is selected or the start time is after the end time, the time search will be skipped.

Day(s)

Hold down the Ctrl (windows) / Command (Mac) button to select multiple options.

Class Number Range

Instructor

Search for an instructor by name.

Course Name

Search for a course by name.

Delivery Method

Class Schedule Search Results

Important Notice: Some Extended Learning courses will be opened to all students (on and off campus) for registration on April 19th. Tuition for undergraduate courses, with the exclusion of most travel courses, is banded (12-18 credits). Some programs/courses are approved for differential tuition, this charge is in addition to the tuition rate. Please review your charges on your fee statement in e-Services.

10 Courses Found.

ID	Dept.	Crs.	Sect.	Title	Cr.	Days	Time	Dates	Location	Instructor	Size
Computer Science
223902	CS	1107	01	Introduction to Computers	3	T H	2:00pm - 3:15pm	8.23.21-12.15.21	S 331	Bakke, Christine	9/40
An examination of the development of computing devices, modern computing practices, components of a computing system, common application software, and uses of computers in society. No previous experience with computers is assumed. Note: This course is not intended for Computer Science majors or minors. Liberal Education Goal Area 9.
223903	CS	1309	01	Prob Solv & Computation	3	M W	12:00pm - 12:50pm	8.23.21-12.15.21	HSH 109	Tian, Baozhong	20/20
						M	2:00pm - 3:50pm	8.23.21-12.15.21	S 371	Tian, Baozhong
Introduction to general problem-solving techniques applicable to solving problems in computing, including elementary computational problems. Other techniques include using systematic lists, using diagrams, and looking for patterns. Includes fundamental computational concepts in information representation, computer organization, and social and ethical issues in computing. The two-hour lab introduces the use of software to solve a variety of problems. The prospective student should have a general understanding of computers and their operation. Prerequisite: Successful completion of MATH 0800 with a grade of B or better, or three years of high school mathematics (including two years of algebra) and a score on the Mathematics Placement Test appropriate for placement into MATH 1170. Liberal Education Goal Area 4
223904	CS	1309	02	Prob Solv & Computation	3	M W	12:00pm - 12:50pm	8.23.21-12.15.21	HSH 109	Tian, Baozhong	15/20
						T	8:00am - 9:50am	8.23.21-12.15.21	S 371	Tian, Baozhong
Introduction to general problem-solving techniques applicable to solving problems in computing, including elementary computational problems. Other techniques include using systematic lists, using diagrams, and looking for patterns. Includes fundamental computational concepts in information representation, computer organization, and social and ethical issues in computing. The two-hour lab introduces the use of software to solve a variety of problems. The prospective student should have a general understanding of computers and their operation. Prerequisite: Successful completion of MATH 0800 with a grade of B or better, or three years of high school mathematics (including two years of algebra) and a score on the Mathematics Placement Test appropriate for placement into MATH 1170. Liberal Education Goal Area 4
223905	CS	2270	01	Intro to Web Programming	3	T H	2:00pm - 3:45pm	8.23.21-12.15.21	S 371	Neville, Francois	9/24
This course expands on basic knowledge of markup languages and web programming languages. Students learn how to use current web markup languages, aspects of various transfer protocols, and client-side scripting languages. All of these topics support the development of both web pages and web sites. Prerequisite: CS 1309.
223906	CS	2321	01	Computer Science I	4	M W F	9:00am - 9:50am	8.23.21-12.15.21	M 230	Tian, Baozhong	7/24
						W	2:00pm - 3:50pm	8.23.21-12.15.21	S 371	Tian, Baozhong
Introduction to the basic principles of software development using a modern high-level language, including using selection, looping, function calls, and recursion, along with simple data structures such as arrays and objects, to solve problems. Includes an introduction to software engineering techniques such as interactive debugging, software testing, and methods of software validation. Includes a two-hour lab. Prerequisite: CS 1309; MATH 1170 or MATH 1470 or higher.
223925	CS	2322	01	Computer Science II	4	M W F	1:00pm - 1:50pm	8.23.21-12.15.21	S 203	Neville, Francois	12/24
						T	12:00pm - 1:50pm	8.23.21-12.15.21	S 371	Neville, Francois
Topics include recursion and the study of object-oriented concepts including encapsulation, inheritance and polymorphism. It includes the study of fundamental data structures including strings, lists, stacks, queues, containers classes, binary trees, and hash tables. Also includes a group-oriented software design and implementation project. Includes a two-hour lab. Prerequisite: CS 2321.
223908	CS	3360	01	Object-Oriented Sftwr Dev	3	M W F	2:00pm - 2:50pm	8.23.21-12.15.21	S 203	Neville, Francois	9/30
Techniques used in object-oriented software development. Key components of these techniques include design patterns, abstraction, encapsulation, modularity, message passing, polymorphism, inheritance, and incremental software development. Students translate a design into software using an object-oriented programming language. Additional topics may include applets, markup languages, multi-threaded programming, and rudimentary network programming. Prerequisite: CS 2322 or equivalent. May not be offered every year.
223909	CS	3507	01	Intro to Databases	3	M W F	10:00am - 10:50am	8.23.21-12.15.21	HSH 214	Neville, Francois	14/30
Provides an introduction to the theory and use of modern database systems, with particular focus on SQL, the relational data model, and relational database design. Prerequisite: CS 2322. May not be offered every year.
223910	CS	3528	01	Data Struct & Algorithms	4	M WHF	8:00am - 8:50am	8.23.21-12.15.21	M 220	Tian, Baozhong	9/30
Study of advanced abstract information storage structures, including priority queues, binary trees, generalized trees, and graphs. Study of algorithm development techniques, including divide and conquer, greedy algorithms, and dynamic programming. Includes learning a programming language not used in CS 2321 and CS 2322. Prerequisites: CS 2322 and MATH 2210 or consent of the instructor.
223911	CS	4840	01	Operating Systems	3	T H	11:00am - 12:15pm	8.23.21-12.15.21	M 240	Tian, Baozhong	3/25
Fundamentals of operating system design with emphasis on at least one modern operating system. Topics include scheduling, memory management, paging, file management, and mutual exclusion. Required work will include programming investigations. Prerequisites: CS 2322 and CS 2810.
Delivery Method Key Note: No delivery method indicates course is delivered in-person on-campus (charged on-campus fees) BLND: Blended/hybrid: 25-75% of course is delivered online with regularly scheduled in-person meetings (charged on-campus fees) HYFL: Course instruction is delivered both in-person and online, you choose the method that is right for you (charged on-campus fees) RMTL: Remote teaching with limited in-person meetings (charged on-campus fees) RMTN: Remote teaching with no in-person meetings (charged on-campus fees) ONL: Course is delivered completely online (charged online tuition differential) ONLP: Course is delivered completely online with proctored exams or up to two in-person meetings (charged online tuition differential) ONLS: Course is delivered completely online with some synchronous class meetings (charged online tuition differential)

Course data last update: 2021-08-03 12:46:47pm
Next course data update: 2021-08-03 1:50:51pm