The objective of the study reported in this thesis has been to develop a unified algorithmrnfor the computer-aided design of a wide range of electrical network configurations.rnWhile the design has been based on well-known techniques established earlier by otherrnresearchers, the present work has made significant contributions in simplifying the usesrnof nodal equation formulation method, graph theoretic concepts and topologicalrnformulas, as well as applications of a modified least p-th Taylor method, componentrndamping techniques, sensitivity analyses and related design concepts. The basicrncomputer-aided design approachfor a selected network was realized byfirst generatingrna voltage gain transfer function from the network connectivity details. Informationrnconcerning the gradient vector necessary in the course of an optimization process wasrnthen derived through a direct method of sensitivity analysis, without performing thernnormally needed first orderpartial differentiations. Comparison of a transfer functionrnagainst desired response was preceded by sampling of the latter at selected frequencyrnpoints and the whole adjustment was eventually automated via the least p-th Taylorrnmethod of optimization. It has been established that this approach avoided the timernconsuming calculation of a Hessian matrix that is usually required for performingrnnetwork optimization. Convergence properties of the least p-th Taylor method werernimproved through a use of Fletcher's modification of the classicalLevenberg-Marquardtrnmethod together with component damping techniques. The concept of dynamic memoryrnallocation has also been exploited. The resulting computer-aided network designrntechnique was therefore efficient in terms of both processing time and memoryrnrequirements and the entire package has been termed as a Pascal program for optimalrnnetwork design or P-POND. The algorithm has beenfully tested in its usefor designingrnboth passive and active network types by specifying initial network parameters andrninput-output relations.