Session

Winter 2023

 Status

Cancelled: Course Delivery

 Term

W

Format

LECT

Calendar Description / Prerequisite / Co-Requisite

A completion to introductory problem solving and algorithm development. Taught in Java, topics include linked lists, binary trees, stacks, queues and other elementary data structures. Complexity analysis is introduced with an emphasis on searching and sorting algorithms. Note: This course will not count for computer science major or minor credit. Prerequisites: AP/ITEC 1620 3.00, AP/ITEC 2610 3.00. PRIOR TO FALL 2014: Course credit exclusions: LE/CSE 1030 3.00.PRIOR TO SUMMER 2013: Prerequisites: AP/ITEC 1620 3.00, AP/ITEC 2610 3.00. Course credit exclusions: GL/CSLA 2620 3.00, GL/ITEC 2620 3.00, SC/CSE 1030 3.00.

Course Start Up

Course Websites hosted on York's "eClass" are accessible to students during the first week of the term. It takes two business days from the time of your enrolment to access your course website. Course materials begin to be released on the course website during the first week. To log in to your eClass course visit the York U eClass Portal and login with your Student Passport York Account. If you are creating and participating in Zoom meetings you may also go directly to the York U Zoom Portal.

For further course Start Up details, review the Getting Started webpage.

For IT support, students may contact University Information Technology Client Services via askit@yorku.ca or (416) 736-5800. Please also visit Students Getting Started UIT or the Getting Help - UIT webpages.