S.Y B-Tech
Syllabus
Transform and Numerical methods (TNM) ▼
  • Unit 1 : Laplace Transform ▼
    Laplace transform definition and their properties Transform of derivatives and integrals Evaluation of integrals by Laplace Transform Laplace tranforms of periodic function Unit Step function Unit Impulse function Inverse Laplace Transform & its properties Convolution Theorem Applications of Laplace Transforms to solve ordinary differential equations
  • Unit 2 : Fourier Transform ▼
    Complex exponential form of Fourier series Fourier Integral theorem Fourier Sine & Cosine Integrals Fourier Transform Fourier Sine and Cosine transforms and their Inverses Properties of Fourier Transform Discrete Fourier Transform Applications of Transforms to boundary value
  • Unit 3: Z-Transform ▼
    Definition Properties of Z-Transforms Inverse Z-Transform and relation between Z transform and Laplace Transform Convolution Theorem Application of Z-Transform to solve difference equations with constant coefficients
  • Unit 4: Numerical Solution of Equations ▼
    Numerical solutions of algebraic and transcendental equations Iteration method Bisection method Regula-Falsi method Newton-Raphson's method and their convergences Solution of system of linear equations by Gauss elimination method Gauss Jordan method Gauss Seidel iteration method
  • Unit 5: Numerical Solution of Ordinary Differential Equations ▼
    Picard's method Taylor series method Euler's method Modified Euler's method Range's method Runge-Kutta fourth order method Predicator-corrector methods Milne's method Solution of Simultaneous first order and higher order differential equations
Computer Networks (CN) ▼
  • Unit 1: Introduction to Computer Networks and Logical Link Medium Access Control ▼
    Introduction - Network architecture - Design Reference models - The OSI Reference Model - The TCP/IP Reference Model - A Comparison of the OSI and TCP/Ip Reference Models Design Issues Switching Techniques: Circuit and Packet Switching Connectionless and Connection-oriented Services Virtual Circuit and Datagram Subnets Autonomous System
  • Unit 2: Network Layer-I ▼
    Routing Algorithms: Optimality principle Shortes Path routing Flooding Distance Vector routing Link state routing Hierarchical routing Network Layer services IP protocol IPv4 Problems with IPv4 IPv6 Subnetting Network Layer Protocols: ARP RARP ICMP DHCP Unicast Routing Algorithms: RIP OSPF BGP
  • Unit 3: Transport Layer ▼
    UDP: UDP functionality UDP Header TCP: TCP features Byte-Stream Connection-oriented TCP Header Format 2-way, 3-way Handshake TCP State Diagram TCP Sliding Window Congestion Control Algorithms Leaky Bucket Token Bucket Congestion Avoidance TCP Tahoe Fast Retransmit Fast Recovery Timer Management
  • Unit 4: Application Layer ▼
    Domain Name System (DNS) Naming and Address Schemes DNS servers Email: MIME SMTP and POP3. Remote login File Transfer Protocol (FTP) SNMP DHCP and BOOTP. World Wide Web HTTP
  • Unit 5: Wireless LAN, MAN, WAN ▼
    Introduction (Infrastructure and Ad-hoc Networks) Fundamentals of WLAN – technical issues Network Architecture IEEE 802.11- physical layer Mac Layer Mechanism CSMA/CA Bluetooth - Specification Transport Layer Middleware Protocol Group Bluetooth Profiles of IEEE 802.16 Sensor Node Architecture (hardware components) Sensor Network Architectures
Operating Systems (OS) ▼
  • Unit 1: Introduction ▼
    Evolution of OS Types of OS Basic h/w support necessary for modern operating systems services provided by OS system programs and system calls system design and implementation.
  • Unit 2: Process & Its Scheduling ▼
    Process concept process control block Types of scheduler context switch threads multithreading model goals of scheduling and different scheduling algorithms
  • Unit 3: Process Management and Synchronization ▼
    Process management and synchronization: Concurrency conditions Critical section problem software and hardware solution semaphores conditional critical regions and monitors classical inter process communication problems
  • Unit 4: Deadlock ▼
    Deadlock definitions Prevention Avoidance detection and Recovery Goals of Protection access matrix Deadlock implementation
  • Unit 5: File Systems ▼
    File systems: File concept Access methods space allocation strategies disk arm scheduling strategies. Contiguous allocation Relocation Paging Segmentation Segmentation with paging demand paging Virtual Memory Concepts page faults and instruction restart page replacement algorithms working sets Locality of reference Thrashing Garbage Collection
Applications of Microprocessors and Microcontrollers (AMM) ▼
  • Unit 1: Introduction ▼
    Microprocessor Technology: 8085/8086 - architectural overview & Programming model
  • Unit 2: Microcontrollers ▼
    Introduction to Microcontrollers 8051 architecture Data Types and Directives Flag bits and PSW register Register bank and stack
  • Unit 3: Assembly Language Programming ▼
    Jump, Loop and Call Instructions I/O Port Programming Addressing Modes Arithmetic, Logic Instructions and Programs Data Types and Time Delay Interfacing to External Memory
  • Unit 4: Programming ▼
    Timer/counter Interrupts and serial communications Serial I/O Programming Tools Program using C Interfacing with 8051: ADC and DAC interfaces for microcontrollers Real Time Interfacing with LED, keypad, LCD display, Sensors interfacing
  • Unit 5: Arduino ▼
    Introduction to Arduino Pin configuration and architecture coding of Arduino using IDE interfacing
Design and Analysis of Algorithms (DAA) ▼
  • Unit 1: Mathematical Foundations & Asymptotic Notations ▼
    Algorithm Mathematical Notations Algorithm specification Analysis of Algorithm-Introduction Analyzing control structures Asymptotic notations space complexity time complexity Performance measurement analyzing control structures best case, worst case and average case analysis Iterative Algorithm analysis.
  • Unit 2: Divide and Conquer ▼
    Recurrence relations solutions of recurrence relations by Master Methods Divide and conquer basic strategy binary search quick sort merge sort maximum and minimum finding
  • Unit 3: Greedy Method ▼
    Greedy method – basic strategy application to job sequencing with deadlines problem minimum cost spanning trees single source shortest path
  • Unit 4: Dynamic Programming ▼
    Dynamic Programming basic strategy multistage graphs all pairs shortest path single source shortest paths optimal binary search trees traveling salesman problems.
  • Unit 5: Traversal and Search Techniques ▼
    Basic Traversal and Search Techniques breadth first search and depth first search Backtracking basic strategy 8-Queen’s problem graph colouring Hamiltonian cycles NP Problems Optimization Algorithms