Internships in Computer Science and Engineering

Posted on by
Sanfoundry located at Bangalore offers internships to deserving B.E./B.Tech Students in Computer Science and Engineering Branch. Go to your favorite topic mentioned below to read more about our Internship and apply:

1. Discrete Mathematics
  • Statements and Proofs
  • Set Notation
  • The Logical Framework
  • Natural Numbers
  • Functions
  • How to Count
  • Integers
  • Divisibility and Prime Numbers
  • Fractions and Real Numbers
  • Principles of Counting
  • Subsets and Design
  • Partition, Classification and Distribution
  • Modular Arithmetic
  • Algorithms and their Efficiency
  • Graphs
  • Trees, Sorting and Searching
  • Bipartite Graphs and Matching Problems
  • Digraphs, Networks and Flows
  • Recursive Techniques
  • Groups
  • Groups of Permutation
  • Rings, Fields and Polynomials
  • Finite Field and Some Applications
  • Error-Correcting Codes
  • Generating Functions
  • Partitions of a Positive Integer
  • Symmetry and Counting
    		•
  • Counting
  • Cryptography and Number Theory
  • Reflections on Logic and Proofs
  • Induction, Recursion and Recurrences
  • Profitability
  • Graphs
  • The Language Of Logic
  • The Language Of sets
  • Function and Metrics
  • Induction and Algorithm
  • Recursion
  • Combinatorics and Discrete Probability
  • Relations
  • Formal Languages and Finite State Machine
  • Boolean Algebra
    		•
     
     
    2. Algorithms

  • Basics of Algorithm Analysis
  • Graphs
  • Divide and Conquer
  • Greedy Algorithms
  • Dynamic Programming
  • Network Flow
  • NP and Computational Intractability
  • PSCAPE; A Class of Problems Beyond NP
  • Extending the Limits of Tractability
  • Approximation Algorithms
  • Randomized Algorithms
  • Local Search
  • Design and Analysis of Algorithms
  • Algorithmic Design Patterns
  • Algorithmic Framework
  • Data Structure
  • Combinatorial Algorithms
  • Geometric Algorithms
  • Numerical Algorithms
  • Internet Algorithms
    		•
  • Spanning-Trees, Branchings and Connectivity
  • Planar Graphs
  • Network and Flows
  • Matchings
  • Eulerian and Hamiltonian Tours
  • Colouring Graph
  • Graphs Problems and Intractability
  • Fundamental Techniques
  • Weighted Graphs
  • Text Processing
  • Network Algorithms
  • NP-Completeness
  • Sorting
    		•
     
     
    3. Programming and Data Structures
  • C Fundamentals
  • Operators and Expressions
  • Data Input and Output
  • Preparing and Running a Complete C Program
  • Control Statements
  • Functions
  • Program Structure
  • Arrays
  • Pointers
  • Structures and Unions
  • Data Files
  • Low-Level programming
  • Some Additional Features of C
  • Types, Operators and Expressions
  • Control Flow
  • Functions and Program Structure
  • Trees
  • Stacks, Queues, Recursion
    		•
  • The UNIX System Interface
  • Fundamental Algorithms
  • Factoring Methods
  • Array Techniques
  • Merging
  • Dynamic Data Structure Algorithms
  • Recursive Algorithms
  • Preliminaries
  • String Processing
  • Linked Lists
  • Graphs and their Applications
    		•
     
     
    4. Software Engineering
  • Software Processes
  • Agile Software Development
  • Requirements Engineering
  • System Modeling
  • Architectural Design
  • Design and Implementation
  • Software Testing
  • Software Evolution
  • Sociotechnical Systems
  • Dependability and Security
  • Dependability and Security and Specification
  • Dependability Engineering
  • Security Engineering
  • Dependability and Security Assurance
  • Software Reuse
  • Component Based Software Engineering
  • Distributed Software Engineering
  • Embedded Software
  • Aspect-Oriented Software Engineering
  • Project Management
  • Project Planning
  • Quality Management
  • Configuration Management
  • Process Improvement
    		•
  • Software Life Cycle Models
  • Software Project Management
  • Requirements Analysis and Specification
  • Software Design
  • Function-Oriented software Design
  • Object Modeling Using UML
  • Object-Oriented Software Development
  • User Interface Design
  • Coding and Testing
  • Software Reliability
  • Computer Aided Software Engineering
  • Software Maintenance
  • Emerging Trends
  • The Development Strategy
  • The Development Plan
  • Product Implementation
    		•
     
     
    5. Switching Circuits and Logic Design
  • Number Systems and Codes
  • Sets, Relations, and Lattices
  • Switching Algebra and its Applications
  • Minimization of Switching Functions
  • Logic Design
  • Multi-level Logic Synthesis
  • Threshod Logic & for Nanotechnologies
  • Testing of Combinational Circuits
  • Introduction to Synchronous Sequential Circuits and Iterative Networks
  • Capabilities, Minimization and Transformation of Sequential Circuits
  • Asynchronous Sequential Circuits
  • Structure of Sequential Machines
  • State-Identification Experiments and Testing of Sequential Circuits
  • Memory, Definiteness, Information of Losslessness of Finite Automata
  • Linear Sequential Machines
  • Finite-State Recognizers
    		•
  • Hardware Modeling
  • Architectural Synthesis
  • Scheduling Algorithms
  • Resource Sharing and Binding
  • Two-Level Combinational Logic Optimization
  • Cell-Library Binding
  • Multiple-Level Combinational Logic Optimization
  • Sequential Logic Optimization
    		•
     
     
    6. Formal Languages and Automata Theory
  • Automata Computablilty Complexity
  • Mathematical Notions Terminology
  • Definitions, Theorems, and Proofs
  • Types Of Proofs
  • Regular Languages
  • Context Free Languages
  • The Church Turning Thesis
  • Decidability
  • Reducibility
  • Advanced Topics in Computability Theory
  • Time Complexity
  • Space Complexity
  • Intractability
  • Advance Topics in Complexity Theory
  • Space Complexity
  • Intractability
  • Advance Topics in Complexity Theory
  • Mathematical Notation and Techniques
  • Regular Languages and Finite Automata
    		•
  • Mathematical induction and Recursive Functions
  • Non Determinism and Kleen’s Theorem
  • Turning Machines and Their Languages
  • Unsolved Problems and Computable Functions
  • Regular Expressions and Finite Automata
  • Mathematical Inductions and Recursive Functions
  • Context Free grammars
  • Pushdown Automata
  • Recursively Enumerable Funtions
  • Tractable and Intractable Problems
  • Computable Functions
  • Measuring and Classifying Complexity
    		•
     
     
    7. Operating Systems
  • Computer System Structures
  • Operating System Structures
  • Process
  • Threads
  • CPU Scheduling
  • Process Synchronization
  • Deadlocks
  • Memory Management
  • Virtual Memory
  • File System Structure
  • File System Interpretation
  • File System Interpretation
  • I/O System
  • Mass storage Structure
  • Distributed System Structure
  • Distributed File System
  • Distributed Coordination
  • Protection
  • Security
  • Computer System Overview
  • Process Description and Control
    		•
  • Concurency: Mutual Exclusion and Synchronization
  • Concurency: Starvation
  • Multiprocessor and Real Time Scheduling
  • I/O Manaement and Disk Scheduling
  • Embedded System Operating Operationg Sysem
  • Conmputer Secuty Threats
  • Computer Security Techniques
  • Distrubuted Processing
  • Client Server and Cluster
  • General Review of the System
  • Introduction to the Kernel
  • The Buffer Cache
  • Internal Representation of Files
  • System Calls for the File System
  • The System Representation of Processes
  • Process Control
  • Distributed UNIX System
  • Multiprocessor Systems
  • Interprocess Communication
    		•
     
     
    8. Compilers
  • A Simple Syntax Directed Translator
  • Lexical Analysis
  • Syntax Analysis
  • Syntax Directed Translation
  • Intermediate Code Generation
  • Run Time Environments
  • Code Generations
  • Machine Independent Optimization
  • Instruction Level Parallelism
  • Optimization For Parallelism and Locality
  • Programming Language Syntax
  • Names Scopes and Binding
  • Semantic Analysis
  • Target Machine Architecture
  • Control Flow
  • Lexical Analysis
  • Parsing
  • Abstract Analysis
  • Semantic Analysis
  • Activation Results
  • Translation to Intermediate Code
  • Basics Blocks And Traces
  • Instruction Selection
  • Liveness Analysis
  • Register Allocation
    		•
  • Putting it all Together
  • Garbage Collection
  • Object Oriented Languages
  • Functional Programming Languages
  • Polymorphic Types
  • Data Flow Analysis
  • Loop Optimization
  • Static Single Assessment Form
  • Pipelining and Scheduling
  • The Memory Hierarchy
  • Data Types
  • Subroutines and Control Abstraction
  • Data Abstractions and Object Orientation
  • Functional Languages
  • Logic Languages
  • Concurrency
  • Scripting Languages
  • Building a Runnable Program
  • Run Time Program Management
  • Code Improvement
    		•
     
     
    9. Foundations of Computing
  • The Foundations Of Logic and Proofs
  • Basic Structures: Sets, Functions, Sequence, Sums, Matrices
  • Algorithms
  • Number Theory and Cryptography
  • Indution and Recursion
  • Counting
  • Discrete Probability
  • Advanced Counting Techniques
  • Relations
  • Graphs
  • Trees
  • Boolean Algebra
  • Modelling Comutation
  • Automata and languages
  • Regular languages
  • Context-free languages
  • Computability theory
  • The Church-Turing thesis
  • Decidability
  • Reducibility
  • Advanced topics in computability theory
  • Complexity theory
  • Time complexity
  • Space complexity
  • Interactibility
  • Advanced topics in complexity theory
    		•
  • Fundamental Principles of Computing
  • Fundamentals of Logic
  • Set Theory
  • Mathematical Induction
  • Relations and Funtions
  • Finite State Machines
  • Relations: The Second Turn around
  • The Principle of Inclusion and Exclusion
  • Generating Functions
  • Recurrence Relations
  • Graph Theory
  • Rings and Modular Arithmetic
  • Boolean Algebra and Switching Functions
  • Algebraic Structure
  • Semigroups
  • Monoids
  • Groups
  • Coding Theory
  • Polys’s Meathod of Enumeration
  • Finite Fields and Combinational Designs
    		•
     
     
    10. Computer Organization and Architecture
  • The General Purpose Machine
  • Machines, Machine Languages, and Digital Logic
  • Some Real Machines
  • Processor Design
  • Processor Design
  • Computer Arithmetic and the Arithmetic Unit
  • Memory System Design
  • Input and Output
  • Peripheral Devices
  • Communications, Networking, and the Internet
  • Computer Evolution and Performance
  • The Computer System
  • System Buses
  • Internal Memory
  • External Memory
  • Input/Output
  • Operating System Support
  • The Central Processing Unit
    		•
  • Computer Arithmetic
  • Instruction Sets: Characteristics and Functions
  • Instruction-Level Parallelism and Superscalar Processors
  • The Control Unit
  • Control Unit Operation
  • Microprogrammed Control
  • Parallel Organization
  • Parallel Processing
  • Computer Abstraction and Technology
  • Language of the Computer
  • Arithmetic for Computers
  • The Processor
  • Large and Fast: Exploiting Memory Heirarchy
  • Parallel Processors from Client to Cloud
    		•
     
     
    11. Theory of Computation
  • Automata and Languages
  • Regular languages
  • Context-free languages
  • Computability theory
  • The Church-Turing thesis
  • Decidability
  • Reducibility
  • Advanced topics in computability theory
  • Complexity theory
  • Time complexity
  • Space complexity
  • Intractability
  • Advanced topics in complexity theory
  • Preliminaries
  • Finite Automata and Regular Languages
  • Universal Models of Computation
  • Computability Theory
  • Complexity Theory: Foundations
  • Proving Problems Hard
  • Complexity Theory: The Frontier
  • Algorithms
  • Turing machines
  • Computability
    		•
  • Boolean logic
  • First-order logic
  • Undecidability in logic
  • P and NP
  • Relations between complexity classes
  • Reductions and completeness
  • NP-complete problems
  • coNP and function problems
  • Randomized computation
  • Cryptography
  • Approximability
  • On P vs. NP
  • Inside P
  • Parallel computation
  • Logarithmic space
  • Beyond NP
  • The polynomial hierarchy
  • Computation that counts
  • Polynomial space
    		•
     
     
    12. Algorithms II
  • Game-Theoretic Techniques
  • Moments and Deviations
  • Tail Inequalities
  • The Probabilistic Method
  • Markov Chains and Random Walks
  • Algebraic Techniques
  • Data Structures
  • Geometric Algorithms and Linear Programming
  • Graph Algorithms
  • Approximate Counting
  • Parallel and Distributed Algorithms
  • Online Algorithms
  • Number Theory and Algebra
  • Competitive Analysis: The List Accessing Problem
  • Randomized Algorithms: The List Accessing Problem
  • Paging: Deterministic Algorithms
  • Paging: Randomized Algorithms
  • Alternative Paging Models: Beyond Pure Competitive Analysis
  • Game Theoretic Foundations
  • Request-Answer Games
    		•
  • Competitive Analysis and Zero-Sum Games
  • Metrical Task Systems
  • The k-Server Problem
  • Randomized k-Server Algorithms
  • Load Balancing
  • Call Admission and Circuit Routing
  • Search, Trading, and Portfolio Selection
  • On Decision Theories and the Competitive Ratio
  • Stochastic Analyses for List Accessing Algorithms
  • Synchronous Network Algorithms
  • Modelling I: Synchronous Network Model
  • Leader Election in a Synchronous Ring
  • Algorithms in General Synchronous Networks
  • Distributed Consensus with Link Failures
  • Distributed Consensus with Process Failures
  • More Consensus Problems
  • Asynchronous Algorithms
    		•
     
     
    13. Computer Networks
  • Data and Computer Communications
  • Protocols and Architecture
  • Data Transmission
  • Transmission Media
  • Signal Encoding
  • Digital Data Communication Techniques
  • Data Link Control
  • Multiplexing
  • Spread Spectrum
  • Wide Area Networks
  • Circuit Switching
  • Packet Switching
  • ATM and Frame Relay
  • Congestion Control in Data Networks
  • Local Area Networks
  • LAN Technology
    		•
  • LAN Systems
  • Communications Architecture and Protocols
  • Internet Protocols
  • Internetwork Operation
  • Transport Protocols
  • Network Security
  • Distributed Applications
  • Physical Layer
  • Data Link Layer
  • Medium Access Sublayer
  • Network Layer
  • Transport Layer
  • Application Layer
  • Principles, protocols, and architecture
  • Design, implementation, and internals
  • Client-server programming and applications
    		•
     
     
    14. Symbolic Logic and Automated Reasoning
  • Propositional Logic: Formulas, Models, Tableaux
  • Propositional Logic: Deductive Systems
  • Propositional Logic: Resolution
  • Propositional Logic: Binary Decision Diagrams
  • Propositional Logic: SAT Solvers
  • First-Order Logic: Formulas, Models, Tableaux
  • First-Order Logic: Deductive Systems
  • First-Order Logic: Terms and Normal Forms
  • First-Order Logic: Resolution
  • First-Order Logic: Resolution
  • First-Order Logic: Undecidability and Model Theory
  • Propositional Calculs
  • Quantification Theory
  • Formal Number Theory
  • Axiomatic Set Theory
    		•
  • Computability
  • Temporal Logic: Formulas, Models, Tableaux
  • Temporal Logic: A Deductive System
  • Verification of Sequential Programs
  • Verification of Concurrent Programs
  • Propositional Logic
  • Resolution
  • Proofs in PL and FL
  • Program Verification
  • Modal Logics
  • Some Other Logics
  • Predicate Logic
  • Verification by Model Checking
  • Modal Logics and Agents
  • Binary Descions Diagrams
    		•
     
     
    15. Principles of Programming Languages
  • The Basic Set Theory
  • Operational Semantics
  • Principles of Induction
  • Domain Theory
  • Recursion Equations
  • Techniques For Recursions
  • Recurive Typers
  • Non Determinism and Parallelism
  • The language PCF
  • Universal algebra and algebraic data types
  • Simply-typed lambda calculus
  • Models of typed lambda calculus
  • Imperative programs
  • Categories and recursive types
  • Logical relations
  • Polymorphism and modularity
  • Subtyping and related concepts
  • Type inference
  • The Role of Programming Languages
  • Language Description: Syntactic Structure
    		•
  • Imperative Programming
  • Statements: Structured Programming
  • Types: Data Representation
  • Procedure Activations
  • Object-oriented Programming
  • Groupings of Data and Operations
  • Object-oriented Programming
  • Functional Programming
  • Elements of Functional Programming
  • Functional Programming in a Typed Language
  • Functional Programming with Lists
  • Other Paradigms
  • Logic Programming
  • Concurrent Programming
  • Language Description
  • Semantic Methods
  • Static Types and the Lambda Calculus
  • A Look at Some Languages
    		•
     
     
    16. Object Oriented System Design
  • Issues and Principles
  • Aspects of Software Quality
  • Modularity
  • Approaches to Re usability
  • The Road to Object-Orientedness
  • Techniques of Object-Oriented Design and Programming
  • Basic Elements of Eiffel Programming
  • Genericity
  • Systematic Approaches to Program Construction
  • More Aspects of Eiffel
  • Designing Class Interfaces
  • Inheritance
  • More About Inheritance
  • Object-Oriented Design: Case Studies
  • Constants and Shared Objects
  • Techniques of Object-Oriented Design
  • Implementation: The Eiffel Programming Environment
  • Memory Management
  • Applying Object-Oriented Techniques in Other Environments
    		•
  • Object-Oriented Programming in Classical Languages
  • Object-Oriented Programming and Ada
  • Genericity versus Inheritance
  • Other Object-Oriented languages
  • Further Issues
  • Complexity
  • The Object Model
  • Classes and Objects
  • The Method
  • The Notation
  • The Process
  • Data Acquisition: Weather Monitoring Station
  • Frameworks: Foundation Class Library
  • Client/Server Computing: Inventory Tracking
  • Artificial Intelligence: Cryptanalysis
  • Command and Control: Traffic Management
    		•
     
     
    17. Artificial Intelligence
  • Intelligent Agents
  • Solving Problems by Searching
  • Informed Search and Exploration
  • Constraint Satisfaction Problems
  • Adversarial Search
  • Logical Agents
  • First-Order Logic
  • Inference in First-Order Logic
  • Knowledge Representation
  • Planning
  • Planning and Acting in the Real World
  • Uncertainty
  • Probabilistic Reasoning
  • Probabilistic Reasoning Over Time
  • Making Simple Decisions
  • Making Complex Decisions
  • Learning from Observations
  • Knowledge in Learning
  • Statistical Learning Methods
  • Reinforcement Learning
  • Communication
    		•
  • Probabilistic Language Processing
  • Perception
  • Robotics
  • Philosophical Foundations
  • Present and Future
  • Reactive Machines
  • Stimulus Response Agents
  • Neural Networks
  • Machine Evolution
  • State Machines
  • Robot Vision
  • Uninformed Search
  • Heuristic Search
  • Planning, Acting and Learning
  • Alternative Search Formulations and Applications
  • Reasoning With Uncertain Information
  • Learning anf Acting With Bayes Nets
  • Situational Calculus
  • Communication Among Agents
  • Agent Architectures
    		•
     
     
    18. Electronic Design Automation
  • Architectural Models in Synthesis
  • Quality Measures
  • Design Description Languages
  • Design Representation and Transformations
  • Partitioning
  • Scheduling
  • Allocation
  • Design Methodology for High-Level Synthesis
  • Digital Systems and VLSI
  • Transistors and Layout
  • Logic Gates
  • Combinational Logic Circuits
  • Sequential Circuits
  • Subsystem Designs
  • Floor Planning
  • Off Chip Connections
  • Architecture Design
  • Chip Design
  • CAD Systems and Algorithms
    		•
  • Types of ASIC
  • CMOS Logic
  • ASIC Library Design
  • Programmable ASIC’s
  • Programmable Logic ASIC Cells
  • Programmable ASIC I/O Cells
  • Programmable ASIC Interconnect
  • Programmable ASIC Design Software
  • VHDL
  • Low Level Design Entry
  • Verilog HDL
  • Logic Synthesis
  • Simulation
  • Test
  • ASIC Construction
  • Floor Planning and Placement
  • Routing
  • VHDL Resources
  • Verilog HDL Resources
    		•
     
     
    19. Image Processing
  • Digital Image Fundamentals
  • Image Enhancement in the Spatial Domain
  • Image Enhancement in the Frequency Domain
  • Image Restoration
  • Color Image Processing
  • Wavelets and Multiresolution Processing
  • Image Compression
  • Morphological Image Processing
  • Image Segmentation
  • Representation and Description
  • Object Recognition
  • Continuous Image Characterization
  • Continuous Image Mathematical Characterization
  • Image Representation
  • Two-Dimensional Systems
  • Two-Dimensional Fourier Transform
  • Image Stochastic Characterization
  • Psychophysical Vision Properties
    		•
  • Light Perception
  • Eye Physiology
  • Visual Phenomena
  • Monochrome Vision Model
  • Color Vision Model
  • Photometry and Colorimetry
  • Photometry
  • Color Matching
  • Colorimetry Concepts
  • Tristimulus Value Transformation
  • Color Spaces
  • Digital Image Characterization
  • Image Sampling and Reconstruction
  • Image Sampling and Reconstruction Concepts
  • Image Sampling Systems
  • Image Reconstruction Systems
  • Discrete Image Mathematical Representation
    		•
     
     
    20. Applied Graph Theory
  • Fundamental Concepts
  • Trees and Distance
  • Matchings and Factors
  • Connectivity and Paths
  • Coloring of Graphs
  • Planar Graphs
  • Edges and Cycles
  • Perfect Graphs
  • Paths and Circuits
  • Trees and Fundamental Circuits
  • Cut Sets and Cut-Vertices
  • Planar and Dual Graphs
  • Vector Spaces of a Graph
  • Matrix Representation of Graphs
    		•
  • Coloring, Covering, and Partitioning
  • Directed Graphs
  • Enumeration of Graphs
  • Graph Theoretic Algorithms and Computer Programs
  • Graphs in Switching and Coding Theory
  • Electrical Network Analysis by Graph Theory
  • Graph Theory in Operations Research
  • Survey of Other Applications
    		•
     
     
    21. Computational Geometry
  • Complexity notions in classical geometry
  • Geometric Searching
  • Convex Hulls: Basic Algorithms
  • Convex Hulls: Extensions and Applications
  • Proximity: Fundamental Algorithms
  • Proximity: Variants and Generalizations
  • Intersections
  • The Geometry of Rectangles
  • Computatuinal Geometry
  • Line Segment Intersecton
  • Polygon Trianulation
  • Linear Programming
  • Orthonogal Range Searching
  • Point Location
  • Voronoi Diagrams
  • Arrangements and Duality
  • Delaunay Trianulations
    		•
  • Geometric Data Structures
  • Convex Hulls
  • Bnary Space Partition
  • Robot Motion Planning
  • Quadtrees
  • Visibility Graph
  • Simplex Range Searching
  • Polygon Triangulation
  • Polygon Partitioning
  • Convex hulls in Two Dimensions
  • Convex hulls in three dimensions
  • Voronoi diagrams
  • Arrangements
  • Search and intersection
  • Motion planning
    		•
     
     
    22. Computational Complexity
  • Algorithms
  • Problems and Algorithms
  • Turing Machines
  • Computability
  • Logic
  • Boolean Logic
  • First-Order Logic
  • Undecidability in Logic
  • P and NP
  • Relations Between Complexity Classes
  • Reductions and Completeness
  • NP-Complete Problems
  • coNP and Function Problems
  • Randomized Computation
  • Cryptography
  • Approximability
  • On P vs. NP
  • Inside P
  • Parallel Computation
  • Logarithmic Space
  • Beyond NP
    		•
  • The Polynomial Hierarchy
  • Computation That Counts
  • Polynomial Space
  • Automata and Languages
  • Regular Languages
  • Context-Free Languages
  • Computability Theory
  • The Church-Turing Thesis
  • Decidability
  • Reducibility
  • Advanced Topics in Computability Theory
  • Complexity Theory
  • Time Complexity
  • Space Complexity
  • Intractability
  • Advanced topics in complexity theory
    		•
     
     
    23. Advanced Computer Architecture
  • Fundamentals of Computer Design
  • Instruction-Level Parallelism and its Exploitation
  • Limits on Instruction-Level Parallelism
  • Multiprocessors and Thread-Level Parallelism
  • Memory Hierarchy Design
  • Storage Systems
  • Pipelining: Basic and Intermediate Concepts
  • Instruction Set Principles and Examples
  • Pipelined Processors
  • Memory and I/O Systems
  • Superscalar Organization
  • Superscalar Techniques
  • The PowerPC 620
    		•
  • Intel’s P6 Microarchitecture
  • Survey of Superscalar Processors
  • Advanced Instruction Flow Techniques
  • Advanced Register Data Flow Techniques
  • Executing Multiple Threads
  • Architecture and Machines
  • Data: How Programs Behave
  • Pipelined Processor Design
  • Cache Memory
  • Memory System Design
  • Concurrent Processors
  • Shared Memory Multiprocessors
  • I/O and the Storage Hierarchy
  • Processor Studies
    		•
     
     
    24. VLSI System Design
  • Fabrics
  • Manufacturing Process
  • Design Methodology Insert A: IC LAYOUT
  • Devices
  • Design Methodology
  • Circuit Simulation
  • Wire
  • Circuit Perspective
  • CMOS Inverter
  • Designing Combinational Logic Gates in CMOS
  • How to Simulate Complex Logic Circuits
  • Layout Techniques for Complex Gates
  • Designing Sequential Logic Circuits
  • System Perspective
  • Implementation Strategies for Digital ICS
  • Characterizing Logic and Sequential Cells
    		•
  • Coping with Interconnect
  • Timing Issues in Digital Circuits
  • Design Methodology Insert G: Design Verification
  • Designing Arithmetic Building Blocks
  • Designing Memory and Array Structures
  • Validation and Test of Manufactured Circuits
  • Architectural Models in Synthesis
  • Quality Measures
  • Design Description Languages
  • Design Representation and Transformations
  • Partitioning
  • Scheduling
  • Allocation
  • Design Methodology for High-Level Synthesis
    		•
     
     
    25. Multimedia Applications
  • Quality Service
  • Multimedia Operating System
  • Media server
  • Networks
  • Communication
  • Group Communication
  • Snchronization
  • Mathematical Preliminaries for Lossless Compression
  • Huffman Coding
  • Arithmetic Coding
  • Dictionary Techniques
  • Context-Based Compression
  • Lossless Image Compresion
  • Mathematical Preliminaries for Lossy Coding
  • Scalar Quantization
    		•
  • Vector Quantization
  • Differential Encoding
  • Mathematical preliminaries for Transforms,Subrands and Wavelets
  • Transform Coding
  • Subband Coding
  • Wavelets
  • Wavelet-Based Image Compression
  • Audio Coding
  • Analysis/Synthesis and Analysis by Synthesis Schemes
  • Video Formats and Quality
  • Video Coding Concepts
  • MPEG-4 Visual
  • Design and Performance
  • Applications and Directions
    		•
     
     
    26. Microprocessors and Microcontrollers
  • The 8051 Microcontrollers
  • 8051 Assembly Language Programming
  • Jump, Loop and Call Instructions
  • I/O Port Programming
  • 8051 Addressing Modes
  • Arithmetic and Logic Instructions and Programs
  • 8051 Programming in C
  • 8051 Hardware Connection and Intel Hex File
  • 8051 Timer Programming in Assembly and C
  • 8051 Serial Port Programming in Assembly and C
  • Interrupts Programming in Assembly and C
  • LCD and Keyboard Interfacing
  • ADC, DAC and Sensor Interfacing
    		•
  • 8051 Interfacing to External Memory
  • 8051 Interfacing with the 8255
  • DS12887 RTC Interfacing and Programming
  • Motor Control : Relay, PWM, DC and Stepper Motors
  • 8051 Instructions, Timing and Registers
  • Basics of Wire Wrapping
  • Technology and System Design Issues
  • Flowcharts and Pseudocode
  • 8051 Primer for X86 Programmers
  • ASCII Codes
  • Assemblers, Development Resources and Suppliers
  • Data Sheets
    		•
     
     
    27. Digital System Testing and Testable Design
  • Fault models
  • Combinational Logic and Fault Simulation
  • Test Generation for Combinational circuits
  • Sequential ATPG
  • Functional Testing
  • Delay Fault Testing
  • CMOS Testing
  • Fault Diagnosis
  • Design for Testability
  • Built-in-Self-Test
  • Synthesis for Testability
  • Memory Testing/Ad Van De Goor
    		•
  • High-level test synthesis
  • System-on-a-Chip Test Synthesis
  • Modelling
  • Logic Simulation
  • Testing for Bridging Faults
  • Functional Testing
  • Built-in-Self_Test
  • Logic-Level Diagnosis
  • Self-Checking Design
  • PLA Testing
  • System-Level Diagnosis
    		•
     
     
    28. Database Management Systems
  • Entity-Relationship Model
  • Relational Model
  • SQL
  • Other Relational Languages
  • Integrity Constraints
  • Relational Database Design
  • Object-Oriented Databases
  • Object-Relational Databases
  • Storage and File Structure
  • Indexing and Hashing
  • Query Processing
  • Transactions
  • Concurrency Control
  • Recovery System
  • Database System Architectures
  • Parallel Databases
    		•
  • Distributed Databases
  • Special Topics
  • Advanced Transaction Processing
  • New Applications
  • Database Application Development
  • Internet Applications
  • Overview of Storage and Indexing
  • Storing Data: Disks and Files
  • Tree-Structured Indexing
  • Hashing-Based Indexing
  • Overview of Query Evaluation
  • External Sorting
  • Concurrency Control
    		•
     
     
    29. Distributed Systems
  • Distributed Programming Languages
  • Formal Approaches to Distributed Systems Design
  • Mutual Exclusion and Election Algorithms
  • Prevention, Avoidance and Detection of Deadlock
  • Distributed Routing Algorithms
  • Adaptive, Deadlock-Free and Fault-Tolerant Routing
  • Reliability in Distributed Systems
  • Static Load Distribution
  • Dynamic Load Distribution
  • Distributed Data Management
  • Distributed System Applications
  • Fundamentals Basic algorithms in massage passing systems
  • Leader Election in Rings
  • Mutual Exclusion in Shared Memory
    		•
  • Fault-Tolerant Consensus
  • Causality and Time
  • Simulations-A Formal Model for Simulations
  • Broadcast and Multicast
  • Distributed Shared Memory
  • Fault-Tolerant Simulations of Read/Write Objects
  • Simulating Synchrony
  • Improving the Fault-Tolerance of Algorithms
  • Fault-Tolerant Clock Synchronization
  • Advanced Topics-Randomization
  • Wait-free Simulations of Arbitrary Objects
  • Problems Solvable in Asynchronous Systems
  • Solving Consensus in Eventually-Stable Systems
    		•
     
     
    30. High Performance Computer Architecture
  • Fundamentals of Computer Design
  • Instruction-Level Parallelism and its Exploitation
  • Limits on Instruction-Level Parallelism
  • Multiprocessors and Thread-Level Parallelism
  • Memory Hierarchy Design
  • Storage Systems
  • Pipelining: Basic and Intermediate Concepts
  • Instruction Set Principles and Examples
  • Review of Memory Hierarchy
  • Pipelined Processors
  • Memory and I/O Systems
  • Superscalar Organization
  • Superscalar Techniques
  • The PowerPC 620
  • Intel’s P6 Micro architecture
    		•
  • Survey of Superscalar Processors
  • Advanced Instruction Flow Techniques
  • Advanced Register Data Flow Techniques
  • Executing Multiple Threads
  • Architecture and Machines
  • Time, Area, and Instruction Sets
  • Data: How Programs Behave
  • Pipelined Processor Design
  • Cache Memory
  • Memory System Design
  • Concurrent Processors
  • Shared Memory Multiprocessors
  • I/O and the Storage Hierarchy
  • Processor Studies
    		•
     
     
    31. Logic for Computer Science
  • Propositional Logic
  • Predicate Logic
  • Verification by Model Checking
  • Program Verification
  • Model Logics and Agents
  • Binary decision diagrams
  • Formulas, Models, Tableaux
  • Deductive Systems
  • Resolution
  • Binary Decision Diagrams
  • SAT Solvers
  • Verification of Sequential Programs
  • Verification of Concurrent Programs
  • Modeling Systems
    		•
  • Model Checking
  • Temporal Logics
  • Partial Order Reduction
  • Model Checking in Practice
  • Compositional Reasoning
  • Abstraction
  • Symmetry
  • Continuous Real Time
  • Discrete Real-Time and Quantitative Temporal Analysis
    		•
     
     
    32. Database Engineering
  • Entity-Relationship Model
  • Relational Model
  • SQL
  • Other Relational Languages
  • Integrity Constraints
  • Relational Database Design
  • Object-Oriented Databases
  • Object-Relational Databases
  • Storage and File Structure
  • Indexing and Hashing
  • Query Processing
  • Transactions
  • Concurrency Control
  • Recovery System
  • Database System Architectures
  • Parallel Databases
  • Distributed Databases
  • Special Topics
    		•
  • Advanced Transaction Processing
  • New Applications
  • Data Systems
  • Functional and Join Dependency
  • Inclusion Dependency
  • A Larger Perspective
  • Design and Dependencies
  • Datalog
  • Evalution of Datalog
  • Recursion and Negation
  • Sizing Up Languages
  • Highly Expressive Languages
  • Incomplete Information
  • Complex Values
  • Object Databases
  • Dynamic Aspects
    		•
     
     
    33. Embedded Systems
  • Embedded Computing
  • Instruction Sets
  • CPUs
  • The Embedded Computing Platform
  • Program Design and Analysis
  • Processes and Operating Systems
  • Hardware Accelerators
  • Networks
  • System Design Techniques
  • Design Challenge Optimizing Design Metrics
  • Common Design Metrics
  • The Time-to-Market Design Metric
  • The NRE and Unit Cost Design Metrics
  • The Performance Design Metric
  • Processor Technology
  • General-Purpose Processors Software
  • Single-Purpose Processors Hardware
  • Application-Specific Processors
    		•
  • IC Technology
  • Full-Custom/VLSI
  • Semicustom ASIC (Gate Array and Standard Cell)
  • PLD
  • Trends
  • Design Technology
  • Compilation/Synthesis
  • Libraries/IP
  • Test/Verification
  • More Productivity Improvers
  • Trends
  • Trade-offs
  • Design Productivity Gap
  • Custom Single-Purpose Processors: Hardware
  • Combinational Logic
  • Transistors and Logic Gates
    		•
     
     
    34. Testing and Verification of Circuits
  • Fault Models
  • Combinational Logic and Fault Simulation
  • Test Generation for Combinational Circuits
  • Sequential ATPG
  • I[Subscript DDQ] Testing
  • Functional Testing
  • Delay Fault Testing
  • CMOS Testing
  • Fault Diagnosis
  • Design for Testability
  • Built-in-self-Test
  • Synthesis for Testability
  • Memory Testing / Ad Van De Goor
  • High-Level Test Synthesis
  • System-on-a-Chip Test Synthesis
    		•
  • Digital Testing and the need for Testable Design
  • Testable Design
  • Pseudorandom Sequence Generators
  • Test Response Compression Techniques
  • Shift-Register Polynomial Division
  • Special Purpose Shift-Register Circuits
  • Random Pattern Built-in Test
  • Built-in Test Structure
  • Limitations and Other Concerns of Random Patterns
  • Test System Requirements for Built-in Test
    		•
     
     
    35. Cryptography and Network Security
  • Classical Techniques
  • Modern Techniques
  • Algorithms
  • Confidentiality Using Conventional Encryption
  • Public-key Cryptography
  • Introduction to Number Theory
  • Messages Authentication and Hash Functions
  • Hash and Mac Algorithms
  • Digital Signatures and Authentication Protocols
  • Authentication Applications
  • Electronic Mail Security
  • IP Security
  • Web Security
  • Intruders, Viruses and Worms
  • Firewalls
  • Projects for Teaching Cryptography and Network Security
  • Some Topics in Elementary Number Theory
    		•
  • Finite Fields and Quadratic Residues
  • Cryptography
  • Public key
  • Primality and Factoring
  • Integers
  • Congruences and Residue Class Rings
  • Encryption
  • Probability and Perfect Secrecy
  • DES
  • Prime Number Generation
  • Public-Key Encryption
  • Factoring
  • Discrete Logarithms
  • Crytographic Hash Functions
  • Digital Signatures
  • Other Groups
  • Indentification
  • Publlic Key Infrastructures
    		•
     
     
    36. Advances in Compiler Construction
  • Informal Complier Algorithm Notation(ICAN)
  • Symbol-Table Structure
  • Intermediate Representations
  • Run-Time Support
  • Producing Code Generators Automatically
  • Control-Flow Analysis
  • Data-Flow Analysis
  • Dependence Analysis and Dependence Graphs
  • Alias Analysis
  • Introduction to Optimization
  • Early Optimizatioms
  • Redundancy Elimination
  • Loop Optimizations
  • Procedure Optimizations
  • Register Allocation
    		•
  • Code Scheduling
  • Control-Flow and Low Level Optimizations
  • Interprocedural Analysis and Optimization
  • Optimization for the Memory Hierarchy
  • Case Studies of Compliers and Future Trends
  • Overview of Compilation
  • Scanners
  • Parsers
  • Context Sensitive Analysis
  • Intermediate Representations
  • The Procedure Abstraction
  • Code Shape
  • Scalar Optimizations
  • Instruction Selection
    		•
     
     
    37. Real Time Systems
  • Typical Real-Time Applications
  • Hard Versus Soft Real-Time Systems
  • A Reference Model of Real-Time Systems
  • Commonly Used Approaches to Real-Time Scheduling
  • Clock-Driven Scheduling
  • Priority-Driven Scheduling of Periodic Tasks
  • Pros and Cons of Clock-Driven Scheduling
  • Scheduling Aperiodic and Sporadic Jobs in Priority-Driven Systems
  • Resources and Resource Access Control
  • Multiprocessor Scheduling, Resource Access Control, and Synchronization
  • Scheduling Flexible Computations and Tasks with Temporal Distance Constraints
  • Real-Time Communication
  • Operating Systems
  • Predictability of General-Purpose Operating Systems
  • Processor Reserves and Resource Kernel
  • Real-Time Protocol
  • Communication in Multicomputer Systems
  • Signal Processing
  • Release Times, Deadlines, and Timing Constraints
  • Periodic Task Model
  • Functional Parameters
  • Clock-Driven Approach
  • Dynamic versus Static Systems
  • Challenges in Validating Timing Constraints in Priority-Driven Systems
  • Static, Timer-Driven Scheduler
  • Improving the Average Response Time of Aperiodic Jobs
  • Practical Considerations and Generalizations
  • Static Assumption
  • Optimality of the RM and DM Algorithms
  • Practical Factors
    		•
     
     
    38. Advanced Graph Theory
  • Fundamental Concepts: Paths, Cycles, and Trails Vertex Degrees and Counting
  • Trees and Distance: Basic Properties
  • Spanning Trees and Enumeration
  • Matchings and Factors: Matchings and Covers
  • Matchings in General Graphs
  • Connectivity and Paths: Cuts and Connectivity
  • K-Connected Graphs
  • Coloring of Graphs: Vertex Colorings and Upper Bounds
  • Planar Graphs: Embeddings and Euler’s Formula
  • Characterization of Planar Graphs
  • Parameters of Planarity
  • Edges and Cycles: Line Graphs and Edge-Coloring
    		•
  • Perfect Graphs
  • Ramsey Theory
  • Random Graphs
  • Eigenvalues of Graphs
  • Paths and Circuits
  • Cut Sets and Cut-Vertices
  • Vector Spaces of a Graph
  • Coloring, Covering, and Partitioning
  • Enumeration of Graphs
  • Graph Theoretic Algorithms and Computer Programs
  • Graphs in Switching and Coding Theory
  • Electrical Network Analysis by Graph Theory
  • Graph Theory in Operations Research
  • Trees and Fundamental Circuits
    		•
     
     
    39. Theory of Programming Languages
  • The language PCF
  • Universal Algebra and Algebraic Data Types
  • Simply-Typed Lambda Calculus
  • Models of Typed Lambda Calculus
  • Imperative Programs
  • Categories and Recursive Types
  • Logical Relations
  • Polymorphism and Modularity
  • Subtyping and Related Concepts
  • Type Inference
  • Mathematical Preliminaries
  • Untyped Systems
  • Untyped Arithmetic Expressions
  • An ML Implementation of Arithmetic Expressions
    		•
  • The Untyped Lambda-Calculus
  • Nameless Representation of Terms
  • An ML Implementation of the Sample Types
  • Typed Arithmetic Expressions
  • Simply Typed Lambda-Calculus
  • An ML Implementation of Simple Types
  • Simple Extensions
  • Normalization
  • References
  • Exceptions
  • Subtyping
  • Metatheory of Subtyping
  • An ML Implementation of Subtyping
  • Case Study : Imperative Objects
  • Case study : Featherweight Java
    		•
     
     
    40. Machine Learning
  • Concept Learning and the General-to-Specific Ordering
  • Decision Tree Learning
  • Artificial Neural Networks
  • Evaluating Hypotheses
  • Bayesian Learning
  • Computational Learning Theory
  • Instance-Based Learning
  • Genetic Algorithms
  • Learning Sets of Rules
  • Analytical Learning
  • Combining Inductive and Analytical Learning
  • Reinforcement Learning
  • Supervised Learning
  • Bayesian Decision Theory
  • Parametric Methods
    		•
  • Multivariate Methods
  • Dimensionality Reduction
  • Clustering
  • Nonparametric Methods
  • Decision Trees
  • Linear Discrimination
  • Multilayer Perceptrons
  • Local Models
  • Kernel Machines
  • Bayesian Estimation
  • Hidden Markov Models
  • Graphical Models
  • combining Multiple Learners
  • Reinforcement Learning
  • Design and Analysis of Machine Learning Experiments
    		•
     
     
    41. Low Power Circuits and Systems
  • Fabrication of MOSFETs
  • MOS Transistor
  • Modeling of MOS Transistors Using SPICE
  • MOS Inverters: Static Characteristics
  • MOS Inverters: Switching Characteristics and Interconnect Effects
  • Combinational MOS Logic Circuits
  • Sequential MOS Logic Circuits
  • Dynamic Logic Circuits
  • Semiconductor Memories
  • Low-Power CMOS Logic Circuits
  • BiCMOS Logic Circuits
  • Chip Input and Output (I/O) Circuits
  • Design for Manufacturability
  • Design for Testability
  • Circuit and Logic Styles
  • Driving interconnect
  • Memory Circuits
    		•
  • Portable Terminal Electronics
  • Computer Aided Design Tools
  • Low-Power CMOS VSLI Design
  • Power Estimation
  • Synthesis for Low Power
  • Design and Test of Low-Voltage CMOS Circuits
  • Low-Power Static Ram Architectures
  • Software Design for Low Power
  • Fabrication of MOSFETs
  • MOS transistor
  • Dynamic Logic Circuits
  • Semiconductor Memories
  • Combinational MOS Logic Circuits
    		•
     
     
    42. Speech and Natural Language Processing
  • Preliminaries
  • Mathematical Foundations
  • Linguistic Essentials
  • Corpus-Based Work
  • Collocations
  • Word Sense Disambiguation
  • Lexical Acquisition
  • Markov Models
  • Part-of-Speech Tagging
  • Probabilistic Context Free Grammars
  • Probabilistic Parsing
  • Clustering
  • Topics in Information Retrieval
    		•
  • Text Categorization
  • Modelling Cognition, Perception and Behaviour
  • Language and Speech Systems
  • Multilingual Research and Development
  • Prosody
  • Syntax, Morphology, Lexicon
  • Semantics
  • Formalisms and Parsing
  • Tools for Development and Teaching
    		•
     
     
    43. Object Oriented Systems
  • Issues and Principles
  • Aspects of Software Quality
  • Modularity
  • Approaches to Reusability
  • The Road to Object-Orientedness
  • Techniques of Object-Oriented Design and Programming
  • Basic Elements of Eiffel Programming
  • Genericity
  • Systematic Approaches to Program Construction
  • More Aspects of Eiffel
  • Designing Class Interfaces
  • Object-Oriented Programming in Classical Languages
  • Object-Oriented Programming and ADA
  • Genericity Versus Inheritance
  • Other Object-Oriented Languages
  • Inheritance
  • More About Inheritance
  • Object-Oriented Design: Case Studies
  • Constants and Shared Objects
  • Techniques of Object-Oriented Design
  • Implementation: The Eiffel Programming Environment
  • Memory Management
    		•
  • Applying Object-Oriented Techniques in Other Environments
  • Object-Oriented Programming in Classical Languages
  • Object-Oriented Programming and Ada
  • Genericity Versus Inheritance
  • Other Object-Oriented Languages
  • Further Issues
  • Complexity
  • The Object Model
  • Classes and Objects
  • Classification
  • The Notation
  • The Process
  • Pragmatics
  • Data Acquisition: Weather Monitoring Station
  • Frameworks: Foundation Class Library
  • Client/Server Computing: Inventory Tracking
  • Artificial Intelligence: Cryptanalysis
  • Command and Control: Traffic Management
    		•
     
     
    44. Formal Systems
  • Preliminaries
  • Finite Automata and Regular Languages
  • Universal Models of Computation
  • Computability Theory
  • Complexity Theory: Foundations
  • Complexity Theory in Practice
  • Complexity Theory: The Frontier
  • Course Roadmap and Historical Perspective
  • Strings and Sets
  • Finite Automata and Regular Sets
  • More on Regular Sets
  • Nondeterministic Finite Automata
  • The Subset Construction
  • Pattern Matching
  • Pattern Matching and Regular Expressions
    		•
  • Regular Expressions and Finite Automata
  • Homomorphisms
  • Limitations of Finite Automata
  • Using the Pumping Lemma
  • DFA State Minimization
  • A Minimization Algorithm
  • Myhill-Nerode Relations
  • The Myhill-Nerode Theorem
  • 2DFAs and Regular Sets
  • Context-Free Grammars and Languages
  • Balanced Parentheses
  • Normal Forms
  • The Pumping Lemma for CFLs
  • Pushdown Automata
    		•
     
     
    45. Multimedia Systems
  • Quality of Service
  • Multimedia Operating Systems
  • Media server
  • Networks
  • Communication
  • Group communication
  • Synchronization
  • Multimedia Over Wireless
  • Multimedia Search and Retrieval
  • Image Reteieval in Digital Libraries
  • MPEG-7: Status and Directions
  • Overview of the MPEG Standards
  • Review of MPEG-4 General Audio Coding
    		•
  • MPEG-4 Visual Standard Overview
  • MPEG-4 Natural Video Coding
  • MPEG-4 Texture Coding
  • MPEG-4 Synthetic Video
  • MPEG-4 Systems: Overview
  • MPEG-4 Systems: Elementary Stream Management and Delivery
  • MPEG-4: Scence Representation and Interactivity
  • Mathematical Preliminaries for Lossless Compression
  • Haffman Coding
  • Arithmetic Coding
  • Dictionary Techniques
  • Context-Based Compression
  • Lossless Image Compression
  • Mathematical Preliminaries foe Lossy CodingScalar Quantization
  • Vector Quantization
  • Differential Encoding
    		•
     
     
    46. Advances in Digital and Mixed Signal Testing
  • Physical Defects
  • Test Suites, Fault Models, Test Sets and Defects
  • Evaluating Tests
  • Selecting Tests
  • Computing Tests
  • Fault Diagnosis
  • Instrumentation for Measurement
  • Test Application Schemes for Testing Delay Defects
  • Delay Fault Models
  • Case Studies on Delay Testing
  • Path Delay Fault Classification
  • Delay Fault Simulation
  • Test Generation for Path Delay Faults
  • Design for Delay Fault Testability
  • Synthesis for Delay Fault Testability
    		•
  • VLSI Testing Process and test Equipment
  • Test Economics and Product Quality
  • Fault Modeling
  • Logic and Fault Simulation
  • Testability Measures
  • Combinational Circuit Test Generation
  • Sequential Circuit Test Generation
  • Memory Test
  • Model-Based Analog and Mixes-Signal Test
  • Delay Test
  • IDDQ Test
  • Digital DFT and Scan Design
  • Built-in Self-Test
  • Boundary Scan Standard
  • Analog Test Bus Standard
  • System Test and Core-Based Design
  • The Future of Testing
    		•
     
     
    47. Complex Networks
  • Modern Architecture of Random Graphs
  • Adjacency Matrix
  • Degree Distribution
  • Clustering
  • Small Worlds
  • Giant Components
  • List of Basic Constructions
  • List of Main Characteristics
  • Popularity is Attractive
  • Attachment of Edges Without Preference
  • Preferential Linking
  • Real Networks
  • Networks of Citations of Scientific Papers
  • Communication Networks: The WWW and the Internet
  • Structure of the WWW
  • Search in the WWW
    		•
  • Structure of the Internet
  • Networks of Collaborations
  • Biological Networks
  • Neural Networks
  • Networks of Metabolic Reactions
  • Genome and Protein Networks
  • Ecological and Food Webs
  • Word Web of Human Language
  • Telephone Call Graph
  • Mail Networks
  • Power Grids and Industrial Networks
  • Electronic Circuits
  • Nets of Software Components
  • Energy Landscape Networks
    		•
     
     
    48. Information Retrieval
  • Boolean Retrieval
  • The Term Vocabulary and Postings Lists
  • Dictionaries and Tolerant Retrieval
  • Index Construction
  • Index Compression
  • Scoring, Term Weighting, and the Vector Space Model
  • Computing Scores in a Complete Search System
  • Evaluation in Information Retrieval
  • Relevance feedback and Query Expansion
  • XML Retrieval
  • Probabilistic Information Retrieval
  • Language Models for Information Retrieval
  • Text Classification and Naive Bayes
  • Vector Space Classification
  • Support Vector Machines and Machine Learning on Documents
    		•
  • Flat Clustering
  • Hierarchical Clustering
  • Matrix Decompositions and Latent Semantic Indexing
  • Web Search Basics
  • Web Crawling and Indexes
  • Link Analysis
  • Modeling
  • Retrieval Evaluation
  • Query Languages
  • Query Operations
  • Text and Multimedia Languages and Properties
  • Text Operations
  • Indexing and Searching
  • Parallel and Distributed IR
  • User Interfaces and Visualization
    		•
     
     

    advertisement
    Sanfoundry is looking for Top-Class Interns who are subject matter expert in their field. An Intern at Sanfoundry is a Free-Soul who desires to contribute a Masterpiece to the Open Community. Every single Intern at Sanfoundry is hand-picked, Mentored and Guided by our Founder and CTO. If you are interested to contribute and apply, Here’s Full Detail of Sanfoundry Internship Program.

    Sanfoundry Global Education & Learning Series – Computer Science Internships!

    Deep Dive @ Sanfoundry:

    1. Java Algorithms, Problems & Programming Examples
    2. C++ Algorithms, Problems & Programming Examples
    3. C Algorithms, Problems & Programming Examples
    4. Data Science Questions and Answers
    5. Bachelor of Computer Applications Questions and Answers
    6. Master of Computer Applications Questions and Answers
    7. Software Engineering Questions & Answers
    8. Information Science Questions and Answers
    9. Computer Science Questions and Answers
    10. Best Reference Books – B.Tech – Electronics and Computer Engineering
    Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer and SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage & Cluster Administration, Advanced C Programming, SAN Storage Technologies, SCSI Internals and Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him below:
    LinkedIn | Facebook | Twitter | Google+