Ai alloat some time..........

 

India mourns the loss of one of its most distinguished leaders

 Former Indian prime minister Manmohan Singh has died at the age of 92.

Singh was one of India's longest-serving prime ministers and he was considered the architect of key liberalising economic reforms, as PM from 2004-2014 and before that as finance minister.

win10 performance settings, 40 best tools in Ai, 1. ChatGPT 2. DALL-E 3. Midjourney 4. Paradox 5. Textio 6. Tome 7. Slides AI 8. Lyric Studio 9. Sythesia 10. Fliki AI 11. Seo AI 12. Alli AI 13. Salesforce 14. Otter.ai 15. Github CoPilot

 

Regedit…2^nd, controlpanel,desktop press m , show menudisplay change 400 to 0

Run, msconfig,boot advsettings processor count 1to max in the dropdown box

The Best AI Tools by Category

• Chatbots: ChatGPT, Claude
• Video Generation and Editing: Synthesia, Runway
• Writing: Rytr, Sudowrite
• Grammar and Writing Improvement: Grammarly, Wordtune
• Search Engines: Perplexity, ChatGPT search
• Social Media Management: Vista Social, FeedHive
• Image Generation: Midjourney, DALL·E 3
• Graphic Design: Canva Magic Studio, Looka
• App Builders: Bubble, Bolt
• Project Management: Asana, ‎ClickUp
• Transcription and Meeting Assistants: tl;dv, Nyota
• Scheduling: Reclaim, Clockwise
• Customer Service: Tidio AI, Hiver
• Recruitment: Textio, CVViZ
• Knowledge Management: Notion AI Q&A, Guru
• Email: Hubspot Email Writer, SaneBox, Shortwave
• Presentations: Gamma, Presentations.ai
• Resume Builders: Teal, Kickresume
• Voice Generation: ElevenLabs, Murf
• Music Generation: Suno, Udio

tension vaddu............. nee kalalaku ledu warranty

 

some interesting information

 

practice GPT & Ai on your free time

JEFF AGE IS 60 Yrs.......Adalf MARRIED JUST A HOUR BEFORE HIS DEPARTURE from this eternal world..........all are valid , .........................................

 Sasanalu enka  nirnaeanchabadaledu    from the TRANSFORMERS     movie.......

Optimus Prime: Any last words? 

Demolishor: This is not your pla-anet to rule. 

The Fallen shall rise again..

DESA BHASHALANDU TELUGU LESSA,.......... Telugu madhuryamu

on  sunday  my freetime 

స్త్రీ జాతికీ ఏనాటికీ స్మరణీయ మహనీయ వీరాగ్రణికి.........

సౌందర్యమూ సౌశీల్యమూ నిలువెల్ల........

నెలకొన్న కలభాషిణికి

అభినందన మందారమాల

నా గుండెపై నీవుండగా...
దివి తానే భువిపైన దిగివచ్చెనా

ప్రియ భావమే లయరూపమై
అలలెక్కి ఆడింది అణువణువులో

Ramanjaneyulu Dayinaboyina , PhD Specialization , Software Engineering in progress , V I T UNIVERSITY , A.P

 

Feelings, nothing more than feelings Trying to forget my feelings of ...................

   Baby, I have no story to be told ………………

when you cross 45 years , expend ..... , save only 40%.................... , because u earned who will use......... by age 30

 didn't get,    Realistic support for my above statements, but the form is different

everybody will earn...............allocate some free time 

my free time , sunday

The voice of the lord Krishna to arjuna ,   the most powerful

         You can’t change what people feel about you so don’t try, just live your life be happy

 

next frame ……lust, anger, greed are the three doors to hell

This is the only framers extension 

Mr(mortal)…to lord……how these doors will get open, for whom these doors will open, who will open

answer    Mr     don’t think …… they themselves know better than us   

ref:- lord is immortal ...........

  Nobody kicks a dead dog.” Dale Carnegie: Time-Tested Methods for Conquering.

By ramu dayinaboyina

XML full length ,............i am going to implement soon ,Prerequisites html , css, java script these 3 concepts must thorough before going to xml

 soon i will start 3 courses 

Data structures using    java or  cpp or  c   any language 

HCI human computer interaction 

web programming up to xml.........

next  jdbc servlets , jsp, java beans, ejbs, rmi, jndi, java mail.., JMS message system......complete server-side technologies. 

DBMS........TRANSACTIONS, find the view Serializability ,conflict Serializability

 Serializability is a type of property of DBMS in which each transaction is executed independently and automatically, even though these transactions are executed concurrently. In other words, we can say that if there are several transactions executed concurrently, then the main work of the serializability function is to arrange these several transactions in a sequential manner.

For better understanding, let's explain these with an example. Suppose there are two users ramu and ravi. Each executes two transactions. Let's transactions T1 and T2 are executed by ramu, and T3 and T4 are executed by ravi. Suppose transaction T1 reads and writes the data item A, transaction T2 reads the data item B, transaction T3 reads and writes the data item C and transaction T4 reads the data item D. Lets the schedule the above transaction as below.

1. .     T1: Read A → Write A→ Read B → Write B`   
2. •   `T2: Read B → Write B`   
3. •   `T3: Read C → Write C→ Read D → Write D`   
4. • `  T4: Read D → Write D  

Dekker’s Algorithm: Final and completed Solution – -Idea is to use favoured thread notion to determine entry to the critical section. Favoured thread alternates between the thread providing mutual exclusion and avoiding deadlock, indefinite postponement, or lockstep synchronization.

 

soon this i will explain 

1

For this total 5 versions are there,   the
final & perfect solution is the below one by   ramu.

Main()

2

{

3

​

4

    // to denote which thread will enter next

5

    int favouredthread = 1;

6

​

7

    // flags to indicate if each thread is in

8

    // queue to enter its critical section

9

    boolean thread1wantstoenter = false;

10

    boolean thread2wantstoenter = false;

11

​

12

    startThreads();

13

}

14

​

15

Thread1()

16

{

17

    do {

18

​

19

        thread1wantstoenter = true;

20

​

21

        // entry section

22

        // wait until thread2 wants to enter

23

        // its critical section

24

        while (thread2wantstoenter == true) {

25

​

26

            // if 2nd thread is more favored

27

            if (favaouredthread == 2) {

28

​

29

                // gives access to other thread

30

                thread1wantstoenter = false;

31

​

32

                // wait until this thread is favored

33

                while (favouredthread == 2)

34

                    ;

35

​

36

                thread1wantstoenter = true;

37

            }

38

        }

39

​

40

        // critical section

41

​

42

        // favor the 2nd thread

43

        favouredthread = 2;

44

​

45

        // exit section

46

        // indicate thread1 has completed

47

        // its critical section

48

        thread1wantstoenter = false;

49

​

50

        // remainder section

51

​

52

    } while (completed == false)

53

}

54

​

55

Thread2()

56

{

57

​

58

    do {

59

​

60

        thread2wantstoenter = true;

61

​

62

        // entry section

63

        // wait until thread1 wants to enter

64

        // its critical section

65

        while (thread1wantstoenter == true) {

66

​

67

            // if 1st thread is more favored

68

            if (favaouredthread == 1) {

69

​

70

                // gives access to other thread

71

                thread2wantstoenter = false;

72

​

73

                // wait until this thread is favored

74

                while (favouredthread == 1)

75

                    ;

76

​

77

                thread2wantstoenter = true;

78

            }

79

        }

80

​

81

        // critical section

82

​

83

        // favour the 1st thread

84

        favouredthread = 1;

85

​

86

        // exit section

87

        // indicate thread2 has completed

88

        // its critical section

89

        thread2wantstoenter = false;

90

​

91

        // remainder section

92

​

93

    } while (completed == false)

94

}

This version guarantees a complete solution to the critical solution problem.