1. Introduction to Computers and Python

(28 Questions)

Are you completely new to programming? If not then we presume you will be looking for information about why and how to get started with Python. Fortunately an experienced programmer in any programming language (whatever it may be) can pick up Python very quickly. It’s also easy for beginners to use and learn, so jump in!

2. Elementary Programming

(34 Questions)

Python is a computer programming language that lets you work more quickly than other programming languages. Experienced programmers in any other language can pick up Python very quickly, and beginners find the clean syntax and indentation structure easy to learn. This quiz tests elementary programming language in python.

3. Functions, Strings & Objects

(25 Questions)

Python classes provide all the standard features of Object Oriented Programming: the class inheritance mechanism allows multiple base classes, a derived class can override any methods of its base class or classes, and a method can call the method of a base class with the same name. Objects can contain arbitrary amounts and kinds of data. Strings are the most popular types in Python. We can create them simply by enclosing characters in quotes. Python gives you many built-in functions like print(), etc. but you can also create your own functions. These functions are called user-defined functions. This quiz tests the knowledge on functions, Strings and Objects. Let us see how much you score ?

4. Selections

(24 Questions)

In this quiz you will be tested about selection statements, which allow a program to choose when to execute certain instructions. For example, a program might choose how to proceed on the basis of the user’s input. As you will be able to see, such statements make a program more versatile.

5. Loops

(9 Questions)

In general, statements are executed sequentially: The first statement in a function is executed first, followed by the second, and so on. There may be a situation when you need to execute a block of code several number of times. Programming languages provide various control structures that allow for more complicated execution paths. A loop statement allows us to execute a statement or group of statements multiple times.

6. Functions

(21 Questions)

Functions are little self-contained programs that perform a specific task, which you can incorporate into your own, larger programs. After you have created a function, you can use it at any time, in any place. This saves you the time and effort of having to retell the computer what to do every time it does a common task, for example getting the user to type something in.

7. Objects & Classes

(16 Questions)

Python is called an “object-oriented programming language.” This means there is a construct in Python called a class that lets you structure your software in a particular way. Using classes, you can add consistency to your programs so that they can be used in a cleaner way.

8. More on Strings and Special Methods

(23 Questions)

Strings are among the most popular types in Python. We can create them simply by enclosing characters in quotes. Python treats single quotes the same as double quotes. Creating strings is as simple as assigning a value to a variable.

9. GUI Programming Using Tkinter

(42 Questions)

The tkinter package is a thin object-oriented layer on top of Tcl/Tk. To use tkinter, you don’t need to write Tcl code, but you will need to consult the Tk documentation, and occasionally the Tcl documentation. tkinter is a set of wrappers that implement the Tk widgets as Python classes. In addition, the internal module _tkinter provides a threadsafe mechanism which allows Python and Tcl to interact. tkinter‘s chief virtues are that it is fast, and that it usually comes bundled with Python.

10. Lists

(37 Questions)

The list type is a container that holds a number of other objects, in a given order. The list type implements the sequence protocol, and also allows you to add and remove objects from the sequence. This quiz aims to test the knowledge of Lists in Python programming language.

11. Multidimensional Lists

(17 Questions)

There are situations that demand multi-dimensional arrays or matrices. In many languages (Java, COBOL, BASIC) this notion of multi-dimensionality is handled by pre-declaring the dimensions (and limiting the sizes of each dimension). In Python, these are handled somewhat more simply. This quiz tests the knowledge of multidimensional lists in Python programming language.

12. Inheritance and Polymorphism

(22 Questions)

Inheritance allows programmer to create a general class first then later extend it to more specialized class. It also allows programmer to write better code. Using inheritance you can inherit all access data fields and methods, plus you can add your own methods and fields, thus inheritance provide a way to organize code, rather than rewriting it from scratch.

13. Files and Exceptions Handling

(22 Questions)

An exception is an error that happens during the execution of a program. Exceptions are known to non-programmers as instances that do not conform to a general rule. The name “exception” in computer science has this meaning as well: It implies that the problem (the exception) doesn’t occur frequently, i.e. the exception is the “exception to the rule”. Exception handling is a construct in Python to handle or deal with errors automatically.

14. Tuples, Sets, and Dictionaries

(37 Questions)

Your brain still hurting from the last quiz? Never worry, this one will require a little less thought. We’re going back to something simple – variables – but a little more in depth.

• Lists are what they seem – a list of values. Each one of them is numbered, starting from zero – the first one is numbered zero, the second 1, the third 2, etc. You can remove values from the list, and add new values to the end. Example: Your many cats’ names.
• Tuples are just like lists, but you can’t change their values. The values that you give it first up, are the values that you are stuck with for the rest of the program. Again, each value is numbered starting from zero, for easy reference. Example: the names of the months of the year.
• Dictionaries are similar to what their name suggests – a dictionary. In a dictionary, you have an ‘index’ of words, and for each of them a definition. In python, the word is called a ‘key’, and the definition a ‘value’. The values in a dictionary aren’t numbered – tare similar to what their name suggests – a dictionary. In a dictionary, you have an ‘index’ of words, and for each of them a definition. In python, the word is called a ‘key’, and the definition a ‘value’. The values in a dictionary aren’t numbered – they aren’t in any specific order, either – the key does the same thing. You can add, remove, and modify the values in dictionaries. Example: telephone book.

15. Recursion

(19 Questions)

Recursion is a way of programming or coding a problem, in which a function calls itself one or more times in its body. Usually, it is returning the return value of this function call. If a function definition fulfills the condition of recursion, we call this function a recursive function. A recursive function has to terminate to be used in a program (Termination condition). A recursive function terminates, if with every recursive call the solution of the problem is downsized and moves towards a base case. A base case is a case, where the problem can be solved without further recursion. A recursion can lead to an infinite loop, if the base case is not met in the calls.

16. Developing Efficient Algorithms

(21 Questions)

Algorithms have been commonly defined in simple terms as “instructions for completing a task”. They’ve also been called “recipes”. In The Social Network, an algorithm is what Zuckerberg needed to make Facemash work. If you saw the movie, you probably remember seeing what looked like a scribbly equation on a window in Mark’s dorm room. But what does that scribbly algebra have to do with Mark’s simple “hot or not” site?

17. Sorting

(18 Questions)

Sorting is ordering a list of objects. We can distinguish two types of sorting. If the number of objects is small enough to fits into the main memory, sorting is called internal sorting. If the number of objects is so large that some of them reside on external storage during the sort, it is called external sorting. This Python quiz is aimed at students, enthusiasts and job seekers with little or no programming experience. It aims to provide them with an understanding of the role of computers and python programming language.

18. Linked Lists, Stacks, Queues, and Priority Queues

(20 Questions)

In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently.Test your knowledge on these important data structures in this quiz.

19. Binary Search Trees

(11 Questions)

In computer science, binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of containers: data structures that store “items” (such as numbers, names etc.) in memory. They allow fast lookup, addition and removal of items, and can be used to implement either dynamic sets of items, or lookup tables that allow finding an item by its key (e.g., finding the phone number of a person by name).

20. AVL Trees

(7 Questions)

An AVL tree is another balanced binary search tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamically balanced trees to be proposed. Like red-black trees, they are not perfectly balanced, but pairs of sub-trees differ in height by at most 1, maintaining an O(logn) search time.

21. Hashing

(9 Questions)

Although it is a matter of opinion, you can’t help but admire the idea of the hash function. It not only solves one of the basic problems of computing – finding something that you have stored somewhere but it helps with detecting file tampering, password security and more.

22. Graphs and Applications

(9 Questions)

A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links. The interconnected objects are represented by points termed as vertices, and the links that connect the vertices are called edges. Formally, a graph is a pair of sets (V, E), where V is the set of vertices and E is the set of edges, connecting the pairs of vertices.

23. Weighted Graph ApplicationsSection

(9 Questions)

It is often necessary to associate weights or other values with the edges of a graph. Such a “weighted” or “edge-labeled” graph can be defined as a triple G = (E, V, w) where w : E → eVal is a function mapping edges or directed edges to their values, and eVal is the set (type) of possible values. For a weighted graph eVal would typically be the real numbers, but for edge-labeled graphs they could be any type.

If you are preparing for interviews you most definitely need an awesome resume to go along with your job search. A great place to build your resume for free is PaanGO’s Resume Builder. Its easy, free and gets the job done in minutes.

If you liked this article please take some time to share it in your social network. Wish you all the best!