Selman ALPDÜNDAR

The Ultimate Guide to High Performance and Accessibility in React: Your Roadmap to a Perfect Lighthouse and ARC Toolkit Score

Introduction

In the modern digital landscape, performance and accessibility are at the heart of every successful web application. React, a powerful JavaScript library, is equipped with the tools to help developers optimize their apps for both these dimensions. This article takes you on an in-depth journey of React performance optimization strategies, accessibility enhancements, and offers detailed insights into the usage of Lighthouse and the ARC Toolkit, two invaluable tools for auditing your app’s health.

Continue with reading

Harness the Power of React Hooks: A Comprehensive Guide to Replacing Component Lifecycle Methods

Introduction

React, one of the leading JavaScript libraries for building dynamic user interfaces, has introduced various changes throughout its lifecycle. Among them, the introduction of Hooks in React 16.8 stands as a significant shift, offering a new way to manage state and side effects in our components. This article will explore what Hooks are, their purpose, some of their use cases, and how they can effectively replace lifecycle methods in class-based components.

Continue with reading

Text-to-Speech (TTS) in React Native: A Comprehensive Guide for Android and iOS

Text-to-Speech (TTS) is a powerful technology that allows your applications to convert written text into spoken words. React Native, a popular cross-platform framework for building mobile apps, can leverage TTS to create more engaging and accessible user experiences. In this blog post, we will walk you through the process of implementing Text-to-Speech in a React Native application for both Android and iOS platforms.

Continue with reading

Solution of Realm Migration Error Code 10

When you make a change on model you have two options. You can delete app from simulator and there will not a problem after running again but if you already has shipped your app
to apple store this option is not acceptable for you. The other option is using migration.
This code is a quotation from realm.io
Suppose we have the following Person model:

class Person: Object {
    @objc dynamic var firstName = ""
    @objc dynamic var lastName = ""
    @objc dynamic var age = 0
}

Continue with reading

Taking a character and integer from user in ASM Assembly

Question : Write an assembly program that prompts the user for a character, and then for an integer. The program then prints out “The character entered was: followed by the character, and “The integer entered was: ” followed by the integer.


%include 'asm_io.inc'
segment .data
  msg1 db "Enter a character : ",0
  msg2 db "Enter a integer : ",0
  msg3 db "Entered character was : ",0
  msg4 db "Entered integer was : ",0
 segment .bss
  integer resd 1
  character resb 1
 segment .text
 	global _asm_main
_asm_main:
    enter	0,0
	pusha	
    ;---------------------------- start ponit -----------------------
    mov eax,msg1 ; move msg1 to eax register
    call print_string ; print to screen  msg1
    call read_char ; read a character from user
    mov [character],al; move the al value to character variable

    mov eax,msg2 ; move msg2 to eax register
    call print_string; print to screen msg2
    call read_int ; read a number from user
    mov [integer],al; mov al value to integer variable

    mov eax,msg3; move msg3 to eax register
    call print_string ; print to screen msg3
    mov eax,[character]; move characker  to eax register
    call print_char; print to screen charecter
    call print_nl; move to point new line

    mov eax,msg4; move msg4 to eax register
    call print_string; print to screen msg4
    mov eax,[integer]; move integer to eax register
    call print_int; print to screen number
    ;---------------------------- start end ------------------------------
    popa
	mov	eax, 0
	leave
	ret

Example of Minimization of Deterministic Finite Automata (DFA)

Minimization of DFA (Table Filling Method or Myhill-Nerode Theorem)

Steps:

  1. Draw a table for all pairs of states (P, Q)
  2. Mark all pairs where Pϵ F and Q∉F
  3. If there are any Unmarked pairs (P, Q) such that [δ(P, x),δ(Q, x)] is marked, then mark [P, Q] where ‘x’ is an input symbol. Repeat this until no more marking can be made.
  4. Combine all the unmarked pairs and make them a single state in the minimized DFA.

Example: Minimize the following DFA using Table Filling Method.

Continue with reading