NESTED WHILE LOOP

 NESTED WHILE LOOP

java script

 1. SEM 5 CLASS 11 PART1. INTERNET TECHNOLOGY ( TEXT BOX ) - click

2. SEM 5 CLASS 11 PART2. INTERNET TECHNOLOGY ( TEXT BOX WITH COLOR)-click

3. SEM 5 CLASS 11 PART3. INTERNET TECHNOLOGY ( TEXT BOX AND P TAG )- click

4. SEM 5 CLASS 11 PART4. INTERNET TECHNOLOGY ( CALCULATOR USING TEXT BOX )-click

5. SEM 5 CLASS 11 PART5. INTERNET TECHNOLOGY ( EVAL AND TEXT BOX )-click

6. SEM 5 CLASS 11 PART6. INTERNET TECHNOLOGY ( RADIO BUTTON )-click

7. SEM 5 CLASS 11 PART 7. INTERNET TECHNOLOGY ( RADIO BUTTON )-click

8. SEM 5 CLASS 11 PART8 INTERNET TECHNOLOGY ( RADIO 2 )-click

9. SEM 5 CLASS 11 PART 9 INTERNET TECHNOLOGY ( RADIO3 )-click

10. SEM 5 CLASS 11 PART10. INTERNET TECHNOLOGY ( RADIO 4 )-click

11. SEM 5 CLASS 11 PART11. INTERNET TECHNOLOGY (CHECK BOX )-click

12. SEM 5 CLASS 11 PART12. INTERNET TECHNOLOGY ( CHECKBOX )-click

12.SEM 5 CLASS 11 PART12. INTERNET TECHNOLOGY ( CHECKBOX )

 12.SEM 5 CLASS 11 PART12. INTERNET TECHNOLOGY ( CHECKBOX )

11.SEM 5 CLASS 11 PART11. INTERNET TECHNOLOGY (CHECK BOX )

 11.SEM 5 CLASS 11 PART11. INTERNET TECHNOLOGY (CHECK BOX )-

10.SEM 5 CLASS 11 PART10. INTERNET TECHNOLOGY ( RADIO 4 )

 10. SEM 5 CLASS 11 PART10. INTERNET TECHNOLOGY ( RADIO 4 )

9.SEM 5 CLASS 11 PART 9 INTERNET TECHNOLOGY ( RADIO3 )

 9.SEM 5 CLASS 11 PART 9 INTERNET TECHNOLOGY ( RADIO3 )

8.SEM 5 CLASS 11 PART8 INTERNET TECHNOLOGY ( RADIO 2 )

 8.SEM 5 CLASS 11 PART8 INTERNET TECHNOLOGY ( RADIO 2 )

7.SEM 5 CLASS 11 PART 7. INTERNET TECHNOLOGY ( RADIO BUTTON )

 7.SEM 5 CLASS 11 PART 7. INTERNET TECHNOLOGY ( RADIO BUTTON )

6. SEM 5 CLASS 11 PART6. INTERNET TECHNOLOGY ( RADIO BUTTON )

 6. SEM 5 CLASS 11 PART6. INTERNET TECHNOLOGY ( RADIO BUTTON )

5.SEM 5 CLASS 11 PART5. INTERNET TECHNOLOGY ( EVAL AND TEXT BOX )

 5.SEM 5 CLASS 11 PART5. INTERNET TECHNOLOGY ( EVAL AND TEXT BOX )

4. SEM 5 CLASS 11 PART4. INTERNET TECHNOLOGY ( CALCULATOR USING TEXT BOX )

 4. SEM 5 CLASS 11 PART4. INTERNET TECHNOLOGY ( CALCULATOR USING TEXT BOX )

3. SEM 5 CLASS 11 PART3. INTERNET TECHNOLOGY ( TEXT BOX AND P TAG )

 3. SEM 5 CLASS 11 PART3. INTERNET TECHNOLOGY ( TEXT BOX AND P TAG )-

2. SEM 5 CLASS 11 PART2. INTERNET TECHNOLOGY ( TEXT BOX WITH COLOR)

 2. SEM 5 CLASS 11 PART2. INTERNET TECHNOLOGY ( TEXT BOX WITH COLOR)

1. SEM 5 CLASS 11 PART1. INTERNET TECHNOLOGY ( TEXT BOX ) -

  1. SEM 5 CLASS 11 PART1. INTERNET TECHNOLOGY ( TEXT BOX ) - 

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-7)

1. electromagnetic spectrum.

2. guided medium, un-guided medium.

3. twisted pair- UTP,STP

4. RJ-45

5. 10Base-T, 100 Base-T.

6. Coaxial Cable 

7. BNC connector

8. Fiber optic cable

9. angle of incidence, critical angle.

10. cladding.

11. multimode step-index fiber, multimode graded-index fiber,

12. single mode

13. SC connector, ST connector

14. advantages , disadvantages of medium.

15. wireless communication.

16. ground propagation, sky propagation, line of sight propagation.

17. Radio wave, micro wave

18. omni unidirectional antenna, unidirectional antenna, parabolic dish antenna, horn antenna.

19. Short note - Infrared.

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-6)

1. Def - Multiplexing process, demultiplexing process, link, carrier frequency

2. FDM , TDM , WDM, Statistical , 

3. Guard band, interleaving

4. group, super group, master group, jumbo group.

5. framing bits

6. bit padding.

7. T-lines, E-lines.

8. Inverse TDM

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-5)

1. modulation and demodulation

2. ASK,PSK,FSK,QAM -- def, diagram , example, advantages , disadvantages .

3. Bandwidth of ASK,FSK.

4. Constellation diagram

5. dibit,tribit,quadbit.

6. MODEM.

7. Modulation, demodulation.

8. AM,PM,FM -- def, diagram , example, advantages , disadvantages .

9. AM bandwidth, FM bandwidth.

10. Trellis coding.

11. minimum required bandwidth of ASK,FSK.

12. advantages of QAM and PSK over ASK

13. Frequencies use of basic telephone line.

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-4)

1. What is line coding?characteristics of line coding.

2. Signal level vs data level.

3. Pulse rate vs bit rate

4. DC component.

5. Self synchronisation.

6. unipolar , polar , bipolar line coding.

7. NRZ,RZ,Manchester, Differential manchester,NRZ-L,NRZ-I.

8. Block coding.

9. Sampling, PAM, PCM. 

10. Transmission mode.

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-3)

1. bit rate , bit synchronization.

2. what is signal?

3. What is analog signal,digital signal?

4. What is periodic signal, aperiodic signal? 

5. def-peak amplitude, time domain, frequency domain, composite signal, bandwidth.

6. Bit rate, bit interval, baud rate.

7. Low pass channel, band pass channel.

8. analog transmission, digital transmission

9. noisy channel, noise lesschannel.

10. Shannon capacity, Nyquist bit rate.
11. transmission impairement--attenuation, distortion,noise, cross-talk
12. decibel
13. throughput, propagation time, propagation speed, wavelength

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-2)

1. Network model.

2. Functions of each layer of OSI model.

3. Functions of each layer of TCP/IP model.

4. header,trailer of data.

5. framing 

6. hop-to-hop delivery, source-to-destination delivery, process-to-process delivery

7. logical addressing , routing, port address

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-1)

1. Component of data communication..

2. Network criteria.
3. Point to point protocol, multi-point protocol
4. Various types of topology,and their advantages,disadvantages.
5. Various types of networking, and their advantages, disadvantages.
6. Difference between internet and intranet.
7. ARPANET

PROLOG PROGRAM LIST:::

 1. introduction

2.arithmetic

3. List: click

1. BIRYINI IS A FOOD.

QUESTION:? 

A) IS BIRIYANI A FOOD?

B) IS MOMO  A FOOD?

CLICK HERE

2. 

BIRYINI IS A FOOD.

MOMO IS A FOOD.

QUESTION:? 

A) HOW MANY FOODS?

B) IF ALL FOODS ARE MEAL , THEN DISPLAY ALL MEALS.

CLICK HERE

3.

BIRYINI IS A FOOD.

MOMO IS A FOOD.

BIRIYANI IS A LUNCH.

QUESTION:? 

A) WHICH ITEMS ARE IN LUNCH?

CLICK HERE

PROLOG -> PROGRAM 3

 BIRYINI IS A FOOD.

MOMO IS A FOOD.

BIRIYANI IS A LUNCH.

QUESTION:? 

A) WHICH ITEMS ARE IN LUNCH?

PROLOG -> PROGRAM 2

 BIRYINI IS A FOOD.

MOMO IS A FOOD.

QUESTION:? 

A) HOW MANY FOODS?

B) IF ALL FOODS ARE MEAL , THEN DISPLAY ALL MEALS.

PROLOG -> PROGRAM 1

 

1. BIRYINI IS A FOOD.

QUESTION:? 

A) IS BIRIYANI A FOOD?

B) IS MOMO  A FOOD?

8. If L is a context-free language, then we can construct a pda A accepting L by empty store, i.e. L = N(A).

 8. If L is a context-free language, then we can construct a pda  A accepting L by empty store, i.e. L = N(A).

7. Construct a pda A accepting the set of all strings over {a, b} with equal number of a's and b's.

 7. Construct a pda A accepting the set of all strings over {a, b} with equal  number of a's and b's.

Construct a pda A accepting L = {WCWT } by final state.

 Construct a pda A accepting L = {WCW^T } by final state. 

5. deterministic pda

 5. deterministic pda

4. move of pushdown automaton.

 4. move of  pushdown automaton. 

3. instantaneous description (ID) of pushdown automaton.

 3. instantaneous description (ID) of pushdown automaton.

III ) Design a TM that accepts {0N1N: n >=1}.

  III )  Design a TM that accepts {0^N1^N: n >=1}.

Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

 Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

2. Definition - pushdown automaton.

 2. Definition -  pushdown automaton.

1. Model of a pushdown automaton.

 1. Model of a pushdown automaton.

NUMERICAL ANALYSIS CLASS LAB CLASS - 1

5. DESIGN OF TURING MACHINES -

 I )  Design a Turing machine to recognize all stlings consisting of an even number

             of 1's.

4. INPUT PROCESSING USING ID.

 4. INPUT PROCESSING USING ID.

3. MOVES OF TURING MACHINE USING ID.

 3. MOVES OF TURING MACHINE USING ID.

2. REPRESENTATION OF TURING MACHINE.

 

1. DEFINITION TURING MACHINE .

 1. DEFINITION TURING MACHINE . 

question theory of automata from Mishra CHAPTER 9

 1. DEFINITION TURING MACHINE .  ANSWER LINK  + 

2. REPRESENTATION OF TURING MACHINE.  ANSWER LINK

3. MOVES OF TURING MACHINE USING ID.  ANSWER LINK + 

4. INPUT PROCESSING USING ID.  ANSWER LINK

5. DESIGN OF TURING MACHINES - 

         I )  Design a Turing machine to recognize all stlings consisting of an even number

             of 1's. ANSWER LINK + 

        II )  Design a Turing machine over {I. b} which can compute a concatenation

              function over L = {I}. If a pair of words (W1,W2) is the input. the output has

              to be W1.W2. ANSWER LINK

      III )  Design a TM that accepts {0^N1^N: n >=1}. ANSWER LINK

     IV )  Design a Turing machine M to recognize the language  1^N2^N3^N :N>=1

      V)   Construct a TM that accepts the language 0 1* + 1 0*.

     VI)  Design a TM which can multiply two positive integers.

     VII) NONDETERMINISTIC TURING MACHINES . 

 

question theory of automata from Mishra CHAPTER 5

 

question theory of automata from Mishra CHAPTER 5

1. REGULAR EXPRESSIONS

2. IDENTITIES FOR REGULAR EXPRESSIONS

3. NDFAs WITH A-MOVES AND REGULAR EXPRESSIONS

4. Any set L accepted by a finite automaton M is represented by

a regular expression.

5. CONVERSION OF NONDETERMINISTIC SYSTEMS TO

DETERMINISTIC SYSTEMS

6. ALGEBRAIC METHOD USING ARDEN'S THEOREM

7. CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT

TO A REGULAR EXPRESSION.

8. EQUIVALENCE OF Two FINITE AUTOMATA

9. EQUIVALENCE OF Two REGULAR EXPRESSIONS

10. PUMPING LEMMA FOR REGULAR SETS

11. CLOSURE PROPERTIES OF REGULAR SETS

12. REGULAR SETS AND REGULAR GRAMMARS

question theory of automata from Mishra CHAPTER 6

 question theory of automata from Mishra CHAPTER 6

1. Construct a context-free grammar G generating all integers (with sign).

2. DERIVATION TREES

3. leftmost derivation and rightmost derivation.

4. AMBIGUITY IN CONTEXT-FREE GRAMMARS

5. If G is the grammar S -> SbS | a, show that G is ambiguous.

6. CONSTRUCTION OF REDUCED GRAMMARS.

7. ELIMINATION OF NULL PRODUCTIONS

8. ELIMINATION OF UNIT PRODUCTIONS

9. CHOMSKY NORMAL FORM

10. GREIBACH NORMAL FORM

question theory of automata from Mishra CHAPTER 7

 1. Model of a pushdown automaton.  ANSWER LINK + 

2. Definition -  pushdown automaton.  ANSWER LINK+ 

3. instantaneous description (ID) of pushdown automaton. + ANSWER LINK

4. move of  pushdown automaton.  ANSWER LINK

5. deterministic pda ANSWER LINK

6. Construct a pda A accepting L = {WCW^T } by final state. +  - ANSWER LINK

7. Construct a pda A accepting the set of all strings over {a, b} with equal  number of a's and b's. +
ANSWER LINK 

8. If L is a context-free language, then we can construct a pda  A accepting L by empty store, i.e. L = N(A).ANSWER LINK

question theory of automata from Mishra CHAPTER 4

 question theory of automata from Mishra CHAPTER 4 

1. DEFINITION OF A GRAMMAR

2. DERIVATIONS AND THE LANGUAGE GENERATED

BY A GRAMMAR

3. CHOMSKY CLASSIFICATION OF LANGUAGES

4. RECURSIVE AND RECURSIVELY ENUMERABLE SETS

THEORY OF COMPUTATION QUESTION SET:

 CHAPTER 3 : THE THEORY OF AUTOMATA  LINK

 CHAPTER 4 :   FORMAL LANGUAGES LINK

 CHAPTER 5 :  REGULAR SETS AND  REGULAR GRAMMARS LINK

 CHAPTER 6 : CFG LINK

 CHAPTER 7 :  PUSH DOWN AUTOMATA LINK

 CHAPTER 9 : TURING MACHINE  LINK

29. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order.

 29. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order.

BUBBLE SORT TECHNIQUE:

C++ CODE: 

28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void.

 28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void.

27. Copy the contents of one text file to another file, after removing all whitespaces.

 27. Copy the contents of one text file to another file, after removing all whitespaces.

26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks

 26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks

25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file.

 25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file.

24. Create a class Box containing length, breath and height. Include following methods in it: a) Calculate surface Area b) Calculate Volume c) Increment, Overload ++ operator (both prefix & postfix) d) Decrement, Overload -- operator (both prefix & postfix) e) Overload operator == (to check equality of two boxes), as a friend function f) Overload Assignment operator g) Check if it is a Cube or cuboid Write a program which takes input from the user for length, breath and height to test the above class.

 24. Create a class Box containing length, breath and height. Include following methods in it:

              a) Calculate surface Area

              b) Calculate Volume

              c) Increment, Overload ++ operator (both prefix & postfix)

              d) Decrement, Overload -- operator (both prefix & postfix)

              e) Overload operator == (to check equality of two boxes), as a friend function

              f) Overload Assignment operator

              g) Check if it is a Cube or cuboid Write a program which takes input from the user for                             length, breath and height to test the above class.

23. Create a class Triangle. Include overloaded functions for calculating area. Overload assignment operator and equality operator.

 23. Create a class Triangle. Include overloaded functions for calculating area. Overload assignment operator and equality operator.

22. Create the Person class. Create some objects of this class (by taking information from the user). Inherit the class Person to create two classes Teacher and Student class. Maintain the respective information in the classes and create, display and delete objects of these two classes (Use Runtime Polymorphism).

 22. Create the Person class. Create some objects of this class (by taking information from the user). Inherit the class Person to create two classes Teacher and Student class. Maintain the respective information in the classes and create, display and delete objects of these two classes (Use Runtime Polymorphism).

21. Create Matrix class using templates. Write a menu-driven program to perform following Matrixoperations (2-D array implementation): a) Sum b) Difference c) Product d) Transpose

 21. Create Matrix class using templates. Write a menu-driven program to perform following Matrixoperations (2-D array implementation): a) Sum b) Difference c) Product d) Transpose

COMPUTER GRAPHICS question set (PAKHIRA)

  CHAPTER 9

1. window and view port

2. clipping

3. Cohen_Sutherland algo

4. Midpoint subdivision'

5. Sutherland-Hodgman algo

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 8

1. Parallel projection, Perspective projection

2. orthographic,oblique

3. Vanishing point

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 7

1. 3D Translation, scaling , rotation

2. 3D rotation about a reference point

4. 3D reflection

5. 3D reflection about a reference point

6. 3D shearing

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 5

1. Translation, scaling , rotation

2. Translation, scaling , rotation about a reference point

3. homogeneous coordinate system

4. reflection

5. reflection about a reference point

6. shearing

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 4

1. polygon - concave,convex, scan conversion.

2. odd-even method.

3. winding number method.

4. Boundary fill

5. Flood fill.

6. scan line fill

7. Scan line seed fill.

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 3

1. Scan conversion method

2. ploynomial method of line, cicrle.

3. DDA for a line, circle.

4. advantage and disadvantage of DDA.

5. Bresssenham's algorithm for line, circle.

6. Midpoint method of line, circle,ellipse.

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 2

1. Raster Scan Display.

2. Working principle of CRT.

3. Interlacing.

4. Aspect ratio.

5. RGB & CMY color system.

6. frame buffer.

7. LUT.

8. LCD

9. Random scan devices.

10. Memory tube displays.

COMPUTER GRAPHICS question set (PAKHIRA)

 CHAPTER 1

1. Application of computer graphics.

2. Operation of computer graphics.

Deadlock:

 Operating System Question Set 

GALVIN

1. What is deadlock?

2. Request , Use, Release.

3. Necessary condition of deadlock.

4. Resource allocation graph.

5. Safe state , safe sequence, unsafe state.

6. Deadlock prevention, deadlock avoidance, deadlock recoverey.

7. Bakers algorithm- i) deadlock avoidance, ii) resource request 

File system:

 Operating System Question Set 

GALVIN

1. File attributes, File operations.

2. Aceess method.

3. Single level directory, two level directory.

4. Absolute path, relative path.

5. link

6. mount point

7. read write permission.

8. Contiguous alloaction, linked alloacation, indexed alloacation, 

9. Inode.

10. FAT,NTFS.

Disk Scheduling:

 Operating System Question Set 

GALVIN

1. FCFS, SSTF, SCAN, C-SCAN , LOOK ,

2. RAID STRUCTURE

Process synchronisation:

Operating System Question Set 
GALVIN

 1. code of producer consumer process.

2. race condition, critical section , starvation.
3. Peterson's solution.
4. semaphore - counting semaphore, binary semaphore.
5. spinlock.
6. bounded buffer problem.
7. Reader writer problem.
8. Dining philosopher problem.
9.  Producer consumer process using semaphore.
10. Monitor.
11. Bounded buffer problem using semaphore.
12. Dining philosopher problem using semaphore.
13.  Reader writer problem using semaphore.

Memory management.

 Operating System Question Set 

GALVIN

1. Address binding.

2. Base register and limit register.
3. memory protection.
4. Compile time, load time, execution time.
5. logical address, physical address.
6. dynamic loading.
7.  static linking and dynamic lining.
8. Swapping.
9. First fit, best fit, worst fit.
10. internal fragmentation, external fragmentation, 50-percent rule.
11. Paging, TLB.
12. Re-entrant code.
13. Hierarchical paging.
14. inverted page table
15. segmentation,  segmentation with paging .
16. virtual memory, demand paging.
17. Page replacement technique.
18. thrashing.
19. Working set model.
20. Buddy system.

PROCESS:

 Operating System Question Set 

GALVIN

1. What is Process?

2. Describe the structure of process in memory.
3. Show the diagram of process state.
4. What is Process Control Block?
5. Define CPU scheduling.
6. What are the various process scheduling concepts?
7. What is preemptive and non preemptive scheduling?
8. What is a Dispatcher?
9. What is dispatch latency?
10. What are the various scheduling criteria for CPU scheduling?
11. Define throughput.
12. What is turnaround time?
13.What is the objective of process scheduler?
14. Define job queue,ready queue.
15, Draw he queuing diagram of process.
16. Explain the term scheduler,short term scheduler,medium term scheduler,long term scheduler.
17. What do you mean by degree of multi programming?How it is related to scheduler?
18. What do you mean by I/O bound process and CPU bound process?
19. convoy effect, aging.

THREAD:

 Operating System Question Set 

GALVIN

1. definition.

2. single threaded and multi-threaded process.
3. synchronisation of thread.

INTRODUCTION:

 Operating System Question Set 

GALVIN

1. Differentiate between tightly coupled systems and loosely coupled systems.

2. Define OS

3. What are the differences between Batch OS and Multiprogramming?
4. What are the differences between Multitasking and Multiprogramming?
5. What is Clustered System?
6. What is Real Time System? List out their types.
7. What is the kernel?
8. What are the three main purposes of an operating system?
9. What are batch systems?
10. What do you mean by system calls?
11. Explain the various types of computer systems.
12. Explain how protection is provided for the hardware resources by the operating system.
13. What are the system components of an operating system and explain them?
14. What is mainframe computer?
15. What is workstations?
16. What is server?
17. What is bootstrap program?
18. What is firmware?
19. What is  symmetric multiprocessing (SMP) and asymmetric multiprocessing?
20. What is hot-standby mode?
21. What is response time
22. What is interactive (or hands-on) computer system
23. What is Time sharing (or multitasking)
24. What is Real-Time Embedded Systems
25. What is Handheld systems
26. What is Client-Server Computing
27. What is peer-to-peer (P2P) system