Skip to main content

PROBLEM SOLVING AND PYTHON PROGRAMMING QUIZ

1) What is the first step in problem-solving? A) Writing code B) Debugging C) Understanding the problem D) Optimizing the solution Answer: C 2) Which of these is not a step in the problem-solving process? A) Algorithm development B) Problem analysis C) Random guessing D) Testing and debugging Answer: C 3) What is an algorithm? A) A high-level programming language B) A step-by-step procedure to solve a problem C) A flowchart D) A data structure Answer: B 4) Which of these is the simplest data structure for representing a sequence of elements? A) Dictionary B) List C) Set D) Tuple Answer: B 5) What does a flowchart represent? A) Errors in a program B) A graphical representation of an algorithm C) The final solution to a problem D) A set of Python modules Answer: B 6) What is pseudocode? A) Code written in Python B) Fake code written for fun C) An informal high-level description of an algorithm D) A tool for testing code Answer: C 7) Which of the following tools is NOT commonly used in pr...

Points to Remember

• A data structure is a particular way of storing and organizing data either in computer’s memory or on the disk storage so that it can be used efficiently.
• There are two types of data structures: primitive and non-primitive data structures. Primitive data structures are the fundamental data types which 
are supported by a programming language. Non-primitive data structures are those data structures which are created using primitive data structures.
• Non-primitive data structures can further be classified into two categories: linear and non-linear data structures. 
• If the elements of a data structure are stored in a linear or sequential order, then it is a linear data structure. However, if the elements of a data structure are not stored in sequential order, then it is a non-linear data structure. 
• An array is a collection of similar data elements which are stored in consecutive memory locations.
• A linked list is a linear data structure consisting of a group of elements (called nodes) which together represent a sequence.
• A stack is a last-in, first-out (LIFO) data structure in which insertion and deletion of elements are done at only one end, which is known as the top of the stack. 
• A queue is a first-in, first-out (FIFO) data structure in which the element that is inserted first is the first to be taken out. The elements in a queue are added at 
one end called the rear and removed from the other end called the front.
• A tree is a non-linear data structure which consists of a collection of nodes arranged in a hierarchical tree structure. 
• The simplest form of a tree is a binary tree. A binary tree consists of a root node and left and right sub-trees, where both sub-trees are also binary trees. 
• A graph is often viewed as a generalization of the tree structure, where instead of a purely parent-to-child 
relationship between tree nodes, any kind of complex relationships can exist between the nodes.
• An abstract data type (ADT) is the way we look at a data structure, focusing on what it does and ignoring how it does its job.
• An algorithm is basically a set of instructions that solve a problem. 
• The time complexity of an algorithm is basically the running time of the program as a function of the input size. 
• The space complexity of an algorithm is the amount of computer memory required during the program execution as a function of the input size. 
• The worst-case running time of an algorithm is an upper bound on the running time for any input.
• The average-case running time specifies the expected behaviour of the algorithm when the input is randomly drawn from a given distribution.
• Amortized analysis guarantees the average performance of each operation in the worst case. 
• The efficiency of an algorithm is expressed in terms of the number of elements that has to be processed and the type of the loop that is being used.

Labels:

Popular posts from this blog

Introduction to C Programs

INTRODUCTION The programming language ‘C’ was developed by Dennis Ritchie in the early 1970s at Bell Laboratories. Although C was first developed for writing system software, today it has become such a famous language that a various of software programs are written using this language. The main advantage of using C for programming is that it can be easily used on different types of computers. Many other programming languages such as C++ and Java are also based on C which means that you will be able to learn them easily in the future. Today, C is mostly used with the UNIX operating system. Structure of a C program A C program contains one or more functions, where a function is defined as a group of statements that perform a well-defined task.The program defines the structure of a C program. The statements in a function are written in a logical series to perform a particular task. The most important function is the main() function and is a part of every C program. Rather, the execution o...
Read more

Performance

Performance ( Optional ) * The I/O system is a main factor in overall system performance, and can place heavy loads on other main components of the system ( interrupt handling, process switching, bus contention, memory access and CPU load for device drivers just to name a few. ) * Interrupt handling can be relatively costly ( slow ), which causes programmed I/O to be faster than interrupt driven I/O when the time spent busy waiting is not excessive. * Network traffic can also loads a heavy load on the system. Consider for example the sequence of events that occur when a single character is typed in a telnet session, as shown in figure( And the fact that a similar group of events must happen in reverse to echo back the character that was typed. ) Sun uses in-kernel threads for the telnet daemon, improving the supportable number of simultaneous telnet sessions from the hundreds to the thousands.   fig: Intercomputer communications. * Rather systems use front-end processor...
Read more

HEAT AND THERMODYNAMICS

Heat: * Temperature is the thermal state of the body, that chooses the direction of flow of heat.  * “Heat is a form of energy transfer between two systems or a system and its surroundings due to temperature difference between them.  Specific heat capacity  * Specific heat capacity of a substance is determined as the quantity of heat required to raise the temperature of 1 kg of the substance through 1K. Its unit is J kg^–1K^–1. * The specific heat capacity of water is the highest for any substance, 4180 J/kg K. It is 30 times the specific heat capacity  of mercury which is about 140J/kg K.  Specific Latent Heat  Specific Latent Heat of fusion of any substance is the quantity of heat energy needed to melt one kilogram of a substance without change in temperature. The symbol used is L. The unit for specific  latent heat is Joule/kilogram or J/kg  The Gas Laws  * Boyle’s Law  “Temperature remaining constant, the pressure of a given mass of ...
Read more