Can multi-classing improve a sorcerer’s solo-potential?

Can multi-classing improve a sorcerer’s solo-potential?

And how should I do this?

My friend has started a new series of 3.5 D&D sessions where I have been leveling my half-elf sorceress.

Due to in-game events and elaborate RP, my character has been forced to solo a lot, and will probably keep doing so with only occasionally teaming up with others. She is currently level 6, and the rest of the PC’s are level 4. In order to tome her XP-gain down, she has Craft Wondrous Items.

Now, I have been considering multi-classing in order to improve my solo-potential. I can dish out enough damage already as a sorcerer, but I can barely take any hits. I wonder if multi-classing could improve my survivability. For example, taking a level in a healing-class for some self-healing.

However, I have done my research and everyone says NOT to multi-class a caster-class, in order to prevent falling behind. However, because the party has fallen behind instead, would that make multi-classing more viable? If so, what class could successfully fulfill my needs?

Beyond this point, I will explain some details about the situation for those that are interested.

We only use the PHB, the rest is done custom. (I.E. monsters, magic items, etc.)

The setting is custom, just like the bosses. They are no normal monsters, instead customly created creatures that either have a specific way to get beaten or have special abilities that can be countered in a smart way. Their health almost always exceeds 100 HP, but up until now none of them have turned out to be too difficult or easy for us, due to the mechanics.

It is also not sure if we will quit this series of sessions either very soon or far beyond level 20, but we do not plan on stopping at level 20 itself, so it’s not like I will lose sorcerer-levels with this decision. I also won’t fall behind, because I have two more levels than the rest of the party.

The sessions mainly consist of RP and boss-battles, with surprisingly less dungeon-crawling.

Character: (extremely narrowed down)

Level 6 half-elf sorcerer, chaotic neutral.
STR 8; DEX 18; CON 14; INT 14; WIS 13; CHA 18

Feats can be changed.

Level 0

  • Detect Magic
  • Dancing Lights
  • Touch of Fatigue
  • Mending
  • Message
  • Prestidigitation
  • Resistance
  • Detect Poison

Level 1

  • Shield (I have armour that gives no ASF, hence why I choose Shield.)
  • Charm Person
  • Shocking Grasp
  • Feather Fall
  • Grease
  • Identify

Level 2

  • Command Undead (I have a corpse-holding cloak.)
  • Spectral Hand
  • See Invisibility

Level 3

  • Fireball
  • Vampiric Touch

Besides spells, has several daggers at her disposal.

If you need more information, let me know.

Is there any way for the Draconic Bloodline Sorcerer’s Elemental Affinity to improve Eldritch Blast, or is the Sage Advice Compendium just wrong?

The Draconic Bloodline Sorcerer’s elemental affinity ability says:

Starting at 6th level, when you cast a spell that deals damage of the type associated with your draconic ancestry, you can add your Charisma modifier to one damage roll of that spell.

The cantrip eldritch blast deals force damage, and force damage does not appear on the Draconic ancestry table.

Nevertheless, the Sage Advice Compendium ruling on elemental affinity states:

Elemental Affinity benefits one damage roll per casting of a spell, even if the spell allows more than one roll. So, for example, the feature improves one of the rays of a scorching ray spell or one of the beams of an eldritch blast spell.

Is this just a case of using eldritch blast as a contextually incorrect choice of category representative of the type of spells this Sage Advice ruling is addressing, or is there a way to modify the damage type of eldritch blast so that it is an actual use case for this ruling on the elemental affinity ability?

Improve Prim’s algorithm runtime

Assume we run Prim’s algorithm when we know all the weights are integers in the range {1, …W} for W, which is logarithmic in |V|. Can you improve Prim’s running time?

When saying ‘Improving’, it means to at-least: $ $ O(|E|)$ $

My question is – without using priority queue, is it even possible? Currently, we learned that Prim’s runtime is $ $ O(|E|log|E|)$ $

And I proved I can get to O(|E|) when weights are from {1,….,W) when W is constant, but when W is logarithmic in |V|, I can’t manage to disprove/prove it.


How to improve wordpress mysql performance on large tables?

I’ve installed WordPress 5.4.1 on Ubuntu 20.04 LTS on AWS EC2 (free tier as I’m starting).

My instance has 30 GB of disk space and 1 GB of RAM.

My website has at about 9000 pages and I’ve imported 7800 so far with “HTML Import 2” plugin.

wp_posts table has 7,800 rows and 66 MB size and, since this table has grown, wordpress has become super slow. Any change I make to the database is super slow as well.

While trying to make changes, I keep getting this error:

Warning: mysqli_real_connect(): (HY000/2002): No such file or directory in /var/www/wordpress/wp-includes/wp-db.php on line 1626 No such file or directory

Error reconnecting to the database This means that we lost contact with the database server at localhost. This could mean your host’s database server is down.

What could I do in order to achieve a better speed and make it usable?

Improve querying of Extended Events target file

As part of our server estate monitoring, I am adding extended events to pick up warnings, blocking etc and I’d like to periodically (Every couple of minutes) query the event file to collect the data. I have been using the below to query data using xQuery, but it seems to be quite slow. I am aware of using a fileoffset as an option to optimise, but beyond that, are there any ways in which I can better improve predicates as been below?

    SELECT           event_data         ,n.value('@timestamp', 'DATETIME2') DtTimeStamp         ,n.value('(action[@name="collect_cpu_cycle_time"]/value)[1]', 'bigINT') CollectCpuCycleTime         ,n.value('(action[@name="collect_system_time"]/value)[1]', 'DATETIME2') CollectSystemTime         ,n.value('(action[@name="last_error"]/value)[1]', 'varchar(255)') LastError         ,n.value('(action[@name="collect_system_time"]/value)[1]', 'datetime2')             CollectSystemTime         ,n.value('(action[@name="task_time"]/value)[1]', 'bigint')                          TaskTime         ,n.value('(action[@name="client_app_name"]/value)[1]', 'varchar(255)')              ClientAppName         ,n.value('(action[@name="client_hostname"]/value)[1]', 'varchar(255)')              ClientHostName         ,n.value('(action[@name="database_name"]/value)[1]', 'varchar(255)')                DatabaseName         ,n.value('(action[@name="nt_username"]/value)[1]', 'varchar(255)')                  NtUserName         ,n.value('(action[@name="server_instance_name"]/value)[1]', 'varchar(255)')         InstanceName         ,n.value('(action[@name="session_id"]/value)[1]', 'INT')                            SessionID         ,n.value('(action[@name="client_pid"]/value)[1]', 'INT')                            ClientPID         ,n.value('(action[@name="sql_text"]/value)[1]', 'VARCHAR(MAX)')                         SQLText     FROM          (             SELECT                  CAST(event_data as XML) event_data             FROM                  sys.fn_xe_file_target_read_file('C:\Temp\EE_QueryWarnings*.xel', null, null, null)         ) ed     OUTER APPLY         ed.event_data.nodes('event') (n)     WHERE         n.value('@name', 'varchar(MAX)')    = 'missing_column_statistics'     AND         n.value('@timestamp', 'DATETIME2')   >= DATEADD(MINUTE,-10,GETUTCDATE()); 

Counting the number of binary strings of length m with no consecutive 1s (RR). How to improve it?

I am new to Mathematica and I am trying to solve this problem of counting the number of binary strings of a certain length m, as far as no consecutive 1s are there.

For instance m = 3, my recurrence relation should give 5 i.e. 000, 001, 101, 100, 010.

I started like this with initial seeds: n > 0; a[ 1] = 1, a[2] = 3, a[3] = 5 and then in RSolve I did:

enter image description here

Is there a better way to improve it so that I can use the output in a plot? Currently, I cannot as my solution says it cannot be used as function.


Why do I take a lot of time to implement sth by myself.How can I improve on that

I have been working as a developer for 2 years now. I have no problem writing logic and doing programming. I have fairly good understanding of data structures .I participate in hacker rank,leet code etc without much difficulty.But when it comes to implementing sth alone, I spent a lot of time face lot of questions and confusions.

For example , I was trying to download files from google drive programmatically in python. When I started reading the documentation of google drive API, I couldnt make sense of everything I read quickly. I have to keep searching ,going back and forth, read the same sentence mutiple times etc.Why does this problem arise? What do I lack? Does it have anything to do with theory related to CS or is it sth everyone face? How can I improve?