Saturday, 4 February 2017
Saturday, 2 August 2014
Friday, 1 August 2014
Thursday, 31 July 2014
CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE PPT
CP7201 THEORETICAL FOUNDATIONS OF
COMPUTER SCIENCE PPT
CLICK BELOW LINK TO DOWNLOAD
ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS REGULATIONS - 2013
REGULATIONS - 2013 M.E. COMPUTER SCIENCE AND ENGINEERING I - IV SEMESTERS (FULL TIME) CURRICULUM AND SYLLABUS 405 M.E. Computer Science
Monday, 14 July 2014
Anna University May/June 2014 Exams Results
Anna University May/June 2014 Exams
2nd, 4th, 6th Semester UG/PG Results
Affiliated Colleges-UG/PG- Results of May/June 2014 Examinations (Chennai&Madurai)
Affiliated Colleges-UG/PG- Results of May/June 2014 Examinations (Trichy & Tirunelveli)
Affiliated Colleges-UG/PG- Results of May/June 2014 Examinations (Coimbatore)
Affiliated Colleges-UG/PG- Results of May/June 2014 Examinations (Mark System)
Monday, 16 December 2013
CS9269 Software Project management 2nd unit
|
What is the Capability Maturity Model? (CMM)
|
|
Capability Maturity Model (CMM) broadly refers to a process
improvement approach that is based on a process model. CMM also refers
specifically to the first such model, developed by the Software Engineering Institute (SEI) in the
mid-1980s, as well as the family of process models that followed. A process
model is a structured collection of practices that describe the
characteristics of effective processes; the practices included are those
proven by experience to be effective.
CMM
can be used to assess an organization against a scale of five process
maturity levels. Each level ranks the organization according to its
standardization of processes in the subject area being assessed. The subject
areas can be as diverse as software engineering, systems engineering, project
management, risk management, system acquisition, information technology (IT)
services and personnel management.
|
Friday, 13 December 2013
CS9263 Ad-hoc Networks 4th unit
OLSR
OPTIMIZED
LINK STATE ROUTING (OLSR) PROTOCOL
OLSR is developed for
mobile ad hoc networks. It operates as a table-driven, pro- active protocol,
that is, it exchanges topology information with other nodes of the network
regularly. Each node selects a set of its neighbor nodes as “multipoint relays”
(MPR). In OLSR, only nodes, selected as such MPRs, are responsible for forwarding
control traffic, intended for diffusion into the entire network. MPRs provide
an efficient mechanism for flooding control traffic by reducing the number of
transmissions required. Nodes, selected as MPRs, also have a special
responsibility when declaring link state information in the network. Indeed,
the only requirement for OLSR to provide shortest path routes to all
destinations is that MPR nodes declare link state information for their MPR
selectors. Additional available link state information may be utilized, for
example for redundancy.
Subscribe to:
Posts (Atom)