12:01

127. Automata_57: DFA accepting all words ending in aba

16:20

126. Automata_56: DFA accepting all words ending in ab on {a, b}

02:31

125. Story 12: कर्तव्यों का पालन: Motivation by Ankur

03:59

124. Story 11: Rani Laxmibai (Motivation by Ankur)

03:03

123. Story 10 Montessori Education: Motivation by Ankur

05:31

122. DAA: Small Oh and Small Omega notation (Asymptotic notation)

05:55

121. DAA: Theta Notation (Asymptotic Notations)

07:06

120. DAA: Big Omega Notation

08:54

119. DAA: Big Oh Notation (Asymptotic notation)

08:57

118. DAA: Asymptotic Notations

24:30

117. Selection Sort Program in C language

17:05

115. DAA: MASTER METHOD

25:08

114. DAA: Recursion Tree

14:45

113. DAA: MERGE SORT

02:53

116. DAA: SUBSTITUTION METHOD

36:11

112. DAA: Aysmptotic Analysis

46:32

111. DAA: Analysis of Insertion Sort

43:20

110. DAA: INSERTION SORT - Computer Science

15:17

109. DAA: Algorithm as a Technology: Introduction to algorithms Part 4

05:13

108. DAA: Algorithms, Pseudocode and Real Code -Introduction to Algorithms Part 3

08:57

107. DAA: Properties of algorithms Part 2

12:48

106. DAA: Introduction to Algorithms: Part 1

02:30

105. Story 9: संस्कृति एवं पोशाक Motivation by Ankur

28:41

104. New education policy - National Credit Framework

02:48

103. Story 8: भरोसा एवं प्यार Motivation by Ankur

02:24

102. Story 7: मानव सेवा Motivation by Ankur

42:32

101. Interview of an Artist: Mr. Ashish Agrawal

02:35

100. Story 6: सादगी Motivation by Ankur

01:30

99. Story 5 :नेता एवं समाज सेवा Motivation by Ankur

28:45

98. Interview of Shri Suraj Verma Sir (Math's and Physics Teacher)

48:06

97. Interview of Shri Surendra Singh Sir (Computer Teacher)

28:02

96. Interview of Ms. Shashi Prabha Madam (Music Teacher)

05:03

95. Story 4:अपराध एवं भ्रष्टाचार Motivation by Ankur

04:26

94. Story 3: असत्य की कमाई नष्ट हो जाती है MOTIVATION BY ANKUR:

04:08

93. Story 2: अध्यापन MOTIVATION BY ANKUR

02:45

92. Story 1: प्रशंसा MOTIVATION BY ANKUR

54:23

91. Interview of Shri S P S Chopra Sir (Retired Principal)

01:08

90. New Section: Interview and Podcasts coming soon

09:20

89. Automata_55: Turing Machine: Halting Problem

12:35

88. Automata_54 Turing Machine: Church Thesis/Turing Thesis

21:17

87. Automata_53 Turing Machine: Recursive & Recursively Enumerable continued

34:09

86. Automata_52 Turing Machine: Recursive and Recursively Enumerable language

12:31

85. Automata_51 Turing Machine: Acceptability and Decidability

12:03

84. Automata_50 Non-Deterministic Turing Machine

11:50

83. Automata_49 Multitape Turing Machine

20:39

82. Automata_48 Turing Machine for adding two numbers

15:55

81. Automat_47 TM as Transducers, Turing Computable Definition

32:28

80. Automata 46 TM for a^n b^n

14:53

79. Automata_45 TM for Language a^n b^n | n is greater than 0 (concept)

21:01

78. Automata_44 TM to accept Language 00*.

31:17

77. Automata_43 Turing Machine Fundamental example, ID, transition Table and Transition Diagram

25:56

76. Automata_42 Turing Machine & its Definition

11:28

75. Automata_41 - WHY TURING MACHINE NEEDED WHEN FA, PDA AND LBA WERE THERE?

25:07

74. PYTHON- SELECTION AND INSERTION SORT

24:17

73. PYTHON-LINEAR SEARCH AND BINARY SEARCH

12:28

72. (HINDI) GATE 2022-question 44

10:49

71. (HINDI) GATE 2022- question 21BASED ON POINTER ARITHMETIC

12:35

70. (ENGLISH) GATE 2022-question 21BASED ON POINTER ARITHMETIC

11:52

67. Automata_40: Definition of regular expressions

24:28

66. Automata_39: The operators of regular expressions