Lecturer Dr. Binsky Hadar

Courses

  • Computers Communication (10013)
  • Course summary:

    Abstract:

    Principles of constructing computer communication networks and the various mechanisms activated in them. The course’s focus is on the Internet, its physical and logical structure and the principles of constructing network applications over it. The main line in the course is the 5 layer model. The course is organized by a top-down approach following Kurose and Ross for methodology for teaching computers communications.
  • Data Structures (10117)
  • Course summary:

    Abstract:

    Issues of the course:

    Analysis of Algorithms and Mathematical Foundations: Growth of f?unctions and Asymptotic notations, Master Methods. Searching for a term in a sorted and an unsorted list,merging sorted series, analyzing the complexity of their run times.

     Abstract Data Types, the Concept of Implementation, Data Types. Lists: Linked Lists, the Linked List as a Data Structure, Double Linked Lists. Stacks, Queues,

    Trees: Binary Trees and Traversals, Binary Search Trees General Trees, Balanced Trees.

    Heaps and Heapsort, analysis of Heapsort . Sorting and Searching:, Quicksort,

     analysis of Quicksort, Sorting in Linear Time : Bucket sort, Radix sort, Counting sort . Median and Order Statistics, Sequential/ Binary/ Tree Searching. Hash Tables.
  • Operating Systems (10303)
  • Course summary:

    Abstract:

    An operating system (OS) is a software that manages computer hardware and software resources. The OS provides common services for computer programs.

    In this course we aim to learn the classical issues regarding modern OS.

    Particularly we will cover the following topics: system calls, Process management (scheduling, context switching, synchronization, threads, deadlocks); Memory management (paging, virtual

    memory), File systems.