Home > Courses > Computer Science/Information Technology > CS703

CS703 : Adanced !perating Systems

I li"e this Course
Course Info
Course Category
Computer Science/Information Technology
Course #eel
$raduate
Credit Hours
3
%re&re'uisites
CS(0) *CS(0) Introduction to %rogramming+, CS-0. *CS-0. !perating Systems+
Instructor
/r0 1arhan 2aidi
/S Computer Science
3niersity of Southern California, 3SA
Course Contents
Introduction, !perating System: top&do4n and 5ottom up ie4s, design issues, modules and
components, serices and system calls, structure and organi6ation0 78ecuta5le file formats, Static
#in"ing, 9ynamic lin"ing, #oading programs into memory, Anatomy of a %rocess, 78ceptional
control flo4, Conte8t s4itching, %rocess related system calls, Threads, Concurrency and
synchroni6ation: :ace conditions, /utual e8clusion and pro5lems arising from them, #oc"s,
semaphores and condition aria5les, 9esign of Inter&process communication mechanisms,
:eaders/4riters and producer/consumer pro5lems, :e&entrant code and thread&safe li5raries,
9eadloc", 9esign alternaties for highly concurrent serers *research topic+0 C%3 scheduling:
Scheduling policies and algorithms, Scheduling algorithm comparison, :eal&time and multi&
processor scheduling, #inu8 case study0 9ynamic memory management: Internal design
alternaties for malloc and free routines, $ar5age collection0 !S memory management: /emory
protection, %rogram relocation, /emory partitioning techni'ues, ;irtual memory, %aging and
segmentation, T#< and cache management0 1ile systems: =aming issues, 9esign alternaties for
file systems, 78ample file systems and their comparison0 I/! management: /emory mapped ;s
9irect I/!, Interrupt drien ;s %olled I/!, 9eice controllers and deice driers, =aming issues,
!S I/! architecture, <uffering techni'ues, 9is" deices and their management0 Timer
management in !S, 7ent notification mechanisms, 3=I> signals, Security and protection:
Security aspects in operating systems, Authentication, Authori6ation, Accounting, Security
domains and security models, %rotection against 4orms and iruses, %rotection against 5uffer
oerflo4 attac"s, ?indo4s case study, #inu8 case study, @aa Security, State of the art !S
research topics0
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
Home > Courses > Computer Science/Information Technology > CS30)
CS30) : 9ata Structures
I li"e this Course
Course Info
Course Category
Computer Science/Information Technology
Course #eel
3ndergraduate
Credit Hours
3
%re&re'uisites
CS(0) *CS(0) Introduction to %rogramming+,
Instructor
9r0 Sohail Aslam
%h9 Computer Science
3niersity of Illinois at 3r5ana&Champaign
Course Contents
Introduction, The Array data type, The #ist a5stract data type *A9T+, #in"ed lists, Stac"s, Aueues,
Trees, A;# Trees ,Huffman encoding , The Heap A9T, %riority 'ueue implementation using the
heap A9T, The 9isBoint Sets A9T, The Ta5le A9T, Implementation using arrays, S"ip lists, Ta5le
A9T implementation using Hashing, Collision resolution in Hashing, !ther uses of Hashing,
Sorting, and Selection sort, Insertion sort, <u55le sort algorithms, 9iide and con'uer strategy:
/erge sort, Auic" sort0
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
Home > Courses > Computer Science/Information Technology > CSC0(
CSC0( : 1undamentals of Algorithms
I li"e this Course
Course Info
Course Category
Computer Science/Information Technology
Course #eel
3ndergraduate
Credit Hours
3
%re&re'uisites
CS30) *CS30) 9ata Structures+
Instructor
9r0 Sohail Aslam
%h09 Computer Science
3niersity of Illinois at 3r5ana&Champaign
Course Contents
Analy6ing the 4orst&case running time of an algorithm as a function of input si6e, sole
recurrence relations, <asics of 9iide and Con'uer strategy, 3nderstand the concepts of
9ynamic programming, 3nderstand the concepts of $reedy Algorithm, 3nderstand the concepts
of $raph traersing, 3nderstand the concepts of /ST and their algorithms, 3nderstand the
algorithms for computing shortest path, <asics of Comple8ity theory0
: 1undamentals of Algorithms
Course !erie4
Course Synopsis
This course is designed to proide students 4ith an understanding of the principles and
techni'ues used in the design and analysis of algorithms0 The course is primarily theoretical and
does not re'uire programming, 5ut it does re'uire understanding of the notion of a mathematical
proof and some "no4ledge of elementary discrete mathematics0 ?e 4ill discuss and analy6e a
ariety of data structures and algorithms chosen for their importance and their illustration of
fundamental concepts0 ?e 4ill emphasi6e analy6ing the 4orst&case running time of an algorithm
as a function of input si6e0 ?e 4ill also spend some time e8ploring the 5oundary 5et4een
feasi5le computations, ta"en to 5e those doa5le in polynomial time, and infeasi5le computations
Course #earning !utcomes
At the end of this course you should 5e a5le to :
Analy6e the 4orst&case running time of an algorithm as a function of input si6e
Sole :ecurrence relations
3nderstand and implement 9iide and Con'uer strategy
3nderstand the concepts of 9ynamic programming
3nderstand the concepts of $reedy Algorithm
3nderstand the concepts of $raph traersing
3nderstand and e8plain 5asics of Comple8ity theory
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD
Home > Courses > Computer Science/Information Technology > CS70(
CS70( : Adanced Algorithms Analysis and 9esign
I li"e this Course
Course Info
Course Category
Computer Science/Information Technology
Course #eel
$raduate
Credit Hours
3
%re&re'uisites
CS30) *CS30) 9ata Structures+, CSC0( *CSC0( 1undamentals of Algorithms+
Instructor
9r0 =0 A0 2afar
%h09 Computer Science
Eyushu 3niersity, @apan
Course Contents
Introduction, 3nderlying mathematical theory, Induction and recursion techni'ues in analy6ing
algorithms, Asymptotic notations, Search techni'ues, 9iide&and con'uer techni'ue, :andomi6ed
algorithms, Heuristic algorithms, <rute 1orce approach, <ac"trac"ing, 5ranch&and&5ound,
!ptimi6ation techni'ues in algorithms designing, 9ynamic algorithms, $reedy algorithms, $raph
Theory, Searching algorithms, /inimal spanning tree algorithms, %olynomials and 11T, =um5er
theoretic notations, =um5er theoretic algorithms, :SA cryptosystems, String matching, pattern
matching, =% completeness and =% completeness proofs0
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD
Home > Courses > Computer Science/Information Technology > CS.0(
CS.0( : Theory of Automata
I li"e this Course
Course Info
Course Category
Computer Science/Information Technology
Course #eel
3ndergraduate
Credit Hours
3
%re&re'uisites
=/A
Instructor
9r0 Shahid Siddi'i
%h090 *Computational /athematics+
<runel 3niersity *3niersity of ?est #ondon+, 7ngland0
Course Contents
#anguages, Eleen Closure, :ecursie 9efinitions, :egular 78pressions, 1inite and Infinite
languages, :egular #anguages, =on:egular #anguages, 1inite Automata 4ith output, 1inite
Automata and their languages, Transition $raphs, =ondeterminism, =on:egular #anguages, The
%umping #emma, Conte8t 1ree $rammars, Tree, Am5iguity, %ushdo4n Automata, 9ecida5ility
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD
Home > Courses > Computer Science/Information Technology > CS-0.
CS-0. : !perating Systems
I li"e this Course
Course Info
Course Category
Computer Science/Information Technology
Course #eel
3ndergraduate
Credit Hours
3
%re&re'uisites
CS30) *CS30) 9ata Structures+, CS.0)*CS.0) Computer Architecture and Assem5ly
#anguage %rogramming+,
CSC0( *)( CSC0( 1undamentals of Algorithms+
Instructor
9r0 Syed /ansoor Sar4ar
%h9 Computer 7ngineering
Io4a State 3niersity, 3SA
Course Contents
Introduction, Single&user systems,!perating system components and serices, !perating system
structures, %rocess concept, Inter&process communication *I%C+ and process synchroni6ation,
3=I>/#inu8 I%C tools and associated system calls, 3se of 1I1!s in a program, Thread models,
Schedulers, 9ispatcher, Algorithm ealuation, %rocess synchroni6ation, The Critical Section
%ro5lem, The <a"ery Algorithm, 9eadloc" and Staration, 9eadloc" handling, 9etections and
:ecoery, /emory management, %aging, /emory /anagement in Intel F03F-, ;irtual /emory,
9emand %aging, , %age 1ault, <eladyGs Anomaly, Stac" :eplacement Algorithms, Thrashing, 1ile
Concept, 9irectory Structure, 1ile System, /ounting, 1ile Sharing and %rotection, Space
Allocation Techni'ues, 9is" Structure and Scheduling, 1ree Space /anagement0
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD
Home > Courses > Computer Science/Information Technology > CS70)
CS70) : Theory of Computation
I li"e this Course
Course Info
Course Category
Computer Science/Information Technology
Course #eel
$raduate
Credit Hours
3
%re&re'uisites
CS.0( *CS.0( Theory of Automata+, /TH(0(
Instructor
9r0 Sarmad A55asi
%h09 Computer Science
:utgers 3niersity, 3SA
Course Contents
Introduction, Set Thoery, Se'uences, Tuples, 1unctions, :elations, $raphs, Turing /achines,
7numerators, 9oetailing, The Church&Turing Thesis, Hil5ertHs Tenth %ro5lem, 9ecida5le
#anguages, The Acceptance %ro5lem for 91As, The Halting %ro5lem, 3niersal T/,
3ndicida5ility of the Halting %ro5lem, #inear <ounded Automata, Computation Histories, Conte8t
1ree $rammars, :ussellHs %arado8, 7mptiness %ro5lem, %ost Correspondence %ro5lem,
Computa5le 1unctions, :educi5ility, :ecursion Theorem, #ogical Theories, $odelHs Theorem,
!racles, Turing :educi5ility, A definition of Information, Incompressi5le Strings, Comple8ity
Theory, <ig !h and #ittle !h =otations, Time Comple8ity, =on&9eterministic Time, The Class %,
The Class =%, %olynomial Time ;erifiers, Su5set Sum %ro5lem, Satisfia5ility, =%&Completness, 3&
Color %ro5lem, The Coo"&#ein Theorem, Independent Sets %ro5lem, Cli'ue, ;erte8 Coer,
Hamiltonian %ath %ro5lem, The Su5set Sum %ro5lem, The Traeling Salesman %ro5lem, Space
Comple8ity, :elationship 5et4een Space and Time Comple8ity, %S%AC7&Completeness, TA<1,
%roe that TA<1 is %S%AC7&Complete, 1!:/3#A&$A/7, $enerali6ed $eography, #!$S%AC7
Transducer, %roe the Theorem: =# D co&=#0
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD