PDAF announces the Biggest Opportunity for the Emerging Artists of India

Mumbai: It’s good news for the innovative and experimental group of Indian talent, who are contributing their best in the fields of arts! The Prafulla Dahanukar Art Foundation (PDAF) has announced the ‘Emerging Artist Contest’, to encourage talented artists by recognizing their work with Gold, Silver, and Bronze Awards in the disciplines of Painting, Sculpture, Ceramics, Print Making, Installations, and Photography. 

The awards are specific to each State and therefore 18 individuals will be awarded in each of India’s 30 States, amounting to a total of 540 awards. In addition, the Foundation will present 18 awards on an all-India basis; one of them being the coveted ‘Emerging Artist Award for 2015.’ The winner of this award will be felicitated and given the opportunity to hold a solo exhibition at a prominent art gallery in Mumbai, with all expenses paid for by the foundation. Furthermore, the winning artists will be showcased on the internet, in the ‘Directory of Emerging Artists’, that will be created by the Prafulla Dahanukar Art Foundation, along with a yearbook for the same.

AWARDS & PRIZES

Rs. 1 Crore Prizes for the Emerging Artists!

All India PDAF Prizes
Category		Category		Category
	Prize Rs.		Prize Rs.		Prize Rs.
Painting		Ceramics		Installation
Gold	40000	Gold	40000	Gold	40000
Silver	20000	Silver	20000	Silver	20000
Bronze	10000	Bronze	10000	Bronze	10000
Sculpture		Printmaking		Photography
Gold	40000	Gold	40000	Gold	40000
Silver	20000	Silver	20000	Silver	20000
Bronze	10000	Bronze	10000	Bronze	10000
Special All India Prizes
Dr. K. Anji Reddy Prize for best Installation All India of Rs. 2 lacs.
Bajaj Electricals Ltd. Prize for best Painting All India of Rs. 2 lacs
JehangirSabavala Prize for best Stylized Landscape Painting Rs. 25000
K H Ara Prize for best Still Life Painting Rs. 25000
M F Hussain Prize for best Stylized Figure Painting Rs. 25000
PrafullaDahanukar Prize for best Abstract Painting Rs. 25000
V A Mali Prize for best Portrait Painting  Rs. 25000
Ramesh Pateria Prize for best Marble Sculpture Rs. 25000
S M Dahanukar Prize for best Fine Art Wedding Photograph Rs. 25000

PDAF Prizes in the States of:
Central Zone		East Zone			West Zone
Chattisgarh		Bihar			Goa
Madhya Pradesh		Jharkhand			Gujarat
Rajasthan		Odisha			Maharashtra
Uttar Pradesh		Sikkim
		West Bengal
North Zone		North East Zone			South Zone
Chandigarh		Arunachal Pradesh			Andhra Pradesh
Delhi		Assam			Karnataka
Haryana		Manipur			Kerala
Himachal Pradesh		Meghalaya			Puducherry
Jammu & Kashmir		Mizoram			Tamil Nadu
Punjab		Nagaland			Telengana
Uttarkhand		Tripura
PDAF States Prizes
Category		Category			Category
	Prize Rs.			Prize Rs.		Prize Rs.
Painting		Ceramics			Installation
Gold	45000	Gold		20000	Gold	20000
Silver	10000	Silver		10000	Silver	10000
Bronze	5000	Bronze		5000	Bronze	5000
Sculpture		Printmaking			Photography
Gold	20000	Gold		20000	Gold	20000
Silver	10000	Silver		10000	Silver	10000
Bronze	5000	Bronze		5000	Bronze	5000
Metro Cities Prizes for Painting Category
Ahmedabad			Rs. 1,10,000
Bangaluru			Rs. 1,10,000
Chennai			Rs. 1,10,000
Delhi			Rs. 1,10,000
Hyderabad			Rs. 1,10,000
Indore			Rs. 1,10,000
Kolkata			Rs. 2,10,000
Mumbai			Rs. 1,10,000

 

The Prafulla Dahanukar Art Foundation (PDAF) is a registered charity trust founded in memory of the award winning Indian painter and artist PrafullaDahanukar. The Foundation finds benefactors amongst the top artists of India and is effectively a fund for the artists, by the artists. “The purpose of the initiative is to create a strong network amongst the artists’ community, simultaneously recognizing and publicizing the works of talented & emerging artists from every part of India,”said Dilip Dahanukar, husband of the late Prafulla Dahanukar, and trustee, PDAF, while talking about this had this program.

Artists interested in applying for these awards can check the details on: www.prafullafoundation.com

Distributed Computing's Question Papers!!!

Distributed Computing  -->>

These are the questions compiled together from all the previous years' question papers of Distributed Computing. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

DOWNLOAD PDF

• Asynchronous Transfer Mode technology 
• Replication Transparency
• Thrashing (3)
• Callback RPC (2)
• Difference: Monolithic kernel and Microkernel approaches for designing a Distributed OS.
• Difference: Load balancing and Load sharing approaches for process scheduling in DS. (2)
• Various address space transfer mechanisms for a process migration facility.
• Client-server binding? Role of binding agent in locating server? (2)
• Difference: PRAM consistency model and Processor consistency model.
• Difference: Replication and Caching
• Immutable file? How basic file operations create, read, write and delete can be performed in file system for shared files. 
• 3 Different process addressing mechanism. Adv. And Disadv. 
• Difference: Stateful and Stateless servers. Why some Distributed applications use stateless servers even when stateful in easy?
• Adv. And Disadv. Of various data locating mechanism that may be used in Distributed shared memory system that uses the NRMB strategy. (2)
• Distributed Computing environment (2)
• Mach Distributed System
• Name Space
• Election algorithms (3) Bully algorithm
• Distributed Operating System
• Happened Before
• Difference: Bridge, Router, Gateway
• Difference: Strong consistency model and Causal consistency model
• Stub? How generated? How helpful in making an RPC mechanism transparent?
• Logical clock? Importance in DS? 
• Preemptive process migration. Different address space transfer mechanisms used in the process transfer?
• Why do most RPC systems support call by value semantics for parameter passing?
• Threads? (2) How different from processes?
• Adv. And Disadv. Of using Full-file cacking and Block caching models for the data caching mechanism of a distributed file system.
• Munin distributed shared memory system
• Mach distributed system
• Group communication in message passing
• Lightweight RPCs
• Issues in designing Distributed operating systems.
• Failure handling in message passing
• Desirable features of a good message passing system
• DCE directory service
• Adv. Of DSM
• Implementation of RPC mechanism. Diagram.
• Different consistency models? How sequential consistency model implemented in DSM?
• Desirable features of a good process migration mechanism?
• NFS?
• Clock synchronization algorithms used in DS. Discuss 1. 
• Chorus
• VMTP protocol
• Lightweight RPC
• Marshalling
• Processor Pool Model
• Multidatagram messages
• Sequential consistency
• System-oriented Names
• Total freezing in address space transfer mechanism for a process migration facility with diagram? 
• Memory consistency in Distributed Shared memory model?
• FLIP protocol

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

Wireless & Mobile Technology's Question Papers!!!

Wireless & Mobile Technology  -->>

These are the questions compiled together from all the previous years' question papers of WIRELESS & MOBILE TECHNOLOGY. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

DOWNLOAD PDF 

1. Operation of Cellular networks
2. Transmission impairments effecting the wireless transmission? (4) Free space loss?
3. GSM Network Architecture? (3) Its concept of physical channel.
4. How is security provided in the WAP using the Wireless Transport Layer Security?
5. Spread Spectrum? Its 3 benefits. (4)
6. FHSS? (4)
7. DSSS? (4)
8. Operation of Mobile IP?
9. Applications of Wireless LAN?
10. Protocol architecture of Bluetooth. (3)
11. CDMA technique with example. (4) CDMA architecture
12. How capacity of satellite is allocated using frequency division?
13. Architecture and services provided by IEEE 802.11 (4) How is SSID discovered?
14. Convolutional codes? (4)
15. Block codes? (2)
16. Infrared LANs
17. Piconets and Scatternets (2)
18. TDD
19. Antennas
20. Fading? Fast and Slow fading. (4)
21. WAP Protocol stack (2)
22. What is the principle of reuse in cellular network? How does handoff(or handover) take place in cellular phone? (4)
23. Why is reflection both useful and harmful?
24. 3 generations of cellular phone? Adv. Of CDMA as compared to GSM and FDM? (2)
25. Relationship between master and slave piconet? Active State and parked State? (3) How Bluetooth device avoid interfering with 802.11 in the same area?
26. IEEE 802.16 for broadband wireless architecture (3)
27. WiFi Protected access(WPA) and WPA 2
28. Explain 3 digital modulation techniques: ASK, FSK, PSK. (3)
29. WAP? WML? WDP?
30. Application areas supported by Bluetooth? How security is achieved in Bluetooth?
31. XHTML
32. WCDMA
33. WEP and WAP
34. MIDP
35. GPRS Architecture
36. Difference: GSM and GPRS.
37. Antennas and its types.
38. Frequency Reuse

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

Advanced Web technology & Dot Net's Question Papers!!!

Advanced Web technology & Dot Net  -->>

These are the questions compiled together from all the previous years' question papers of ADVANCED WEB TECHNOLOGY & DOT NET. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

DOWNLOAD PDF

1. Architecture of .Net framework (4)
2. Difference: J2ee and .Net (4), Postback and Crosspage posting (2), Inline coding and code behind coding in ASP.NET, Connected and Disconnected manner in ADO.NET
3. Explain following components of C#: Text Box and Label Control, Access Data Source Control
4. Explain following concept of C#:- Static Constructors, Virtual methods, properties
5. ADO.Net? Explain steps to retrieve data from SQL database in C# using ADO.NET as an example. (4)
6. Page Event? Page Life Cycle of an ASP.NET page with an example. (2)
7. Web Services? (2)
8. XML?
9. DateTime objects in C#
10. Coding models in ASP.NET (2)
11. File handling in C# and example. (3)
12. Search Engine Optimization (2)
13. Web Service Architecture
14. Inheritance and polymorphism in C# (2)
15. Validation controls in ASP.NET with e.g.
16. C# program to list the directories in a drive selected by user. 
17. Design a User registration form for a recruitment site using asp.net
18. CLR? (2) Working of CLR? Features of CLR?
19. Exception handling mechanism of C#
20. How will u create a class in c#? Different components that can be included in a class of c#? different types of properties that can be added to a class? 
21. Software as a Service 
22. SOA
23. Reference data type in C#
24. ASP.NET server controls in ASP.NET with suitable e.g.
25. FCL
26. Web Services engine

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

Computer Networks' Question Papers!!!

Computer Networks  -->>

These are the questions compiled together from all the previous years' question papers of COMPUTER NETWORKS. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

1. Explain any 2 IEEE 802 standards with the format of the frames. (4)
2. What is a window? Explain the concept of sliding window. Explain in short the two methods used in sliding window protocol along with the window sizes required at the sender and the receivers side and why? (4)
3. Unguided transmission medium (3)
4. Congestion. Various methods of preventing and reducing the in congestion in the network. (3)
5. Network security? Symmetric and Asymmetric methods to make the data secure and explain the RSA algorithm in detail.
6. Explain SMTP, FTP, E-mail.
7. Satellite. Various categories of Satellite. (2)
8. Services provided by the network layer?  Bellman Ford Routing Algorithm. 
9. Protocols that are used for resolving the addresses at the network layer.
10. Concept of layered communication model. Explain OSI reference model and compare it with the TCP/IP. (3)
11. Signaling? What layer does the job of signaling and how? Explain 4 methods to convert digital data to digital signal.
12. Multiplexing
13. Switching
14. Multicasting
15. IPv6
16. Four way handshake in TCP. (2)
17. Optimality principle. Link State Routing Algorithm. (3)
18. Difference between CSMA, CSMA/CD and collision free protocol. (2)
19. Three way handshake for TCP connection establishment. (2)
20. With respect to IP address, explain class of IP address, subnet masking in details.
21. HDLC frame format in details. 
22. Fragmentation. Why is it needed? How is it done? (2)
23. ARP
24. MIME (2)
25. Hamming code
26. Multiplexing
27. Tunneling (2)
28. Define orbit, period. (3)
29. IPv6 header in details
30. DHCP
31. FTP (2)
32. UDP header
33. Modulation (2)
34. PCM (2)
35. Subnetting/supernetting
36. Circuit switching/packet switching
37. Compare Symmetric Key Cryptography and Asymmetric Key Cryptography.
38. DES algorithm
39. TPC/IP connection termination process in detail.
40. Explain persistence, non persistence, persistence CSMA protocol in details. 

41. Piggy banking. Advantages/Disadvantages.

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA

Data Structure's Question Papers!!!

Data Structure  -->>

These are the questions compiled together from all the previous years' question papers of DATA STRUCTURE. So first try to prepare these topics and then go for the whole book. :-)

NOTE: The number in bracket denotes the number of times the question has been asked in previous exams.

1. Implement heap sort of given numbers. [Numbers will be given]
2. Explain binary tree as a Data Structure. 
3. Write algorithms for:- 
a. Inserting an element in the binary tree
b. Searching a given element in the binary search tree. (4)
4. Define a circular queue. Explain how a circular queue can be implemented using arrays. Write algorithms to enqueue and dequeue an element to and from a circular queue. (4)
5. Hashing? Use digit extraction method and linear probing store the given keys in an array with 19 elements. How many collisions occur? What is the density of the list after the keys are inserted? [Set of numbers would be given].
6. Write an algorithm to sort elements using Quick Sort. 
7. What is a graph? Explain various methods of storing a graph. Write algorithms to add a vertex and delete an edge.
8. What is a height balanced tree? Write an algorithm to Rotate AVL tree right and illustrate with a help of an example. 
9. Define a B-tree. Build a B-tree of order 3 created by inserting the data in sequence. [Numbers would be given]. (4)
10. What is analysis of algorithm? Discuss the concept of best, average and worst case of an algorithm? (2)
11. Define an expression tree. The following infix expression is given. Draw the expression tree and find the prefix and post fix expression. (A+B*(C/D)-E)*(F/(G+H-J)
12. Define a minimum spanning tree. Write an Kruskal’s algorithm to generate a minimum spanning tree of a given graph. Also write Prim’s algorithm. (4)
13. Explain the preorder, postorder and inorder traversal of a tree with their algorithms. (3) 
14. What is a double linked list? For a doubly linked list, write algorithms to: (2)
a. Append two lists together.
b. Delete an element from the list.
15. Explain the interpolation search algorithm.
16. Differentiate between:
a. Singly linked list and Doubly linked list (2)
b. Tree and Graph
17. Algorithm to sort elements using Bubble sort.
18. Reheapup operation for a heap. Create max heap for given numbers. 
19. Write algorithm for searching the element in doubly linked list and print the list elements in reverse order.
20. Define clustering in hash list. Using mid-square method and key offset, store the keys shown below in array of size 13. 55, 65, 20, 12, 66, 26, 90.
21. Define Binary tree traversal. Explain breadth-first traversal of a graph with example. (2) 
22. Define collision. Explain collision resolution methods with e.g. (2)
23. Define M-way tree. 
24. Define graph. Distinguish between undirected and directed graphs. How adjacency list stores graph information into it?
25. Write the algorithm to insertion sort.
26. Define and explain the Stack Data structure. Give algorithm for PUSH, POP, stack, StackFull and StackEmpty. (2)
27. For a singly linked list, write algorithms to:-
a. Delete an element
b. Append one list to the other
c. Count the number of nodes in the list
28. Give algorithm for depth-first traversal of the graph. (2)
29. AVL tree? Explain with e.g. to rotate an AVL tree left and write the algorithm. (2)
30. Find Huffman code from the “given data”. (2)
31. What is heap? Write algorithm for:- (2)
a. Building a heap.
b. Deleting a heap.
32. Big-O notation
33. Circular Linked List
34. Midsquare hashing method. Solve the given example. 
35. General tree? Write steps to convert general tree to a binary tree. 
36. Algorithm for Shell sort. 

37. Djikstra’s algorithm to determine the shortest path in a graph.

NOTE: If anyone feels that the notes he/she has is in a very easy language on any topic, you can send it to LastMinuteStudyARN@gmail.com. It will be published on the site with your name.

 Thanks.

ABHILASH RUHELA