Functional Programming

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-programming-language/language-design/functional-programming-functions-recursion-and-immutability/asset-functional-programming after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  11. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a lecture on programming paradigms, focusing on functional programming. The instructor begins by defining functional programming as a paradigm that treats computation as the evaluation of mathematical functions and avoids state changes and mutable data, contrasting it with imperative programming. The lecture then explores the historical context, noting that LISP was the first operational functional language. It further discusses the modern applications of functional programming in industry, particularly in domain-specific languages like R for statistics, Mathematica for symbolic math, and F# for financial analysis. The video concludes by explaining the concept of evaluation strategies, differentiating between eager (strict) evaluation, where arguments are fully evaluated before a function call, and lazy evaluation, where arguments are only evaluated when their values are needed. The final topic covered is type inference, which is the ability of a language to automatically deduce the data types of expressions.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture begins with a definition of functional programming, presented on a slide. The instructor explains that it is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state changes and mutable data. This is contrasted with imperative programming, which emphasizes changes in state. The instructor then writes on the slide, listing other programming paradigms such as procedural, logic, and declarative, and begins to discuss the concept of 'eager' evaluation, which is the full evaluation of function arguments before invoking a function.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues to elaborate on the definition of functional programming, emphasizing its core principles. The slide text is visible, stating that functional programming avoids state changes and mutable data. The instructor then transitions to the historical context, mentioning that LISP was the first operational functional programming language. The slide also notes that functional programming has not been very popular except for a restricted number of application areas, such as artificial intelligence. The instructor writes 'Value of variable' on the slide, likely to illustrate a concept related to state.

  3. 5:00 – 8:02 05:00-08:02

    The lecture moves to the applications of functional programming in industry. The slide lists domain-specific languages like R (statistics), Mathematica (symbolic math), and F# (financial analysis). The instructor then explains the concept of evaluation strategies, differentiating between 'eager' (strict) evaluation, where function arguments are fully evaluated before the function is called, and 'lazy' evaluation, where arguments are only evaluated when their values are required. The final topic is 'type inference', defined as the ability to automatically deduce the type of values manipulated by a program, a feature found in strongly statically typed languages. The instructor writes 'Type inference' and 'implicit typing' on the slide to reinforce the concept.

The video provides a comprehensive overview of functional programming, starting with its foundational definition and contrasting it with imperative programming. It then traces the history of the paradigm, highlighting LISP as a pioneering language. The lecture effectively connects the theoretical concepts to real-world applications by discussing modern domain-specific languages. The final segment on evaluation strategies and type inference adds a layer of technical depth, explaining how functional languages manage computation and data types, providing a well-rounded introduction to the topic.

Loading lesson…