Progress over Perfection

Monthly archives for April, 2015

GPSC 2015: Solved Paper for Assistant...

GPSC 2015: Solved Paper for Assistant Professor-IT

GPSC 2015 ( 26 April) ANSWER KEYS of GPSC Exam (Information Technology) 001. In which of the following, resource allocation is not required? (A) Circuit Switching (B) Packet Switching (C) Frame Switching (D) Circuit Switching and Packet Switching Answer: B 002. Which logic gate can be used to realize and to get all functions of […]

Managing network Devices: SNMP

Managing network Devices: SNMP

SNMP is the most widely used and popular protocol for managing, monitoring and controlling of network devices like routers, switches over a public or private network. SNMP provides a framework for managing devices using TCP/IP Protocol suit. SNMP uses the concept of manager and agent For a network there may be few managers and set of […]

Practice Set 4 : Computer Security &#...

Practice Set 4 : Computer Security – GPSC

1. CIA is known as: a. Confidentiality, Integrity, and Availability b. Computers, Information, and Assets c. Confidence In Applications d. Controls, Integrity, and Availability 2. The primary reason why users are told to use strong passwords is not: a. It is more difficult to “shoulder surf” a strong password because of the additional keystrokes b. […]

Practice Set 3 : Computer Network ...

Practice Set 3 : Computer Network – GPSC

For Questions 1, 2 & 3, there are two statements Assertion (a) and Reason (r). Choose (A) Both (a) and (r) are true and (r) is the correct reason for (a). (B) Both (a) and (r) are true but (r) is not the correct reason for (a). (C) Both (a) and (r) are false. (D) […]

Practice Set 2 : Operating System – G...

Practice Set 2 : Operating System – GPSC

1. A computer running the Windows operating system has nearly exhausted available physical memory for active processes. In order to avoid exhausting all available memory, what should the operating system begin doing? a. Swapping b. Paging c. Killing old processes d. Running the garbage collector 2. The innermost portion of an operating system is known […]

Image Enhancement in the Spatial Doma...

Image Enhancement in the Spatial Domain: VC++

Image enhancement approaches fall into two broad categories: 1. Spatial domain methods and 2. Frequency domain methods The term spatial domain refers to the image plane itself, and approaches in this category are based on direct manipulation of pixels in an image. Spatial domain refers to the aggregate of pixels composing an image. Spatial domain methods are procedures that […]

Ambiguity and Simplification Algorith...

Ambiguity and Simplification Algorithms of CFG

Ambiguity in CFG A CFG G is ambiguous if there is at least one string w in L(G) having 2 or more derivation trees. example: Let CFG G : S → S + S | a The string a + a + a ∈ L(G) has 2 left most derivatives as shown below, so given G is […]

Practice Set 1 : Computer Network – G...

Practice Set 1 : Computer Network – GPSC

1. All of the following statements about the TCP protocol are true except: a. Correct order of delivery is guaranteed b. Connectionless c. Connection oriented d. Missing packets will be retransmitted 2. The purpose of the NTP protocol is: a. Transfer the contents of a file b. Synchronization of computer clocks to a reference clock […]

PDA: Push Down Automata Designing

PDA: Push Down Automata Designing

PDA from CFL L = {anbn > 0} Accepted strings = {ab, aabb, aaabbb, …} δ(q0, a, Z) = (q0, aZ)   // q0 is the initial state, a is the current input symbol and Z is the top of the stack then push a in the stack δ(q0, a, a) = (q0, aa)   // q0 is the […]

Automata Theory: An Introduction

Automata Theory: An Introduction

Automata Mathematical representation of formal language (FL) is known as automata. Automata theory is a subject which describes the behavior of automatic machines mathematically. In Computer Science the word automata is used for recognizer or acceptor as well as transducer (machine with output capability). Types of Automata: There are four types of automata: Finite Automata (FA) […]