CSE Course Website

Site news

Please read this!

by Matt Kernan - Tuesday, January 17, 2012, 12:04 PM

 

Instructors - if it's your first time using the new site, you'll need to send me an email letting me know that you've logged in for the first time so that I may then grant you the ability to create a course.

 

Students AND Instructors - It is important that you completely quit out of your browser after logging out of our Moodle site to ensure that your session is properly closed.  If you do not, then subsequent visits to the Moodle site will automatically log you back in.  This is especially important if you're using a public or shared computer.

 

Welcome to the new CSE Moodle site

by Matt Kernan - Tuesday, January 17, 2012, 12:04 PM

 

Welcome to the updated CSE Moodle site.  The site is ready to use, but if you run into any trouble, just send me an email (csesupport@unt.edu).

 

If you need or want to retrieve any course materials from past Moodle courses, the old site is still available for the time being.

 

http://moodle-old.cse.unt.edu

 

Available courses

• Advanced Object Oriented and Functional Programming in Scala

  • Teacher: Fahmida Hamid

  An advanced Scala programming course covering the best software development practices in object oriented and functional programming.

  

• Introduction to Compilation Techniques

  • Grader: Fahmida Hamid

  

• Programming Languages

  • Grader: Mahesh Gautam

  Spring 2012:  Office Hours:  Tuesday 4:30-5:00pm Thu 4:30-6:00pm. Travel: Jan 23-27 – presenting a paper at PADL’12

  CSCE 4430 Programming Languages: Tuesday 5:00pm-7:50pm, room B140

  Description and Objectives:

  An advanced programming language course, with emphasis on programming paradigms and language processors - and some of their formal models like Predicate Logic  and Lambda Calculus and exhibiting actual implementations of key concepts (recursion, inheritance, unification, backtracking, type inference, infinite and  lazy data objects, threads, event-driven and concurrent/distributed programming). The course also provides a glimpse at salient features of  modern object oriented languages and an overview of language implementation techniques, run-time systems, garbage collection, interpreters, compilers with emphasis  on addressing and memory management in efficient procedural languages like C.

  Syllabus (L1..Ln) indicate number of the lecture

  • Basics
  • Quick Introduction to Scala and Eclipse (our main tools) L1
  • Evolution of Programming Languages L1
  • Programming Paradigms: logic, functional, object oriented, imperative L1
  • Language Specification: Syntax and Semantics L2
  • Language Processors: Interpreters and Compilers L2
  • Models of Computation, Computability, Turing Equivalence L2
  • Object Oriented Programming (Java and Scala)
  • Types: Static vs. Dynamic Type Checking L3
  • Classes and Instances, Type vs. Implementation Inheritance L3
  • Collections, Iterators and IO operations L4
  • Reflection and Serialization L4
  • Object Oriented Exception Handling L4
  • Functional Programming Languages (Scala and Haskell)

  • Lambda Calculus and Recursion Theory L5
  • Higher Order Functions L5
  • Working with Fold/Unfold, Map, Zip L5
  • Case Classes and Pattern Matching L6
  • Regular Expressions and Combinator Parsers L6
  • Lazy Evaluation, Computing with Infinite Lists L7
  • Polymorphism, Type inference, Type Classes L7

  • Logic Programming Languages (Prolog, using a Scala-based Interpreter)
  • Unification and Horn Clause Resolution L8
  • Non-determinism and Backtracking with application to Problem Solving L8
  • Practical Prolog: IO, File Operations L9
  • Definite Clause Grammars L9
  • Parsing and Generation L9
  • Meta-Interpreters, Universal Machines L10

  •  Low Level Imperative Programming (C)
  • basics: assignment, function calls, lexical scoping, memory representations L11
  • implementing dynamic memory management and garbage collection L11
  • Implementing high-level programming languages L12
  • Concurrent Programming
  • Multi-threaded programming and Actors in Scala and Prolog L13
  • Distributed Programming, Client/Server Message Passing and Coordination L14
  • Service Architectures and Interactivity L14
  • Future trends in Programming Language Design L15

  Prerequisites: mandatory  (Data Structures)

  Recommended books:

   

  • Scala Tutorials    
  • A. Tucker & R. Noonan: Programming Languages, Principles and Paradigms, McGraw Hill
  • R. Harper’s draft PL book at: http://www.cs.cmu.edu/~rwh/plbook/
  • Java for Students:  Douglas Bell & Mike Parr, Prentice Hall
  • The Art of Prolog by Sterling and Shapiro, MIT Press

  Evaluation:

  • 2 Individual Exams: 50%
  • Team Project and Assignments (groups of 2-3): 50%

  Resources:

  • Scala and Akka
  • The Eclipse Open Software Development  Platform
  • A good prolog tutorial
  • Haskell compiler GHC and Prelude library sources
  • Java interpreter/compiler on silo and CAS network  (java, javac), Java from www.javasoft.com
  • Java based Prolog compiler
  • Programming Languages Popularity/Impact Index 
  • 99 Haskell Problems based on 99 Prolog Problems   Various Haskell Coding Styles 
  • An Objective-C tutorial 
  • Programmers Competency Matrix

  
  

  

• 3600 --- Systems Programming

  • Teacher: Philip Sweany

  The focus of this course is systems programming, largely using C and bash.  (Much) more detail is available in the class web site and course syllabus.

  

• 1040 --- C Programming, Part II

  • Teacher: Philip Sweany

  This course expands upon students basic knowledge of the C programming language, focusing on advanced C topics and developing larger and more sophisticated software.  (Much) more detail is available on the class web site and course syllabus.

  

• CSCE 5430 - Topics in Software Engineering - Spring 2012

  • Teacher: Enkh-Amgalan Baatarjav

  An advanced software engineering course, with emphasis on declarative specifications, software automation and knowledge-driven software methodologies.

  

• CSCE 4600/5640 Operating System Design

  • Instructor: Armin Mikler
  • Instructor: Yiheng Liang

  

• CSCE 5580 - Computer Networks - Spring 2012

  • Teacher: Ramanamurthy Dantu
  • Teacher: Enkh-Amgalan Baatarjav

  In this course, we will be studying practical aspects of socket programming, TCP/IP protocols, congestion control, flow control and quality of service.

  In addition, we shall study on how a router or L3 switch is designed and issues involved in such network elements. High availability design will be another aspect of the course.

  Finally we study (if time permits) the new protocols like ATM, MPLS and discuss different aspects of securing a network. Throughout the course we emphasize on real life examples and case studies. Lecture notes will be posted on the website.

  Prerequisites: CSCI 3580 and enthusiasm to learn new things in networking

  

• CSCE 4010 Spring 2012 Section 002

  • Teacher: Jonathon Doran

  

• CSCE 4420 - Software Development II - Spring 2012

  • Teacher: Ryan Garlick

  

• CSCE 4410 - Software Development I - Spring 2012

  • Teacher: Ryan Garlick

  

• CSCE 3110 Data Structures and Algorithms

  • Teacher: Jorge Reyes-Silveyra

  

• CSCE 2110.001 / 2110.002 - Computing Foundations II - Section 1 / Section 2 - Spring 2012

  • Faculty: Tamara Schneider

  Continuation of Computing Foundations I. Further introduces students to both data structures and formalisms used in computer science, such as asymptotic behavior of algorithms. Data structures and formalisms used to both describe and evaluate those data structures simultaneously. By the end of the two-semester sequence of which this course is the second part, each student will have a solid foundation in conceptual and formal models, efficiency, and levels of abstraction as used in the field of computer science. Prerequisites: CSCE 2100.

  

• CSCE 1045 Information Systems II Spring 2012

  • Teacher: David Keathly

  

• CSCE 4915 CMPE Senior Design II Spring 2012

  • Teacher: David Keathly

  

• CSCE 4925 BAIT Capstone II Spring 2012

  • Teacher: David Keathly

  

• CSCE 2110.003 - Computing Foundations II - Section 3 - Spring 2012

  • Faculty: Tamara Schneider

  This course is specifically designed for students who have taken 2050 and need to fulfill the discrete math requirement.

  

• CSCE 2100 - Computing Foundations I - Spring 2012

  • Faculty: Tamara Schneider
  • Faculty: Ian Parberry

  Introduces students to both data structures and formalisms used in computer science, such as asymptotic behavior of algorithms. Data structures and the formalisms used to both describe and evaluate those data structures simultaneously. By the end of the two-semester sequence of which this course is the first part, each student will have a solid foundation in conceptual and formal models, efficiency, and levels of abstraction as used in the field of computer science. Prerequisites: CSCE 1040.

  

• CSCE 3410 - Android - Spring 2012

  • Teacher: Ryan Garlick

  CSCE 3410. 3 hours. This course will focus on programming apps for the Android platform.